Routing in Outer Space: Fair Traffic Load in Multihop Wireless Networks

In this paper, we consider security-related and energy efficiency issues in multihop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multihop wireless networks. These areas are critical-they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that does not create congested areas, does not have the associated security-related issues, and does not encourage selfish positioning. Moreover, the network is more energy efficient than the same network using the original routing protocol (in spite of using more energy globally) and dies more gracefully. We also describe applications of our idea to mobility and to a security protocol for the detection of node replication attacks.

[1]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.

[3]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[4]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

[5]  Tesi di Laurea,et al.  UNIVERSITÀ DEGLI STUDI DI ROMA "LA SAPIENZA" , 2000 .

[6]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[7]  Sylvie Perreau,et al.  Increasing the network performance using multi-path routing mechanism with load balance , 2004, Ad Hoc Networks.

[8]  Andy Hopper,et al.  A new location technique for the active office , 1997, IEEE Wirel. Commun..

[9]  Ahmed Helmy,et al.  Geographic Protocols in Sensor Networks , 2004 .

[10]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[11]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[12]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[13]  Michele Zorzi,et al.  Efficient Non-Planar Routing around Dead Ends in Sparse Topologies using Random Forwarding , 2007, 2007 IEEE International Conference on Communications.

[14]  Gustavo de Veciana,et al.  Capacity of ad hoc wireless networks with infrastructure support , 2005, IEEE Journal on Selected Areas in Communications.

[15]  Roberto Di Pietro,et al.  A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks , 2007, MobiHoc '07.

[16]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[17]  Jorma T. Virtamo,et al.  On Traffic Load Distribution and Load Balancing in Dense Wireless Multihop Networks , 2007, EURASIP J. Wirel. Commun. Netw..

[18]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[19]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[20]  Stefano Basagni,et al.  Localization Error-Resilient Geographic Routing for Wireless Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[21]  Adrian Perrig,et al.  Distributed detection of node replication attacks in sensor networks , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).

[22]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[23]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[24]  Abtin Keshavarzian,et al.  Load balancing in ad hoc networks: single-path routing vs. multi-path routing , 2004, IEEE INFOCOM 2004.

[25]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[26]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[27]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[28]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[29]  Paolo Santi,et al.  Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks , 2002, MobiCom '02.

[30]  Xiaoyan Hong,et al.  Effective probabilistic approach protecting sensor traffic , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[31]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[32]  Elaine Shi,et al.  The Sybil attack in sensor networks: analysis & defenses , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[33]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[34]  A. Perrig,et al.  The Sybil attack in sensor networks: analysis & defenses , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[35]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[36]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[37]  Deborah Estrin,et al.  Self-configuring localization systems: Design and Experimental Evaluation , 2004, TECS.

[38]  N. Asokan,et al.  Securing ad hoc routing protocols , 2002, WiSE '02.

[39]  Richard M. Karp,et al.  Balancing traffic load in wireless networks with curveball routing , 2007, MobiHoc '07.

[40]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[41]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[42]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[43]  Ness B. Shroff,et al.  Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[44]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[45]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[46]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[47]  Elizabeth M. Belding-Royer,et al.  A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[48]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[49]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[50]  Deborah Estrin,et al.  Self-configuring localization systems , 2002 .