Interference avoidance in wireless multi-hop networks 1

Size: px
Start display at page:

Download "Interference avoidance in wireless multi-hop networks 1"

Transcription

1 Interference avoidance in wireless multi-hop networks 1 Youwei Zhang EE228A Project Report, Spring Motivation Wireless networks share the same unlicensed parts of the radio spectrum with devices of various types. For examples, cordless phones, wireless sensor networks, Bluetooth and microwave ovens can all access frequencies around 2.4 GHz. As a result, wireless networks operating near these devices are very likely to encounter interference from them. Since most of these devices do not know how to share frequencies with others, the only alternative left for wireless networks is to switch to another frequency (channel) if the current one is found to be occupied already. Currently in most cases, the channel assignment is done manually before deployment and often requires extensive site surveys. Another source of interference comes from within a wireless network itself. When multiple nodes within range of one another attempt to transmit simultaneously, collisions are bound to result. What s worse, an intermediate node usually attempts to forward a received packet immediately, resulting in collision with further incoming traffic. It is known that the interference from within a multi-hop wireless network can degrade the overall performance of the network significantly [1]. To cope with the interference from both external devices and inside wireless nodes, we propose a new multi-channel MAC protocol called Blackbird. Blackbird is designed to allocate channels on a per-hop and per-burst basis and to locally blacklist channels that are found to be of poor quality. Blackbird uses blacklisting to avoid interference with external devices, while the per-hop and per-burst allocation is designed to reduce interference from within wireless networks. 2 Protocol Design 2.1 Overview To make our MAC protocol practical, we assume that each wireless node only has one half-duplex radio, and that a node is capable of switching among channels and yet only transmitting or receiving on a particular channel at any one time. This assumption reflects most existing wireless nodes. The overall idea of Blackbird is pretty simple: a pair of sender and receiver negotiates a channel for transferring a burst of data, where the chosen channel should be less likely to suffer from either internal or external interference. However, to do so, we need to address the following questions: Where and how can negotiations be carried on? How do nodes know whether a channel will be clear or not? To solve the above questions, Blackbird designates a channel as the control channel and all other channels as data channels. The control channel is known in advance to all nodes. By default, nodes stay and listen on the control channel whenever they are 1 Joint work with Cheng Tien Ee and Jinyang Li

2 idle. A sender proposes a set of candidate data channels to the receiver, and the latter replies with a choice. Then both the sender and the receiver switch to the chosen data channel. After the transmission of a burst of data, both nodes switch back to the control channel. Also, the data channel is evaluated at the end of transmission and this information will be used for future selection of candidate channels. 2.2 Packet Transfer In Blackbird, each node maintains a neighbor table, and each entry of the table corresponds to one of the node s neighbors. As shown in Table 1, such an entry keeps track of a neighbor by recording such state information as packets to send to this neighbor, number of packets remaining in the current burst, channels that are being used by the neighbor and how soon the neighbor is estimated to return to the control channel. The state information is updated through mechanisms discussed later. addr MAC address of the neighbor pktstosend Total number of packets to send to this neighbor pktstosendburst Number of packets remaining in this burst of transfer pbuffer Queue of pointers to packets destined for this neighbor phead, ptail Pointers to head and tail of the circular queue of packet pointers dsn Last sequence number assigned to packet due for this neighbor channelsinuse Channels currently in use by this neighbor waittime Time to wait before this neighbor returns to the control channel Table 1: Neighbor Table Entry To help understand how Blackbird works, we now describe the packet transfer process between a sender (S) and a receiver (R) by tracing the steps shown in Figure 1. Figure 1(a): S accumulates a burst of packets destined for a neighbor R, determines whether R is available by checking the neighbor table entry corresponding R. If R is on the control channel (by checking channelsinuse) and thus be available, S chooses a subset of channels L which are not used by any neighbor and sensed to be clear. Otherwise, S will try another neighbor or wait (for waittime) until R is available. Figure 1(b): Now suppose that R is available, S sends, through the control channel, the first data packet which contains such control information as the subset L and the burst size p. The transmission is done using CSMA [2] with exponential backoff, similar to b [3]. Figure 1(c): Upon receiving the first packet on the control channel, R picks a data channel from L, choose a new burst size p to be the minimum of p and its available buffer space. If no channel in L is free according to local information, R sets p to be the expected minimum time to wait (by checking all neighbor entries) and puts the control channel in place of the otherwise chosen data channel. R sends to S an ACK packet containing p and the chosen channel. By checking whether the chosen channel in ACK is a data channel or not, S can tell whether R is available for data reception and how long it can transfer or needs to wait. The transfer duration or wait time is simply t p, where t

