GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
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
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
ACM SIGMOBILE Mobile Computing and Communications Review
A near-optimal broadcast technique for vehicular networks
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Adaptive weighted clustering for large scale mobile ad hoc networking systems
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Consistency-Based on-line localization in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
This paper proposes a location service to assist location-based routing protocols, realized through a novel Associativity-Based clustering protocol. The main goal of our scheme, which employs hierarchical principles, is to minimize the control traffic associated with location-management. In location-based routing protocols, the control traffic is mainly due to location-updates, queries and responses. Our scheme employs a novel geographically-oriented clustering scheme in order to minimize control traffic without impairing performance. In our location management scheme, nodes are assigned home-zones, and are required to send their location-updates to their respective home-zones through a dominating-set. This strategy, unlike similar location-management approaches, minimizes inevitable superfluous flooding by every node, and prevents location updates and queries from traversing the entire network unnecessarily, hence conserving bandwidth and transmission power. The proposed scheme is evaluated through mathematical analysis and simulations, and the results indicate that our protocol scales well with increasing node-count, node-density and node-speed.