CSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks

Size: px
Start display at page:

Download "CSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks"

Transcription

1 CSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks Tiantong You (you@cs.queensu.ca) Department of Computing and Information Science Chi-Hsiang Yeh (yeh@ece.queensu.ca) Department of Electrical and Computer Engineering Hossam Hassanein (hossam@cs.queensu.ca) Department of Computing and Information Science Queen s University Kingston, ON K7L 3N6, Canada Abstract In this paper, we present a new collision-free MAC protocol Carrier Sense Media Access with ID Countdown (CSMA/IC) for ad hoc wireless networks that can achieve 1% collision-free performance by solving the hidden terminal problem and the concurrent sending problem. Compared to CSMA/CA of IEEE 82.11, it also improves the network's performance in decreasing the average delay of packet sending, dropping discard ratio, and increases the network's throughput significantly. Furthermore, it can enable different packets with different priority to access the media and thus gain QoS. I. INTRODUCTION In the ad-hoc [1] type of wireless network, portable devices are brought together to form a network on the fly. Usually every node is able to communicate with every other node when all nodes are spread around a relatively small geographic range. However, nodes may spread over a larger geographic range than the communication signal can reach. In this case, nodes may have to communicate over multiple hops. There is only one medium that is shared by all the nodes that are in the same radio communication range, and the radio frequency bandwidth is limited. As well, packet collisions are unavoidable due to the fact that traffic arrivals are random and there is non-zero propagation time between transmitters and receivers. Therefore, Medium Access Control (MAC) schemes are used to coordinate access to the single channel in the network. Mobile terminals have to contend for medium access by themselves. Carrier Sense Medium Access (CSMA) [2] is the main mechanism to implement medium access. Consequently, transmissions of packets from distinct mobile terminals are more prone to overlap, resulting in packet losses. Retransmissions are required and a noticeable delay appears. Recently, a lot of research has been done on local wireless MAC protocols. The IEEE [5-7] protocol, which defines the MAC and physical layer standards for license-free industrial, scientific and medical (ISM) bands [3] allocated by the Federal Communications Commission (FCC) in the USA, is the most popular MAC for wireless LANs. It consists of Distributed Coordination Function (DCF) and Point Coordination Function (PCF). The DCF is based on the CSMA/CA mechanism and solves the hidden terminal problem [4] efficiently with the Request-to-send message (RTS) and Clear-to-send message (CTS). In this case, all the neighboring nodes that heard either of these two messages will reserve the media for data packet sending. In the scheme, the transmission radius for all the packets (including data packets, function packets, etc) is fixed. To solve the concurrent sending of neighboring nodes, the IEEE has defined three different lengths of Inter-frame spaces (IFS) and extension time slots for use between the sending of consecutive packets. That is, when the node senses the medium is idle; it does not send the packets immediately, but first senses and confirms that the medium is idle for the different time periods. Thus the higher priority packets could be given a short time period of sensing before being sent. RTS-CTS dialogues can solve the hidden terminal problem for data packets, but cannot solve the hidden terminal problem between for the transmissions of RTS and CTS messages. The length of time to sense the medium is not unique to the node before sending the packet. So it could not avoid having the same sensing length as neighboring nodes and this may lead to collision. When the collision takes place, the extension time slot number may be enlarged, leading to a large overhead when competition for the medium occurs. In this paper, we introduce a 1% collision-free MAC protocol - Carrier Sense Media Access with ID Countdown (CSMA/IC) for ad hoc wireless networks by completely solving the hidden terminal problem and totally avoiding concurrent sending by neighboring nodes. The sensing length before packet sending is reasonable and the use of RTS-CTS packets becomes unnecessary. All of these decrease overhead. This paper is organized as follows. The next section discusses the CSMA/IC protocol. The evaluation of protocols by simulation will be discussed in Section III. In Section IV, the conclusion will be made.