3 is the time required for the transmission of one full-sized packet and its corresponding acknowledgement. Figure 1(d): Suppose R chose a data channel for data reception, both S and R now switch to the chosen data channel, enter BURST_SEND and BURST_WAIT states respectively, and stay on the data channel for a period of t p (by setting a timer). However, it s possible that the ACK sent by R on the control channel may not reach S, and thus S will try to retransmit the first data packet on the control channel while R has switched to the data channel. To cope with this problem, R sets another shorter timer, and if no data packet arrives on the data channel before the timeout, R switches back to the control channel. Figure 1(e): S sends a burst of packets to R during the period of t p. R acknowledges each received packet with an ACK, and never initiates any packet transfer while in BURST_WAIT mode. If a packet is lost, S simply retransmits it with no exponential backoff. Figure 1(f): Once the burst timer of t p Figure 1: Timeline showing the packet transfer process between the sender S and the receiver R fires, S and R switch back to the control channel and leave BURST_SEND and BURST_WAIT respectively. If not all p packets in the burst have been transferred, the remaining packets will be left for next burst period. 2.3 Channel Status Update Now it is desirable to describe how a node updates its neighbor table, specifically the channel status (channelsinuse and waittime). When on the control channel, nodes eavesdrop on all packets and use the control information contained in each packet to update the corresponding field in the neighbor entry associated with the packet. The first packet from a sender contains the proposed subset of candidate channels and the burst size, while an ACK on the control channel indicate exactly the chosen data channel and the agreed-on burst size or waittime. We use both control information contained in data packets and that in ACKs, because it is possible that a node only hears a data packet but not the corresponding ACK. 2.4 Neighbor Support To make our protocol work, we have to address an important issue: a potential sender may not know that its intended receiver is tuned to another channel, and thus may mistakenly conclude either that the receiver is no longer present or that the control channel is congested. We solve this by enabling neighbors aware of the receiver s status to reply on behalf of the receiver, notifying the sender which channels the receiver is

4 possibly using and how soon the receiver is estimated to come back to the control channel. Each neighbor backs off a random time before reporting, and thus the first neighbor to report can suppress duplicate notifications from other neighbors. 2.5 Channel Blacklisting and Control Channel Determination If a channel is severely jammed, it should be blacklisted and not used for nearfuture transmission. There are multiple ways to evaluate a channel s quality. Currently, we use a running average of packets successfully sent as the metric. Since overloaded channels may become free later, the blacklisting period is bounded. Currently, we designate a specific channel to be the control channel and make it known to all nodes in advance. However, if the control channel were constantly jammed due to external interference, it would be preferred that the control channel can also be dynamically chosen. To do so, a preference order can be assigned to the channels, and each node periodically exchanges a global blacklist and the current control channel with any node on the same channel. Nodes switch to a more preferred channel as the new control channel collectively only if the current control channel is found to be blacklisted. This mechanism is one part of our future work. 3 Simulation Results We have implemented the basic Blackbird protocol in the packet-level simulator NS-2 [4], so as to investigate Blackbird s capability to reduce internal contentions. Blacklisting was not implemented because NS-2 does not provide any external noise model. To reflect TelosB motes [5] used in our real implementation, each wireless node has a radio that is capable to switch among a maximum of 16 orthogonal channels. Each channel has a base capacity of 250 kbps, and the channel switching time is 100 microseconds. Within NS-2, the effective transmission range is 250 meters, while the interference range can be as large as 550 meters. The routing table at each node is set statically and there is no routing traffic present. Senders transmit constant-rate UDP packets at 214 kbps. The maximum burst size is 8 packets. Each packet has a maximum size of 134 bytes and is replied with an ACK of 23 bytes. So the maximum achievable channel throughput is (134+23) =213 kbps. Therefore, the workload we introduce matches that of the full capacity. We run simulations over two simple topologies: (I) a single chain of nodes with an inter-node spacing of 200 meters, as shown in Figure 2; (II) two parallel chains with both inter-node and inter-chain spacing of 200 meters, as shown in Figure 4. The leftmost node in a chain is the sender and the rightmost node is the receiver. For different simulation runs, we vary the number of available channels that a Blackbird node is allowed to use, as well as the number of hops involved in a chain. All experiments run for 100 simulated seconds. Figure 2: A single chain of nodes spaced at 200 meters

