Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

ELEC 1406 Communications > June Test > Flashcards

June Test Flashcards

1
Q

Key applications of communications in robotics (3 of them)

A

Telerobotics: semi-autonomous robots controlled remotely via comunication network

Swarm robotics: an approach for coordinating several robots capable of performing simple tasks

Cloud robotics: any robot that relies on data/code from a network to support its operation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Haptic/tactile technology

A

Haptic: creates an experience of touch through vibrations forces or motions
Tactile: sensors designed to provide feedback to human operators about robots environment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Definition of latency

Acceptable latency for VR (only roughly)

A

Time it takes for a packet of data to get from one designated point to another
Around 25ms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Calulating latency for a given length of fiber

A

Ask henry

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

CPS: what it stands for, what is it and three key components

A

Cyber physical systems
Integrates the physical and digital processes
Used for communication, control and computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Definition of IOT

Difference between CPS and IOT

A

Internet of things-computing devices connected via the internet
All IOT devices are CPS’s but CPS’s are not necessarily connected to the internet

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Definition of PAN,LAN

A

PAN: personal area network, within around 10 metres, computer connected to mouse/printer, bluetooth
LAN: local area network, small geographic area, computers in offices to share resources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Definiton of MAN,WAN, internet

A

MAN: metropolitan area network, covers between several buildings to a city
WAN: wide area network, covers a country/continent
Internet: WAN that interconnects billions of devices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Name for the link from source-to-destination and vice versa

Three categories of equipment in networks

A

Uplink/upstream
Downlink/downstream
1. End systems (hosts): client/server devices
2. Intermediate devices: devices capable of directing packets or performing other functions on the packets
3. Network media: medium providing a channel for communication (fiber cable etc)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Definition of:
Transmission latency
Link throughput
Hop count

A

TL: delay between transmission and reception on a communication link
LT: number of bits per second
HC: number of communication links traversed in a path

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Things to consider about network media

A

Distance of each link dictated by media
Impairments associated with media
Maximum sustained throughput
Cost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Key challenges to do with networking (5 of them)

A

Sender and reciever locating each other over a network
Accomodating multiple senders and receivers simultaneously
Avoiding errors i.e. missage mix ups
Maintaining communication path between reciever and sender
Stopping eavesdropping

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

OSI model: what it stands for, all the layers, good mnemonic to remember

A

Open systems interconnection
Application, presentation, session, transport, network, data link, physical
All people seem to need data processing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Description of 1-3 OSI layers (what they do)

A

Application: implement human machine interface
Presentation: encode and compress data in appropriate form
Encrypt/decrypt data
Session: manages sessions for different host applications

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Description of 4-5 OSI layers

A

Transport: enables error correction and flow control
Network: structure and manage network using logical addressing
Manage message priority and scheduling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Description of 6-7 OSI layers

A

Data link: manages reliable transmission and sharing of physical media
Physical: encodes data in to voltages/waveforms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Protocol multiplexing and de-multiplexing (specifically how to de-multiplex)

A 
Multiple overlying (higher) protocols can use same underlying (lower) protocols. E.g. Multiple transport protocols can use the same networking one
Protocol headers: each layer attaches a label/tag. Lower layers remove tags before forwarding payload upwards
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Differences between OSI and TCP/IP

A

OSI is reference architecture, TCP/IP is based on the specific standardized internet protocols
In TCP/IP the first three layers are merged into one application layer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

The three properties of layers

A

Service: functionality of the layer
Service interface: how to access the service
Protocol interface: how peers communicate to implement service
Rules and formats about communication between two internet hosts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Hub: layers involved, how they work and collision/broadcast domains

A

Only has physical layer
Sends incoming signal to all outgoing ports
1 collision domain, 1 broadcast domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Switch: layers involved, how they work and collision/broadcast domains

A

Switch: physical and data link layers.
Knows specific address of messages and can send directly to the right computer
0 collision domain so can receive from multiple PC’s.
1 broadcast domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Router: layers involved, how they work and collision/broadcast domains

A

Physical, data and network layers
Usually connects two networks
0 collsion and broadcast domain so can send and receive from multiple PC’s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

What is collision and broadcast domain?

A