2 II. CSMA/IC PROTOCOL 2.1. Basic Mechanisms for CSMA/IC In the CSMA/IC protocol, the transmission radius is fixed to certain unified value and the sensing radius is twice or more than that of the transmission radius. This could be achieved by simply setting the noise signal threshold lower, or we could use an extra narrow band control channel that has twice of the data transmission radius be dedicated to send the so-called buzz signal. As Fig. 1 shows, the circle 1 is the maximum transmission range of node a ; the nodes outside this range or on the edge of this range cannot receive the data clearly. We suppose that the collision radius is the same as the transmission radius. The radius of circle 2 is the sensing radius which is twice or more that of radius 1. The nodes inside the sensing radius, but outside the transmission radius, can sense (not hear) the sending signal of the sender and thus suppress sending to avoid collision. Therefore, the hidden terminal problem can be solved automatically. This approach is referred to as sensitive CSMA (S-CSMA) in [8]. However, S-CSMA also makes the exposed terminal problem even more serious by blocking a larger transmission area than CSMA. This overhead of CSMA/IC could be compensated in CSMA/CP [9] where the capacity is separated into two channels a control channel and a data channel. The control channel uses CSMA/IC while the transmission of data packets is based on scheduling through the control channel and thus solves the hidden terminal and exposed terminal problems at the same time. Note that the control packets are relatively small and this reduces the overhead of single channel S-CSMA. The system needs to be synchronized so that mobilestations (MTs) could compete for the media beginning at the same time point. External devices like a satellite Global Positioning System (GPS) could be used to make the synchronization. Our CSMA/IC only requires local synchronization between neighboring competing nodes, and the asynchrony between the nodes several hops away will not affect or have trivial effect to the function of our CSMA/IC protocol. To achieve the local synchronization, every MT will maintain a clock. The MTs will only compete the media periodically depend on their own clock. To synchronize the MTs clock locally, every MT will send a so-called Synchronizing Beacon signal (SB) periodically based on the competing period. That is, whether the MT will send the SB signal this round will be decided randomly. The surrounding MTs will adjust their clock when hear the SB signal. If the MT hears two asynchronous SB signals (from nodes hidden to each other), it will send the SB signal next round based on the first SB signal previously heard, and other MTs will adjust their clock according to the new round SB signal. Before competing, the node first senses the medium, if the medium is not idle (there is node sending data), it will quit the current competing and wait for next round. We use the binary count down mechanism to achieve media access. As Fig. 2 shown, the time period is consists of competing units, and every competing unit begins by a time slot of medium sensing, then SB signal sending period (MTs may or may not send SB signal during this period), binary competing slots, and the data-sending period. For each packet that will be sent, the node will create an equal length binary number (its value must be unique in the surrounding nodes). The higher value of the binary number means higher priority. Thus we can encrypt the packet s priority (packet type and waiting time) to the binary number. Corresponding to the binary number, the Inter Frame Space (IFS) consists of slots of time that match every bit of the unique binary number. To make our CSMA/IC robust, the time slot should be sufficiently large (e.g., larger than 2 times of maximum propagation, turn-around time plus sensing time). During competition, at the time slot that represents the bit in the binary number, the node will sense the medium. When it senses that the media is busy, it will quit the competition; otherwise the node will continue competing for the medium. At the time slot that represents the bit 1 in the binary number, the node will send a buzz signal. The nodes that finish processing the entire binary number win the media and send the packet. So, in this competition, the node with the higher value of binary number always wins the media. For the binary code design, we separate the code to two parts the first part is assigned for the packets priority, while Competing units 2 1 a b ~One competing unit~ time Fig. 1 The Transmission Range and Sensing Range Data sending period Binary competing slots SB signal sending period Medium sensing slot Fig. 2 The frame format of competing unit

3 the second part of code is assign for the uniqueness of competence. The priority part could be create depend on packet s type, and packet s waiting type. The higher priorities packets will be given a large value binary code. We could use the unique MAC ID as the second part of the binary code that will guarantee the unique winner when the two senders have same priority packet to send. In the competition, a lower priority function packet will lose the competition and quit in the same range. In the case of same priority packets, the lower MAC ID node will lose and quit. Any receiver must return back an ACK when they receive a data packet to confirm the reception. If the sender does not receive the ACK after sending the data packet, it will regard the data packet has suffered collision and will re-schedule to send it again. If the sender tries several times without any response, the destination will be regarded as shutting down or moving out of sender s maximum transmission radius. In our proposed CSMA/IC MAC protocol, the ACK has the highest priority, because when a node sends out the data packet, it hopes the feedback can come back immediately without delay. 2.2 Performance Analysis of CSMA/IC In the ad-hoc wireless network, the medium is shared by all the MTs. The sending signal by itself dominates the signal from neighboring nodes. So, there is no way to detect the collision when the node is sending a signal. There are two sources of data collision. One source comes from the hidden terminal. The other is the concurrently sent signal. The CSMA/IC protocol can achieve 1% collision free performance with the following two thereon. As described in last section, the sensing radius in CSMA/IC is twice or more that of the collision radius. Thereon 1: All hidden terminals of a sending node could sense the signal sending of the sending node except if there is the concurrent sending in CSMA/IC. Proof: The destination of the legal packet sending must be inside the maximum transmission radius (γ). Then, the distance between the sender and destination must be smaller than γ. The hidden terminals which are the nodes that could interfere with the data reception of the destination node must be in the range of destination s collision area. So, the distance between destination and the hidden terminal must be smaller or equal to the collision radius that is equal to transmission radius (γ). So, the distance between the sender and any hidden terminal must smaller than 2γ - in the sensing range. As Fig. 1 shows, the node b is the furthest node that may interfere with the furthest receiver of node a. But node b is in the sensing range of node a - they could sense the sending of each other if they send at the different time. Thereon 2: If the nodes could sense the signal sending to each other, with the CSMA/IC, there are no two nodes or more with different binary numbers, which could win the media at the same time. Proof: We compare two different value binary numbers that are of equal bits length (for a small value binary number, the high position bit could use to make the binary number fixed bit long) bit by bit from the highest bit position to the lowest bit position. We must be able to find the highest bit position that has a different bit value. The bit value in the binary number with the higher value must be 1, and the binary number with lower value must be. At the corresponding time slot, the node with the bit value will sense the medium and sense signal sending from the node with the bit value 1 and quit. So, two or more winners with different binary codes could not co-exist at the same time. In our proposed CSMA/IC, the binary code the node used to compete for the media must be unique, thus guaranteeing one sender in the same sensing range. To show some advantages of CSMA/IC, we compare it with the CSMA/CA mechanism defined in the IEEE In both mechanisms, before sending a packet, there is time overhead to compete for the medium. The competing overhead in IEEE consists of IFS plus a variable number of time slots, which is randomly created from the Collision Window (CW) a parameter reflecting the traffic situation. Let s say the length of IFS is equal to 3 time-slots, and the maximum CW is 128, then the length of competing overhead of IEEE will vary from 3+ to In the CSMA/IC, the length of competing overhead is a constant value (16 time-slots is enough). So, the length of competing overhead in a binary count down mechanism is acceptable. Furthermore, it makes the synchronization more efficient. Because the length of competing overhead is constant, and the length of a function packet is constant, then we can slice the time into units equal to a constant competing overhead time + time to send a function packet. If we try to use the synchronization in the CSMA/CA, we have to slice the time into the sections equal to time to send the packet. The bandwidth wasting in competing overhead is significant even when network traffic is light (especially when the size of the sending packet is small). Using the CSMA/IC, we can get collision free MAC, but to synchronize the wireless ad-hoc networks we need external devices. There is another potential trade off that wastes the medium resource in binary count down we call it multihop competing problem. That is, in one communication range, there may be no winner; the winner may lay several hops away - that would not happen in CSMA/CA defined in the IEEE protocol. As Fig. 3 shows, when node a, b, c, d, e, and f want to access the medium at the same time, they use the binary key as shown in the figure a b c d e f 1 Fig. 3 Scenario of Multi-hop competing problem

