Predict and relay: an efficient routing in disruption-tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Candidate selection algorithms in opportunistic routing
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Opportunistic routing in wireless sensor networks powered by ambient energy harvesting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and comparison of candidate selection algorithms in opportunistic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
SSN: a seamless spontaneous network design around opportunistic contacts
Journal of Mobile Multimedia
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
Computer Communications
Delay-bounded utility-based event detection in energy harvesting sensor networks
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Pathbook: Cross-layer optimization for full-duplex wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A context-rich and extensible framework for spontaneous smartphone networking
Computer Communications
| Hi-index | 0.00 |
Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a datapacket generates benefit. The objective is to maximize utility, defined as a function of benefit and cost of transmission. As the link reliability of each relay determines eventual packet delivery and hence utility, OR offers the ability to increase reliability through opportunistic relays. We explore the optimality of utility-based routing through OR without allowing retransmission, and observe that the optimal scheme requires exhaustive searching of all paths from source to destination. We then propose a heuristic solution to select relays and determine priorities among them. Finally, we provide distributed implementations for both schemes. Simulations on NS-2 and our customized simulator are conducted to verify the effectiveness of the heuristic compared with the optimal.