Abstract

Physical resource allocation strategy is a key factor affecting the performance of a mobile ad hoc network (MANET), which serves as a network model widely used in the sensor and detection field. For various perceived service information, it is significant for the allocation strategy to adapt to the dynamic service requirements and prioritize resource access for the service information with high priority to guarantee its real-time performance. In this paper, a novel dynamic time division multiple access (TDMA) scheduling strategy is proposed for MANETs. Firstly, a service priority-based dynamic TDMA scheduling (SP-DS) algorithm is presented, which introduces the service priority as a reference factor for slot allocation and fully considers the transmission throughput and end-to-end delay performance. Moreover, for improving the slot use of the whole system, a modified distributed color constraint heuristic (MD-CCH) scheme is presented to optimize the frame structure. The SP-DS and MD-CCH algorithms are combined to form the novel strategy. Simulation results have demonstrated that the proposed strategy has better performance in the slot use, slot allocation efficiency, end-to-end delay and transmission throughput compared with the existing slot allocation algorithms.

Highlights

  • In contrast to the traditional cellular networks (GSM, LTE-A, 5th-Generation, etc.) [3], it has the characteristics of decentralization, infrastructure-less, self-organization, flexible networking and dynamic topology [4,5], which have made it be recognized as a promising network model that is widely used in the sensor and detection field [1,6,7], such as Internet of Things (IoT) [8], wireless sensor network (WSN) [9], unmanned aerial vehicle (UAV) swarm detection network [10]

  • For the proposed dynamic time division multiple access (TDMA) scheduling strategy, firstly, its validity in prioritized service information transmission is evaluated. It is assessed by comparing with the existing distributed randomized (DRAND), EB-ET-DRAND, and DSA-color constraint heuristic (CCH) algorithms from the aspects of slot use, slot allocation efficiency, end-to-end delay and throughput

  • The packet size in each service flow is set to 256 bytes and 1000 packets are sent per second

Read more

Summary

Background and Motivation

The mobile ad hoc network (MANET) is a typical wireless distributed network, which is adapted to the requirements of communication and networking in the high dynamic and large spatial scale scenarios [1,2]. Each node selects the time slot according to its local (two-hop range) environment information and generates an allocation strategy in a distributed manner, which has good scalability and flexibility so that can adapt to the dynamic service requirements of different nodes [23,24]. These characteristics make the dynamic distributed TDMA scheme show better applicability than the static distributed. Researchers have recognized the dynamic distributed TDMA scheme as the future development trend and proposed various related algorithms

Related Work
Innovations and Contributions
The Service Priority Based Dynamic TDMA Scheduling Algorithm
The Service Priority Based Distributed Broadcast Mechanism
The Mathematical Expectation of Reservation Rounds
The Binary Tree Model Based Adaptive Slot Allocation Mechanism
The Model of Graph Vertex Coloring
The Modified Distributed Color Constraint Heuristic Algorithm
Experiment and Performance Evaluation
Experiment Settings
Experiment Results and Performance
Number of Colors
Running Time and Number of Reservation Rounds
End-to-end Delay and Throughput
Conclusions
Full Text
Published version (Free)

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