4 When the process starts, node f first senses that the medium is busy at time slot 2 and quits, node e quits at time slot 3, and so on. Finally, only node a wins the medium. In the case that shows in Fig. 4, the node s layout is the same as the Fig. 3, but if the binary code is modified to the value as shown in the figure, the performance will be different. In the second time slot, node b is beaten by node a and quits. So, node c survives even its binary code is smaller than node b. In the fourth time slot, node d is beaten by node c and quits, then node e survives and beats node f. So, in this case, even the value of the binary code decreases from node a to node f, but finally, node a, c, and e all win the competition and send at the same time without collision. The CSMA/IC protocol has high performance in single hop ad-hoc wireless networks, such as at a conference. All the nodes pack into one room; they are all located in each other s transmission range, no matter the sensing range. However, in the multi-hops ad-hoc wireless networks, the nodes are spread in large area. In the whole sensing area (which is 4 times the transmission area), only one node at most could be allowed to send at one time. The bandwidth cost is too high, especially for the large size data packet. The exposed terminal problem still exists. To overcome the shortcut mention above is list on our future research. III a b 11 c 11 d 11 e f 1 Fig. 4 Another scenario SIMULATION ANALYSIS In this section, we study the performance of our CSMA/IC wireless MAC protocol by simulation. We compare performance of our CSMA/IC protocol to the single channel CSMA/CA that is defined in the IEEE standard. The performance metrics include (1) the transmission delay, which is measured from the time when the packet is created until the time the MT receives an ACK from the destination MT of this sent packet. We calculate the Average Delay (AD) of all the successfully received packets. (2) The Discard Ratio (DR), which is the ratio of the number of discarded packets to the total number of packets sent. There are several reasons for an MT to discard a packet. For example, before sending the packet, the MT checks the packet s destination to see whether it is reachable - if the packet s destination is not in the MT s reachable neighborhood MT list, the MT discards the packet without trying to send it. This kind of discarding does not occupy any medium resources. The packet may also be discarded because sending failed 3 consecutive times. When we calculate DR, we count the packets that are sent but failed and are finally discarded relative to the total number of packets that are sent (both those that are successful and those that fail). (3) Networks Throughput, which is a measure of the number of data packets sent successfully (get ACK) per second in the whole wireless LAN. (4) The Collision Rate (CR), which is the percentage of data-type packets sent that suffer collision. A packet-level simulator was developed using the Java programming language in order to monitor, observe and measure the performance of our protocol, using different input parameters Experimental setting In our simulation experiments, the channel capacity is set to 2 Mbps. All the MTs are assumed to be within a 4 4-unit grid. The CSMA/CA relative parameters are set as follows: the three IFS periods, SIFS, PIFS, DIFS and the slot defer time have been set to an effective length of 2, 3, 4 and 1 octet for 2 Mbps, respectively. The size of the Collision Window (CW) is between 8 and 128. When the MT suffers repeated collisions, the CW may reach 128. When an MT is successful for 4 consecutive times, the CW will be halved till it reaches 8. The parameters in CSMA/IC are set as follows: the length of total IFS consists of 16 time slots, each time slot has the same length effect as the slot time in the CSMA/CA. In our simulations, when packet transmission is attempted 3 times without receiving an ACK, the packet will be discarded. If the MT discards 3 packets in a row for the same destination, the destination MT is removed from the MT table. Hello messages are exchanged every.2 seconds. If the MT does not hear from its neighboring MT for 2 seconds, it will remove it from its MT table. Each experiment tests the behavior of the system for a given number of nodes (8 nodes) for 6 seconds. Our simulations consist of two stages: the network initiation stage, and the testing stage. During the network initiation stage, the MTs are created one at a time. When an MT is generated, it tries to establish its neighborhood by communicating with the hello message. After all specified MTs have been created for 5 seconds, the simulation then goes into the testing stage where data is collected for an additional 6 seconds. In the simulation, every MT is in one of two mobility states: moving or pausing. When in the moving state, the MT moves towards its target location determined in the last pause period, with a specific speed (randomly generated with a mean equal to Move Speed (1 grid unit/sec)). When the MT reaches its target location, it will reach its pausing state. The length of the pausing period is also randomly generated with a mean equal to a user defined input parameter, Pause Time (4 sec). During the pause period, it will determine the next target location and its moving speed. Hence, the MT s lifetime will consist of moving periods (each with its own speed and direction), and pausing periods (of different time intervals) in turn. Another variable parameter related to the mobility model is the transmission range, which is set to 1

