Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Agent Technologies for Sensor Networks
IEEE Intelligent Systems
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Reliable and energy aware routing protocols for wireless sensor networks
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Hi-index | 0.24 |
In this paper, we introduce two fading-aware reliability based routing algorithms for wireless sensor networks (WSNs) with lossy radio links. The proposed algorithms are able to find optimal multi-hop paths in polynomial complexity, over lossy links, which are modeled by using standard fading models (e.g. Rayleigh and Rice fading). These algorithms minimize the energy consumption and ensure reliable packet transmission to the base station (BS) at the same time. A reliable path is defined in terms of successful packet transfer to the BS despite the lossy links. More precisely, the probability of correct reception of the packet at the BS must exceed a predefined threshold. The first algorithm minimizes the total energy consumption sending a packet over the selected path to the BS. On the other hand, the second algorithm selects a path which maximizes the minimum remaining energy on the node closest to exhaustion and, as a result, balances the energy consumption yielding high longevity. In both cases, reliable and energy efficient packet forwarding in WSN can be reduced to a constrained optimization problem. By using a specific link metrics, these problems can then be mapped into shortest path problems solved in polynomial time. Thus the obtained results ensure the selection of reliable paths which also guarantee minimum energy consumption in real time.