Abstract
We propose a location-service to assist location-based routing protocols, realized through our 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. We evaluate our proposed scheme through simulations, and the results indicate that our protocol scales well with increasing node-count.
Chapter PDF
Similar content being viewed by others
Key words
References
S. Sivavakeesar, and G. Pavlou, “Stable Clustering Through Mobility Prediction for Large-Scale Multihop Intelligent Ad Hoc Networks”, IEEE WCNC, Mar. 2004.
X. Hong, M. Gerlo, Y. Yi, K. Xu, and T.J. Kwon, “Scalable Ad Hoc Routing in Large, Dense Wireless Networks Using Clustering and Landmarks”, Proc. Int’l Conf. on Communications. (ICC 2002), vol. 25, no. 1, Apr. 2002, pp. 3179–3185.
S-C.M. Woo, and S. Singh, “Scalable Routing Protocol for Ad Hoc Networks”, Wireless Networks, Kluwer Academic Publishers, vol. 7, no. 5, Sep. 2001, pp. 513–529.
S.J. Philip, and C. Qiao, “ELF: Efficient Location Forwarding in Ad Hoc Networks”, Proc. Global Telecommunications Conference. (Globecom 2003), vol. 22, no. 1, Dec. 2003, pp. 913–918.
J. Li, J. Jannoti, D.S.J. De Couto, D.R. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing”, Proc. 6 th Int’l Conf. on Mobile Computing and Networking (Mobicom 2000), Aug. 2000, pp. 120–130.
J. Sucec and I. Marsic, “Location Management or Hierarchically Organised Mobile Ad hoc Networks”, Proc. IEEE WCNC 2002, March 2002, pp. 603–607.
M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks”, IEEE Network, vol. 15, no. 6, Nov./Dec. 2001, pp. 30–39.
X. Hong, K, Xu, and M. Gerla, “Scalable Routing Protocols for Mobile Ad Hoc Networks”, IEEE Network, vol. 16, no. 4, Jul./Aug. 2002, pp. 11–21.
C-K. Toh, G. Lin, and M. Delwar, “Implementation and Evaluation of an Adaptive Routing Protocol for Infrastructureless Mobile Networks”, Proc. Int’l Conf. on Computer Communications & Networks (IEEE IC3N), Las Vegas, 2000.
R. Sivakumar, P. Sinha, V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad hoc Routing Algorithm”, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, August 1999, pp 1–12.
J. Sucec, and I. Marsic, “Clustering Overhead for Hierarchical Routing in Mobile Ad Hoc Networks”, Proc. IEEE INFOCOM’2002, June 2002, pp. 1698–1706.
X. Zengu, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for Parallel Simulations of Large-scale Wireless Networks”, Proceedings of the 12th Workshop on Parallel and Distributed Simulations, May 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Sivavakeesar, S., Pavlou, G. (2005). Cluster-based Location-Services for Scalable Ad Hoc Network Routing. In: Belding-Royer, E.M., Al Agha, K., Pujolle, G. (eds) Mobile and Wireless Communication Networks. MWCN 2004. IFIP International Federation for Information Processing, vol 162. Springer, Boston, MA. https://doi.org/10.1007/0-387-23150-1_37
Download citation
DOI: https://doi.org/10.1007/0-387-23150-1_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23148-8
Online ISBN: 978-0-387-23150-1
eBook Packages: Computer ScienceComputer Science (R0)