5 grid units, and the sensing radius is equal to 2.1 times of transmission range in the control channel. However, in the data channel, the sensing radius is equal to the transmission radius. The length of the function packets and management packets is set to 2 octets. The length of the data packets is set to 2 octets. The mean packet arrival rate ( ) is set to 4, 8, 12, 16, 24, 32 units/second separately for every node. The queue size is set to 1 packets. When the average packets arrival rate ( ) is set to the value higher than the maximum capacity of packets that can be sent out, the queue that is used to store the data packet temporarily (capacity is set to 1 packets in our experiment) will be filled, and after that over speed packet arrival will be blocked Discussion of the results In the Pictures shown underneath, the value for every point is the mean value of 12 individual testing. In all of these experiments with our proposed CSMA/IC protocol, no matter how high the data arrival rate, there are no collisions taking place. In our simulation, the size of queue used to temporarily store the incoming data packets is 1. When the arrival rate reaches a certain point, the network traffic load becomes unbalanced, thus leading to heavy collisions, and the average delay is up sharply. But when the queue is full, the next incoming data packet will be blocked outside the node. So, when the data arrival rate is higher than the network traffic load unbalance point, network performance like Average Delay, Discard Ratio, and Network Throughput are similar and may increase slowly due to the uneven character of network (some node s queues may be full, but others may not be). Fig. 5 shows the AD of above two MAC mechanisms. We found that our proposed CSMA/IC protocol has lower AD than the DCF of IEEE when the increases. When the is not bigger than 12 packets/sec in, the AD of both experiments becomes relatively low. This is because at these packet arrival rates, the system is in balance, the transmission ability is still over the packet arrival rate and the temporary packet-storing queue is in the not-full state. Fig. 9 shows the packets blocking rate at these packet arrival rates are or near. In the low data arrival rate, the AD of CSMA/CA is slightly better than our proposed CSMA/IC, because the time slot number in CSMA/CA stays very small, limiting the sending overhead. When the is increased, the system is beyond the balance point, and most of time, the packet temporary storing queue is in the full state. The packet arrival at the full state queue will be blocked. The AD is increased slowly to two different maximum values equal to the time to send 1 packets (queue capacity) with the different MAC mechanisms. Fig. 6 and Fig. 7 show the DR and CR of the two MAC mechanisms respectively. The DR of our proposed CSMA/IC is remaining at, because of our 1% collision free status while the CSMA/CA has around 15% discard ratio when the network traffic load is unbalanced. From Fig. 8, we could find that the network throughput of our proposed CSMA/IC has increased by more than 6%. IV. CONCLUSION In this paper, we proposed a new MAC protocol CSMA/IC for wireless ad hoc networks. CSMA/IC can provide 1% collision-free media access. Our simulation results showed that CSMA/IC improves DCF of IEEE in terms of the average delay under heavy load and maximum achievable network throughput. The CSMA/IC protocol can also differentiate network service in packet sending and thus achieve QoS. References [1] B. Leiner, D. Nielson, and F. A. Tobagi, Eds., Proceedings of IEEE GLOBECOM, Special issue on packet radio networks, vol. 75, Jan [2] L. Kleinrock and F. A. Tobagi, Packet switching in radio channels, part I Carrier sense multiple-access modes and their throughput-delay characteristics, IEEE Trans. Commun., vol. COM-23, Dec. 1975, pp [3] Federal Communications Commision, Part 15-RADIO FREQUENCY DEVICES, Subpart D-Unlicensed Personal Communications Service Devices, 47 CER.1. [4] F.A. Tobagi and L.Kleinrock, Packet Switching in Radio Channels: Part II The Hidden Terminal Problem in CSMA and Busy-Tone Solution, IEEE Trans. On Communications COM 23, December 1975, pp [5] IEEE Standard for Wireless LAN LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Standard 82.11, 1997 [6] The Institute of Electrical and Electronics Engineers, Inc. IEEE Std Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, 1999 edition. [7] Benny Bing, High-Speed Wireless ATM and LANs by Artech House publishers [8] C.-H. Yeh, H. Zhou, and H.T. Mouftah, A time space division multiple access (TSDMA) protocol for multihop wireless networks with access points, Proc. IEEE Vehicula Technology Conf., May 22. [9] You, T., C.-H. Yeh, and H. Hassanein, A new class of collision-prevention MAC protocols for ad hoc wireless networks, IEEE Int'l Conf. Communications (IEEE ICC'3), May 23

