Opportunistic Frame Forwarding in Wireless Mesh Networks

Abstract:

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is transmitted and forwarded along with a fixed and predetermined path, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

• Periodical: Applied Mechanics and Materials (Volumes 764-765)
• Pages: 941-945
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.764-765.941
• Online since: May 2015
• Authors: Shih Tsung Liang*, Bo Yi Song, Yu Yao Su
• Keywords: Deterministic Routing, Opportunistic Routing, Wireless Mesh Networks

References

[1] C. Cetinkaya and E. Knightly: Opportunistic traffic scheduling over multiple network paths, In Proc. of IEEE Infocom (2004).

DOI: 10.1109/infcom.2004.1354602

[2] B. Sadeghi, V. Kanodia, A. Sabharwal and E. Knightly: Opportunistic media access for multirate ad hoc networks, In Proc. of ACM Mobicom (2002).

DOI: 10.1145/570645.570650

[3] S. Chachulski, M. Jennings, S. Katti and D. Katabi: Trading structure for randomness in wireless opportunistic routing, In Proc. of ACM SIGCOMM (2007).

DOI: 10.1145/1282427.1282400

[4] F. Wu, V. Raman and N. Vaidya: Being opportunistic or being Concurrent— on designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks, the 7th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks, In Proc. of SECON (2010).

DOI: 10.1109/secon.2010.5508210

[5] Y. YAN and B. ZHANG: CORE: A coding-aware opportunistic routing mechanism for wireless mesh networks, IEEE Wireless Communications, 17(3) (2010) 96–103.

DOI: 10.1109/mwc.2010.5490984

[6] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard and J. Crowcroft: XORs in the air: Practical wireless network coding, In Proc. of ACM SIGCOMM (2006).

DOI: 10.1145/1151659.1159942

[7] S. Biswas and R. Morris, ExOR: Opportunistic multihop routing for wireless networks, In Proc. of ACM SIGCOMM (2005).

DOI: 10.1145/1090191.1080108

[8] S. -T. Liang and Y. -Y. Su: Opportunistic routing with considering race among forwarders in wireless mesh networks, The 3rd World Congress in Applied Computing, Computer Science, and Computer Engineering (2011).

[9] J. Jun and M. Sichitiu: The nominal capacity of wireless mesh networks, IEEE Wireless Communications, 10(5) (2003) 8–14.

DOI: 10.1109/mwc.2003.1241089

[10] J.R. Jackson: Networks of Waiting Lines, Operation Research, 5 (1957) 518-521.