A Reliable Braided Multi-path Routing Algorithm for Wireless Sensor Networks
There exist many applications that need to deliver bulk data reliably in wireless sensor networks (WSN). In this paper, we propose a novel reliable routing algorithm that exploits braided multi-path route to deliver data. Meanwhile, not like other reliabl
- PDF / 280,808 Bytes
- 9 Pages / 439.37 x 666.142 pts Page_size
- 1 Downloads / 173 Views
A Reliable Braided Multi-path Routing Algorithm for Wireless Sensor Networks Jian-Jun Lei
Abstract There exist many applications that need to deliver bulk data reliably in wireless sensor networks (WSN). In this paper, we propose a novel reliable routing algorithm that exploits braided multi-path route to deliver data. Meanwhile, not like other reliable routing algorithms adopting the reliable strategies in data link layer, this algorithm guarantees reliability in application layer by using erasure-resilient codes, which can reconstruct all original data after the sink receives part of the encoding packets. Therefore, the intermediate nodes only need to perform besteffort data delivery. Furthermore, the algorithm benefits from multi-path routing in terms of congestion control, load balance and buffer management. The simulation shows that our algorithm obtains better performance as the network load increases. Keywords Reliable data collection • Erasure-resilient code • Multi-path routing
152.1
Introduction
Many-to-one data collection is an important issue in WSN. The type of data could be bulk data, e.g. video and acoustics files, or some loss intolerant data, e.g. location based on service using TDOA (time difference of arrival) to estimate the position by correlating comparable samples observed at different nodes. In these cases, the loss of data can adversely affect the accuracy of the algorithm. Nevertheless, WSN is often designed for short range wireless communication based on low power consumption and low cost. In this kind of network, the communication capacity may be limited by the low hardware specifications such as the low processing capability and small memory size [1]. Reliable bulk data transmission always is a strong challenge in multi-hop WSN.
J.-J. Lei (*) Chongqing University of Technology, Chongqing 400054, China e-mail: [email protected] S. Zhong (ed.), Proceedings of the 2012 International Conference on Cybernetics 1185 and Informatics, Lecture Notes in Electrical Engineering 163, DOI 10.1007/978-1-4614-3872-4_152, # Springer Science+Business Media New York 2014
1186
J.-J. Lei
In this paper, we propose a scalable and reliable many-to-one bulk data collection algorithm which only needs to consume fixed memory to buffer relaying packets. This algorithm provides multiple braided paths between the source node and the sink. The packets are encoded by erasure-resilient codes at the source node and dispersed to the network. The reliability can be guaranteed in the application layer between the source node and the sink, so that all intermediate nodes only need to perform best-effort transmission. Therefore, the intermediate nodes can relay the packets to multiple reachable paths by using forward-when-feasible approach instead of store-and-forward approach [2]. Therein, the utilization of fixed size memory can improve the data delivery efficiency. In this algorithm, each node determines its hop distance to the destination and that of its neighbors by broadcasting beacon frame mutually. This beaco
Data Loading...
