An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks
Issue No. 04 - April (2010 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2009.133
Yan Sun , University of Kentucky, Lexington
Qiangfeng Jiang , University of Kentucky, Lexington
Mukesh Singhal , University of Kentucky, Lexington
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.
Mobile ad hoc and sensor networks, geographic routing, unit-disk graph, planar, t-spanner, Delaunay triangulation.
M. Singhal, Y. Sun and Q. Jiang, "An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 9, no. , pp. 479-490, 2009.