By Topic

An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Sun ; Dept. of Comput. Sci., Univ. of Kentucky, Lexington, KY, USA ; Qiangfeng Jiang ; Singhal, M.

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.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:9 ,  Issue: 4 )