Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Stream data gathering in wireless sensor networks within expected lifetime
Proceedings of the 3rd international conference on Mobile multimedia communications
Performance analysis of probabilistic multi-path geographic routing in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks
The Journal of Supercomputing
Journal of Network and Computer Applications
Finding multiple induced disjoint paths in general graphs
Information Processing Letters
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
Although data forwarding algorithms are among the first set of the most important issues explored in sensor networks, how to efficiently and reliably deliver sensing data through a large field of sensors remains a research challenge. Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distribute traffic and balance network's load, as well as considerate fault tolerance. In this paper, we proposed a node-disjoint parallel multi-path routing algorithm (DPMR), which finds the node-disjoint multi-paths simultaneously by taking full advantage of the known geographic information. Through improving the packet delivery performance and evenly distributing the energy load among the sensors, DPMR can prolong the network's system lifetime. Simulations show that DPMR can significantly improve the network's performance.