Multiple Access Networks •

Broadcast and multiple access technologies are very common for LANs and for wireless settings.

Local Area Networks and Medium Access Control Protocols

3 2

4

1 Shared Multiple Access Medium

5

M …

Multiple Access Communication: Examples Satellite Channel

Examples (2) Ring networks

= fin = fo u t

Multidrop telephone lines

Multitapped Bus Inbound line Outbound line

1

Examples (3)

Multi-Access Protocols • Protocols that resolve the resolution problem dynamically are called Multiple-Access ( Multi Access) Protocols

Wireless LAN

• Contention Protocols resolve a collision after it occurs. These Protocols execute a collision resolution protocol after each collision. • Collision -free Protocols ensure that a collision never occurs.

Evolution of Contention Protocols Aloha

Slotted Aloha

CSMA

CSMA/CD

Developed for Univ. of Hawaii packet radio network

Contention Protocols • ALOHA Protocols – (Pure) Aloha – Slotted Aloha

Start transmission only at fixed times (slots)

• CSMA (Carrier Sense Multiple Access) CSMA = Carrier Sense Multiple Access Start transmission only if no transmission is ongoing CD = Collision Detection Stop ongoing transmission if a collision is detected

– Persistent CSMA – Non-persistent CSMA – CSMA/CD: Carrier Sense Multiple Access with Collision Detection (used in Ethernet)

• Etc…

2

(Pure) ALOHA

Collisions in Pure ALOHA

• Topology: – Multiple transmitters (stations) share same medium.

1,1

Station 1

1,2

1,3

Transmission Time (F)

• Aloha protocol: – Whenever station has data, it transmits immediately – Whenever a collision occurs, it is treated as transmission error, and frame is retransmitted. – Sender backs off for some random time after collision before it retransmits.

Station 2

2,1

2,2

3,1

Station 3

3,2

Broadcast channel Complete Collision

Collisions and Vulnerable Period Frame which collides with start of red frame

Frame which collides with end of red frame

Partial Collision

Slotted ALOHA • Slotted Aloha Protocol – Time is divided into discrete time intervals (=slots) – A station can transmit only at the beginning of a frame

frame F

F

Vulnerable Period of red frame

• As a consequence: – Frame either completely or do not collide at all – Vulnerable period = 1 frame time

• A frame (dark frame) collides whenever another transmission begins in the vulnerable period of the frame. • Vulnerable period has length of 2 frame times.

3

Collisions in Slotted ALOHA

Performance of ALOHA • What is the maximum throughput of the ALOHA protocol?

1,1

Station 1

1,2

1,3

• Notation:

Transmission Time (F) Station 2

S

2,1

2,2

G 3,1

Station 3

3,2

Throughput : Expected number of successful transmission per time unit Offered Load: Expected number of transmission and retransmission attempts (from all users) per time unit.

• Normalization: – Frame transmission time is 1 => maximum throughput is 1

Broadcast channel Complete Collision

Complete Collision

Modeling Assumptions • Normalization: All frames have a fixed length of one time unit.

Throughput of ALOHA • Relation between throughput and offered load: S = G * Prob[frame suffers no collision]

• Infinite user population New transmissions

• Offered load is modeled as a Poisson process with rate G:

Successful transmission ALOHA Broadcast Channel S

G collisions

Prob[ k packets are generated in t frame times] =

(Gt )k × e− tG k!

4

Performance of (pure) ALOHA • Prob[frame suffers no collision] = Prob[no other frame is generated during the vulnerable period of this frame] = Prob[no frame is generated during a 2-frame a period] =

( 2G)0 × e− 2G = e− 2 G

Results: Maximum Achievable Throughput ∂S =0 ∂G

• Take derivative and set

• Maximum is attained at G = 0.5 • We obtain:

smax = 0 .5 × e −1 =

1 = 0. 184 2e

0!

• Throughput in ALOHA:

S = G × e −2 G

Performance of Slotted ALOHA

• Note: That is 18% of channel capacity!