5 3.1 Single Chain Performance Figure 3 shows the chain throughput of Blackbird with different number of available channels as well as the MAC as a function of number of forwarding hops. Both Blackbird and achieve the maximal channel capacity when packets are only sent over 1 hop to the destination node. Blackbird with more than one channel does not help in this case because there is neither internal contention nor external interference present. As expected, the chain s throughput decreases with the growth of the chain length. Both and Blackbird using only one channel have similar performance and the chain throughput for both stabilizes at approximately 31.5 kbps for a chain of 7 hops. The reason that the chain throughput is only /7 was explained in detail in [6]. When Blackbird uses 2 channels (one for control and one for data channel), the throughput increases to about 47 kbps for a chain of 7 hops. The distributed nature of Blackbird makes it fail to schedule transmissions optimally with regard to both timing and the channel assignment. For example, with Blackbird using 2 channels, its performance improvement over the single channel case is only =1.49. However, when more channels are available (e.g. the case of C=4 has 3 data channels and 1 control channel), Blackbird's throughput increases to 55.4 kbps, almost doubling the throughput in the single channel case. This is because Blackbird has more freedom in assigning channels in a distributed fashion. Further increases in the number of channels in use does not significantly increase throughput; for example increasing the number of channels in use to 10 results in 67 kbps for a chain of 7 hops, only a small improvement from the case with 4 channels. chain throughput (Kbps) w/o RTS/CTS Blackbird C=1 Blackbird C=2 Blackbird C=4 Blackbird C= Chain length (hops) Figure 3: The end-to-end forwarding throughput of Blackbird with various number of channels and along a single chain of various number of hops. We also find the control channel witnesses a significant amount of traffic because all packet bursts start with one successful packet transmission on the control channel; it is used to send 34% of all packets when Blackbird uses 4 channels and 25% packets when 10 channels are used. Typically, the control channel is used twice or four times more often than any other data channels. We speculate that by reducing the amount of traffic

6 on the control channel, such as only sending control information instead of the actual data packets, we can further improve the performance of Blackbird. This shall be another part of our future work. Figure 4: Double chains with both inter-chain space and inter-node space set as 200 meters 3.2 Double Chain Performance As shown in Figure 4, two chains are placed in parallel, with both the inter-chain space and the inter-node space set as 200 meters. Therefore, when sender1 and sender2 transmit simultaneously to receiver1 and receiver2 along the respective chains, interference with each other shall result. chain throughput (Kbps) w/o RTS/CTS Blackbird C=1 Blackbird C=2 Blackbird C=4 Blackbird C= chain length (hops) Figure 5: The end-to-end forwarding throughput of Blackbird and along two interfering chains of various number of hops. Figure 5 shows the average per-chain throughput of Blackbird with different numbers of channels in use and as a function of number of forwarding hops in each chain. When there are two competing chains, 's throughput per chain drops by almost half, to 99 kbps for a 1 hop chain and 16 kbps for a 7-hop chain. Blackbird improves per chain throughput to 29.2 kbps and 35.9 kbps for a 7-hop chain when using 4 and 10 channels respectively.

7 4 Conclusion and Acknowledgement In this project, we designed a new multi-channel medium control protocol to cope with interference from both external and internal interference. We have shown, through the packet-level simulations, that Blackbird is able to effectively reduce internal interference in wireless multi-hop networks. In fact, we also implemented Blackbird on TelosB motes, and verified that our MAC can avoid external interference. (I choose not to present the implementation results in this report due to two reasons: 1. the results are not very significant mainly because the implementation itself still needs improvement. 2. I was not heavily involved in the implementation on real hardware.) As for the project itself, Cheng Tien Ee originally proposed the Blackbird protocol. In the beginning, I was partly involved in the implementation on sensor motes. Later I shifted to be responsible for implementing Blackbird in NS-2 with the help from Jinyang Li. I d like to thank Cheng Tien Ee and Jinyang Li for their guidance and help. 5 References [1] J. Bicket, D. Aguayo, S. Biswas, and R. Morris. Architechture and Evaluation of an Unplanned b Mesh Network. In Mobicom 05: Proceedings of the 11 th annual international conference on Mobile computing and networking, Aug [2] L. Kleinrock and F. Tobagi. Packet Switching in Radio Channels: Part I - Carrier Sense Multiple Access Modes and Their Throughput-Delay Characteristics. IEEE Transactions on Communications 23(12): , December 1975 [3] ANSI/IEEE Std Edition [4] S. McCanne and S. Floyd. ns Network Simulator. [5] [6] J. Li, C. Blake, D. D. Couto, H. I. Lee and R. Morris. Capacity of ad hoc wireless networks. In MobiCom 01: Proceedings of the 7th annual international conference on Mobile computing and networking, Aug 2001

CSE 461: Wireless Networks

CSE 461: Wireless Networks CSE 461: Wireless Networks Wireless IEEE 802.11 A physical and multiple access layer standard for wireless local area networks (WLAN) Ad Hoc Network: no servers or access points Infrastructure Network

More information

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver 1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois

More information

Congestions control through cloud computing with MANET

Congestions control through cloud computing with MANET Congestions control through cloud computing with MANET Ajey Singh 1, Maneesh Shrivastava 2 Department of Information Technology 1,2 Lakshmi Narain College of Technology Bhopal, India 1,2 Abstract Adhoc

More information

Lecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy

Lecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy Lecture 12 December 04, 2017 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2017-2018 Random Medium Access Control Part II - CSMA and Collision

More information

Wireless MACs: MACAW/802.11

Wireless MACs: MACAW/802.11 Wireless MACs: MACAW/802.11 Mark Handley UCL Computer Science CS 3035/GZ01 Fundamentals: Spectrum and Capacity A particular radio transmits over some range of frequencies; its bandwidth, in the physical

More information

CS263: Wireless Communications and Sensor Networks