CD: the part of the network where collisions can occur
Collision: when two devices send a packet at the same time on the same network segment
BD: the domain in which a broadcast is forwarded
All ports on a hub/switch are in the same broadcast domain
All ports on a router are in different broadcast domains

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Packet switching equations: time required to complete transmission

A 
T = L/R
T= time
L = packet length
R = bits per second
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

What is store-and-forward transmission?

What’s the equation for transmitting time for switches/routers?

A

SFT: switches and routers must receive complete packet before the first bit can be retransmitted
τ = 4L/R
L = packet length
R = bits per second

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

What’s the general equation for sending one packet over a path with multiple N links

A 
τ = N*L/R
N = number of links between source and destination
Means theres N-1 routers 
L = packet length
R = bits per second rate of the links
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Circuit switching: description, pros and cons

A

Reserves the resources required for the duration of communication session
Pros: guaranteed good service and no delays
Cons: wasted bandwidth, static single path to follow

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Packet switching: description, pros and cons

A

No prior reservation of resources. Instead they are allocated on demand so messages may have to wait in queues
Pros: enables data transmission on multiple paths simultaneously
Cons: wasted bandwidth when source bit rate is lower than link bit rate
Congestion occurs under heavy traffic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Multiplexing: frequency division vs time division
What’s a frame?
Equation for transmission rate of a circuit

A

Frequency division: multiple packets being transmited at the same time at different frequencies
Time division: packets sent one at time at all frequencies
Frame: a unit of data
TRC = Frame rate (No. of frames per second) * Number of bits in each slot

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

What is source coding?

What is the equation to calculate the number of bits required for a source code?

A

Converting any type of data into binary form
2^L = M
M = number of distinct characters (aka not repeated)
L = number of bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

How to synchronise a message?

What is a fix length code?

A

Send code that identifies the start and end of a message

The number of bits used for all symbols/data in a source code is the same i.e. if theres 8 symbols use 3 bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

What is a variable length code? What is the benefit?

A

Symbols that appear more often have fewer number of bits than symbols that appear more often.
Saves data but requires carefully designed source code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

How to use the huffman algorithm?

A
  1. List all letters and how often they appear. REMEMBER SPACES
  2. Combine them into nodes with a combined value. Do this in order from lowest frequency to highest
  3. List them in a tree. One side gets a 0, other side gets a 1
  4. To list off values follow the tree
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

What is required for variable length code?

A

Needs to be uniquely decodable. Achieved by prefix free code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

What does uniquely decodable mean/prefix free mean?

A

When variable length code is put in series, you are able to deode and identify each letter individually

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

How to figure out percentage of compression for Huffman code?

A

% = (1- VLC/FLC)*100
VLC = variable length code
Adding up the number of bits needed from the Huffman code table
FLC = fixed length code
Adding up the number of bits if FLC was used i.e. 4 characters, 2 bits, 8 characters, 3 bits

37
Q

What can an MQTT client do?

How are messages grouped?

A

Can publish to or receive messages from an MQTT server
Messages are grouped using a label called ‘Topic Name’. Clients can decide to only get certain messages using ‘Topic Filter’

38
Q

What can an MQTT server do?

A

Acts as an mediator between MQTT clients.
Also called MQTT broker
Receives messages from clients under various topics and forwards those messages to clients who have subscribed to those topics

39
Q

What does MQTT stand for? What layer does it run on?

What protocol does it run over?

A

Message Queuing Telemetry Transport
Application layer
TCP/IP

40
Q

What is the naming structure of MQTT?

What are the naming conventions of MQTT?

A 
Organised like a file system with topics seperated by '/'
Tree higherarchy of files
>Case sensitive 
>At least 1 character long
>Space can be used
>Cannot include NULL character
>Can't exceed 2^16 bytes
41
Q

What’s the special reserved topic name in MQTT?

What’s it used for?

A

$SYS
Used by the server
Used for meta topics like server specific information
Read only for clients

42
Q

What are MQTT wildcards?

A

topic/# will allow a client to subscribe to all topic threads on the level of the # AND below

topic/+ will allow the client to subcribe to all topics threads on the level of +

43
Q

What is the format of an MQTT packet?

3 different parts

A

Fixed Header:
Minimum = 2 bytes
Header info = 1 byte
Packet length >= 1 byte

Variable header:
Variable size, not compulsory

