Change search
ReferencesLink to record
Permanent link

Direct link
DLS: A Dynamic Local Stitching Mechanism to Rectify Transmitting Path Fragments in Wireless Sensor Networks
China, Australia.
China.
The University of Sydney, Australia.ORCID iD: 0000-0001-9194-010X
The University of Sydney, Sydney, Australia.
2013 (English)In: Journal of Network and Computer Applications, ISSN 1084-8045, E-ISSN 1095-8592, Vol. 16, no 1, 306-315 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, a pair of novel rectification algorithms (greedy negative pressure push algorithm and dynamic local stitching algorithm) is proposed to cooperatively repair broken transmitting paths in Wireless Sensor Networks. Our approach is to overcome the poor data validity in WSNs, specifically for harsh application environments - such as unattended sensor nodes or frail wireless transmitting channels - where fault tolerant becomes a vital aspect. Using adjacency information, Greedy negative pressure push algorithm can efficiently grow the transmitting path to achieve the minimum energy consumption for relays model. Here, we measured packet travel time and the expectation of relay distance to set this model's key parameters to achieve the lowest possible end-to-end transmitting delay. Dynamic local stitching algorithm has a major difference with other existing routing algorithms in rectifying broken paths: despite others that reroute whole paths, our algorithms only stitch broken fragments of the original path spending minimum amount of energy as well as recovery time. Based on mathematical computing and simulation, our novel rectification algorithm could effectively (1) reduce the total number of routing overheads, (2) improve net throughput, and (3) increase system fault tolerant much better than four already designed routing algorithms. Results were also very promising to motivate other algorithms in this field.

Place, publisher, year, edition, pages
2013. Vol. 16, no 1, 306-315 p.
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-46078ISI: 000312683300028OAI: oai:DiVA.org:kau-46078DiVA: diva2:970844
Note

A, IF (2011): 0.660

Available from: 2016-09-14 Created: 2016-09-14 Last updated: 2016-09-16Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Taheri, Javid
In the same journal
Journal of Network and Computer Applications
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link