Greedy anti-void routing protocol for wireless sensor networks

Wen Jiunn Liu*, Kai-Ten Feng

*Corresponding author for this work

Research output: Contribution to journalArticle

11 Scopus citations

Abstract

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the Greedy Anti-void Routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the Unit Disk Graph (UDG). The proposed Rolling-ball UDG boundary Traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.

Original languageEnglish
Pages (from-to)562-564
Number of pages3
JournalIEEE Communications Letters
Volume11
Issue number7
DOIs
StatePublished - 1 Jul 2007

Keywords

  • Greedy routing
  • Localized algorithm
  • Unit disk graph
  • Void problem
  • Wireless sensor network

Fingerprint Dive into the research topics of 'Greedy anti-void routing protocol for wireless sensor networks'. Together they form a unique fingerprint.

  • Cite this