Payload:
Variable size, not compulsory

44
Q

MQTT QoS:
What is QoS?
How many levels?

A

Quality of service of MQTT

3 levels

45
Q

What is QoS 0?

A

“Fire and forget”

Messages are sent to clients and the server assumes that that it received it

46
Q

What is QoS 1?

A

Server sends messages to client until client replies with acknowledgement

47
Q

What is QoS 2?

A
  1. Server sends message to client
  2. Client responds with acknowledgment
    >If no acknowledgment is received message is sent again with duplicate flag
  3. Server responds with acknowledgment
  4. Client responds with acknowledgment
48
Q

What are the two transport layer choice?

A

UDP and TCP

49
Q

UDP:
What it stands for
Pros,Cons

A 
User Datagram Protocol
Pros: minimum sending rate
Reduced transmission delay
Cons: Unreliable data transfer
Dosn't guarantee data arrives
50
Q

TCP:
What is stands for
Pros
Cons

A 
Transmission control protocol
Pros: Reliable data transfer
Prevents nodes from swamping links
Cons: needs more computer resources
Slower
51
Q

What are the two parts of a TCP/UDP port?

A

IP: identifies the computer that the packet needs to travel to
Port: identifies the application on the computer

52
Q

What’s special about ports 0-1023?

What port is MQTT?

A

Well-known port numbers which are usually restricted to other apps (e.g. HTTP)
Port 1883

53
Q

What are the features of UDP?

A 
>Multiplexing
>Demultiplexing
>Basic error detection
>No handshaking
>No congestion control
54
Q

How does UDP establish a connection?

What happens with the connection state?

A

No connection establishment
>Less packet exchanges

Connection state isn’t maintained so servers can handle more users

55
Q

What are allowed message and what are they called?

What are disallowed messages and what are they called?

A

AM: every string of bits sent over a network
Codewords
DM: a AM where there is an error
Space

56
Q

What is two-repetition code?

A

> Transmitter repeats every bit once (e.g. 0011001111)
Receiver decodes the message (01011)
If there is a single bit error (01 or 10) it can be detected and the message resent

57
Q

Whats a two bit error in two-repetition code?

Can it be detected?

A

When both of the bits sent are both flipped

Can’t be detected

58
Q

What is hamming distance?

What is the hamming distance for two-repetition code?

A

The minimum number of bit flips to change one code word into another
2
00 > 01 > 11

59
Q

Whats the symbol for minimum Hamming distance?

How many errors at most can we detect given this?

A

dmin

Max errors detected: dmin - 1

60
Q

How does a receiver decode error correcting codes?

How can a receiver correct errors in error correcting code?

A
  1. Match the received bits to code words
  2. Map codeword to source bits
    Chooses the closest codeword to the received bits
61
Q

Explain how a receiver decides how to correct a three-repetition code

A

If error detected: receiver will correct it with the codeword that shares the most bits as the error
001 = 000
101 = 111

62
Q

How many bit flips can be corrected with three-repetition code?
What is the general formula for how many bits can be corrected given Hamming distance dmin?

A

1 bit flip

(dmin - 1)/2

63
Q

What is code rate?

What is the equation for it?

A 
A fraction between 0 and 1
Defines how much excess data an error detecting code produces
R = k/n
R = code rate
k = message length
(k < n)
n = codeword length
64
Q

What is the trade off with regards to code rate?

A

High-rate codes (R → 1)
Correct fewer errors but add less overhead
Lower-rate codes (R→0)
Correct more errors but add more overhead

65
Q 
Parity bit:
What it is?
Even parity
Odd parity
Why is it useful?
A

Bit added to the end of a message
EP: Bit makes total number of 1’s even
OP: Bit makes total number of 1’s odd
Receiver counts number of 1’s in message to check for an error

66
Q

Minimum hamming distance for parity

A

dmin = 2

Change one data bit → change parity bit

67
Q

How does two dimensional parity work?

Think like an array

A

> Break the data into multiple rows
Add a parity bit to each row at the end
Add a parity bit to each column
Add a parity bit for the row parity bits and add this to the end of the bottom row parities

68
Q

What is dmin for two dimensional parity arrays?

How many errors can be therefore be detected?

A

dmin = 4

Can detect <= 3 errors