CS263: Wireless Communications and Sensor Networks CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 6: Bluetooth and 802.15.4 October 12, 2004 2004 Matt Welsh Harvard University 1 Today's Lecture Bluetooth Standard for Personal Area

More information

Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver

Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois

More information

TMMAC: A TDMA Based Multi-Channel MAC Protocol using a Single. Radio Transceiver for Mobile Ad Hoc Networks

TMMAC: A TDMA Based Multi-Channel MAC Protocol using a Single. Radio Transceiver for Mobile Ad Hoc Networks : A TDMA Based Multi-Channel MAC Protocol using a Single Radio Transceiver for Mobile Ad Hoc Networks Jingbin Zhang, Gang Zhou, Chengdu Huang, Ting Yan, Sang H. Son, John A. Stankovic Department of Computer

More information

Granting Silence to Avoid Wireless Collisions

Granting Silence to Avoid Wireless Collisions Granting Silence to Avoid Wireless Collisions Jung Il Choi, Mayank Jain, Maria A. Kazandjieva, and Philip Levis October 6, 2010 ICNP 2010 Wireless Mesh and CSMA One UDP flow along a static 4-hop route

More information

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols Medium Access Control MAC protocols: design goals, challenges, contention-based and contention-free protocols 1 Why do we need MAC protocols? Wireless medium is shared Many nodes may need to access the

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 3 CMPE 257 Winter'11 1 Announcements Accessing secure part of the class Web page: User id: cmpe257.

More information

Strengthening Unlicensed Band Wireless Backhaul

Strengthening Unlicensed Band Wireless Backhaul be in charge Strengthening Unlicensed Band Wireless Backhaul Use TDD/TDMA Based Channel Access Mechanism WHITE PAPER Strengthening Unlicensed Band Wireless Backhaul: Use TDD/TDMA Based Channel Access Mechanism

More information

Wireless Medium Access Control Protocols

Wireless Medium Access Control Protocols Wireless Medium Access Control Protocols Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 Classification of wireless MAC protocols Wireless

More information

Impact of IEEE n Operation on IEEE Operation

Impact of IEEE n Operation on IEEE Operation 2009 International Conference on Advanced Information Networking and Applications Workshops Impact of IEEE 802.11n Operation on IEEE 802.15.4 Operation B Polepalli, W Xie, D Thangaraja, M Goyal, H Hosseini

More information

Wireless Network Security Spring 2013

Wireless Network Security Spring 2013 Wireless Network Security 14-814 Spring 2013 Patrick Tague Class #10 MAC Layer Misbehavior MAC Misbehavior Agenda Analysis of the 802.11 MAC protocol Selfish / greedy 802.11 MAC misbehavior Malicious 802.11

More information

Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks

Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks Dodda Sunitha Dr.A.Nagaraju Dr. G.Narsimha Assistant Professor of IT Dept. Central University

More information

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall IEEE 802.11, Token Rings 10/11/06 CS/ECE 438 - UIUC, Fall 2006 1 Medium Access Control Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 10/11/06

More information

A Multi-channel MAC Protocol for Ad Hoc Wireless Networks

A Multi-channel MAC Protocol for Ad Hoc Wireless Networks A Multi-channel MAC Protocol for Ad Hoc Wireless Networks Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Email: jso1@uiuc.edu Nitin

More information

A Survey on Modified RTS/CTS Mechanism

A Survey on Modified RTS/CTS Mechanism A Survey on Modified RTS/CTS Mechanism Prachi Srivastava Computer Science and Engineering, MMMEC, Gorakhpur prachi.srivastava.itm@gmail.com Dayashankar Singh Computer Science and Engineering, MMMEC, Gorakhpur

More information

WITH the evolution and popularity of wireless devices,

WITH the evolution and popularity of wireless devices, Network Coding with Wait Time Insertion and Configuration for TCP Communication in Wireless Multi-hop Networks Eiji Takimoto, Shuhei Aketa, Shoichi Saito, and Koichi Mouri Abstract In TCP communication

More information

Wireless Network Security Spring 2014

Wireless Network Security Spring 2014 Wireless Network Security 14-814 Spring 2014 Patrick Tague Class #12 MAC Misbehavior 1 IEEE 802.11 Infrastructure mode Many stations share an AP connected to Internet Distributed coordination function

More information

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:

More information

End-to-End Mechanisms for QoS Support in Wireless Networks

End-to-End Mechanisms for QoS Support in Wireless Networks End-to-End Mechanisms for QoS Support in Wireless Networks R VS Torsten Braun joint work with Matthias Scheidegger, Marco Studer, Ruy de Oliveira Computer Networks and Distributed Systems Institute of

More information

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem Medium Access Control IEEE 802.11, Token Rings Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 9/15/06 CS/ECE 438 - UIUC, Fall 2006 1 9/15/06 CS/ECE

More information

Random Access. 1. Aloha. 2. Slotted Aloha 3. CSMA 4. CSMA/CD

