Energy efficiency of opportunistic routing with unreliable links
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Low bound of energy-latency trade-off of opportunistic routing in multi-hop networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Lower bound of energy-latency tradeoff of opportunistic routing in multihop networks
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Massively parallel cooperative localisation in scalable sensor networks
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.01 |
This letter analytically examines the achievable energy efficiency of channel aware geographic-informed forwarding (CAGIF) algorithm, which chooses the next hop relay node by taking into consideration the underlying channel conditions, rather than purely maximizing the forwarding progress. The theoretical analysis in terms of the average forward distance is developed and the upper bound and lower bound of the average energy consumption are provided by referring to the retransmission techniques. Numerical results show that CAGIF significantly improves the energy efficiency over the previous geographic information based routing algorithms that ignore the channel conditions.