Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
A scalable location service for geographic ad hoc routing
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
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
CarNet: a scalable ad hoc wireless network system
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Hi-index | 0.00 |
In this paper, we present a new position-based routing algorithmfor mobile wireless networks, such as ad hoc networks and sensornetworks. The proposed algorithm minimises the effect of inaccuratelocation information on routing, which is caused by periodicalupdates of node location information in the network. The algorithmachieves low communication complexity of O(√n), compared toother existing position-based algorithms with O(n) complexity,where n is the number of nodes in the network. In addition, unlikesome existing routing algorithms, the new algorithm is insensitiveto the mobility of mobile nodes and consistently performs well forvarious mobilities.