Random Access. 1. Aloha. 2. Slotted Aloha 3. CSMA 4. CSMA/CD Random Access 1. Aloha 2. Slotted Aloha 3. CSMA 4. CSMA/CD Background Communication medium B No Collision collision A C Modern Local Area Networks (LANs) operate as follows Users are connected to communication

More information

UNIT IV -- TRANSPORT LAYER

UNIT IV -- TRANSPORT LAYER UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission

More information

CDMA-Based MAC Protocol for Wireless Ad Hoc Networks

CDMA-Based MAC Protocol for Wireless Ad Hoc Networks CDMA-Based MAC Protocol for Wireless Ad Hoc Networks Alaa Muqattash and Marwan Krunz Presented by: Habibullah Pagarkar for 600.647-Advanced Topics in Wireless Networks. JHU. Spring 04 Today s Presentation

More information

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may

More information

UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks

UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks Sung-Hee Lee, Jong-Mu Choi, and Young-Bae Ko College of Information and Communication, Ajou University, South Korea shlee@dmc.ajou.ac.kr,

More information

Wireless Network Security Spring 2012

Wireless Network Security Spring 2012 Wireless Network Security 14-814 Spring 2012 Patrick Tague Class #10 MAC Layer Misbehavior Announcements I'll be in Pittsburgh Feb 28-29 If you or your project team would like to meet, email me to schedule

More information

Chapter - 1 INTRODUCTION

Chapter - 1 INTRODUCTION Chapter - 1 INTRODUCTION Worldwide Interoperability for Microwave Access (WiMAX) is based on IEEE 802.16 standard. This standard specifies the air interface of fixed Broadband Wireless Access (BWA) system

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions

More information

A Measurement Study of Multiplicative Overhead Effects in Wireless Networks

A Measurement Study of Multiplicative Overhead Effects in Wireless Networks A Measurement Study of Multiplicative Overhead Effects in Wireless Joseph Camp, Vincenzo Mancuso, Omer Gurewitz, and Edward W. Knightly INFOCOM 2008 http://networks.rice.edu System: Large-scale, Multi-tier

More information

CS 716: Introduction to communication networks. - 9 th class; 19 th Aug Instructor: Sridhar Iyer IIT Bombay

CS 716: Introduction to communication networks. - 9 th class; 19 th Aug Instructor: Sridhar Iyer IIT Bombay CS 716: Introduction to communication networks - 9 th class; 19 th Aug 2011 Instructor: Sridhar Iyer IIT Bombay Contention-based MAC: ALOHA Users transmit whenever they have data to send Collisions occur,

More information

Wireless Network Security Spring 2015

Wireless Network Security Spring 2015 Wireless Network Security Spring 2015 Patrick Tague Class #9 MAC Misbehavior; OMNET++ Tutorial II 1 Reminder: Assignments Assignment #2 is due today 11:59pm PST Assignment #3 is posted, due March 5 It's

More information

Lecture 16: QoS and "

Lecture 16: QoS and Lecture 16: QoS and 802.11" CSE 123: Computer Networks Alex C. Snoeren HW 4 due now! Lecture 16 Overview" Network-wide QoS IntServ DifServ 802.11 Wireless CSMA/CA Hidden Terminals RTS/CTS CSE 123 Lecture

More information

EE 122: Ethernet and

EE 122: Ethernet and EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts

More information

Wireless TCP Performance Issues

Wireless TCP Performance Issues Wireless TCP Performance Issues Issues, transport layer protocols Set up and maintain end-to-end connections Reliable end-to-end delivery of data Flow control Congestion control Udp? Assume TCP for the

More information

Multiple Access Protocols

Multiple Access Protocols Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just

More information

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. IV (May - Jun.2015), PP 06-11 www.iosrjournals.org Impact of IEEE 802.11

More information

Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information

Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering

More information

RD-TCP: Reorder Detecting TCP

RD-TCP: Reorder Detecting TCP RD-TCP: Reorder Detecting TCP Arjuna Sathiaseelan and Tomasz Radzik Department of Computer Science, King s College London, Strand, London WC2R 2LS {arjuna,radzik}@dcs.kcl.ac.uk Abstract. Numerous studies

More information

Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1

Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1 Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1 Wireless Local Area Networks The proliferation of laptop computers and other mobile devices

More information

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks Li Shaohua and Dong-Ho Cho School of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology

More information

Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg

Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg Five Problems Encoding/decoding Framing Error Detection Error Correction Media Access Five Problems Encoding/decoding Framing

More information

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis Computer Network Fundamentals Spring 2008 Week 3 MAC Layer Andreas Terzis Outline MAC Protocols MAC Protocol Examples Channel Partitioning TDMA/FDMA Token Ring Random Access Protocols Aloha and Slotted

More information

Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV

Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins University

More information

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point Chapter 6 outline 6.1 Introduction Wireless 6.2 Wireless links, characteristics CDMA 6.3 IEEE 802.11 wireless LANs ( wi-fi ) 6.4 Cellular Internet Access architecture standards (e.g., GSM) Mobility 6.5