6 Average Delay of Successfully Sent Data Packets msec Fig. 5 Average Delay of Successfully Sent Data 5 (%) Collision Rate of Sent Data Packets Fig. 7 Collision Rate of Sent Data Packets (%) Discard Ratio of Sent Data Packets Fig. 6 Discard Ratio of Sent Data Packets (unit/sec) Networks Throughput of Data Packets Fig. 8 Networks Throughput of Data Packets 6 Blocking rate of Data packets (%) Fig. 9 Blocking Rate of Data Packet

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Local Area Networks (WLANs) Part I Almost all wireless LANs now are IEEE 802.11

More information

The MAC layer in wireless networks

The MAC layer in wireless networks The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?

More information

Local Area Networks NETW 901

Local Area Networks NETW 901 Local Area Networks NETW 901 Lecture 4 Wireless LAN Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Contents What is a Wireless LAN? Applications and Requirements Transmission

More information

Multiple Access Links and Protocols

Multiple Access Links and Protocols Multiple Access Links and Protocols Two types of links : point-to-point PPP for dial-up access point-to-point link between Ethernet switch and host broadcast (shared wire or medium) old-fashioned Ethernet

More information

Computer Communication III

Computer Communication III Computer Communication III Wireless Media Access IEEE 802.11 Wireless LAN Advantages of Wireless LANs Using the license free ISM band at 2.4 GHz no complicated or expensive licenses necessary very cost

More information

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview Wireless LANs CSE 3213 Fall 2011 4 November 2011 Overview 2 1 Infrastructure Wireless LAN 3 Applications of Wireless LANs Key application areas: LAN extension cross-building interconnect nomadic access

More information

The MAC layer in wireless networks

The MAC layer in wireless networks The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a time/space problem Who transmits when?

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

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

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

Wireless Local Area Networks (WLANs) Part I

Wireless Local Area Networks (WLANs) Part I Wireless Local Area Networks (WLANs) Part I Raj Jain Professor of CSE Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse574-08/

More information

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

Data and Computer Communications. Chapter 13 Wireless LANs

Data and Computer Communications. Chapter 13 Wireless LANs Data and Computer Communications Chapter 13 Wireless LANs Wireless LAN Topology Infrastructure LAN Connect to stations on wired LAN and in other cells May do automatic handoff Ad hoc LAN No hub Peer-to-peer

More information

IEEE Medium Access Control. Medium Access Control

IEEE Medium Access Control. Medium Access Control IEEE 802.11 Medium Access Control EECS3214 3 April 2018 Medium Access Control reliable data delivery access control MAC layer covers three functional areas: security 2 1 MAC Requirements To avoid interference

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

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

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802. 4.3 IEEE 802.11 Physical Layer 4.3.1 IEEE 802.11 4.3.2 IEEE 802.11b 4.3.3 IEEE 802.11a 4.3.4 IEEE 802.11g 4.3.5 IEEE 802.11n 4.3.6 IEEE 802.11ac,ad Andreas Könsgen Summer Term 2012 4.3.3 IEEE 802.11a Data

More information

original standard a transmission at 5 GHz bit rate 54 Mbit/s b support for 5.5 and 11 Mbit/s e QoS

original standard a transmission at 5 GHz bit rate 54 Mbit/s b support for 5.5 and 11 Mbit/s e QoS IEEE 802.11 The standard defines a wireless physical interface and the MAC layer while LLC layer is defined in 802.2. The standardization process, started in 1990, is still going on; some versions are:

More information

Multi-channel MAC with Dynamic Channel Selection for Ad Hoc Networks

Multi-channel MAC with Dynamic Channel Selection for Ad Hoc Networks Multi-channel MAC with Dynamic Channel Selection for Ad Hoc Networks Asis Nasipuri and Jai Mondhe Department of Electrical & Computer Engineering The University of North Carolina at Charlotte Charlotte,

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

/99/$10.00 (c) 1999 IEEE

/99/$10.00 (c) 1999 IEEE COLLISION-FREE MEDIUM ACCESS CONTROL SCHEME FOR AD-HOC NETWORKS Zygmunt J. Haas and Jing Deng School of Electrical Engineering Cornell University Ithaca, NY 14853 haas@ee.cornell.edu Siamak Tabrizi US

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

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

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

Throughput Improvement by Adjusting RTS Transmission Range for W-LAN Ad Hoc Network

Throughput Improvement by Adjusting RTS Transmission Range for W-LAN Ad Hoc Network Proceedings of the 2014 Federated Conference on Computer Science and Information Systems pp. 941 946 DOI: 10.15439/2014F437 ACSIS, Vol. 2 Throughput Improvement by Adjusting RTS Transmission Range for

More information

Rahman 1. Application

Rahman 1. Application Data Link layer Overview of IEEE 802.11 Application Presentation Session Transport LLC: On transmission, assemble data into a frame with address and CRC fields. On reception, disassemble frame, perform

More information

Performance analysis of Internet applications over an adaptive IEEE MAC architecture

