Aline C. Viana
Marcelo D. de Amorim
ABSTRACT
The need for efficient location mechanisms is an important issue in scalable self-organizing networks. Existing solutions are inherently dependent on the spatial distribution of nodes in the topology. This leads to limitations that go against the principles of self-organization. In this paper, we propose Twins, an easily-managed location service for self-organizing networks. Twins defines a logical multidimensional space that is a strict mathematical representation of the network geographic space. This representation is obtained through Hilbert space-filling curves. The geographic space is used for addressing and routing, while localization is based on the curve. Control messages are routed based on the logical structure while data packets are routed in a hop-by-hop basis with greedy next-hop choice. In this paper, we evaluate the Twins management operations in terms of fairness of space sharing and logical/geographic distances between nodes and their location servers. Our results show that Twins assures a fair distribution of control overhead and scales well with the number of nodes.
- J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," in Proceedings of ACM Mobicom, (Dallas, TX), Oct. 1998. Google Scholar
Digital Library
- B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," In Proceedings of ACM Mobicom, (Boston, MA), Aug. 2000. Google ScholarDigital Library
- B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, "Analysis of the clustering properties of the hilbert space-filling curve," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 124--141, Jan. 2001. Google ScholarDigital Library
- J. P. Hubaux, T. Gross, J. Y. L. Boudec, and M. Vetterli, "Towards self-organized mobile ad hoc networks: the terminodes project," IEEE Communications Magazine, vol. 39, no. 1, pp. 118--124, Jan. 2001. Google ScholarDigital Library
- J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proceedings of ACM Mobicom, (Boston, MA), Aug. 2000. Google ScholarDigital Library
- Y. Xue, B. Li, and K. Nahrstedt, "A scalable location management scheme in mobile ad-hoc networks," In Proceedings of IEEE Conference on Local Computer Networks (LCN), (Tampa, FL), Nov. 2001. Google ScholarDigital Library
- Z. Xu, M. Mahalingam, and M. Karlsson, "Turning heterogeneity into an advantage in overlay routing," In Proceedings of IEEE Infocom, (San Francisco, CA), Mar. 2003.Google Scholar
- A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, "Self-organization in spontaneous networks: the approach of DHT-based routing protocols," To appear in Ad Hoc Networks Journal, 2005. Google ScholarDigital Library
- J. Ridoux, A. Fladenmuller, Y. Viniotis, and K. Salamatian, "Trellis-based virtual regular addressing structures in self-organized networks," in Proceedings of IFIP Networking, (Waterloo, Canada), pp. 511--522, May 2005. Google ScholarDigital Library
- B. Chen and R. Morris, "L+: Scalable landmark routing and address lookup for multi-hop wireless networks," tech. rep., Massachusetts Institute of Technology, Cambridge, Massachusetts - MIT LCS Technical Report 837 (MIT-LCS-TR-837), Mar. 2002.Google Scholar
- J. Eriksson, M. Faloutsos, and S. Krishnamurthy, "Scalable ad hoc routing: The case for dynamic addressing," In Proceedings of IEEE Infocom, (Hong Kong), Mar. 2004.Google Scholar
- T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer, "Space-filling curves and their use in the design of geometric data structures," Theoretical Computer Science, vol. 181, no. 1, pp. 3--15, July 1997. Google ScholarDigital Library
- B. Moghaddam, K. J. Hintz, and C. V. Steward, "Space-filling curves for image compression," in Automatic Object Recognition, 1991.Google Scholar
- L. K. Platzman and J. J. B. III, "Space filling curves and the planar travelling salesman problem," Journal of the Association for Computing Machinery, vol. 36, no. 4, no. 4, pp. 719--737, 1995. Google ScholarDigital Library
- D. Hilbert, Ueber Stetige Abbildung Einer Linie auf ein Flachenstuck. Mathematische Annalenn, 38:459--460., 1891.Google ScholarCross Ref
- G. Breinholt and C. Schierz, "Algorithm 781: Generating hilbert's space-filling curve by recursion," ACM Transactions on Mathematical Software, vol. 24, no. 2, pp. 184--189, June 1998. Google ScholarDigital Library
- E. D. Kaplan, Understanding GPS: Principles and Applications. Artech House Telecommunications Library, 1996.Google Scholar
- S. Capkun, M. Hamdi, and J.-P. Hubaux, "GPS-free positioning in mobile ad hoc networks," in Proceedings of the 34th HICSS, Jan. 2001. Google ScholarDigital Library
- D. R. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web," In Proceedings of ACM Symposium on Theory of Computing, (El Paso, TX), May 1997. Google ScholarDigital Library
- T. Henderson, D. Kotz, and I. Abyzov, "The changing usage of a mature campus-wide wireless network," In Proceedings of ACM Mobicom, (Philadelphia, PA), Oct. 2004. Google ScholarDigital Library
Index Terms
- Easily-managed and topology-independent location service for self-organizing networks
Recommendations
Self-Adaptive On-Demand Geographic Routing for Mobile Ad Hoc Networks
It has been a big challenge to develop a routing protocol that can meet different application needs and optimize routing paths according to the topology changes in mobile ad hoc networks. Basing their forwarding decisions only on local topology, ...
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
As the size of mobile self-organizing networks increases, the efficiency of location services must increase as well so that addressing/routing scalability does not become an issue. In this paper, we propose a novel architecture, called Twins, tailored ...
Beacon location service: a location service for point-to-point routing in wireless sensor networks
IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networksIn this paper we present Beacon Location Service (BLS): a location service for beacon-based routing algorithms like Beacon Vector Routing (BVR) [8] and S4 [19] . The role of a location service is to map node names to topologically meaningful addresses ...
Comments