MAXM is a multi-channel MAC protocol for Ad Hoc Networks. The idea of MAXM is to maximize utilization of bandwidth by adopting a distributed self-stabilizing maximal matching-transmission algorithm. In this paper, we prove that given a fixed number, p, of packets, MAXM is able to guarantee that all packets are delivered within O(pN + pT ) time in the network of N mobile hosts, where T is the time to transmit a packet on a non-conflicting channel.
Utilization of multiple channels in ad hoc networks provides the benefits of reducing the probability of collisions, decreasing the normalized propagation delay and support of QoS. However, problems like busy waiting or deadlock existence degrade the bandwidth utilization. In this paper, we introduce two neighbor indexing schemes which assign different sequence numbers to the neighbors of every nodes to avoid the collision when communicating. Our neighbor indexing schemes are integrated into MAC protocols. The first is a basic neighborsequenced scheme, which we call static neighbor indexing scheme (SNI). SNI can be employed in the ad hoc network where the maximal number of neighbors every nodes could have is restricted to a fixed number. The second method we propose is the adaptive neighbor indexing scheme (ANI) which can reassign a new sequence number to a registered neighbor for reducing the maximal sequence number assigned to its neighbors. The proposed schemes can adequately adjust to station movements so as to support the high mobility network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.