Comparison of ALOHA and Slotted ALOHA

• Derivation is analogous to (pure) ALOHA: S = G * Prob[frame suffers no collision] 0.4

0.368

0.35

0.15 0.1

Ge -2G

0.05

8

4

2

1

0.5

0.25

0 0.125

0! • Total throughput in Slotted ALOHA: S = G × e −G 1 • Achievable Throughput: smax = e −1 = = 0. 37 e

0.184

0.2

0.0625

× e−1G = e −1G

Ge -G

0.25

0.03125

(1G)

0.3

S

0.01563

• Prob[frame suffers no collision] = Prob[no other frame is generated during a vulnerable period] = Prob[no frame is generated during 1 frame period] = 0

G

5

CSMA – Carrier Sense Multiple Access • Improvement over ALOHA protocol:

CSMA – Carrier Sense Multiple Access • CSMA protocol

– If stations have carrier sense capability (stations can test the broadcast medium for ongoing transmission), and – If stations only transmit if the channel is idle, – Then many collisions can be avoided

– A station that wishes to transmit listens to the medium for an ongoing transmission – Is the medium busy? • Yes: Station backs off for a specified period • No: Station transmits

– If a sender does not receive an acknowledgement after some period, it assumes that a collision has occurred. – After a collision a station backs off for a certain (random) time and retransmits.

• Note : This improves ALOHA only in cases with small delay bandwidth products. Why?

CSMA - Variations

Non-Persistent CSMA

• Variations of CSMA protocol • Each variant specifies what to do if the medium is found busy: – Non-persistent CSMA – 1-persistent CSMA – p-persistent CSMA

1. If the medium is idle, transmit immediately 2. If the medium is busy, wait a random amount of time and Repeat Step 1. • •

Random back-off reduces probability of collisions. Wasted idle time if the back-off time is too long.



May result in long access delays.

6

1-Persistent CSMA

1. If the medium is idle, transmit immediately 2. If the medium is busy, continue to listen until medium becomes idle, and then transmit immediately. •

What if two stations want to transmit when channel is busy?

p-Persistent CSMA

1. If the medium is idle, transmit with probability p, and delay for one time unit with probability (1-p) (time unit = length of propagation delay) 2. If the medium is busy, continue to listen until medium becomes idle, and then go to Step 1. 3. If transmission is delayed by one time unit, continue with Step 1. •

How to Select Probability p ?

Good trade-off between non-persistent and 1persistent CSMA.

Comparison of CSMA Strategies Non-persistent: Transmit if idle; otherwise delay and try again

• Assume that N stations have a packet to send and the medium is busy. • Expected number of stations that will attempt to transmit once the medium becomes idle: N * p • If N * p > 1, then a collision is expected to occur (with retransmission, and so more collisions)

constant or variable delay channel busy

ready

• Therefore : Network must make sure that N * p < 1, where N is the maximum number of stations that can be active at a time.

p-persistent: Transmit as soon as channel goes idle, with probability p. Otherwise, delay one slot and repeat process. 1-persistent: Transmit as soon as channel goes idle. If collision, back off and try again

7

Comparison of ALOHA and CSMA • Load vs. Throughput (very small delay-bandwidth product)

CSMA/CD • CSMA has an inefficiency: – If a collision occurred, the channel is unstable until colliding packets have been fully transmitted

• CSMA/CD overcomes this as follows: – While transmitting, the sender is listening to medium for collision. Sender stops if collision has occurred.

• Note: – CSMA: Listen Before Talking – CSMA/CD: Listen While Talking

Operation CSMA/CD • Generic CSMA/CD Protocol: – Use one of the CDMA persistence algorithms (nonpersistent, 1-persistent, p-persistent) for transmission. – If a collision is detected during transmission, cease transmission and transmit a jam signal to notify other stations of collision. – After sending the jam signal, back off for a random amount of time, then start to transmit again.

Collision Detection in CSMA/CD To detect a collision, in the worst case, it takes twice the maximum propagation delay of the medium.

