This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
December 2006 (vol. 17 no. 12)
pp. 1468-1481

Abstract—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 for self-organizing networks. Twins architecture involves addressing and locating nodes in large networks, forwarding packets between them, and managing in the presence of mobility/topology changes. Twins defines a logical multidimensional space for addressing and forwarding, while location service and management operations make use of a one-dimensional space. To improve scalability and performance, forwarding is hop-by-hop with greedy next-hop choice and the location service uses a rendezvous paradigm to distribute information among nodes. In this paper, we describe the Twins architecture and present a performance evaluation to assess scalability, fairness in the overhead distribution among nodes, and routing robustness.

[1] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, Aug. 2000.
[2] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing,” Proc. ACM MobiCom, Aug. 2000.
[3] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report, SI Research Report ISI/RR-87-180, Univ. of Southern California, Los Angeles, Mar. 1987.
[4] S.-C.M. Woo and S. Singh, “Scalable Routing Protocol for Ad Hoc Networks,” ACM/Kluwer Wireless Networks, vol. 7, no. 5, pp. 513-529, Sept. 2001.
[5] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Outing,” Proc. ACM MobiHoc, June 2003.
[6] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric Ad-Hoc Routing: Of Theory and Practice,” Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC), July 2003.
[7] 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,” Proc. ACM MobiCom, pp. 85-97, Oct. 1998.
[8] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom, Aug. 1999.
[9] J.P. Hubaux, T. Gross, J.Y. Le Boudec, and M. Vetterli, “Towards Self-Organized Mobile Ad Hoc Networks: The Terminodes Project,” IEEE Comm. Magazine, vol. 39, no. 1, pp. 118-124, Jan. 2001.
[10] Y. Xue, B. Li, and K. Nahrstedt, “A Scalable Location Management Scheme in Mobile Ad-Hoc Networks,” Proc. IEEE Conf. Local Computer Networks (LCN), Nov. 2001.
[11] A.C. Viana, M.D. Amorim, S. Fdida, and J.F. Rezende, “Self-Organization in Spontaneous Networks: The Approach of DHT-Based Routing Protocols,” Ad Hoc Networks J., special issue on data comm. and topology control in ad hoc networks, vol. 3, no. 5, pp.589-606, Sept. 2005.
[12] E.D. Kaplan, Understanding Gps: Principles and Applications. Artech House Telecomm. Library, 1996.
[13] Z. Xu, M. Mahalingam, and M. Karlsson, “Turning Heterogeneity into an Advantage in Overlay Routing,” Proc. IEEE INFOCOM, Mar. 2003.
[14] 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,” Proc. ACM Symp. Theory of Computing, May 1997.
[15] 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.
[16] B. Moghaddam, K.J. Hintz, and C.V. Stewart, “Space-Filling Curves for Image Compression,” Proc. SPIE, pp. 414-421, Mar. 1991.
[17] L.K. Platzman and J.J. Bartholdi III, “Space Filling Curves and the Planar Travelling Salesman Problem,” J. ACM, vol. 36, no. 4, pp.719-737, 1995.
[18] D. Hilbert, “Ueber Stetige Abbildung Einer Linie auf ein Flachenstuck,” Math. Annalenn, vol. 38, pp. 459-460, 1891.
[19] H.V. Jagadish, “Linear Clustering of Objects with Multiple Attributes,” Proc. ACM SIGMOD, May 1990.
[20] B. Moon, H.V. Jagadish, C. Faloutsos, and J.H. Saltz, “Analysis of the Clustering Properties of the Hilbert Space-Filling Curve,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 1, pp. 124-141, Jan./Feb. 2001.
[21] C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos, “Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp.373-383, May 1997.
[22] S. Capkun, M. Hamdi, and J.-P. Hubaux, “GPS-Free Positioning in Mobile Ad Hoc Networks,” Proc. Hawaii Int'l Conf. System Sciences (HICSS), Jan. 2001.
[23] N. Patwari, A.O. Hero III, M. Perkins, N.S. Correal, and R.J. O'Dea, “Relative Location Estimation in Wireless Sensor Networks,” IEEE Trans. Signal Processing, vol. 51, no. 8, pp. 2137-2148, Aug. 2003.
[24] T.C. Hou and V.O.K. Li, “Transmission Range Control in Multihop Packet Radio Networks,” IEEE Trans. Comm., vol. 34, no. 1, pp. 228-240, Jan. 1986.
[25] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Comm., vol. 32, no. 3, pp. 246-257, Mar. 1984.
[26] Opnet Modeler Simulator, 2006, http://http://www.opnet.com/products/modeler home.html/.
[27] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom, Oct. 2004.
[28] B. Chen and R. Morris, “L+: Scalable Landmark Routing and Address Lookup for Multi-Hop Wireless Networks,” MIT LCS Technical Report 837 (MIT-LCS-TR-837), Mass. Inst. of Technology, Cambridge, Mar. 2002.
[29] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Scalable Ad Hoc Routing: The Case for Dynamic Addressing,” Proc. IEEE INFOCOM, Mar. 2004.
[30] A.C. Viana, M.D. Amorim, S. Fdida, and J.F. Rezende, “An Underlay Strategy for Indirect Routing,” ACM Wireless Networks, vol. 10, no. 6, pp. 747-758, Nov. 2004.
[31] J. Ridoux, A. Fladenmuller, Y. Viniotis, and K. Salamatian, “Trellis-Based Virtual Regular Addressing Structures in Self-Organized Networks,” Proc. IFIP Networking Conf., pp. 511-522, May 2005.
[32] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, pp. 161-172, Aug. 2001.

Index Terms:
Distributed networks, network topology, wireless communication, protocol architecture, routing protocols.
Citation:
Aline Carneiro Viana, Marcelo Dias de Amorim, Yannis Viniotis, Serge Fdida, Jos? Ferreira de Rezende, "Twins: A Dual Addressing Space Representation for Self-Organizing Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 1468-1481, Dec. 2006, doi:10.1109/TPDS.2006.179
Usage of this product signifies your acceptance of the Terms of Use.