The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Distributed Detection and Data Fusion
Distributed Detection and Data Fusion
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Parametric probabilistic sensor network routing
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Self-configuring localization systems: Design and Experimental Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Towards resilient geographic routing in WSNs
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Node-Disjoint Parallel Multi-Path Routing in Wireless Sensor Networks
ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems
Maximizing the functional lifetime of sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
IEEE Transactions on Computers
ICSNC '06 Proceedings of the International Conference on Systems and Networks Communication
Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
A wireless sensor network for structural health monitoring: performance and experience
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
A reliable and flexible data gathering protocol for battery limited wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Repellent voids for improving geographical routing efficiency in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
We present a theoretical performance analysis of network lifetime for sensor networks that route packets through multiple paths between a source and destination pair. Our analysis is based on the length of the paths established and we show how this value can be used to estimate the lifetime of the sensor network. Through our analysis, we show how much the network lifetime can be increased when additional paths are established between source and destination. We divide our analysis in two parts: 1) when the probability of link-level retransmission is negligible; 2) when it is significant. In the former case, we develop analytical closed-form equations that allow us to compute the expected network lifetime. In the latter case, we develop theoretical tools that allow us to compute the probability distribution function of the network lifetime and we show simulation results that confirm our theoretical analysis. We also demonstrate how to estimate the increase in network lifetime when more than one path is added. We also compute the probabilities of packet forwarding for each path that maximise the gain in network lifetime.