Routing in communications networks
Power management techniques for mobile communication
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Minimum energy reliable paths using unreliable wireless links
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Performance analysis of the V-BLAST algorithm: an analytical approach
IEEE Transactions on Wireless Communications
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Balancing power: tradeoffs between connection lifetime and control traffic in MANETS
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Dynamic power budget distribution schemes that optimise connection lifetimes in MANETs
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
In this paper we present and evaluate a new technique to lower packet-level error rates of application layer connections in wireless ad-hoc networks. In our scheme, data packets submitted at a connection's source are checksummed and replicated, flowing breadth-first across an overlay network towards the destination. The destination delivers the first error-free copy of each packet, in order, to the application layer, dropping packets that are corrupt or duplicate. Specifically in this paper, we consider overlays consisting of multiple parallel multi-hop paths. We provide an algorithm which determines the optimal parameters of the overlay in terms of the number of paths, their lengths, and specific routes. We demonstrate experimentally that the proposed scheme significantly outperforms traditional routing and power allocation approaches in terms of bit error rate, even when the comparison is made under identical power consumption constraints.