A straightforward path routing in wireless ad hoc sensor networks

Z. Jiang, J. Ma, Wei Lou, J. Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Building a ldquostraightforwardrdquo path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper, we extend our early work on the straightforward path routing in WASNs in the presence of the ldquolocal minimardquo, where the routing is blocked due to the lack of available forwarding successors. We bring some new insights of the safety information model for a forwarding routing that is limited in the request zone. A new routing is proposed to make a more intelligent decision in greedy advance and achieve more straightforward paths. The experimental results show substantial improvements of our approach compared with the best result known to date.
Original languageEnglish
Title of host publication29th IEEE International Conference on Distributed Computing Systems Workshops, 2009 : ICDCS Workshops '09, 22-26 June 2009, Montreal, QC
PublisherIEEE
Pages103-108
Number of pages6
ISBN (Print)9780769536606
DOIs
Publication statusPublished - 2009
EventInternational Conference on Distributed Computing Systems [ICDCS] -
Duration: 1 Jan 2009 → …

Publication series

NameInternational Conference on Distributed Computing Systems Workshop. Proceedings
ISSN (Print)1545-0678

Conference

ConferenceInternational Conference on Distributed Computing Systems [ICDCS]
Period1/01/09 → …

Keywords

  • Distributed algorithm
  • Information model
  • Routing
  • Wireless ad-ho sensor networks

Cite this