Performance analysis of Internet applications over an adaptive IEEE MAC architecture Journal of the Franklin Institute 343 (2006) 352 360 www.elsevier.com/locate/jfranklin Performance analysis of Internet applications over an adaptive IEEE 802.11 MAC architecture Uthman Baroudi, Mohammed

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

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

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

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

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

/$10.00 (c) 1998 IEEE

/$10.00 (c) 1998 IEEE Dual Busy Tone Multiple Access (DBTMA) - Performance Results Zygmunt J. Haas and Jing Deng School of Electrical Engineering Frank Rhodes Hall Cornell University Ithaca, NY 85 E-mail: haas, jing@ee.cornell.edu

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

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

Introduction to Wireless Networking CS 490WN/ECE 401WN Winter Lecture 4: Wireless LANs and IEEE Part II

Introduction to Wireless Networking CS 490WN/ECE 401WN Winter Lecture 4: Wireless LANs and IEEE Part II Introduction to Wireless Networking CS 490WN/ECE 401WN Winter 2007 Lecture 4: Wireless LANs and IEEE 802.11 Part II This lecture continues the study of wireless LANs by looking at IEEE 802.11. I. 802.11

More information

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE 802.11 NETWORKS Marek Natkaniec, Andrzej R. Pach Department of Telecommunications University of Mining and Metallurgy al. Mickiewicza 30, 30-059 Cracow

More information

Medium Access Control Sublayer

Medium Access Control Sublayer Wireless (WLAN) Medium Access Control Sublayer Mahalingam Mississippi State University, MS October 20, 2014 Outline Medium Access Protocols Wireless (WLAN) 1 Medium Access Protocols ALOHA Slotted ALOHA

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

Logical Link Control (LLC) Medium Access Control (MAC)

Logical Link Control (LLC) Medium Access Control (MAC) Overview of IEEE 802.11 Data Link layer Application Presentation Session Transport LLC: On transmission, assemble data into a frame with address and CRC fields. On reception, disassemble frame, perform

More information

Unit 7 Media Access Control (MAC)

Unit 7 Media Access Control (MAC) Unit 7 Media Access Control (MAC) 1 Internet Model 2 Sublayers of Data Link Layer Logical link control (LLC) Flow control Error control Media access control (MAC) access control 3 Categorization of MAC

More information

Mohamed Khedr.

Mohamed Khedr. Mohamed Khedr http://webmail.aast.edu/~khedr Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12 Week 13 Week 14 Week 15 Overview Packet Switching IP addressing

More information

A Performance Analysis of IEEE Networks in the Presence of Hidden Stations

A Performance Analysis of IEEE Networks in the Presence of Hidden Stations A Performance Analysis of IEEE 802.11 Networks in the Presence of Hidden Stations Marek Natkaniec, Andrzej R. Pach University of Mining and Metallurgy, Department of Telecommunications, Cracow, Poland

More information

An Efficient Scheduling Scheme for High Speed IEEE WLANs

An Efficient Scheduling Scheme for High Speed IEEE WLANs An Efficient Scheduling Scheme for High Speed IEEE 802.11 WLANs Juki Wirawan Tantra, Chuan Heng Foh, and Bu Sung Lee Centre of Muldia and Network Technology School of Computer Engineering Nanyang Technological

More information

A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem

A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC) A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for

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

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

Channel-Hopping Multiple Access

Channel-Hopping Multiple Access Channel-Hopping Multiple Access Asimakis Tzamaloukas and J.J. Garcia-Luna-Aceves Computer Engineering Department Baskin School of Engineering University of California, Santa Cruz, California 9564 jamal,

More information

MAC protocols. Lecturer: Dmitri A. Moltchanov

MAC protocols. Lecturer: Dmitri A. Moltchanov MAC protocols Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2616/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of MAC protocols Contention-based

More information

Embedded Internet and the Internet of Things WS 12/13

Embedded Internet and the Internet of Things WS 12/13 Embedded Internet and the Internet of Things WS 12/13 4. MAC Protocols Prof. Dr. Mesut Güneş Distributed, embedded Systems (DES) Institute of Computer Science Freie Universität Berlin Prof. Dr. Mesut Güneş

More information

Lesson 2-3: The IEEE x MAC Layer

Lesson 2-3: The IEEE x MAC Layer Module 2: Establishing Wireless Connectivity Lesson 2-3: The IEEE 802.11x MAC Layer Lesson Overview This lesson describes basic IEEE 802.11x MAC operation, beginning with an explanation of contention schemes

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

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

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

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

Computer Networks. Wireless LANs

Computer Networks. Wireless LANs Computer Networks Wireless LANs Mobile Communication Technology according to IEEE (examples) Local wireless networks WLAN 802.11 Personal wireless nw WPAN 802.15 WiFi 802.11a 802.11b 802.11h 802.11i/e/

More information

Tarek Sheltami. CCSE COE 3/8/2008 1

Tarek Sheltami. CCSE COE  3/8/2008 1 Mobile Ad hoc Networks COE 549 Random Access I Tarek Sheltami KFUPM CCSE COE http://faculty.kfupm.edu.sa/coe/tarek/coe549.htm 3/8/2008 1 Outline Medium Access Control Protocols ALOHA BTMA CSMA Some simulation

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

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 LAN -Architecture