More information

Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network

Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)

More information

Wireless and WiFi. Daniel Zappala. CS 460 Computer Networking Brigham Young University

Wireless and WiFi. Daniel Zappala. CS 460 Computer Networking Brigham Young University Wireless and WiFi Daniel Zappala CS 460 Computer Networking Brigham Young University Wireless Networks 2/28 mobile phone subscribers now outnumber wired phone subscribers similar trend likely with Internet

More information

Enhanced Power Saving Scheme for IEEE DCF Based Wireless Networks

Enhanced Power Saving Scheme for IEEE DCF Based Wireless Networks Enhanced Power Saving Scheme for IEEE 802.11 DCF Based Wireless Networks Jong-Mu Choi, Young-Bae Ko, and Jai-Hoon Kim Graduate School of Information and Communication Ajou University, Republic of Korea

More information

Department of Electrical and Computer Systems Engineering

Department of Electrical and Computer Systems Engineering Department of Electrical and Computer Systems Engineering Technical Report MECSE-6-2006 Medium Access Control (MAC) Schemes for Quality of Service (QoS) provision of Voice over Internet Protocol (VoIP)

More information

Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer. Computer Networks: Wireless LANs

Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer. Computer Networks: Wireless LANs Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer 1 Wireless Local Area Networks (WLANs) The proliferation of laptop computers and other mobile devices (PDAs and cell phones)

More information

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network *

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network * Performance Evaluation of Modified IEEE 802.11 MAC for Multi-Channel Multi-Hop Ad Hoc Network * Jiandong LI ISN Lab., Xidian University JL384@cornell.edu Zygmunt J. Haas Cornell University haas@ece.cornell.edu

More information

CSMA based Medium Access Control for Wireless Sensor Network

CSMA based Medium Access Control for Wireless Sensor Network CSMA based Medium Access Control for Wireless Sensor Network H. Hoang, Halmstad University Abstract Wireless sensor networks bring many challenges on implementation of Medium Access Control protocols because

More information

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless CSCD 433 Network Programming Fall 2016 Lecture 7 Ethernet and Wireless 802.11 1 Topics 802 Standard MAC and LLC Sublayers Review of MAC in Ethernet MAC in 802.11 Wireless 2 IEEE Standards In 1985, Computer

More information

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering

More information

II. Principles of Computer Communications Network and Transport Layer

II. Principles of Computer Communications Network and Transport Layer II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part

More information

Implementation of a Multi-Channel Multi-Interface Ad-Hoc Wireless Network

Implementation of a Multi-Channel Multi-Interface Ad-Hoc Wireless Network ENSC 85: High-Performance Networks Spring 2008 Implementation of a Multi-Channel Multi-Interface Ad-Hoc Wireless Network Chih-Hao Howard Chang howardc@sfu.ca Final Project Presentation School of Engineering

More information

Wireless LANs. ITS 413 Internet Technologies and Applications

Wireless LANs. ITS 413 Internet Technologies and Applications Wireless LANs ITS 413 Internet Technologies and Applications Aim: Aim and Contents Understand how IEEE 802.11 wireless LANs work Understand what influences the performance of wireless LANs Contents: IEEE

More information

Topics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:

Topics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection: 1 Topics 2 LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS Multiple access: CSMA/CD, CSMA/CA, token passing, channelization LAN: characteristics, i basic principles i Protocol architecture Topologies

More information

Performance Analysis of TCP LBA and TCP TAHOE Approaches in g Standard Savreet KaurBrar 1, Sandeep Singh Kang 2

