Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Optimization of wireless resources for personal communications mobility tracking
IEEE/ACM Transactions on Networking (TON)
Mobile users: to update or not to update?
Wireless Networks
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Scalable routing protocol for ad hoc networks
Wireless Networks
Source-Tree Routing in Wireless Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Position-based routing in ad hoc networks
IEEE Communications Magazine
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
An adaptive distance-based location update algorithm for next-generation PCS networks
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This paper presents two new route update strategies for performing proactive route discovery in mobile ad hoc networks (MANETs). The first strategy is referred to as minimum displacement update routing (MDUR). In this strategy, the rate at which route updates are sent into the network is controlled by how often a node changes its location by a required distance. The second strategy is called minimum topology change update (MTCU). In this strategy, the route updating rate is proportional to the level of topology change each node experiences. We implemented MDUR and MTCU on top of the fisheye state routing (FSR) protocol and investigated their performance by simulation. The simulations were performed in a number of different scenarios, with varied network mobility, density, traffic, and boundry. Our result indicate that both MDUR and MTCU produce significantly lower levels of control overhead than FSR and achieve higher levels of throughput as the dencity and the level of traffic in the network are increased.