Wireless LAN -Architecture Wireless LAN -Architecture IEEE has defined the specifications for a wireless LAN, called IEEE 802.11, which covers the physical and data link layers. Basic Service Set (BSS) Access Point (AP) Distribution

More information

ECE 4450:427/527 - Computer Networks Spring 2017

ECE 4450:427/527 - Computer Networks Spring 2017 ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.6: Wireless Networks - MAC Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527

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

Chapter 12 Multiple Access 12.1

Chapter 12 Multiple Access 12.1 Chapter 12 Multiple Access 12.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12.2 Figure 12.1 Data link layer divided into two functionality-oriented sublayers

More information

CS 43: Computer Networks. 27: Media Access Contd. December 3, 2018

CS 43: Computer Networks. 27: Media Access Contd. December 3, 2018 CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently

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

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

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

Nomadic Communications WLAN MAC Fundamentals

Nomadic Communications WLAN MAC Fundamentals Nomadic Communications WLAN 802.11 MAC Fundamentals Renato Lo Cigno ANS Group locigno@disi.unitn.it http://disi.unitn.it/locigno/index.php/teaching-duties/nomadic-communications Copyright Quest opera è

More information

Aloha and slotted aloha

Aloha and slotted aloha CSMA 2/13/06 Aloha and slotted aloha Slotted aloha: transmissions are synchronized and only start at the beginning of a time slot. Aloha sender A sender B collision sender C t Slotted Aloha collision sender

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 Jamming-Based MAC Protocol for Wireless Multihop Ad Hoc Networks

A Jamming-Based MAC Protocol for Wireless Multihop Ad Hoc Networks A Jamming-Based MAC Protocol for Wireless Multihop Ad Hoc Networks Shiang-Rung Ye, You-Chiun Wang, and Yu-Chee Tseng Department of Computer Science and Information Engineering National Chiao Tung University

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 802.11 Wireless LAN CSE 3213, Winter 2010 Instructor: Foroohar Foroozan Wireless Data Communications Wireless communications compelling

More information

SENSOR-MAC CASE STUDY

SENSOR-MAC CASE STUDY SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle

More information

Overview : Computer Networking. Spectrum Use Comments. Spectrum Allocation in US Link layer challenges and WiFi WiFi

Overview : Computer Networking. Spectrum Use Comments. Spectrum Allocation in US Link layer challenges and WiFi WiFi Overview 15-441 15-441: Computer Networking 15-641 Lecture 21: Wireless Justine Sherry Peter Steenkiste Fall 2017 www.cs.cmu.edu/~prs/15-441-f17 Link layer challenges and WiFi WiFi Basic WiFi design Some

More information

CSE 6811 Ashikur Rahman

CSE 6811 Ashikur Rahman Data Link layer Application Overview of IEEE 802.11 LLC: On transmission, assemble data into a frame with address and CRC fields. On reception, disassemble frame, perform address recognition and CRC validation.

More information

Wireless Communication and Networking CMPT 371

Wireless Communication and Networking CMPT 371 Wireless Communication and Networking CMPT 371 Wireless Systems: AM, FM Radio TV Broadcast Satellite Broadcast 2-way Radios Cordless Phones Satellite Links Mobile Telephony Systems Wireless Local Loop

More information

Topics for Today. More on Ethernet. Wireless LANs Readings. Topology and Wiring Switched Ethernet Fast Ethernet Gigabit Ethernet. 4.3 to 4.

Topics for Today. More on Ethernet. Wireless LANs Readings. Topology and Wiring Switched Ethernet Fast Ethernet Gigabit Ethernet. 4.3 to 4. Topics for Today More on Ethernet Topology and Wiring Switched Ethernet Fast Ethernet Gigabit Ethernet Wireless LANs Readings 4.3 to 4.4 1 Original Ethernet Wiring Heavy coaxial cable, called thicknet,

More information

ICE 1332/0715 Mobile Computing (Summer, 2008)

ICE 1332/0715 Mobile Computing (Summer, 2008) ICE 1332/0715 Mobile Computing (Summer, 2008) IEEE 802.11 Prof. Chansu Yu http://academic.csuohio.edu/yuc/ Contents Overview of IEEE 802.11 Frame formats MAC frame PHY frame IEEE 802.11 IEEE 802.11b IEEE

More information

ICE 1332/0715 Mobile Computing (Summer, 2008)

ICE 1332/0715 Mobile Computing (Summer, 2008) ICE 1332/0715 Mobile Computing (Summer, 2008) Medium Access Control Prof. Chansu Yu http://academic.csuohio.edu/yuc/ Simplified Reference Model Application layer Transport layer Network layer Data link

More information

Mohammad Hossein Manshaei 1393

Mohammad Hossein Manshaei 1393 Mohammad Hossein Manshaei manshaei@gmail.com 1393 1 An Analytical Approach: Bianchi Model 2 Real Experimentations HoE on IEEE 802.11b Analytical Models Bianchi s Model Simulations ns-2 3 N links with the

More information

Mobile & Wireless Networking. Lecture 7: Wireless LAN

Mobile & Wireless Networking. Lecture 7: Wireless LAN 192620010 Mobile & Wireless Networking Lecture 7: Wireless LAN [Schiller, Section 7.3] [Reader, Part 6] [Optional: "IEEE 802.11n Development: History, Process, and Technology", Perahia, IEEE Communications

More information

Media Access Control in Ad Hoc Networks

Media Access Control in Ad Hoc Networks Media Access Control in Ad Hoc Networks The Wireless Medium is a scarce precious resource. Furthermore, the access medium is broadcast in nature. It is necessary to share this resource efficiently and

More information

CONTENTION BASED PROTOCOLS WITH RESERVATION MECHANISMS

CONTENTION BASED PROTOCOLS WITH RESERVATION MECHANISMS CONTENTION BASED PROTOCOLS WITH RESERVATION MECHANISMS Five-Phase Reservation Protocol A single-channel time division multiple access (TDMA)-based broadcast scheduling protocol. Nodes use a contention

More information

MAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users

MAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users MAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users Static Channel Allocation: Frequency Division Multiplexing

More information

Channel-Hopping Multiple Access

Channel-Hopping Multiple Access Channel-Hopping Multiple Access Asimakis Tzamaloukas and J.J. Garcia-Luna-Aceves Computer Engineering Department Baskin School of Engineering University of California, Santa Cruz, California 9564 fjamal,

More information

A new MAC protocol for reducing effect of needless transmission deferment induced by missed RTS/CTS handshake

A new MAC protocol for reducing effect of needless transmission deferment induced by missed RTS/CTS handshake Mobile Information Systems 5 (009) 3 DOI 0.333/MIS-009-0070 IOS Press A new MAC protocol for reducing effect of needless transmission deferment induced by missed / handshake Tetsuya Shigeyasu a, Daishi

More information

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay CS 348: Computer Networks - WiFi (contd.); 16 th Aug 2012 Instructor: Sridhar Iyer IIT Bombay Clicker-1: Wireless v/s wired Which of the following differences between Wireless and Wired affect a CSMA-based

More information

MAC protocols for ad hoc networks

MAC protocols for ad hoc networks MAC protocols for ad hoc networks Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2756/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of

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

MAC. Fall Data Communications II 1

MAC. Fall Data Communications II 1 802.11 MAC Fall 2005 91.564 Data Communications II 1 RF Quality (ACK) Fall 2005 91.564 Data Communications II 2 Hidden Terminal (RTS/CTS) Fall 2005 91.564 Data Communications II 3 MAC Coordination Functions

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

Mobile Communications Chapter 7: Wireless LANs

Mobile Communications Chapter 7: Wireless LANs Characteristics IEEE 802.11 PHY MAC Roaming IEEE 802.11a, b, g, e HIPERLAN Bluetooth Comparisons Prof. Dr.-Ing. Jochen Schiller, http://www.jochenschiller.de/ MC SS02 7.1 Comparison: infrastructure vs.

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang Intelligent Transportation Systems Medium Access Control Prof. Dr. Thomas Strang Recap: Wireless Interconnections Networking types + Scalability + Range Delay Individuality Broadcast o Scalability o Range

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 Spring'15 1 Next week Announcements April 14: ICN (Spencer Sevilla) April 16: DTN

More information

MC-CDMA Based IEEE Wireless LAN

MC-CDMA Based IEEE Wireless LAN MC-CDMA Based IEEE 802.11 Wireless LAN Georgios Orfanos Jörg Habetha Ling Liu Aachen Univ. of Technology D-52074 Aachen, Germany Philips Research Laboratories, D-52066 Aachen, Germany Aachen Univ. of Technology

More information

Chapter 6 Wireless and Mobile Networks. Csci 4211 David H.C. Du

Chapter 6 Wireless and Mobile Networks. Csci 4211 David H.C. Du Chapter 6 Wireless and Mobile Networks Csci 4211 David H.C. Du Wireless LAN IEEE 802.11 a, b, g IEEE 802.15 Buletooth Hidden Terminal Effect Hidden Terminal Problem Hidden terminals A, C cannot hear each

More information

3.1. Introduction to WLAN IEEE

3.1. Introduction to WLAN IEEE 3.1. Introduction to WLAN IEEE 802.11 WCOM, WLAN, 1 References [1] J. Schiller, Mobile Communications, 2nd Ed., Pearson, 2003. [2] Martin Sauter, "From GSM to LTE", chapter 6, Wiley, 2011. [3] wiki to

More information

Distributed STDMA in Ad Hoc Networks

Distributed STDMA in Ad Hoc Networks Distributed STDMA in Ad Hoc Networks Jimmi Grönkvist Swedish Defence Research Agency SE-581 11 Linköping, Sweden email: jimgro@foi.se Abstract Spatial reuse TDMA is a collision-free access scheme for ad

More information

Overview. Wireless networks basics IEEE (Wi-Fi) a/b/g/n ad Hoc MAC protocols ad Hoc routing DSR AODV

Overview. Wireless networks basics IEEE (Wi-Fi) a/b/g/n ad Hoc MAC protocols ad Hoc routing DSR AODV Wireless networks 1 Overview Wireless networks basics IEEE 802.11 (Wi-Fi) a/b/g/n ad Hoc MAC protocols ad Hoc routing DSR AODV 2 Wireless Networks Autonomous systems of mobile hosts connected by wireless

More information