Abstract
Communication resource allocation and collision detection are important for the Ad Hoc network. Considering the existing TDMA-MAC protocol, the allocation way based on fixed time slot is mostly adapted, which cannot guarantee the performance and be not flexible about the business for different nodes in the distributed network. Desynchronization, as a biological term, can be utilized in the Ad Hoc network. It implies that sensor nodes interleave periodic events to occur in succession through negotiation and adjustment. In this paper, we design a MAC protocol(MD-MAC) in the multi-hop network based on the idea of Desynchronization to solve the problem caused by stale information and lay down the adjustment rule to allocate the communication resource. Also, we propose a scheme which the network can detect collision in a self-adapting way. Finally, we simulate the proposed protocol to evaluate the performance. The experimental results indicate that the proposed algorithm can accelerate the convergence speed of resource allocation, solve collision and improve the efficiency of the distributed network.
Highlights
Since mobile Ad hoc network is used quite frequently, more and more things are connected into information space to intercommunicate and cooperate with each other [1,2]
In order to solve these problems in Desync-Media Access Control (MAC) protocol, we propose a distributed TDMA protocol which can be implemented in the multi-hop network, namely MD-MAC protocol which is the extension of Desync-MAC protocol
The performance of the proposed MD-Mac protocol is evaluated by extensive simulation experiments compared with the existing distributed TDMA and collision avoidance protocols in different ways, including Reins-Mac [19], Z-MAC [16], improved scheduling policy with RL-model, L-Mac [20], L-BEB [21] and so on
Summary
Since mobile Ad hoc network is used quite frequently, more and more things are connected into information space to intercommunicate and cooperate with each other [1,2]. Bryan et al [9] proposed a distributed time slot allocation protocol based on a new Graph Coloring technology called DSA-CCH It can achieve a measure of parallelism in the case of not using global information to color. The result showed that the algorithm had a certain improvement on the performance of resource scheduling These approaches introduce complicated polynomial-based algorithms and an important problem is that it exits redundant slots not to be utilized efficiently. The algorithm assumed that all nodes know global information so that each node can adjust according to its neighbors information and converge to a stable status In this protocol, the slot length occupied by every node is suitable for its demand and the allocation process is continuous.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
