The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2009 vol.58)
pp: 839-850
Alessandro Mei , Sapienza University of Rome, Rome
Julinda Stefa , Sapienza University of Rome, Rome
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.
Multihop wireless networks, routing, analysis, energy efficiency, load balancing, simulations.
Alessandro Mei, Julinda Stefa, "Routing in Outer Space: Fair Traffic Load in Multihop Wireless Networks", IEEE Transactions on Computers, vol.58, no. 6, pp. 839-850, June 2009, doi:10.1109/TC.2009.17
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp.102-114, Aug. 2002.
[2] S. Basagni, M. Nati, and C. Petrioli, “Localization Error-Resilient Geographic Routing for Wireless Sensor Networks,” Proc. IEEE Global Comm. Conf. (GLOBECOM '08), Dec. 2008.
[3] C. Bettstetter, G. Resta, and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 3, pp.257-269, July-Sept. 2003.
[4] M. Bhardwaj and A.P. Chandrakasan, “Bounding the Lifetime of Sensor Networks via Optimal Role Assignments,” Proc. IEEE INFOCOM '02, vol. 3, pp.1587-1596, 2002.
[5] D.M. Blough and P. Santi, “Investigating Upper Bounds on Network Lifetime Extension for Cell-Based Energy Conservation Techniques in Adhoc Networks,” Proc. ACM MobiCom, 2002.
[6] J.-Y Le Boudec and I. Vojnovic, “Perfect Simulation and Stationarity of a Class of Mobility Models” Proc. IEEE INFOCOM '05, vol. 4, pp. 2743-2754, Mar. 2005.
[7] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom '98, pp.85-97, 1998.
[8] N. Bulusu, J. Heidemann, D. Estrin, and T. Tran, “Self-Configuring Localization Systems: Design and Experimental Evaluation,” Trans. Embedded Computing Systems, vol. 3, no. 1, pp.24-60, Feb. 2004.
[9] P. Casari, M. Nati, C. Petrioli, and M. Zorzi, “Efficient Non-Planar Routing Around Dead Ends in Sparse Topologies Using Random Forwarding,” Proc. IEEE Int'l Conf. Comm. (ICC '07), pp.3122-3129, June 2007.
[10] H. Chan, A. Perrig, and D. Song, “Random Key Predistribution Schemes for Sensor Networks,” Proc. IEEE Security and Privacy Symp., 2003.
[11] M. Conti, R.D. Pietro, L.V. Mancini, and A. Mei, “A Randomized, Efficient, and Distributed Protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks,” Proc. Eighth ACM Int'l Sym. Mobile Ad Hoc Networking and Computing (MobiHoc '07), pp.80-89, 2007.
[12] Q. Fang, J. Gao, and L.J. Guibas, “Locating and Bypassing Holes in Sensor Networks,” Mobile Networks and Applications, vol. 11, no. 2, pp.187-200, 2006.
[13] Y. Ganjali and A. Keshavarzian, “Load Balancing in Ad Hoc Networks: Single-Path Routing vs. Multi-Path Routing,” Proc. IEEE INFOCOM '04, vol. 2, pp.1120-1125, 2004.
[14] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, 388-404 Mar. 2000.
[15] Z. Haas, “A New Routing Protocol for the Reconfigurable Wireless Networks,” Proc. IEEE Int'l Conf. Universal Personal Comm., Oct. 1997.
[16] J. Hightower and G. Borriello, “Location Systems for Ubiquitous Computing,” Computer, vol. 34, no. 8, pp.57-66, Aug. 2001.
[17] X. Hong, P. Wang, J. Kong, Q. Zheng, and J. Liu, “Effective Probabilistic Approach Protecting Sensor Traffic,” Proc. IEEE Military Comm. Conf. (MILCOM '05), vol. 1, pp.169-175, Oct. 2005.
[18] E. Hyytiä and J. Virtamo, “On Traffic Load Distribution and Load Balancing in Dense Wireless Multihop Networks,” EURASIP J. Wireless Comm. and Networking, vol. 2007, no. 1, 2007.
[19] P. Jacquet, P. Mühlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized Link State Routing Protocol for Ad Hoc Networks,” Proc. Fifth IEEE Multi Topic Conf. (INMIC), 2001.
[20] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, vol. 353, T. Imielinski and H.F. Korth, eds., Kluwer Academic Publishers, 1996.
[21] B. Karp and H.T. Kung, “Gpsr: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom '00, Aug. 2000.
[22] A. Kröller, S.P. Fekete, D. Pfisterer, and S. Fischer, “Deterministic Boundary Recognition and Topology Extraction for Large Sensor Networks,” Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithm (SODA '06), pp.1000-1009, 2006.
[23] S. Kwon and N.B. Shroff, “Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks,” Proc. IEEE INFOCOM '07, May 2007.
[24] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, “Wireless Sensor Networks for Habitat Monitoring,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp.88-97, 2002.
[25] J. Newsome, E. Shi, D. Song, and A. Perrig, “The Sybil Attack in Sensor Networks: Analysis and Defenses,” Proc. Third IEEE/ACM Int'l Conf. Information Processing in Sensor Networks (IPSN '04), pp.259-268, 2004.
[26] V.D. Park, M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM '97, p.1405, 1997.
[27] B. Parno, A. Perrig, and V. Gligor, “Distributed Detection of Node Replication Attacks in Sensor Networks,” Proc. 2005 IEEE Symp. Security and Privacy (SP '05), pp.49-63, 2005.
[28] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, pp.234-244, 1994.
[29] C.E. Perkins and E. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp.90-100, Feb. 1999.
[30] P.P. Pham and S. Perreau, “Increasing the Network Performance Using Multi-Path Routing Mechanism with Load Balance,” Ad Hoc Networks, vol. 2, pp.433-459, Oct. 2004.
[31] L. Popa, A. Rostamizadeh, R. Karp, C. Papadimitriou, and I. Stoica, “Balancing Traffic Load in Wireless Networks with Curveball Routing,” Proc. Eighth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '07), pp.170-179, 2007.
[32] N. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket Location-Support System,” Proc. ACM MobiCom '00, Aug. 2000.
[33] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. MobiCom '03, pp.96-108, 2003.
[34] E. Royer and C. Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks,” IEEE Personal Comm., vol. 6, no. 2, pp. 46-55, Apr. 1999.
[35] K. Sanzgiri, B. Dahill, B. Levine, C. Shields, and E. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. Int'l Conf. Network Protocols (ICNP), 2002.
[36] A. Savvides, C.-C. Han, and M.B. Srivastava, “Dynamic Fine-Grain Localization in Ad-Hoc Networks of Sensors,” Proc. ACM/MobiCom, 2001.
[37] K. Seada and A. Helmy, “Geographic Protocols in Sensor Networks,” technical report, University of Southern California, July 2004.
[38] V. Srinivasan, P. Neggehalli, C.F. Chiasserini, and R.R. Rao, “Cooperation in Wireless Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, 2003.
[39] W. Wang, X. Li, and Y. Wang, “Truthful Multicast Routing in Selfish Wireless Networks,” Proc. ACM MobiCom '04, Sept. 2004.
[40] Y. Wang, J. Gao, and J.S.B. Mitchell, “Boundary Recognition in Sensor Networks by Topological Methods,” Proc. ACM MobiCom '06, pp.122-133, 2006.
[41] A. Ward, A. Jones, and A. Hopper, “A New Location Technique for the Active Office,” IEEE Personal Comm., vol. 4, no. 5, pp. 42-47, Oct. 1997.
[42] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom '01, July 2001.
[43] Y. Yu, R. Govindan, and D. Estrin, “Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” Technical Report UCLA/CSD-TR-01-0023, University of California, Los Angeles, Computer Science Dept., May 2001.
[44] M.G. Zapata and N. Asokan, “Securing Ad Hoc Routing Protocols,” Proc. ACM Workshop Wireles Security (WiSe), 2002.
[45] A. Zemlianov and G. deVeciana, “Capacity of Ad Hoc Wireless Networks with Infrastructure Support,” IEEE J. Selected Areas in Comm., vol. 23, no. 3, 657-667, Mar. 2005.
[46] H. Zhang and J. Hou, “On Deriving the Upper Bound of $\alpha$ —Lifetime for Large Sensor Networks,” Proc. ACM MobiHoc '04, pp.121-132, 2004.
[47] M. Zorzi and R.R. Rao, “Geographic Random Forwarding (geraf) for Ad Hoc and Sensor Networks: Energy and Latency Performance,” IEEE Trans. Mobile Computing, vol. 2, no. 4, pp.349-365, Oct.-Dec. 2003.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool