LF-GFG: Location-Free Greedy-Face-Greedy Routing With Guaranteed Delivery and Lightweight Maintenance Cost in a Wireless Sensor Network With Changing Topology

Cheng, Yuan-Po; Tang, Yao-Jen; Tsai, Ming‐Jer

doi:10.1109/twc.2014.2360844

Cited by 7 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Future research includes the study of improving the performance of the beaconless routing protocols by incorporating the proposed sufficient condition with them. In addition, there exists a routing protocol that employs GFG to forward packets in the networks where the node location information is unavailable [4]. Another research direction is to study how to improve the performance of the location-free routing protocols by using the the proposed sufficient condition.…”

Section: Resultsmentioning

confidence: 99%

Face Routing on a Non-Planar Graph

Cheng

Tsai

2015

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Self Cite

View full text Add to dashboard Cite

In geographic routing protocols, face forwarding is often used in helping a packet escape from the stuck state. To guarantee packet delivery, face forwarding usually routes a packet in a planar subgraph of the network, which might disable many edges in the network and, in turn, worsen the routing performance and reduce the link failure tolerance. In this paper, we aim to improve the connectivity of the graphs on which face forwarding can guarantee packet delivery. We present a sufficient condition for the packet delivery guarantee of GFG face forwarding, augment the graph used in face forwarding with selected disabled edges in the network, and propose a geographic routing protocol, termed GFG-NP, in which a packet escapes from the stuck state by performing GFG face forwarding on the augmented graph that might be nonplanar. We show, using theoretical analysis, that GFG-NP guarantees packet delivery when performed on the augmented graphs of the partial Delaunay triangulation (PDT) and the CLDP-stable graph constructed by the cross-link detection protocol (CLDP), termed PDT-and CLDP-augmented graphs, respectively. In addition, simulations on network simulator NS-2 show that GFG-NP with face forwarding performed on PDT-and CLDP-augmented graphs outperforms GFG with face forwarding performed on PDT and the CLDP-stable graph, respectively, in terms of load balance, path length, routing latency, and packet delivery rate.

show abstract

Section: Resultsmentioning

confidence: 99%