Subscribe

Issue No.04 - April (2010 vol.9)

pp: 479-490

Yan Sun , University of Kentucky, Lexington

Qiangfeng Jiang , University of Kentucky, Lexington

Mukesh Singhal , University of Kentucky, Lexington

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2009.133

ABSTRACT

In mobile ad hoc and sensor networks, since all nodes are mobile and there is no fixed infrastructure, the design of routing protocols becomes one of the most challenging issues. In recent years, geographic routing protocols have been widely used. Most of them, e.g., greedy-face-greedy routing protocols, need nodes to construct planar graphs as the underlying graphs. In this paper, we propose an Edge Constrained Localized Delaunay graph, denoted by ECLDel, as the underlying graph for geographic routing. We prove that the ECLDel is a planar t-spanner of the unit-disk graph. Geographic routing on ECLDel is as efficient as on the previous work of PLDel in terms of path length (hop count). However, the construction of ECLDel graph is far more simple and it converges faster. This is due to the following two reasons: First, we significantly reduce the number of messages broadcast by each node from five rounds (each round may contain several messages) to only two messages; second, we define two new types of edges, the Intersecting Gabriel (IG) edges and the Unaware Intersection (UI) edges, which are constrained in the ECLDel graph. These edges help significantly reduce the size of messages broadcast by each node. The decrease of both the number and the size of messages broadcast by each node reduces the communication cost, and saves the network bandwidth and node power, which are desirable for mobile ad hoc and sensor networks. Our simulation results show that the average number of messages and the average size of messages broadcast by each node are, respectively, 65 and 42 percent less in the construction of ECLDel than that in PLDel.

INDEX TERMS

Mobile ad hoc and sensor networks, geographic routing, unit-disk graph, planar, t-spanner, Delaunay triangulation.

CITATION

Yan Sun, Qiangfeng Jiang, Mukesh Singhal, "An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks",

*IEEE Transactions on Mobile Computing*, vol.9, no. 4, pp. 479-490, April 2010, doi:10.1109/TMC.2009.133REFERENCES

- [1] C. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing,"
Proc. ACM SIGCOMM, Oct. 1994.- [3] C. Perkins, "Ad-Hoc On-Demand Distance Vector Routing,"
Proc. IEEE Military Comm. Conf. (MILCOM '97), Nov. 1997.- [4] D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks,"
Mobile Computing, vol. 353, Springer, 1996.- [5] P. Sinha, R. Sivakumar, and V. Bharghavan, "CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm,"
Proc. IEEE INFOCOM, vol. 1, pp. 202-209, 1999.- [6] 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-54, Apr. 1999.- [9] K. Akkaya and M. Younis, "A Survey of Routing Protocols for Wireless Sensor Networks,"
Ad Hoc Networks, vol. 3, no. 3, pp. 325-349, 2005.- [11] E. Kranakis, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks,"
Proc. 11th Canadian Conf. Computational Geometry: An Introduction, pp. 51-54, 1999.- [14] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,"
Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 1999.- [15] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,"
Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, 2000.- [16] 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), 2002.- [17] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric Ad-Hoc Routing: Of Theory and Practice,"
Proc. ACM Symp. Principles of Distributed Computing (PODC '03), July 2003.- [19] S. Giordano, I. Stojmenovic, and L. Blazevic, "Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy,"
Ad Hoc Wireless Networking, Kluwer Academic Publishers, 2003.- [21] S. Capkun, M. Hamdi, and J. Hubaux, "Gps-Free Positioning in Mobile Ad Hoc Networks,"
Proc. Hawaii Int'l Conf. System Science (HICSS), Jan. 2001.- [23] S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, "Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table,"
Mobile Networks and Applications, vol. 8, pp. 427-442, 2003.- [24] S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin, "Data-Centric Storage in Sensornets,"
Proc. ACM SIGCOMM HotNets, 2002.- [25] M. Li, W. Lee, and A. Sivasubramaniam, "Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks,"
Proc. Second Workshop Emerging Applications for Wireless and Mobile Access, 2004.- [26] X. Li, Y.J. Kim, R. Govindan, and W. Hong, "Multi-Dimensional Range Queries in Sensor Networks,"
Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys '03), Nov. 2003.- [27] R. Sarkar, X. Zhu, and J. Gao, "Double Rulings for Information Brokerage in Sensor Networks,"
Proc. ACM MobiCom, Sept. 2006.- [28] G. Finn, "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks," ISI Research Report ISU/RR-87-180, Mar. 1987.
- [30] J. Bondy and U. Murty,
Graph Theory with Applications. Elsevier Science Ltd., 1976.- [33] X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks,"
Proc. IEEE INFOCOM, 2002.- [36] F. Araujo and L. Rodrigues, "Fast Localized Delaunay Triangulation,"
Proc. Int'l Conf. Principle of Distributed Systems (OPODIS '04), Dec. 2004.- [37] W. Wang, X.-Y. Li, K. Moaveninejad, Y. Wang, and W.-Z. Song, "The Spanning Ratios of Beta-Skeleton,"
Proc. Canadian Conf. Computational Geometry (CCCG '03), 2003.- [38] F.P. Preparata and M.I. Shamos,
Computational Geometry: An Introduction. Springer-Verlag, 1985.- [40] S. Fortune, "A Sweepline Algorithm for Voronoi Diagrams,"
Algorithmica, vol. 2, pp. 153-174, 1987.- [43] P. Boone, E. Chavez, L. Gleitzky, E. Kranakis, J. Opatrny, G. Salazar, and J. Urrutia, "Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks,"
Proc. Silencing RNAs: Organisers and Coordinators of Complexity in Eukaryotic Organisms (SIROCCO), pp. 23-34, 2004.- [45] A.-C. Yao, "On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems,"
SIAM J. Computing, vol. 11, pp. 721-736, 1982.- [47] R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, "Distributed Topology Control for Wireless Multihop Ad-Hoc Networks,"
Proc. IEEE INFOCOM, 2001.- [48] X.-Y. Li, P.-J. Wan, and Y. Wang, "Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks,"
IEEE Proc. Int'l Conf. Computer Comm. and Networks (ICCCN '01), pp. 564-567, 2001.- [49] X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, "Sparse Power Efficient Topology for Wireless Networks,"
Proc. IEEE Ann. Hawaii Int'l Conf. System Sciences (HICSS), 2002. |