Abstract

In wireless ad hoc networks, nodes cooperatively form a network without any infrastructure such as a BS/AP (base station or access point). The widely-used contention-based MAC protocol, IEEE 802.11b, is inefficient in multi-hop networks due to the hidden and exposed terminal problems. The most popular schedule-based MAC protocol, TDMA (time division multiple access), is difficult to implement in an ad hoc network due to the lack of infrastructure. The contribution of this paper is to provide the community novel and efficient MAC (medium access control) protocols (i.e., a collision resolution protocol) for a wireless ad hoc network without a centralized infrastructure. We propose two new MAC protocols (one distributed algorithm and one cluster-based algorithm) that use a collision resolution scheme for a network with a single BS/AP. We first compare the performance of our distributed algorithm with our cluster-based algorithm. Then, we compare our algorithm that performs better (i.e., our cluster-based algorithm) to TDMA in a two-hop network. The simulation results illustrate that our cluster-based algorithm provides higher throughput and lower delay than TDMA in a two-hop network.

Highlights

  • A wireless ad hoc network is a network of wireless devices, such as laptops and PDAs

  • We are not able to compare our cluster-based algorithm with TDMA in a network with more than two hops, we do evaluate the performance of our clusterbased algorithm in a three-hop network

  • All clusters have the same size and each cluster has T seconds to transmit in each round; that is, T is the size of one time frame

Read more

Summary

Introduction

A wireless ad hoc network is a network of wireless devices, such as laptops and PDAs (personal digital assistants). A good MAC protocol is critical in a wireless ad hoc network to ensure collision free transmissions. Since each time slot is allocated to one node, the transmission is collision free. Traditional MAC protocols focus on how to avoid collisions in the network. We propose two new approaches that incorporate a collision resolution scheme (ALLIANCES) [1]. The advantages of ALLIANCES are: 1) the reuse of collided packets saves time and energy and 2) no slot assignment scheduling is needed. During each of the K 1 subsequent time slots, the BS/AP selects neighboring nodes in the network (i.e., relay nodes) to retransmit the collided packets. We propose a novel MAC protocol (i.e., a collision resolution protocol) for a wireless network with no centralized BS/AP.

Idea 1: A Distributed Algorithm
Collision Resolution Mode
Relay Node Selection
Pseudocode of Our Distributed Algorithm
Idea 2: A Cluster-Based Algorithm
Cluster Formation and Numbering
Cluster Head Selection
Variable Transmission Ranges
Pseudocode of Our Cluster-Based Algorithm
Simulation Configuration
Performance Evaluation
Comparison of Our Distributed Algorithm and Cluster-Based Algorithms
Comparison of Our Cluster-Based Algorithm and TDMA in a Two-Hop Network
Results of Our Cluster-Based Algorithm in a Three-Hop Network
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.