A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Cost-Efficient QoS Routing Protocol for Mobile Ad Hoc Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
An on-demand, link-state, multi-path QoS routing in a wireless mobile ad-hoc network
Computer Communications
QoS routing in ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
QoS-aware routing based on bandwidth estimation for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Policy-based time slot assignment algorithm in a MANET (PBTSA)
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.24 |
The paper proposes several dynamic bandwidth allocation strategies for QoS routing on TDMA-based mobile ad hoc networks. Comprehensively, these strategies are called a distributed slots reservation protocol (DSRP). In DSRP, QoS routing only depends on one-hop neighboring information of each mobile host (MH). In addition, slot inhibited policies (SIPs) and slot decision policies (SDPs) are proposed to determine which slots are valid to use and which slots in the valid slots can be used actually, respectively. In SDPs, three heuristic policies, 3BDP, LCFP, and MRFP, are proposed to increase the success rate of a QoS route and alleviate the slot shortage problems. Moreover, a slot adjustment protocol (SAP) is proposed for a conflicting MH to coordinate the slot usage of its neighbors during the route reservation phase in order to accommodate more routes in the network. The slot adjustment algorithm (SAA) invoked in SAP is a branch-and-bound algorithm, which is an optimum algorithm in terms of the number of slots to be adjusted, on the premise that not to break down any existing route. QoS route maintenance and improvement are also provided. By the simulation results, the proposed protocol cannot only increase the success rate in search of a route with bandwidth requirement guaranteed but also raise the throughput and efficiency of the network.