Performance Analysis of TCP LBA and TCP TAHOE Approaches in g Standard Savreet KaurBrar 1, Sandeep Singh Kang 2 Performance Analysis of TCP LBA and TCP TAHOE Approaches in 802.11g Standard Savreet KaurBrar 1, Sandeep Singh Kang 2 1 (MTechCSE Student, Chandigarh Engineering College Landran,India) 2 (Associate Professor

More information

Collisions & Virtual collisions in IEEE networks

Collisions & Virtual collisions in IEEE networks Collisions & Virtual collisions in IEEE 82.11 networks Libin Jiang EE228a project report, Spring 26 Abstract Packet collisions lead to performance degradation in IEEE 82.11 [1] networks. The carrier-sensing

More information

Virtual University of Pakistan. Describe the Hidden Node and Exposed Node problems in Standard? VUSR. [Larry L. Peterson]

Virtual University of Pakistan. Describe the Hidden Node and Exposed Node problems in Standard? VUSR. [Larry L. Peterson] www..net Solution Assignment No. 2 Question No. 1 Describe the Hidden Node and Exposed Node problems in 802.11 Standard? Hidden Node Problem: Consider the figure below. [Larry L. Peterson] B can exchange

More information

MAC in /20/06

MAC in /20/06 MAC in 802.11 2/20/06 MAC Multiple users share common medium. Important issues: Collision detection Delay Fairness Hidden terminals Synchronization Power management Roaming Use 802.11 as an example to

More information

Architecture and Evaluation of an Unplanned b Mesh Network

Architecture and Evaluation of an Unplanned b Mesh Network Architecture and Evaluation of an Unplanned 802.11b Mesh Network John Bicket, Daniel Aguayo, Sanjit Biswas, and Robert Morris MIT CSAIL (MobiCom 05) slides by Jong-Kwon Lee, presented by Fallon Chen May

More information

Advanced Computer Networks WLAN

Advanced Computer Networks WLAN Advanced Computer Networks 263 3501 00 WLAN Patrick Stuedi Spring Semester 2014 1 Oriana Riva, Department of Computer Science ETH Zürich Last week Outlook Medium Access COPE Short Range Wireless Networks:

More information

Co-existence of WiFi and ZigBee

Co-existence of WiFi and ZigBee Co-existence of WiFi and ZigBee Kang G. Shin The University of Michigan Joint work with Xinyu Zhang ACM MobiHoc 2011 Applying Autonomics to Create an Intelligent, Ubiquitous Environment Slide 1 Coexistence

More information

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute Troy, NY bisnin@rpi.edu, abouzeid@ecse.rpi.edu

More information

Improving IEEE Power Saving Mechanism

Improving IEEE Power Saving Mechanism 1 Improving IEEE 82.11 Power Saving Mechanism Eun-Sun Jung 1 and Nitin H. Vaidya 2 1 Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu 2 Dept. of

More information

Networked Systems (SAMPLE QUESTIONS), COMPGZ01, May 2016

Networked Systems (SAMPLE QUESTIONS), COMPGZ01, May 2016 Networked Systems (SAMPLE QUESTIONS), COMPGZ01, May 2016 Answer TWO questions from Part ONE on the answer booklet containing lined writing paper, and answer ALL questions in Part TWO on the multiple-choice

More information

Chapter 6 Medium Access Control Protocols and Local Area Networks

Chapter 6 Medium Access Control Protocols and Local Area Networks Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Part II: Local Area Networks CSE 3213, Winter 2010 Instructor: Foroohar Foroozan Chapter Overview Broadcast

More information

LECTURE PLAN. Script. Introduction about MAC Types o ALOHA o CSMA o CSMA/CD o CSMA/CA

LECTURE PLAN. Script. Introduction about MAC Types o ALOHA o CSMA o CSMA/CD o CSMA/CA Course- B.Sc. Applied Physical Science (Computer Science) Year- IIIrd, Sem- Vth Subject Computer Science Paper- XVIIth, Computer Networks Lecture -11 Lecture Title- Medium Access Layer Script Today in

More information

H-MMAC: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks

H-MMAC: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks H-: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks Duc Ngoc Minh Dang Department of Computer Engineering Kyung Hee University, Korea Email: dnmduc@khu.ac.kr Choong Seon Hong Department

More information

ECEN 5032 Data Networks Medium Access Control Sublayer

ECEN 5032 Data Networks Medium Access Control Sublayer ECEN 5032 Data Networks Medium Access Control Sublayer Peter Mathys mathys@colorado.edu University of Colorado, Boulder c 1996 2005, P. Mathys p.1/35 Overview (Sub)networks can be divided into two categories:

More information

A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets

A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets Balakrishna J. Prabhu and A. Chockalingam Department of Electrical Communication Engineering Indian Institute of Science, Bangalore

More information

SIMPLE MODEL FOR TRANSMISSION CONTROL PROTOCOL (TCP) Irma Aslanishvili, Tariel Khvedelidze

SIMPLE MODEL FOR TRANSMISSION CONTROL PROTOCOL (TCP) Irma Aslanishvili, Tariel Khvedelidze 80 SIMPLE MODEL FOR TRANSMISSION CONTROL PROTOCOL (TCP) Irma Aslanishvili, Tariel Khvedelidze Abstract: Ad hoc Networks are complex distributed systems that consist of wireless mobile or static nodes that

More information

Medium Access Control Sublayer Chapter 4

Medium Access Control Sublayer Chapter 4 Medium Access Control Sublayer Chapter 4 Channel Allocation Problem Multiple Access Protocols Ethernet Wireless LANs Broadband Wireless Bluetooth RFID Data Link Layer Switching Revised: August 2011 & February

More information

Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks

Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Madhusmita Nandi School of Electronics Engineering, KIIT University Bhubaneswar-751024, Odisha, India ABSTRACT The present work is to evaluate

More information

Power Aware Routing using Power Control in Ad Hoc Networks

Power Aware Routing using Power Control in Ad Hoc Networks Power Aware Routing using Power Control in Ad Hoc Networks Eun-Sun Jung and Nitin H. Vaidya Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu, Dept.

More information

Data Communications. Data Link Layer Protocols Wireless LANs

Data Communications. Data Link Layer Protocols Wireless LANs Data Communications Data Link Layer Protocols Wireless LANs Wireless Networks Several different types of communications networks are using unguided media. These networks are generally referred to as wireless

More information

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained

More information

Link Layer II: MACA and MACAW

Link Layer II: MACA and MACAW Link Layer II: MACA and MACAW COS 463: Wireless Networks Lecture 5 Kyle Jamieson [Parts adapted from J. Kurose, K. Ross, D. Holmar] Medium access: Timeline Packet radio Wireless LAN Wired LAN ALOHAnet

More information

Advanced Networking Technologies

Advanced Networking Technologies Advanced Networking Technologies Chapter 4 Medium Access Control Protocols (Acknowledgement: These slides have been prepared by Prof. Dr. Holger Karl) Advanced Networking (SS 16): 04 Medium Access Control

More information

MSIT 413: Wireless Technologies Week 8

MSIT 413: Wireless Technologies Week 8 MSIT 413: Wireless Technologies Week 8 Michael L. Honig Department of EECS Northwestern University November 2017 The Multiple Access Problem How can multiple mobiles access (communicate with) the same

More information

An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol

An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol Hung-Wei Tseng, Shih-Hsien Yang, Po-Yu Chuang,Eric Hsiao-Kuang Wu, and Gen-Huey Chen Dept. of Computer Science and Information Engineering,

More information

MAC LAYER. Murat Demirbas SUNY Buffalo

MAC LAYER. Murat Demirbas SUNY Buffalo MAC LAYER Murat Demirbas SUNY Buffalo MAC categories Fixed assignment TDMA (Time Division), CDMA (Code division), FDMA (Frequency division) Unsuitable for dynamic, bursty traffic in wireless networks Random

More information

FSA: A Fast Coordination Scheme for Opportunistic Routing

FSA: A Fast Coordination Scheme for Opportunistic Routing F: A Fast Coordination Scheme for Opportunistic Routing Zhenyu Yang, Kai Zeng and Wenjing Lou Department of ECE, Worcester Polytechnic Institute, Worcester, MA 69 {zyyang, kzeng, wjlou}@wpi.edu Abstract

More information

Wireless Communications

Wireless Communications 4. Medium Access Control Sublayer DIN/CTC/UEM 2018 Why do we need MAC for? Medium Access Control (MAC) Shared medium instead of point-to-point link MAC sublayer controls access to shared medium Examples:

More information

CERIAS Tech Report A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research

CERIAS Tech Report A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research CERIAS Tech Report 2004-115 A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research Information Assurance and Security Purdue University, West

More information

CS 268: Computer Networking. Taking Advantage of Broadcast

CS 268: Computer Networking. Taking Advantage of Broadcast CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic

More information

standard. Acknowledgement: Slides borrowed from Richard Y. Yale

standard. Acknowledgement: Slides borrowed from Richard Y. Yale 802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale IEEE 802.11 Requirements Design for small coverage (e.g. office, home) Low/no mobility High data rate applications Ability to

More information

Wireless Local Area Networks. Networks: Wireless LANs 1

Wireless Local Area Networks. Networks: Wireless LANs 1 Wireless Local Area Networks Networks: Wireless LANs 1 Wireless Local Area Networks The proliferation of laptop computers and other mobile devices (PDAs and cell phones) created an obvious application

More information

Chapter 6 Wireless and Mobile Networks

Chapter 6 Wireless and Mobile Networks Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. 6: Wireless and Mobile Networks 6

More information

On Admission of VoIP Calls Over Wireless Mesh Network

On Admission of VoIP Calls Over Wireless Mesh Network On Admission of VoIP Calls Over Wireless Mesh Network Hung-yu Wei Department of Electrical Engineering National Taiwan University Taipei, Taiwan {hywei}@ntu.edu.tw Kyungtae Kim, Anand Kashyap and Samrat

More information

COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS)

COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS) COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS) Question 1 (X marks) (a) The one-way propagation delay between A and B is 100/1 = 100 seconds. The RTT will be

More information

Remarks On Per-flow Differentiation In IEEE

Remarks On Per-flow Differentiation In IEEE Remarks On Per-flow Differentiation In IEEE 82.11 Imad Aad and Claude Castelluccia PLANETE project, INRIA Rhône-Alpes ZIRST - 655, Avenue de l Europe - Montbonnot. 38334 Saint Ismier Cedex - France [imad.aad,

More information

Transport layer issues

Transport layer issues Transport layer issues Dmitrij Lagutin, dlagutin@cc.hut.fi T-79.5401 Special Course in Mobility Management: Ad hoc networks, 28.3.2007 Contents Issues in designing a transport layer protocol for ad hoc

More information

Randomization. Randomization used in many protocols We ll study examples:

Randomization. Randomization used in many protocols We ll study examples: Randomization Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling 1 Ethernet Single shared broadcast channel 2+ simultaneous

More information

Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling

Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling Randomization Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling 1 Ethernet Single shared broadcast channel 2+ simultaneous

More information