A transmits A at t = 0

A detects collision at t = 2 tprop

Distance d meters tprop = d / ν seconds B B transmits before t = t

A

B and detects prop

A

B

collision shortly thereafter

Figure 6.7

8

CSMA/CD: Restrictions

Exponential Backoff Algorithm

• Packet should be twice as long as time to detect a collision (2 * max. propagation delay)

• Ethernet uses an exponential backoff algorithm to determine when a station can retransmit after a collision.

• Otherwise, CSMA/CD does not have an advantage over CSMA

Algorithm: • Example: Ethernet – Ethernet requires a minimum packet size and restricts the maximum length of the medium. – Question: What is the minimum packet size in a 10Mbit/sec network with a maximum length of 500 meters?

Performance of CSMA/CD • Parameters and assumptions: a : end-to-end propagation delay 1: packet transmission time (normalized) N: Number of stations

• Time can be thought of as being divided in contention intervals and transmission intervals. • Contention intervals can be thought of as being slotted with slot length of 2a (roundtrip propagation delay).

Set “slot time” equal to 2a After first collision, wait 0 or 1 slot times. After i-th collision, wait random number between 0 and 2i-1 time slots. Do not increase random number range if i=10. Give up after 16 collisions

Performance of CSMA/CD contention slot frame

frame

frame

contention interval

• Contention slots end in a collision • Contention interval is a sequence of contention slots • Length of a slot in contention interval is 2a • Probability that a station attempts to transmit in a slot is P

9

Performance of CSMA/CD

Performance of CSMA/CD

• Derivation of maximum throughput of CSMA/CD

Prob[contention interval has a length of j slots] = Prob[1 successful attempt] * Prob[j-1 unsuccessful attempts] =

– Let A be the probability that some station can successfully transmit in a slot. We get:

N A =   × P 1 × (1 − P ) N −1 = N × P × (1 − P ) N − 1 1

A × (1 − A ) j−1

• The expected number of slots in a contention interval is then calculated as:

– In the above formula, A is maximized when P=1/N. Thus: ∞

1 A = (1 − ) N −1 N

∑ j × A × (1 − A ) j =0

j −1

=

1 A

Performance of CSMA/CD • Calculate the maximum efficiency of CSMA/CD with usual formula: FrameTime = FrameTime +Overhead Frame Time = FrameTime +Average ContentionInterval 1+

1 2a A

10

Local Area Networks and Medium Access Control ... - Semantic Scholar

Multiple Access Communication: Examples. Satellite Channel. = fin. = fout. Multidrop telephone lines. Inbound line. Outbound line. Examples (2). Ring networks.

75KB Sizes 0 Downloads 279 Views

Recommend Documents

1 Local Area Networks and Medium Access ... - Semantic Scholar
Developed for Univ. of Hawaii packet radio network. Start transmission only at fixed times (slots). CSMA = Carrier Sense Multiple Access. Start transmission only ...

Achieving distributed user access control in sensor ... - Semantic Scholar
networks, in: IEEE Symposium on Security and Privacy, Oakland, CA,. 2004 (May). Haodong Wang is an assistant professor of. Computer and Information Science at Cleve- land State University. He received his PhD in. Computer Science at College of Willia

Topology Control of Dynamic Networks in the ... - Semantic Scholar
planets outside our own solar system, will rely on FF to achieve ... energy consumption in the network. .... the consumption of fuel and energy is also crucial for.

Topology Control of Dynamic Networks in the ... - Semantic Scholar
enabling technology for future NASA space missions such ... In mobile sensor networks, there ... preserving connectivity of mobile networks [5], [9], [14],. [15], [20] ...

Communication, Coordination and Networks! - Semantic Scholar
[email protected], URL: http://sites.google.com/site/jihong33). 1 .... Pre%play communication in social networks has been studied in theoretical .... Page 10 ...

Communication, Coordination and Networks! - Semantic Scholar
... of cheap talk in promoting cooperation and coordination in different games and compare it to that of ... In contrast, our paper deals with the distributional issue as well as effi ciency. .... The first number in each cell is the number of subjec

