ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
Measurement driven deployment of a two-tier urban mesh access network
Proceedings of the 4th international conference on Mobile systems, applications and services
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Model-driven optimization of opportunistic routing
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Model-driven optimization of opportunistic routing
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Survey Paper: Opportunistic routing - A review and the challenges ahead
Computer Networks: The International Journal of Computer and Telecommunications Networking
Model-driven optimization of opportunistic routing
IEEE/ACM Transactions on Networking (TON)
Coding- and interference-aware routing protocol in wireless networks
Computer Communications
| Hi-index | 0.00 |
Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportunistic routing can be implemented in a simple and practical way without resorting to a complicated scheduling protocol. Traditionally, due to the constraints of computational complexity, a protocol utilizing network coding needs to partition the data into multiple segments and encode only packets in the same segment. However, it is extremely challenging to decide the optimal time to move to the transmissions of the next segment, and existing designs all resort to different heuristic ideas that might harm network throughput. To address this problem, we propose SlideOR, a new protocol to encode source packets in overlapping sliding windows such that coded packets from one window position may be useful towards decoding the source packets inside another window position. Through extensive simulations, we show that SlideOR outperforms the existing solutions and is amenable to much simpler implementation than solutions with complicated scheduling among multiple segments.