This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Geographical Cluster-Based Routing in Sensing-Covered Networks
September 2006 (vol. 17 no. 9)
pp. 899-911

Abstract—The relationship between coverage and connectivity in sensor networks has been investigated in recent research treating both network parameters in a unified framework. It is known that networks covering a convex area are connected if the communication range of each node is at least twice a unique sensing range used by each node. Furthermore, geographic greedy routing is a viable and effective approach providing guaranteed delivery for this special network class. In this work, we will show that the result about network connectivity does not suffer from generalizing the concept of sensing coverage to arbitrary network deployment regions. However, dropping the assumption that the monitored area is convex requires the application of greedy recovery strategies like traversing a locally extracted planar subgraph. This work investigates a recently proposed planar graph routing variant and introduces a slight but effective simplification. Both methods perform message forwarding along the edges of a virtual overlay graph instead of using wireless links for planar graph construction directly. In general, there exist connected network configurations where both routing variants may fail. However, we will prove three theoretical bounds which are a sufficient condition for guaranteed delivery of these routing strategies applied in specific classes of sensing covered networks. By simulation results, we show that geographical cluster-based routing outperforms existing related geographical routing variants based on one-hop neighbor information. Furthermore, simulations performed show that geographical cluster-based routing achieves a comparable performance compared to variants based on two-hop neighbor information, while maintaining the routing topology consumes a significantly reduced amount of communication resources.

[1] I. Stojmenovic, “Home Agent Based Location Update and Destination Search Schemes in Ad Hoc Wireless Networks,” Advances in Information Science and Soft Computing, pp. 6-11, 2002.
[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. Sixth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '00), pp. 120-130, Aug. 2000.
[3] C. Cheng, H. Lemberg, S. Philip, E. van den Berg, and T. Zhang, “SLALoM: A Scalable Location Management Scheme for Large Mobile Ad-Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., Mar. 2002.
[4] Y. Xue, B. Li, and K. Nahrstedt, “A Scalable Location Management Scheme in Mobile Ad-Hoc Networks,” Proc. IEEE Conf. Local Computer Networks, 2001.
[5] S.J. Philip, J. Ghosh, C. Qiao, and H.Q. Ngo, “Location Management in Sparse Ad Hoc Networks,” 2005.
[6] H. Frey and D. Görgen, “Planar Graph Routing on Geographical Clusters,” Ad Hoc Networks, special issue on data comm. and topology control in ad hoc networks, vol. 3, no. 5, pp. 560-574, Sept. 2005.
[7] H. Frey, “Geographical Cluster Based Routing with Guaranteed Delivery,” Proc. Second IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '05), Nov. 2005.
[8] 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.
[9] G.G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report ISI/RR-87-180, Information Sciences Inst. (ISI), Mar. 1987.
[10] I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
[11] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[12] G. Xing, C. Lu, R. Pless, and Q. Huang, “On Greedy Geographic Routing Algorithms in Sensing-Covered Networks,” Proc. Fifth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '04), pp. 31-42, May 2004.
[13] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc. INFOCOM '01, vol. 3, pp. 1380-1387, Apr. 2001.
[14] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Wireless Sensor Networks,” ACM Trans. Sensor Networks, 2005.
[15] H. Zhang and J.C. Hou, “Maintaining Coverage and Connectivity in Large Sensor Networks,” The Wireless Ad Hoc and Sensor Networks: An Int'l J., 2005.
[16] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '99), pp. 48-55, Aug. 1999.
[17] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. Sixth ACM/IEEE Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM '00), pp. 243-254, Aug. 2000.
[18] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,” Proc. Fourth ACM Int'l Symp. Mobile Computing and Networking (MobiHoc '03), 2003.
[19] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric Ad-Hoc Routing: Of Theory and Practice,” Proc. 22nd ACM Int'l Symp. Principles of Distributed Computing (PODC), pp. 63-72, July 2003.
[20] L. Barriere, P. Fraigniaud, L. Narajanan, and J. Opatrny, “Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges,” Proc. Fifth ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '01), pp. 19-27, 2001.
[21] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Ad-Hoc Networks beyond Unit Disk Graphs,” Proc. ACM Joint Workshop Foundations of Mobile Computing (DIALM-POMC), pp. 69-78, Sept. 2003.
[22] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Asymptotically Optimal Geometric Mobile Ad-Hoc Routing,” Proc. Sixth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DialM '02), pp. 24-33, Sept. 2002.
[23] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Geometric Spanner for Routing in Mobile Networks,” Proc. Second ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHOC '01), pp. 45-55, Oct. 2001.
[24] X.-Y. Li, G. Calinescu, and P.-J. Wan, “Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks,” Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM '02), vol. 3, pp. 1268-1277, June 2002.
[25] X. Li, I. Stojmenovic, and Y. Wang, “Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 350-361, Apr. 2004.
[26] S. Datta, I. Stojmenovic, and J. Wu, “Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks,” Proc. IEEE Int'l Conf. Distributed Computing and Systems (Wireless Networks and Mobile Computing Workshop (WNMC)), pp. 461-466, Apr. 2001.
[27] I. Stojmenovic and S. Datta, “Power and Cost Aware Localized Routing with Guaranteed Delivery in Unit Graph Based Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 4, pp. 175-188, 2004.
[28] Y. Xu, J.S. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Mobile Computing and Networking, pp. 70-84, 2001.
[29] W.-H. Liao, J.-P. Sheu, and Y.-C. Tseng, “GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks,” Telecomm. Systems, vol. 18, nos. 1-3, pp. 37-60, 2001.
[30] K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, pp. 259-278, 1969.
[31] J. Kuruvila, A. Nayak, and I. Stojmenovic, “Hop Count Optimal Position Based Packet Routing Algorithms for Ad Hoc Wireless Networks With a Realistic Physical Layer,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), Oct. 2004.
[32] J.K. Lehnert, D. Görgen, H. Frey, and P. Sturm, “A Scalable Workbench for Implementing and Evaluating Distributed Applications in Mobile Ad Hoc Networks,” Proc. Western Simulation MultiConf. (WMC '04), 2004.
[33] J. Zhao and R. Govindan, “Understanding Packet Delivery Performance in Dense Wireless Node Networks,” Proc. First ACM Conf. Embedded Networked Node Systems, Nov. 2003.

Index Terms:
Ad hoc networks, sensor networks, sensing coverage, geographic routing, topology control.
Citation:
Hannes Frey, Daniel G?rgen, "Geographical Cluster-Based Routing in Sensing-Covered Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 9, pp. 899-911, Sept. 2006, doi:10.1109/TPDS.2006.124
Usage of this product signifies your acceptance of the Terms of Use.