This document presents the Contention Window Multiplicative Increase Decrease Backoff (CWMIDB) algorithm for reducing collisions in mobile ad hoc networks (MANETs). CWMIDB dynamically controls the contention window size of nodes experiencing collisions. During collisions, the window size increases by 4x, and decreases to the minimum size after a successful transmission. The algorithm is simulated and shown to improve transmission probability and throughput compared to the existing binary exponential backoff algorithm.
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...ijasuc
The document presents a new Collision Based Contention (CBC) MAC protocol for mobile ad hoc networks.
The CBC protocol aims to improve throughput by dynamically adjusting the contention window size based on the current collision level, rather than using a fixed binary exponential backoff as in 802.11. Under CBC, the contention window is incremented or decremented by varying factors depending on the number of consecutive collisions or successes. This allows the window size to better reflect current network conditions compared to alternatives like MILD, MIMD, and AETF. Simulation results showed CBC outperforms 802.11 BEB and other proposals in terms of throughput, fairness, and delay.
This document provides an overview of multiple access protocols for shared wireless media. It discusses random access protocols like ALOHA, slotted ALOHA, CSMA, CSMA/CD, and CSMA/CA. ALOHA protocols allow stations to transmit whenever they have data, which can cause collisions. Slotted ALOHA and CSMA protocols reduce collisions by coordinating transmissions. The document also covers controlled access protocols like reservation, polling, and token passing that establish transmission rights to avoid collisions. It includes frame formats, throughput calculations, and flow diagrams to illustrate how each protocol manages access to the shared channel.
S.VIJAYALAKSHMI M.SC(CS) discusses Media Access Control and multiple access protocols. The main task of MAC protocols is to minimize collisions and utilize bandwidth by determining when nodes can access the shared channel, what to do when the channel is busy, and how to handle collisions. Early protocols like Aloha and slotted Aloha were inefficient at high loads due to many collisions. CSMA protocols reduce collisions by having nodes listen first before transmitting, but collisions are still possible due to propagation delays.
This document discusses multiple access protocols used at the data link layer. It describes random access protocols like ALOHA and CSMA, controlled access protocols using reservation, polling and token passing, and channelization protocols including FDMA, TDMA and CDMA. Random access allows stations to transmit without coordination when they have data, while controlled access requires stations to get authorization before transmitting. Channelization divides the available bandwidth using techniques like frequency, time, or code to allow multiple simultaneous transmissions. Diagrams and examples are provided to illustrate how each protocol works.
This document summarizes research on medium access control (MAC) layer protocols for ad-hoc networks. It begins with an introduction to ad-hoc networks and their key properties. It then discusses important issues at the MAC layer for these dynamic networks, including limited bandwidth, errors, and changing topologies. Several MAC protocol classifications and examples are provided, such as power-aware, multiple channel, and quality of service protocols. The document concludes by discussing future research directions for addressing open problems at the MAC layer in ad-hoc networks.
This document discusses multiple access protocols for wireless networks. It begins by describing random access protocols like ALOHA and slotted ALOHA. It then covers controlled access protocols using reservation, polling, and token passing. Finally, it discusses channelization protocols using frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA). Throughout are examples calculating throughput for different access loads and determining minimum frame sizes.
Medium access control methods from fixed networks like CSMA/CD may not work well for wireless networks due to signal strength degradation over distance and hidden and exposed terminal problems. Various MAC protocols were developed for wireless including TDMA, FDMA, polling, and random access methods like Aloha and its variants. Later protocols use signaling messages to reserve channels and avoid collisions, like MACA which uses RTS/CTS messages.
In the seven-layer OSI model of computer networking, media access control (MAC) data communication protocol is a sublayer of the data link layer (layer 2). The MAC sublayer provides addressing and channel access control mechanisms that make it possible for several terminals or network nodes to communicate within a multiple access network that incorporates a shared medium, e.g. an Ethernet network. The hardware that implements the MAC is referred to as a media access controller.
The MAC sublayer acts as an interface between the logical link control (LLC) sublayer and the network's physical layer. The MAC layer emulates a full-duplex logical communication channel in a multi-point network. This channel may provide unicast, multicast or broadcast communication service.
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...ijasuc
The document presents a new Collision Based Contention (CBC) MAC protocol for mobile ad hoc networks.
The CBC protocol aims to improve throughput by dynamically adjusting the contention window size based on the current collision level, rather than using a fixed binary exponential backoff as in 802.11. Under CBC, the contention window is incremented or decremented by varying factors depending on the number of consecutive collisions or successes. This allows the window size to better reflect current network conditions compared to alternatives like MILD, MIMD, and AETF. Simulation results showed CBC outperforms 802.11 BEB and other proposals in terms of throughput, fairness, and delay.
This document provides an overview of multiple access protocols for shared wireless media. It discusses random access protocols like ALOHA, slotted ALOHA, CSMA, CSMA/CD, and CSMA/CA. ALOHA protocols allow stations to transmit whenever they have data, which can cause collisions. Slotted ALOHA and CSMA protocols reduce collisions by coordinating transmissions. The document also covers controlled access protocols like reservation, polling, and token passing that establish transmission rights to avoid collisions. It includes frame formats, throughput calculations, and flow diagrams to illustrate how each protocol manages access to the shared channel.
S.VIJAYALAKSHMI M.SC(CS) discusses Media Access Control and multiple access protocols. The main task of MAC protocols is to minimize collisions and utilize bandwidth by determining when nodes can access the shared channel, what to do when the channel is busy, and how to handle collisions. Early protocols like Aloha and slotted Aloha were inefficient at high loads due to many collisions. CSMA protocols reduce collisions by having nodes listen first before transmitting, but collisions are still possible due to propagation delays.
This document discusses multiple access protocols used at the data link layer. It describes random access protocols like ALOHA and CSMA, controlled access protocols using reservation, polling and token passing, and channelization protocols including FDMA, TDMA and CDMA. Random access allows stations to transmit without coordination when they have data, while controlled access requires stations to get authorization before transmitting. Channelization divides the available bandwidth using techniques like frequency, time, or code to allow multiple simultaneous transmissions. Diagrams and examples are provided to illustrate how each protocol works.
This document summarizes research on medium access control (MAC) layer protocols for ad-hoc networks. It begins with an introduction to ad-hoc networks and their key properties. It then discusses important issues at the MAC layer for these dynamic networks, including limited bandwidth, errors, and changing topologies. Several MAC protocol classifications and examples are provided, such as power-aware, multiple channel, and quality of service protocols. The document concludes by discussing future research directions for addressing open problems at the MAC layer in ad-hoc networks.
This document discusses multiple access protocols for wireless networks. It begins by describing random access protocols like ALOHA and slotted ALOHA. It then covers controlled access protocols using reservation, polling, and token passing. Finally, it discusses channelization protocols using frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA). Throughout are examples calculating throughput for different access loads and determining minimum frame sizes.
Medium access control methods from fixed networks like CSMA/CD may not work well for wireless networks due to signal strength degradation over distance and hidden and exposed terminal problems. Various MAC protocols were developed for wireless including TDMA, FDMA, polling, and random access methods like Aloha and its variants. Later protocols use signaling messages to reserve channels and avoid collisions, like MACA which uses RTS/CTS messages.
In the seven-layer OSI model of computer networking, media access control (MAC) data communication protocol is a sublayer of the data link layer (layer 2). The MAC sublayer provides addressing and channel access control mechanisms that make it possible for several terminals or network nodes to communicate within a multiple access network that incorporates a shared medium, e.g. an Ethernet network. The hardware that implements the MAC is referred to as a media access controller.
The MAC sublayer acts as an interface between the logical link control (LLC) sublayer and the network's physical layer. The MAC layer emulates a full-duplex logical communication channel in a multi-point network. This channel may provide unicast, multicast or broadcast communication service.
1) Medium Access Control (MAC) protocols regulate access to shared wireless channels and ensure performance requirements of applications are met. They assemble data into frames, append addressing and error detection, and disassemble received frames.
2) Common MAC protocols include Fixed Assignment (e.g. TDMA), Demand Assignment (e.g. polling), and Random Assignment (e.g. ALOHA, CSMA). Schedule-based MAC protocols avoid contention through resource scheduling while contention-based protocols (e.g. CSMA/CA) allocate resources on demand, risking collisions.
3) The document discusses various MAC protocols for wireless sensor networks and their objectives to minimize energy waste from idle listening, collisions,
The document outlines different multiple access mechanisms for data link layers, including random access, controlled access, and channelization. It then describes the sublayers of the data link layer and various random access protocols like ALOHA, slotted ALOHA, CSMA, CSMA/CD, and CSMA/CA. It provides details on how each protocol handles channel access and collisions.
Wireless Application Protocol (WAP) allows devices to access the Internet over wireless networks. There are three main categories of protocols for managing shared access to wireless networks: fixed assignment, demand assignment, and random assignment. Fixed assignment divides resources like frequency bands or time slots and allocates them exclusively. Demand assignment allocates resources only to nodes that need them. Random assignment does not preallocate resources and relies on collision detection and retransmission to manage shared access. Common protocols that fall under these categories include FDMA, TDMA, CDMA, ALOHA, and CSMA.
The document proposes a Power Controlled Dual Channel (PCDC) medium access protocol for wireless ad hoc networks that aims to increase channel utilization and network throughput while decreasing energy consumption. The protocol builds on IEEE 802.11 by allowing simultaneous transmissions in a neighborhood through dynamic power control based on directional and channel gain information from overheard RTS and CTS packets. Simulation results show the proposed protocol achieves significant increases in channel utilization and end-to-end throughput as well as significant decreases in total energy consumption compared to IEEE 802.11.
The document discusses MAC layer protocols for wireless networks. It begins by explaining that MAC (Media Access Control) controls access to the shared transmission medium on a local area network. It aims to prevent nodes from interfering with each other's transmissions. Common MAC protocols discussed include CSMA/CD used in Ethernet, and early wireless MAC protocols like MACA which introduced RTS/CTS to avoid the hidden terminal problem. A key part of wireless MAC is the IEEE 802.11 distributed coordination function, which uses carrier sensing, backoff mechanisms and RTS/CTS/DATA/ACK to allow multiple nodes fair access to the shared wireless channel.
The document discusses media access control (MAC) protocols for wireless networks. It explains that standard MAC schemes from wired networks often fail in wireless scenarios due to signal attenuation over distance and the hidden terminal problem. It provides examples of the hidden terminal, exposed terminal, and near-far terminal problems that can occur in wireless networks. It then summarizes several MAC protocols used in wireless networks, including CSMA/CA, TDMA, FDMA, and ALOHA/Slotted ALOHA.
This document describes three TCP-aware link layer protocols: Snooping TCP, Wireless TCP, and Delayed DACK. Snooping TCP uses an agent at the base station to snoop and buffer TCP connections, ensuring packets are delivered to the mobile node in order and retransmitting lost packets. Wireless TCP modifies timestamps to compensate for increased round-trip time. Delayed DACK delays acknowledgments to allow time for lost packets to be recovered before triggering retransmissions.
Medium access control (MAC) is the sublayer of the data link layer that coordinates use of a shared medium in wireless networks. It addresses problems like hidden and exposed terminals through techniques like carrier sense multiple access (CSMA) and time division multiple access (TDMA). TDMA divides time into slots and assigns slots to different users to avoid collisions. Early random access protocols like Aloha and slotted Aloha had low throughput due to many collisions, while later protocols use RTS/CTS handshaking and carrier sensing to reduce collisions and improve throughput.
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...Pallepati Vasavi
This document discusses various terminology related to the MAC sublayer, including:
1. The station model consisting of independent stations that generate frames for transmission.
2. The single channel assumption where a single channel is available for all communication.
3. The collision assumption where if two frames are transmitted simultaneously they will overlap and be garbled.
It then covers concepts such as carrier sensing, hidden and exposed terminals, and near and far terminals that create challenges for wireless networks. Finally, it introduces various multiple access methods including SDMA, FDMA, TDMA, and CDMA.
The document summarizes key aspects of the MAC (Media Access Control) layer. It discusses how the MAC layer provides MAC addressing using unique identifiers for each device and provides multiple access to allow multiple devices to share the same communication channel. It describes different multiple access protocols like random access, CSMA, polling, and channelization methods including FDMA, TDMA, and CDMA that control how devices access and share the channel.
This document discusses multiple access protocols for wireless networks. It describes random access methods like ALOHA and slotted ALOHA, controlled access methods using reservation, polling, and token passing, and channelization methods including FDMA, TDMA, and CDMA. Examples are provided to illustrate the calculation of throughput for various access loads in ALOHA and slotted ALOHA networks.
Medium access control protocols can be classified as random access, controlled access, or channelization protocols. Random access protocols have no central control and stations decide independently when to transmit. Common random access protocols include ALOHA, CSMA, CSMA/CD, and CSMA/CA. Controlled access protocols require stations to get permission before transmitting, using methods like reservation, polling, or token passing. Channelization protocols divide the channel bandwidth by frequency (FDMA), time (TDMA), or code (CDMA).
The document discusses the Medium Access Control (MAC) sublayer of the data link layer and various protocols for determining which device can access a shared communication channel. It focuses on static and dynamic channel allocation problems in local area networks (LANs) and wireless networks. Static allocation wastes bandwidth by assigning each user a fixed portion of the channel even when they are not transmitting. Dynamic protocols like ALOHA and carrier sense multiple access (CSMA) aim to improve channel utilization by allowing users to transmit only when the channel is idle.
The Media Access Control (MAC) data communication protocol sub-layer, also known as the
Medium Access Control, is a sublayer of the Data Link Layer specified in the seven-layer OSI
model (layer 2). The hardware that implements the MAC is referred to as a Medium Access
Controller. The MAC sub-layer acts as an interface between the Logical Link Control (LLC)
sublayer and the network's physical layer. The MAC layer emulates a full-duplex logical
communication channel in a multi-point network. This channel may provide unicast, multicast or
broadcast communication service.
CSMA protocols allow nodes on a shared transmission medium to transmit packets in a probabilistic manner without collisions. There are several types of CSMA protocols. CSMA with collision detection (CSMA/CD) improves performance by terminating transmissions when collisions are detected. CSMA with collision avoidance (CSMA/CA) uses random deferral of transmissions when the medium is busy to reduce collisions. Virtual time CSMA avoids collisions in hard real-time systems using two clocks, one that freezes when the medium is busy.
The document discusses various medium access control protocols for local area networks:
1. Static channel allocation protocols like Frequency-Division Multiplexing (FDM) can waste bandwidth if the number of users is not exactly equal to the number of allocated channels.
2. Dynamic channel allocation protocols do not pre-allocate channels. The ALOHA and CSMA protocols allow nodes to transmit whenever the channel is sensed to be idle, which can still result in collisions.
3. Slotted ALOHA improves on pure ALOHA by only allowing transmissions to start at discrete time slots, doubling its maximum throughput. Carrier sensing in CSMA helps reduce but does not eliminate the possibility of collisions.
The document compares MAC protocols in wired and wireless systems. In wired systems, protocols like Ethernet use CSMA/CD, allowing nodes to detect collisions. In wireless systems, hidden and exposed terminal problems occur, requiring protocols like MACA, MACAW, and 802.11 CSMA/CA to use RTS/CTS handshaking or polling to avoid interference between transmissions. The IEEE 802.11 standard defines distributed and point coordination function MAC methods for wireless LANs.
This document discusses different medium access control (MAC) protocols for wireless networks. It describes the problems with using carrier sense multiple access with collision detection (CSMA/CD) in wireless networks due to signal strength decreasing with distance and hidden and exposed terminal problems. It then discusses various MAC protocols to address these issues, including space division multiple access (SDMA), frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA). It provides details on how FDMA, TDMA, and CDMA work to allow multiple access to the wireless medium.
This document discusses multiple access procedures used in wireless networks. It describes four main types: FDMA which divides the frequency band into channels; TDMA which divides the available time into time slots; CDMA which uses orthogonal codes to separate signals that occupy the same frequency; and SDMA which divides the space using directional antennas. The document provides details on how FDMA, TDMA, and CDMA work and notes some variants of TDMA including fixed, dynamic, and packet-based TDMA.
Quality of Service for Video Streaming using EDCA in MANETijsrd.com
Mobile Ad-hoc network(MANET) is a collection of wireless terminals that are able to dynamically form a temporary network. To establish such a network no fixed infrastructure is required. Here, it is the responsibility of network nodes to forward each other's packets and thus these nodes also act as routers. In such a network resources are limited and also topology changes dynamically. So providing Quality of service(QoS) is also necessary. QoS is more important for real time applications for example Video Streaming. IEEE 802.11e network standard supports QoS through EDCA technique. This technique does not fulfill the requirements of QoS. So, in this project modified EDCA technique is proposed to enhance QoS for Video Streaming application. This technique is implemented in NS2 and compared with traditional EDCA.
11.a review of improvement in tcp congestion control using route failure det...Alexander Decker
This summary provides an overview of a document that reviews several algorithms aimed at improving TCP congestion control and addressing route failures in mobile ad hoc networks (MANETs).
The document begins with an introduction to MANETs and the issues they present for TCP, as TCP was designed for wired networks and interprets all packet losses as congestion. It then analyzes and compares five different algorithms that have been proposed to help TCP distinguish between losses due to route failures versus congestion. These algorithms aim to improve network performance metrics like throughput, packet delivery ratio, and end-to-end delay. The document concludes that while these algorithms approach the problem of route failures and TCP performance degradation in different ways, their overall goal is the
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETsIOSR Journals
This document presents a proposed multi-channel distribution scheme for mobile ad hoc networks (MANETs) and evaluates it through simulation. The proposed scheme assigns channels to nodes based on their node IDs to avoid control overhead from time synchronization. While neighboring nodes on the same channel is possible, the probability is low given random node distribution. The proposed scheme is compared to a single-channel scheme in ns-2 simulations. Results show the proposed technique has better performance.
1) Medium Access Control (MAC) protocols regulate access to shared wireless channels and ensure performance requirements of applications are met. They assemble data into frames, append addressing and error detection, and disassemble received frames.
2) Common MAC protocols include Fixed Assignment (e.g. TDMA), Demand Assignment (e.g. polling), and Random Assignment (e.g. ALOHA, CSMA). Schedule-based MAC protocols avoid contention through resource scheduling while contention-based protocols (e.g. CSMA/CA) allocate resources on demand, risking collisions.
3) The document discusses various MAC protocols for wireless sensor networks and their objectives to minimize energy waste from idle listening, collisions,
The document outlines different multiple access mechanisms for data link layers, including random access, controlled access, and channelization. It then describes the sublayers of the data link layer and various random access protocols like ALOHA, slotted ALOHA, CSMA, CSMA/CD, and CSMA/CA. It provides details on how each protocol handles channel access and collisions.
Wireless Application Protocol (WAP) allows devices to access the Internet over wireless networks. There are three main categories of protocols for managing shared access to wireless networks: fixed assignment, demand assignment, and random assignment. Fixed assignment divides resources like frequency bands or time slots and allocates them exclusively. Demand assignment allocates resources only to nodes that need them. Random assignment does not preallocate resources and relies on collision detection and retransmission to manage shared access. Common protocols that fall under these categories include FDMA, TDMA, CDMA, ALOHA, and CSMA.
The document proposes a Power Controlled Dual Channel (PCDC) medium access protocol for wireless ad hoc networks that aims to increase channel utilization and network throughput while decreasing energy consumption. The protocol builds on IEEE 802.11 by allowing simultaneous transmissions in a neighborhood through dynamic power control based on directional and channel gain information from overheard RTS and CTS packets. Simulation results show the proposed protocol achieves significant increases in channel utilization and end-to-end throughput as well as significant decreases in total energy consumption compared to IEEE 802.11.
The document discusses MAC layer protocols for wireless networks. It begins by explaining that MAC (Media Access Control) controls access to the shared transmission medium on a local area network. It aims to prevent nodes from interfering with each other's transmissions. Common MAC protocols discussed include CSMA/CD used in Ethernet, and early wireless MAC protocols like MACA which introduced RTS/CTS to avoid the hidden terminal problem. A key part of wireless MAC is the IEEE 802.11 distributed coordination function, which uses carrier sensing, backoff mechanisms and RTS/CTS/DATA/ACK to allow multiple nodes fair access to the shared wireless channel.
The document discusses media access control (MAC) protocols for wireless networks. It explains that standard MAC schemes from wired networks often fail in wireless scenarios due to signal attenuation over distance and the hidden terminal problem. It provides examples of the hidden terminal, exposed terminal, and near-far terminal problems that can occur in wireless networks. It then summarizes several MAC protocols used in wireless networks, including CSMA/CA, TDMA, FDMA, and ALOHA/Slotted ALOHA.
This document describes three TCP-aware link layer protocols: Snooping TCP, Wireless TCP, and Delayed DACK. Snooping TCP uses an agent at the base station to snoop and buffer TCP connections, ensuring packets are delivered to the mobile node in order and retransmitting lost packets. Wireless TCP modifies timestamps to compensate for increased round-trip time. Delayed DACK delays acknowledgments to allow time for lost packets to be recovered before triggering retransmissions.
Medium access control (MAC) is the sublayer of the data link layer that coordinates use of a shared medium in wireless networks. It addresses problems like hidden and exposed terminals through techniques like carrier sense multiple access (CSMA) and time division multiple access (TDMA). TDMA divides time into slots and assigns slots to different users to avoid collisions. Early random access protocols like Aloha and slotted Aloha had low throughput due to many collisions, while later protocols use RTS/CTS handshaking and carrier sensing to reduce collisions and improve throughput.
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...Pallepati Vasavi
This document discusses various terminology related to the MAC sublayer, including:
1. The station model consisting of independent stations that generate frames for transmission.
2. The single channel assumption where a single channel is available for all communication.
3. The collision assumption where if two frames are transmitted simultaneously they will overlap and be garbled.
It then covers concepts such as carrier sensing, hidden and exposed terminals, and near and far terminals that create challenges for wireless networks. Finally, it introduces various multiple access methods including SDMA, FDMA, TDMA, and CDMA.
The document summarizes key aspects of the MAC (Media Access Control) layer. It discusses how the MAC layer provides MAC addressing using unique identifiers for each device and provides multiple access to allow multiple devices to share the same communication channel. It describes different multiple access protocols like random access, CSMA, polling, and channelization methods including FDMA, TDMA, and CDMA that control how devices access and share the channel.
This document discusses multiple access protocols for wireless networks. It describes random access methods like ALOHA and slotted ALOHA, controlled access methods using reservation, polling, and token passing, and channelization methods including FDMA, TDMA, and CDMA. Examples are provided to illustrate the calculation of throughput for various access loads in ALOHA and slotted ALOHA networks.
Medium access control protocols can be classified as random access, controlled access, or channelization protocols. Random access protocols have no central control and stations decide independently when to transmit. Common random access protocols include ALOHA, CSMA, CSMA/CD, and CSMA/CA. Controlled access protocols require stations to get permission before transmitting, using methods like reservation, polling, or token passing. Channelization protocols divide the channel bandwidth by frequency (FDMA), time (TDMA), or code (CDMA).
The document discusses the Medium Access Control (MAC) sublayer of the data link layer and various protocols for determining which device can access a shared communication channel. It focuses on static and dynamic channel allocation problems in local area networks (LANs) and wireless networks. Static allocation wastes bandwidth by assigning each user a fixed portion of the channel even when they are not transmitting. Dynamic protocols like ALOHA and carrier sense multiple access (CSMA) aim to improve channel utilization by allowing users to transmit only when the channel is idle.
The Media Access Control (MAC) data communication protocol sub-layer, also known as the
Medium Access Control, is a sublayer of the Data Link Layer specified in the seven-layer OSI
model (layer 2). The hardware that implements the MAC is referred to as a Medium Access
Controller. The MAC sub-layer acts as an interface between the Logical Link Control (LLC)
sublayer and the network's physical layer. The MAC layer emulates a full-duplex logical
communication channel in a multi-point network. This channel may provide unicast, multicast or
broadcast communication service.
CSMA protocols allow nodes on a shared transmission medium to transmit packets in a probabilistic manner without collisions. There are several types of CSMA protocols. CSMA with collision detection (CSMA/CD) improves performance by terminating transmissions when collisions are detected. CSMA with collision avoidance (CSMA/CA) uses random deferral of transmissions when the medium is busy to reduce collisions. Virtual time CSMA avoids collisions in hard real-time systems using two clocks, one that freezes when the medium is busy.
The document discusses various medium access control protocols for local area networks:
1. Static channel allocation protocols like Frequency-Division Multiplexing (FDM) can waste bandwidth if the number of users is not exactly equal to the number of allocated channels.
2. Dynamic channel allocation protocols do not pre-allocate channels. The ALOHA and CSMA protocols allow nodes to transmit whenever the channel is sensed to be idle, which can still result in collisions.
3. Slotted ALOHA improves on pure ALOHA by only allowing transmissions to start at discrete time slots, doubling its maximum throughput. Carrier sensing in CSMA helps reduce but does not eliminate the possibility of collisions.
The document compares MAC protocols in wired and wireless systems. In wired systems, protocols like Ethernet use CSMA/CD, allowing nodes to detect collisions. In wireless systems, hidden and exposed terminal problems occur, requiring protocols like MACA, MACAW, and 802.11 CSMA/CA to use RTS/CTS handshaking or polling to avoid interference between transmissions. The IEEE 802.11 standard defines distributed and point coordination function MAC methods for wireless LANs.
This document discusses different medium access control (MAC) protocols for wireless networks. It describes the problems with using carrier sense multiple access with collision detection (CSMA/CD) in wireless networks due to signal strength decreasing with distance and hidden and exposed terminal problems. It then discusses various MAC protocols to address these issues, including space division multiple access (SDMA), frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA). It provides details on how FDMA, TDMA, and CDMA work to allow multiple access to the wireless medium.
This document discusses multiple access procedures used in wireless networks. It describes four main types: FDMA which divides the frequency band into channels; TDMA which divides the available time into time slots; CDMA which uses orthogonal codes to separate signals that occupy the same frequency; and SDMA which divides the space using directional antennas. The document provides details on how FDMA, TDMA, and CDMA work and notes some variants of TDMA including fixed, dynamic, and packet-based TDMA.
Quality of Service for Video Streaming using EDCA in MANETijsrd.com
Mobile Ad-hoc network(MANET) is a collection of wireless terminals that are able to dynamically form a temporary network. To establish such a network no fixed infrastructure is required. Here, it is the responsibility of network nodes to forward each other's packets and thus these nodes also act as routers. In such a network resources are limited and also topology changes dynamically. So providing Quality of service(QoS) is also necessary. QoS is more important for real time applications for example Video Streaming. IEEE 802.11e network standard supports QoS through EDCA technique. This technique does not fulfill the requirements of QoS. So, in this project modified EDCA technique is proposed to enhance QoS for Video Streaming application. This technique is implemented in NS2 and compared with traditional EDCA.
11.a review of improvement in tcp congestion control using route failure det...Alexander Decker
This summary provides an overview of a document that reviews several algorithms aimed at improving TCP congestion control and addressing route failures in mobile ad hoc networks (MANETs).
The document begins with an introduction to MANETs and the issues they present for TCP, as TCP was designed for wired networks and interprets all packet losses as congestion. It then analyzes and compares five different algorithms that have been proposed to help TCP distinguish between losses due to route failures versus congestion. These algorithms aim to improve network performance metrics like throughput, packet delivery ratio, and end-to-end delay. The document concludes that while these algorithms approach the problem of route failures and TCP performance degradation in different ways, their overall goal is the
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETsIOSR Journals
This document presents a proposed multi-channel distribution scheme for mobile ad hoc networks (MANETs) and evaluates it through simulation. The proposed scheme assigns channels to nodes based on their node IDs to avoid control overhead from time synchronization. While neighboring nodes on the same channel is possible, the probability is low given random node distribution. The proposed scheme is compared to a single-channel scheme in ns-2 simulations. Results show the proposed technique has better performance.
Comparative Analysis of Different TCP Variants in Mobile Ad-Hoc Network partha pratim deb
The document analyzes the performance of different TCP variants (New Reno, Reno, Tahoe) with MANET routing protocols (AODV, DSR, TORA) through simulation. It finds that in scenarios with 3 and 5 nodes, AODV has better throughput than DSR and TORA for all TCP variants. Throughput decreases for all variants as node count increases. New Reno provides multiple packet loss recovery and is the best choice for AODV in MANETs due to its consistent performance with changes in node count. Further analysis of additional protocols and TCP variants is recommended.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Performance analysis and evaluation of IEEE 802.11 distributed coordination f...journalBEEI
This paper discusses the distributed coordination function (DCF) access mechanism which is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme. Simulation projects for different DCF performance parameters have been built using the OPNET network simulator. The projects are mainly basic service set (BSS) topology simulated under different parameter values (data rate, fragmentation, RTS/CTS, number of nodes, and load condition). Simulation results show when the DCF access mechanism is better under what load condition, and how to choose the best fragmentation threshold and other access-mechanism specific parameters according to the network conditions. Simulation results were validated against a theoretically calculated maximum throughput (the simulation maximum throughput was about 70% of the theoretically calculated maximum throughput).
This document discusses several key performance metrics for wireless MAC protocols: throughput, delay, fairness, and energy efficiency. It then summarizes several MAC protocols and how they aim to improve these metrics, including MACA-BI, MARCH, and MILD algorithm in MACAW which aims to increase fairness. Power save mechanisms and power control MAC protocols are also covered as approaches to improve energy efficiency. Finally, the potential benefits of using directional antennas with MAC protocols are discussed.
This document summarizes a research paper that proposes a new routing algorithm called Quadrant-Based Directional Routing (Q-DIR) for multihop wireless networks. Q-DIR is implemented as a cross-layer with Contention Window Adaptation Mechanism (CWAM) to reduce network power consumption and increase throughput. Q-DIR limits flooding to the quadrant containing the source and destination nodes. CWAM adapts the contention window size based on node traffic to improve throughput. Simulation results show that Q-DIR with CWAM outperforms standard flooding protocols by utilizing fewer nodes and increasing throughput while reducing power consumption.
4..[26 36]signal strength based congestion control in manetAlexander Decker
This document discusses several algorithms and approaches for improving TCP performance in mobile ad hoc networks (MANETs) using signal strength measurements:
1. TCP Venoplus is a cross-layer approach that uses signal strength information from the MAC layer to better distinguish between packet losses due to congestion versus random errors.
2. Other algorithms proposed include Link-RED to tune wireless link drop probability, adaptive pacing to improve spatial reuse, and algorithms to predict link failures and find stable routes using signal strength measurements.
3. Received signal strength is also used in algorithms to minimize broadcast storms and adapt MAC layer retransmissions to distinguish true link failures from false ones caused by interference.
4. Gray zone prediction and
11.signal strength based congestion control in manetAlexander Decker
This document discusses several algorithms and approaches for improving TCP performance in mobile ad hoc networks (MANETs) using signal strength measurements:
1. TCP Venoplus is a cross-layer approach that uses signal strength information from the MAC layer to better distinguish between packet losses due to congestion versus random errors.
2. Other algorithms proposed include Link-RED and adaptive pacing to reduce the impact of wireless interference on TCP, as well as techniques to predict and avoid link failures before they occur such as gray zone prediction and multi-agent adaptive DSR.
3. Most of the algorithms aim to minimize unnecessary packet retransmissions when losses are due to non-congestion factors like mobility, thereby improving throughput
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
This document discusses multiple access protocols for sharing a communication channel between multiple stations. It covers both random access protocols like ALOHA and slotted ALOHA, and controlled access protocols like polling, token passing, and reservation. It also discusses channelization protocols for sharing bandwidth, including Frequency-Division Multiple Access (FDMA), Time-Division Multiple Access (TDMA), and Code-Division Multiple Access (CDMA). FDMA divides the channel into frequency bands, TDMA divides it into time slots, and CDMA allows all stations to transmit simultaneously using unique coding. The document provides detailed explanations, examples, diagrams and equations for each protocol.
A New MultiChannel MAC Protocol With On-Demand Channel Assignment For Multi-H...Wendy Hager
The document presents a multi-channel MAC protocol called SM that uses static channel assignment. Each mobile host is assigned a single channel and uses that channel for all transmissions following the IEEE 802.11 standard. However, several issues are identified when directly applying a single-channel protocol to a multi-channel system, including missing control packets, exposed terminals, and channel deadlocks. To address these issues, the document proposes a new dynamic multi-channel MAC protocol called DCA that flexibly assigns channels based on demand and requires only two transceivers per host.
This document describes a proposed system called Enhanced Adaptive Acknowledgement (EAACK) for detecting misbehaving nodes in mobile ad hoc networks (MANETs). The system uses three components - ACK, Secure ACK, and Misbehavior Report Analysis. ACK provides end-to-end acknowledgment, S-ACK provides acknowledgment between three consecutive nodes, and MRA confirms any misbehavior reports. Digital signatures are also used to validate acknowledgments. The system is simulated using the NS-2 network simulator and results show it can effectively detect misbehaving nodes while maintaining good network performance.
Effect of Interleaved FEC Code on Wavelet Based MC-CDMA System with Alamouti ...IJCSEIT Journal
In this paper, the impact of Forward Error Correction (FEC) code namely Trellis code with interleaver on
the performance of wavelet based MC-CDMA wireless communication system with the implementation of
Alamouti antenna diversity scheme has been investigated in terms of Bit Error Rate (BER) as a function of
Signal-to-Noise Ratio (SNR) per bit. Simulation of the system under proposed study has been done in M-ary
modulation schemes (MPSK, MQAM and DPSK) over AWGN and Rayleigh fading channel incorporating
Walsh Hadamard code as orthogonal spreading code to discriminate the message signal for individual
user. It is observed via computer simulation that the performance of the interleaved coded based proposed
system outperforms than that of the uncoded system in all modulation schemes over Rayleigh fading
channel.
The document discusses Time Division Multiple Access (TDMA) in clustered wireless networks. It proposes a solution to optimize TDMA scheduling that can achieve high power efficiency, zero conflict, and reduced end-to-end delay. A cross-layer optimization model is developed to minimize energy consumption and derive optimal flows on each link. Then an algorithm is presented to obtain TDMA schedules with the minimum frame length based on the optimal flows, guaranteeing minimum delay. Numerical results show the proposed approach significantly reduces energy consumption and delay compared to existing solutions.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
DYNAMIC CURATIVE MECHANISM FOR GEOGRAPHIC ROUTING IN WIRELESS MULTIMEDIA SENS...csandit
Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability
The document summarizes MAC protocols for wireless mesh networks. It begins with an introduction to wireless mesh network architectures and important definitions. It then discusses single channel MAC protocols like S-MAC, T-MAC, and a new TDMA-based protocol. It also covers multi-channel MAC protocols classifications and examples like CC-MMAC and SSCH MAC. The document provides detailed explanations of the mechanisms and concepts behind various single and multi-channel MAC protocols.
The document summarizes key concepts about the transport layer. It discusses the services provided by the transport layer, including reliable data transmission and quality of service guarantees. It describes two common transport protocols - UDP and TCP. Elements of transport protocols like addressing, connection establishment using three-way handshake, connection release, error control, flow control, and multiplexing/demultiplexing are explained. The document provides details on transport layer primitives and sockets interface used for programming.
This document provides an overview of congestion control and quality of service techniques. It begins by defining data traffic and different traffic profiles. It then discusses congestion, including what causes it and different congestion control approaches like open-loop prevention and closed-loop removal. Two examples of congestion control are described - TCP and Frame Relay. Quality of service is then introduced and different techniques to improve it are outlined, including scheduling, traffic shaping, resource reservation, and admission control.
1. AN EFFECTIVE BACKOFF ALGORITHM FOR
COLLISION REDUCTION IN MANET
R.K. Shanmugasundaram, S. Vaidheeswaran
BTECH, B.S Abdur Rahman University,
Vandalur, Tamilnadu, (India)
Professor, Dr.N. Sabiyath Fatima, Dept of CSE, B.S Abdur Rahman University,
Vandalur, Tamilnadu, (India)
ABSTRACT
In Mobile Ad-hoc Networks (MANETS), every node performs both as transmitter and receiver. The existing
backoff models do not accurately predict the performance of the wireless network. Also, the existing models
suffer with high packet collisions. Whenever a collision occurs, the contention window (CW) of the station is
doubled until it reaches the maximum value. The main objective of this project is to reduce collision using
contention window Multiplicative Increase Decrease Backoff (CWMIDB) scheme. The purpose of increasing
CW is to reduce the collision probability by distributing the traffic into a larger time space. In wireless Ad hoc
networks, the CWMIDB algorithm dynamically controls the contention window of the nodes experiencing
collisions. During packet transmission, the backoff counter is uniformly selected from the given range of [0,
CW-1]. Here, CW is known as contention window and its value depends on the number of failed transmissions
for the packet. At the first transmission attempt, CW is set to minimum value (Cmin), if transmission attempt fails
then its value gets doubled, and again set to minimum value on successful transmission. CWMIDB is simulated
in NS2 environment and its performance is compared with Binary Exponential Backoff Algorithm. The
simulation results shows improvement in transmission probability compared to that of the existing backoff
algorithm.
Keywords— backoff, MANET, contention window,CWMIDB.
I. INTRODUCTİON
Mobile Ad Network (MANET) is an infrastructure-less dynamic network without fixed routers. All nodes are
capable of moving and can be connected dynamically. The responsibilities for organizing and controlling the
network are distributed among the terminals themselves. The entire network is mobile, in this type of network,
some pairs of terminals may not be able to communicate directly with each other and relaying of some messages
is required so that they are delivered to their destinations. The main drawback of MANET is energy
conservation. Energy consumption increases due to packet loss. This packet loss occurs due to collision between
the nodes during transmission of data. For wireless networks, the devices operating on battery try to pursue the
energy efficiently by reducing the energy they consume, while data transmission. The features of MANET
introduce several challenges. These include, collision due to transmission errors. This system breaks down when
two computers attempt to transmit at the same time. This is a case of collision. To avoid collision, carrier
sensing mechanism is used. Here each computer listens to the network before attempting to transmit. If the
network is busy, it waits until network quiets down. In carrier detection, computers continue to listen to the
network as they transmit. If computer detects another signal that interferes with the signal it is sending, it stops
2. transmitting. Both computers then wait for random amount of time and attempt to transmit. A collision can be
detected by listening to the shared medium immediately after transmitting and identifying collision
characteristics; or by capturing data from the medium and performing error detection.An alternative method to
handle collisions in a contention based system is to attempt to avoid them. Some systems may utilize a strict
scheduling guideline to identify who may use which resources another system may have the senders listen to the
channel immediately prior to transmitting and determine suitable times to transmit. The purpose of using
CWMIDB algorithm in IEEE 802.11 is to minimize collisions during contention between multiple nodes and
also in the presence of hidden nodes. This is a very simple backoff algorithm in which the size of the contention
window increases and decreases rather than increasing exponentially. The basic operation of the MAC protocol
is by successive Frame Exchange Sequences (FES) RTS-CTS-DATA-ACK as in 802.11 DCF. Each transmitter
before attempting to transmit must find the carrier to be idle for a time period of Distributed Inter-Frame
Spacing (DIFS) seconds. After deferring for the DIFS period the station selects a back off value for an
additional deferral time before transmitting. This back off period corresponds to an integer number of time slots
of the protocol and is selected based on Contention Window Multiplicative Increase Decrease Backoff
Algorithm. When some other transmission is detected the back off procedure pauses and starts over when the
medium is found to be idle for one DIFS period. If collision occurs, then the stations that were involved have to
restart the access procedure with DIFS period and new back off value.
II. AN EFFECTIVE BACKOFF ALGORITHM FOR COLLISION REDUCTION IN
MANET
The major problem in MANET is degradation in throughput because of node mobility, unreliable medium,
interference and route failure. The degradation in throughput is because MANET is unable to distinguish packet
loss. The packet loss occurs due to hidden node and congestion. This problem can be solved by using certain
backoff scheme. The backoff algorithm is a part of Media Access Control (MAC) protocol which is used to
avoid collision in Mobile Ad hoc Network (MANET). When the nodes in the network try to access the channel,
one of these nodes gains access the channel while the other nodes still contend for a time period. Collision
occurs in mobile ad-hoc networks when the node chooses the same value for data transmission. In Figure 3.1, A
and B are two nodes. During the transmission of data between these two nodes, collision occurs. After receiving
the collision signal, transmission is stopped from A and B. They will try to retransmit, since there is no
restriction.
Figure 2.1 Collision Problem
3. To overcome from the problem of collision, a new Contention Window Multiplicative Increase Decrease
Backoff scheme is proposed. CWMIDB provides minimum transmission delay and maximum throughput by
improving collision. This collision can be improved by certain mechanism. In the existing Binary Exponential
Backoff algorithm, for each packet transmission, the backoff time is uniformly chosen in the range (0, W-1)
where W is the initial contention window size. When the packet transmission is not successful the node
increases the contention window size, so the node has to sense the channel for long period of time. Due to this
throughput of the wireless network decreases automatically. The average delay required for the packet delivery
increases.
Figure 2.2 Backoff Concept
The Contention Window Multiplicative Increase Decrease Backoff Algorithm (CWMIDB) consist of three
phases, they are Identification of channel idleness, Setting up Backoff Counter, Performance comparison
of CWMIDB & Binary Exponential Backoff Algorithm. The steps for Contention Window
Multiplicative Increase Decrease Backoff Algorithm is implemented as follows,
CW = min [4*CW, CWmax] --------- (2.1)
The equation 2.2 describes that size of the contention window increase by four times during collision
CW = CWmin ------------------ (2.2)
The equation 2.2 describes that size of the contention window decrease during successful transmission
The CWMIDB algorithm steps are discussed
Step 1: Initially source node sends data when channel is in idle state until the destination is reached. The data
transmission process consists of two states namely idle and non-idle state.
Step 2: In Figure 2.3 S,A,B,D are nodes where S is source node and D is destination node, This node check for
idleness, if channel is in idle state, then it transfers the data to destination. If channel is not idle then it
waits for random backoff time.
Figure 2.3 A Scenario of Collision Detection
4. Step 3: When random backoff time value reaches zero it will transmit packet again to the destination.
Step 4: If the frame is correctly received, the receiving node sends an acknowledgment (ACK) frame to sender.
If ACK is not received, the size of the contention window size increases and retransmit packet again to
the destination.
Step 4.1: During successful transmission, the size of the contention window decreases to minimum.
Step 4.2: During the second transmission attempt, the size of contention window increases exponentially by CW
= CW x 4.
Step 5: During third transmission attempt, the size of the contention window decreases by CW = current value
of CW / 2
Step 6: If acknowledgement is received, go to step1.
Step 7: Stop
III Pseudocode for CWMIDB algorithm during successful transmission
Step 1: Set BackOff Timer to initial value
Step 2: While BackOff Timer ≠ 0 do
For each Time Slot
If channel is idle then BackOff Timer = BackOff Timer – 1
If channel is idle for more than DIFS then
Send
If (Send Failure) then
If (NumberOfBackoffs<=W) then
CW= CW * K
Else if (NumberOfBackoffs>=W)
CW= CW / K
BackOffTimer = Random x; 1 ≤ x ≤ CW -1
Else
CW = CW - 1
BackOffTimer = 0
Go to Step 1
Step 3: Stop
[Where
DIFS – Distributed Inter-Frame Spacing
CW-Contention Window]
/* Channel idleness process*/
When idle
MinCW=32;
MaxCW=256;
Backoff range = [0,CW];
/*During Successful Transmission*/
MinCW=32;
MaxCW=256, 1024;
Backoff range = [0,CW];
5. if (success) node's CW = MinCW;
node's BC = randomly select (0, MinCW);
end if
/*During Packet Collision*/
MinCW=32;
MaxCW=256, 1024;
Backoff range = [0,CW];
if (collision),
node's CW =
min(4*currentCW, MaxCW);
node's BC = randomly
select (0, newCW);
end
3.1 Channel Idleness phase
In channel idleness phase every node must sense the medium, in order to check the state of the channel (idle or
busy). If a node has data to send, but it sees that the channel is busy, then it waits for the end of transmission. At
the end of transmission, it must wait for a DIFS. The back off time counter continuously gets decremented until
the channel is sensed in an “Idle” state. It goes in “Frozen” State when a transmission is detected on the channel
and it goes to the reactivated state when the channel is sensed idle again for more than a DFIS. As soon as the
back-off time reaches zero the station starts the transmission. If two or more wireless nodes finish their
countdowns at the same time-slot, there occurs a collision between RTS (ready to send) packets if the
CSMA/CA (carrier sense multiple access with collision avoidance) is implemented, otherwise two data packets
collide with each other. If there is a collision, every node which participated in the collision multiplies its
contention window by the multiplicative factor m.
Figure 3.1 IDLE Procedure Finite State Representation
In Figure 3.1, the contention period can be determined by the CWMIDB algorithm. It increments the
appropriate retry counter associated with the frame. The CWMID Backoff mechanism chooses a random
number which represents the amount of time must elapse while there are not any transmissions, i.e., the medium
is idle before the listening station may attempt to begin its transmission again. The random number resulting
from this algorithm is uniformly distributed in a range, called the contention window, the size of which
increases with every attempt to transmit that is deferred, until a maximum size is reached for the range. Once a
transmission is successfully completed, the range is reduced to its minimum value for the Next transmission.
6. 3.2 Backoff Counter Phase
In backoff counter phase, it attempts to double the contention window size during collision .Set the backoff counter
(BOC) between 0 and CWlow. Decrement the BOC by 1 if the channel is idle. If BOC reaches zero, transmit the data
frame. If acknowledgment is received then, transmit the next data frame. If the acknowledgement is not received
select the BOC between 0 and CW in the next backoff stage as
For second transmission attempt, CW = CW x 4. For third transmission attempt, CW = current value of CW / 2. For
fourth transmission attempt, CW = current value of CW X 4. For fifth transmission attempt, CW = current value of
CW / 2 and so on. If contention window is high, it will select the BOC between 0 and CW in the current backoff
stage.
Figure 3.2 BACKOFF Procedure Finite State Representation.
The Figure 3.2 depicts the backoff procedure for finite state representation.To prevent all nodes sensing the
channel from beginning of the transmission at the same time, each node chooses a random waiting time called
Backoff before starting transmission. The range from which the Backoff value is chosen is called the Contention
Window (CW). If the channel becomes busy during Backoff, Backoff counter decrementing is stopped until the
channel becomes idle again. For example, let us assume that the current backoff stage is ‘i’ with contention
windowCW( i ) = 4i * CWmin , and there is a successful transmission, the next backoff stage will be stage 0
with contention window CW( 0 ) = 31 according to the specification. But if the number of competing nodes is
large enough (>>31), the new collision will likely occur at the backoff stage 0. The main argument is that since
the current backoff stage is ‘i’ some collision must have occurred recently at the previous stage. Now if the
number of current competing nodes is larger than or close to CW( i ), and if the backoff stage is set to 0, there is
a high probability that new Collision will happen. So resetting the contention window after every successful
transmission is an inefficient approach if the number of nodes is large.
3.3 PERFORMANCE COMPARISON OF CWMIDB AND BEB
Here in this project performance comparison is done with CWMIDB and Binary Exponential Backoff (BEB) .
This performance comparison is done by taking into the account the performance metrics like packet delivery
ratio (PDR), Energy, Throughput. While making comparison CWMIDB is proven to be highly energy
conservation and efficient one than other.
7. The characteristics of NS2 parameter like throughput, packet information, etc can be plotted using trace graph.
The following Table 7.2 illustrates the comparison of various performance metrices like Packet Delivery Ratio
(PDR), Energy and throughput. These metrices are calculated by taking in to the account the number of sending
packets, number of receiving packets at destination and considerably the number of routing packets which is
generated in the trace file. The packet delivery ratio (PDR) of CWMIDB gradually increases from 10.28 percent
to 91.92 percent. The PDR ratio is high because CWMIDB send the packets by increasing and decreasing the
contention window size. CWMIDB initially increases and then decreases. The simulation analysis of CWMIDB
algorithm is obtained by considering the following performance metrics like, Packet delivery ratio and
Throughput
IV Packet Delivery Ratio (PDR)
Packet Delivery Ratio (PDR) is the ratio between the number of packets transmitted by a traffic source and the
number of packets received by a traffic sink. It measures the loss rate as seen by transport protocols and as such,
it characterizes both the correctness and efficiency of ad hoc routing protocols. In CWMIDB the packet
Delivery Ratio is high as 97.94%.
PDR is defined as the total amount of packets received by the receiver and amount of data packet sent by
source. The formula to calculate the packet delivery ratio is defined as follows,
PDR=[ ]* 100
Then by taking into the account number of sending packets, receiving packets and routing packets the graph is
plotted. Here, the packet delivery ratio gradually increases with time in CWMIDB. Here, the PDR of CWMIDB
is 97.94%.The Figure 4.1 shows the packet delivery ratio between CWMIDB and BEB.
Figure 4.1 Packet delivery ratio between CWMIDB and BEB
V Throughput analysis
It is the ratio of the total amount of data that reaches a receiver from a sender to the time it takes for the
receiver to get the last packet. When comparing the routing throughput by each of the node, AODV has the high
throughput. It measures of effectiveness of a routing protocol. The throughput value of CWMIDB algorithm is
high when compared to BEB. Here, the throughput ratio increases with increase in number of packets received.
8. Figure 4.2 Throughput comparison between CWMIDB and BEB
The Figure 7.2 shows the throughput comparison between CWMIDB and BEB. It shows that
CWMIDB has high throughput than BEB. The throughput percentage of CWMIDB is 97.14%
VI CONCLUSION AND FUTURE WORK
In this project, Contention Window based Multiplicative Increase Decrease backoff (CWMIDB) algorithm for
IEEE 802.11 based wireless networks is proposed. The main feature of this algorithm is to avoid channel
capture and to decrease the number of collisions. In this algorithm, the size of the contention window will not be
doubled immediately following a collision. Rather it increases by four times for first collision and decreases by
half for second collision and so on. The performance of the CWMIDB algorithm is very efficient especially
when basic access mechanism is employed under high congested environments as well as in Ad hoc networks.
The simulation result and analysis shows that Contention Window Multiplicative Increase Decrease Backoff
algorithm has higher efficiency with high packet delivery ratio and throughput than the Binary Exponential
Backoff algorithm.
CWMIDB can be extended further by taking into account the data transmission among number of nodes. If
number of node increases there is a slight deflection in the performance. The future work concentrates on the
reduction of collision by increasing the number of nodes. Integration of modified BEB and CWMIDB may
produce high throughput which may help in increasing the efficiency of CWMIDB.
REFERENCES
[1] Tatineni Madhavi, Gottapu SasiBhushanaRao, Development of Collision Alleviating DCF Protocol with
Efficient Backoff Algorithm for Wireless Ad hoc Networks. November 2014, 80:1791–1814.1.
[2] Sasi BhushanaRao, G., &Madhavi, T, Performance analysis of collision alleviating distributed coordination
function protocol in congested wireless networks - a Markov chain analysis, IET Networks, 2013, 2(4), 204–
213.
[3] Ibrahim Sayed Ahmad., Modified Binary Exponential Backoff Algorithm to Minimize Mobiles
Communication Time”, I.J. Information Technology and Computer Science, 2014, 20-29,.
[4] Xiangyu, P., Letian, J.,&Guozhi,X. Performance analysis of hybrid backoff algorithm of wireless
LAN.InProceedings of 5th international conference on WiCom, 2007, pp. 1853–1856.
[5] Sartthong, J., &Sittichivapak, S. Backoff algorithm optimization for IEEE802.11 wireless local area
networks. In Proceedings of ECTI-CON, 2012, pp. 1–4.
[6] Fan, J., Gao, F.,Wang,W. S., & Dong, G. F. Performance analysis of an adaptive backoff scheme for ad hoc
networks. In Proceedings of IEEE international conference on CIT, 2008, pp. 624–629.
[7] Albalt, M.,&Nasir, Q. Adaptive backoff algorithm for IEEE 802.11MAC protocol.International Journal of
Communications, Network and System Sciences, 2009, 2(4), 300–317.
9. [8] Babich, F.,&Comisso, M. Throughput and delay analysis of 802.11-based wireless networks using smart and
directional antennas. IEEE Transactions on Communications, 57(5), 2009, 1413–1423.
[9] Zhalehpoor, S., &ShahriarShahhoseini, H. SBA backoff algorithm to enhance the quality of service in
MANETs. In Proceedings of international conference on signal acquisition and processing, 2009, pp. 43–47.
[10] Chatzimisios, P., Boucouvalas, A., & Vitsas, V. Performance analysis of IEEE 802.11 DCF in presence of
transmission errors. In Proceedings of IEEE international conference on communications (7), 2004, pp. 3854–
3858.
[11] Fan, J., Gao, F.,Wang,W. S., & Dong, G. F. Performance analysis of an adaptive backoff scheme for ad hoc
networks. In Proceedings of IEEE international conference on CIT, 2008, pp. 624–629.
[12] Peng Xiangyu, Hybrid Backoff Algorithm based on DCF protocol. IEEE international conference on 2007,
1-4244-1312-5.
10. [8] Babich, F.,&Comisso, M. Throughput and delay analysis of 802.11-based wireless networks using smart and
directional antennas. IEEE Transactions on Communications, 57(5), 2009, 1413–1423.
[9] Zhalehpoor, S., &ShahriarShahhoseini, H. SBA backoff algorithm to enhance the quality of service in
MANETs. In Proceedings of international conference on signal acquisition and processing, 2009, pp. 43–47.
[10] Chatzimisios, P., Boucouvalas, A., & Vitsas, V. Performance analysis of IEEE 802.11 DCF in presence of
transmission errors. In Proceedings of IEEE international conference on communications (7), 2004, pp. 3854–
3858.
[11] Fan, J., Gao, F.,Wang,W. S., & Dong, G. F. Performance analysis of an adaptive backoff scheme for ad hoc
networks. In Proceedings of IEEE international conference on CIT, 2008, pp. 624–629.
[12] Peng Xiangyu, Hybrid Backoff Algorithm based on DCF protocol. IEEE international conference on 2007,
1-4244-1312-5.