Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27073
Title: A straightforward path routing in wireless ad hoc sensor networks
Authors: Jiang, Z
Ma, J
Lou, W 
Wu, J
Keywords: Distributed algorithm
Information model
Routing
Wireless ad-ho sensor networks
Issue Date: 2009
Publisher: IEEE
Source: 29th IEEE International Conference on Distributed Computing Systems Workshops, 2009 : ICDCS Workshops '09, 22-26 June 2009, Montreal, QC, p. 103-108 How to cite?
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.
URI: http://hdl.handle.net/10397/27073
ISBN: 978-0-7695-3660-6
978-0-7695-3660-6 (E-ISBN)
ISSN: 1545-0678
DOI: 10.1109/ICDCSW.2009.47
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

42
Last Week
2
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.