Abstract
Wireless routing protocols in MANET are all flat routing protocols and are thus not suitable for large scale or very dense networks because of bandwidth and processing overheads they generate. A common solution to this scalability problem is to gather terminals into clusters and then to apply a hierarchical routing, which means, in most of the literature, using a proactive routing protocol inside the clusters and a reactive one between the clusters. We previously introduced a cluster organization to allow a hierarchical routing and scalability, which have shown very good properties. Nevertheless, it provides a constant number of clusters when the intensity of nodes increases. Therefore we apply a reactive routing protocol inside the clusters and a proactive routing protocol between the clusters. In this way, each cluster has O(1) routes to maintain toward other ones. When applying such a routing policy, a node u also needs to locate its correspondent v in order to pro-actively route toward the cluster owning v. In this paper, we describe our localization scheme based on Distributed Hashed Tables and Interval Routing which takes advantage of the underlying clustering structure. It only requires O(1) memory space size on each node.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amis, A., Prakash, R., Vuong, T., Huynh, D.: Max-Min d-cluster formation in wireless ad hoc networks. In: INFOCOM, Tel-Aviv, Israel (2000)
Araujo, F., Rodrigues, L., Kaiser, J., Changling, L., Mitidieri, C.: CHR: A Distributed Hash Table for Wireless Ad Hoc Networks. In: DEBS 2005, Columbus, USA (2005)
Blazevic, L., Giordano, S., Le Boudec, J.-Y.: Self-organized Terminode routing. Journal of Cluster Computing 5(2) (April 2002)
Chen, B., Morris, R.: L+: Scalable landmark routing and address lookup for multi-hop wireless networks. Mit lcs technical report 837 (March 2002)
Chen, G., Garcia, F., Solano, J., Stojmenovic, I.: Connectivity-based k-hop clustering in wireless networks. In: HICSS 2002, Hawaii, USA (2002)
Chen, Y.P., Liestman, A.L., Liu, J.: Clustering algorithms for ad hoc wireless networks. Ad Hoc and Sensor Networks (2004)
Fernandess, Y., Malkhi, D.: k-clustering in wireless ad hoc networks. In: POMC 2002, Toulouse, France (2002)
Fraigniaud, P., Gauron, P.: An overview of the content-addressable network D2B. In: PODC 2003 (July 2003)
Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.K.: A cluster based approach for routing in dynamic networks. In: ACM SIGCOMM, pp. 49–65 (April 1997)
Li, J., Morris, R., Jannotti, J., Decouto, D.S., Karger, D.R.: A scalable location service for geographic ad hoc routing. In: Mobicom 2000, pp. 120–130 (2000)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal of Selected Areas in Communications 15(7), 1265–1275 (1997)
Maziéres, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: IPTPS 2002, MIT Faculty Club, Cambridge (2002)
Mitton, N., Busson, A., Fleury, E.: Self-organization in large scale ad hoc networks. In: MED-HOC-NET 2004, Bodrum, Turkey (2004)
Mitton, N., Fleury, E.: Distributed node location in clustered multi-hop wireless networks. Technical Repor. In: proceed, INRIA (2005)
Mitton, N., Fleury, E.: Efficient broadcasting in self-organizing multi-hop wireless network. In: Ad Hoc Now 2005, Cancun, Mexico (2005)
Mitton, N., Fleury, E., Gurin-Lassous, I., Tixeuil, S.: Self-stabilization in self-organized multihop wireless networks. In: WWAN 2005, Columbus, USA (2005)
Ng, E.T., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: INFOCOM, New-York, USA (2002)
Niculescu, D., Nath, B.: Ad hoc positioning system (APS). In: GLOBECOM 2001 (2001)
Nikaein, N., Labiod, H., Bonnet, C.: DDR-distributed dynamic routing algorithm for mobile ad hoc networks. In: MobiHoc, Boston, USA (2000)
Perkins, C.: Ad hoc networking. Addison-Wesley, Reading (2001)
Riedi, R., Druschel, P., Hu, Y.C., Johnson, D.B., Baraniuk, R.: SAFARI: A self-organizing hierarchical architecture for scalable ad hoc networking. Technical Report TR04-433, Rice University (February 2005)
Santivanez, C., McDonald, B., Stavrakakis, I., Ramanathan, R.R.: On the scalability of ad hoc routing protocols. In: INFOCOM, New-York, USA (2002)
Santoro, N., Khatib, R.: Labeling and implicit routing in networks. The computer Journal 28, 5–8 (1985)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: SIGCOMM 2001 (2001)
Van Leeuven, J., Tan, R.: Interval routing. The computer Journal 30, 298–307 (1987)
Viana, A.C., de Dias Armorim, M., Fdida, S., de Ferreira Rezende, J.: Self-organization in spontaneous networks: the approach of DHT-based routing protocols. Ad Hoc Networks Journal (2005)
Wu, J., Lou, W.: Forward node set based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3(2), 141–154 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitton, N., Fleury, E. (2005). Distributed Node Location in Clustered Multi-hop Wireless Networks. In: Cho, K., Jacquet, P. (eds) Technologies for Advanced Heterogeneous Networks. AINTEC 2005. Lecture Notes in Computer Science, vol 3837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599593_9
Download citation
DOI: https://doi.org/10.1007/11599593_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30884-3
Online ISBN: 978-3-540-32292-4
eBook Packages: Computer ScienceComputer Science (R0)