Networks in Finance - Semantic Scholar
Mar 10, 2008 - two questions arise: how resilient financial networks are to ... which the various patterns of connections can be described and analyzed in a meaningful ... literature in finance that uses network theory and suggests a number of areas

Cooperative Control and Potential Games - Semantic Scholar
Grant FA9550-08-1-0375, and by the National Science Foundation under Grant. ECS-0501394 and Grant ... Associate Editor T. Vasilakos. J. R. Marden is with the ... J. S. Shamma is with the School of Electrical and Computer Engineer- ing, Georgia ......

Wide Area Multilateration report - Semantic Scholar
Division: Distribution: Limited. Classification title: Unclassified. August 2005. Approved by author: Approved by project manager: Approved by project managing.

Cooperative Control and Potential Games - Semantic Scholar
However, we will use the consensus problem as the main illustration .... and the learning dynamics, so that players collectively accom- plish the ...... obstruction free. Therefore, we ..... the intermediate nodes to successfully transfer the data fr

Wide Area Multilateration report - Semantic Scholar
least equivalent to an MSSR/Mode S radar service. .... target altitude is known from another source (e.g. from Mode C or in an SMGCS environment) then the ...

Counteractive Self-Control - Semantic Scholar
mained in the distance? ... tempt individuals to stray from otherwise dominant long-term ... bach, University of Chicago, Booth School of Business, 5807 South.

Iterative learning control and repetitive control in ... - Semantic Scholar
shown in Figure 1 where VCM (voice coil motor), spindle motor, disk (media), ...... Proceedings of the IEEE International Conference on Decision and Control ...

Towards local electromechanical probing of ... - Semantic Scholar
Sep 19, 2007 - (Some figures in this article are in colour only in the electronic .... from Electron Microscopy Sciences) at room temperature for ..... These data.

Aeroengine Prognostics via Local Linear ... - Semantic Scholar
The application of the scheme to gas-turbine engine prognostics is ... measurements in many problems makes application of ... linear trend thus detected in data is used for linear prediction ... that motivated their development: minimizing false.

Iterative learning control and repetitive control in ... - Semantic Scholar
sophisticated HDD servo controls, Messner and Ehrlich [1] presented a nice tutorial on controls for disk ... Electrical and Computer Engineering, 4160 Old Main Hill, Utah State ... For example, a disk drive product in the year 2000 ... simple words,

Multi-View Local Learning - Semantic Scholar
Recently, another type of methods, which is based on data graphs have aroused considerable interests in the machine learning and data mining community. .... problem, where a real valued fi, 1 ≤ i ≤ l + u, is assigned to each data point xi. For an

Bandwidth and Local Memory Reduction of Video ... - Semantic Scholar
Aug 6, 2009 - MB, the associated search range data is first loaded to the on- chip local SRAM, where 8-bit data is stored for each pixel. The IME processing unit, which is designed with bit-truncation technique, only accesses 5 bits for each pixel to

Evaluating Heterogeneous Information Access ... - Semantic Scholar
search engines, and is a topic of investigation in both the academic community ... the typical single ranked list (e.g. ten blue links) employed in homogeneous ...

Evaluating Heterogeneous Information Access ... - Semantic Scholar
We need to better understand the more complex user be- haviour within ... search engines, and is a topic of investigation in both the ... in homogeneous ranking.

Distributed medium access control for wireless mesh ...
Department of Electrical and Computer Engineering, Centre for Wireless Communications, University of. Waterloo, Waterloo ... Contract/grant sponsor: Natural Science and Engineering Research Council (NSERC) of Canada. radio spectrum, many .... data ch

Local and Global Consistency Properties for ... - Semantic Scholar
A placement mechanism violates the priority of student i for position x if there exist .... Let x ∈ X. We call a linear order ≻x over ¯N a priority ordering for position type x. ...... Murat Sertel Center for Advanced Economic Studies Working Pa