Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
The Ad Hoc on-demand distance-vector protocol
Ad hoc networking
ZRP: a hybrid framework for routing in Ad Hoc networks
Ad hoc networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Implicit source routes for on-demand ad hoc network routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
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
Conserving Transmission Power in Wireless Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Efficient DSR route request flooding with directional antennas
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reduce redundant broadcasting in MANETs using rough sets
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
Flooding technique is often used for route discovery in on-demand routing protocols in mobile ad hoc networks (MANETs) such as Dynamic Source Routing (DSR) and Ad hoc On-demand Distance Vector (AODV) routing. In this paper we present a Positional Attribute based Next-hop Determination Approach (PANDA) to improve the performance of flooding-based route discovery in MANETs using positional attributes of the nodes. These attributes may be geographical, power-aware, or based on any other quality of service (QoS) measure. We identify the "next-hop racing" phenomena due to the random rebroadcast delay (RRD) approach during the route discovery process in DSR and AODV, and show how the PANDA approach can resolve this problem. We assume that each node knows its positional attributes, and an intermediate node can learn the positional attributes of its previous-hop node via the received route-request message. Based on the attributes such as the relative distance, estimated link lifetime, transmission power consumption, residual battery capacity, an intermediate node will identify itself as good or bad candidate for the next-hop node and use different rebroadcast delay accordingly. By allowing good candidates to always go first, our approach will lead to the discovery of better end-to-end routes in terms of the desired quality of service metrics. Through simulations we evaluate the performance of PANDA using path optimality, end-to-end delay, delivery ratio, transmission power consumption, and network lifetime. Simulation results show that PANDA can: (a) improve path optimality, and end-to-end delay, (b) help find data paths with only 15%-40% energy consumption compared to the RRD approach at a moderate cost of increased routing messages, (c) balance individual node's battery power utilization and hence prolong the entire network's lifetime.