69
Q

How to calculate a UDP checksum?

How to use the checksum to check for errors?

A

Split the message into bit words (often 16 bits) and sum them
Invert the total and this is the checksum

Sum all of the bitwords inclucding the checksum and the total should be all 1’s

70
Q

Acknowledgements that can be given by a receiver

A

ACKS: acknowledge, receiver tells sender that packet recevied okay
NACKS: negative acknowledge, receiver tells sender that packet had errors

71
Q

What is the reliable data transfer protocol?

Think about ACK’s

A

Sender: sends packet
Receiver: sends ACK
Sender: waits ‘reasonable’ amount of time to get ACK.
When ACK received it sends the next packet

72
Q

What happens in the reliable data transfer protocol when:
>a packet is lost
>an ACK is lost
>ACK takes too long to arrive

A

> after a ‘reasonable’ amount of time the packet is resent
packet is resent
Receiver gets two packets and detects duplicates so ignores second
packet is resent
Receiver detects duplicate

73
Q

Equation for the utilization of a link from a single sender sneding a single packet and receiving ACK? How to turn this into a percentage?

A 
U = (L/R) / (RTT + (L/R) )
% = 100 * U
L = packet size
R = rate of transmission
RTT = 2*propagation delay
74
Q

What is pipelining?

How to calculate utilization for n packets sent?

A

Sending multiple packets in a row and waiting for multiple ACKs
n * U

75
Q

What is Go-Back N?

Similar to pipelining

A

Sender can send up to N unACKed packets
Receiver ONLY sends cumulative ACK
Sender has timer for oldest unACKed packet
When timer expires, retransmit all unACKed packets

76
Q

TCP:
>what does it stand for
>how does it work
>what does it use

A

Transmission control protocol

Point-to-point transmission standard (one sender, one receiver)

Uses reliable, in-order byte stream
Uses pipeling

77
Q

Equation for the time out interval in TCP pipelining

How to calculate safety margin?

A

ToI: EstimatedRTT + ‘Safety Margin’
Safety margin = 4*DevRTT
DevRTT = deviation of RTT

78
Q

What is a nodes routing table?

A

For every destination in the network graph/mesh:
>Number of hops to reach the destination
>Next node on the path to that destination

79
Q

How does each node on a network know which node to sent data to?

A

Each node broadcasts its routing table which allows neighbouring nodes to update theirs accordingly

80
Q

In a network what happens if:
>a new node is added
>a link is removed

A

> Neighbouring nodes update their tables with the new node
The new tables are then broadcast to others
Weight of link is set to infinity

81
Q

What is dynamic source routing (DSR):
>when is it used
>how does it work

A

> When a node wants to send a packet to another node but doesn’t know the route
floods network with route requests (RREQ)
Eventually the shortest route is found

82
Q

What is the process for route discovery for DSR?

A
  1. Transmitting node floods network with RREQ packets
  2. RREQ packets are duplicated and sent on until one reachs the destination node
  3. Once a RREQ packet reachs its destination, a RREP packet is sent back the same way to the transmitting node
  4. Transmitting node sends data the way that the RREP node came
83
Q

What does RREQ stand for?

What does RREP stand for?

A

Route request

Route reply

84
Q

What is the data link

4 main points

A

> Enables communication between end hosts
Controls errors
Determines the start and end of bits and frames
Delivers information reliably

85
Q

TDMA:
>What does it stand for
>What does it involve
>What are cons

A

> Time division multiple access
Each user gets a fixed time slot to transmit packets
Unused slots are wasted

86
Q 
FDMA:
>What does it stand for
>What does it involve
>What are pros
>What are cons
A

> Frequency division multiple access
Each user gets a frequency band to send data over
Guaranteed to be able to send bits
Unused frequencies are wasted

87
Q

What is CDMA?

A

CDMA = Code DIvision Multiple Access

All users transmit over the same frequencies and at the same time with no interference

88
Q

Nyquist-Shannon Theorem

A

Sampling frequency should be at least twice the highest frequency contained in the signal
fs > 2*f

89
Q

Equation for calculating noise power?

A

Power = Δ^2/12
Where 1/Δ is the gradient of the slope
Slope = (y2 - y1) / (x2 - x1)

ELEC 1406 Communications (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions