The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2009 vol.8)
pp: 1622-1635
Eric Rozner , University of Texas at Austin, Austin
Jayesh Seshadri , University of Texas at Austin, Austin
Yogita Ashok Mehta , University of Texas at Austin, Austin
Lili Qiu , University of Texas at Austin, Austin
ABSTRACT
Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a Simple Opportunistic Adaptive Routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: 1) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, 2) priority timer-based forwarding to let only the best forwarding node forward the packet, 3) local loss recovery to efficiently detect and retransmit lost packets, and 4) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.
INDEX TERMS
Opportunistic routing, wireless mesh networks.
CITATION
Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu, "SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks", IEEE Transactions on Mobile Computing, vol.8, no. 12, pp. 1622-1635, December 2009, doi:10.1109/TMC.2009.82
REFERENCES
[1] B. Awerbuch, D. Holmer, and H. Rubens, “Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Learning,” technical report, version 1, JHU, May 2003.
[2] S. Biswas and R. Morris, “ExOR: Opportunistic Multi-Hop Routing for Wireless Networks,” Proc. ACM SIGCOMM, Aug. 2005.
[3] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” Proc. ACM SIGCOMM, Aug. 2007.
[4] C. Chen, D. Aksoy, and T. Demir, “Processed Data Collection Using Opportunistic Routing in Location Aware Wireless Sensor Networks,” Proc. Int'l Conf. Mobile Data Management, May 2006.
[5] R. Choudhury and N. Vaidya, “MAC-Layer Anycasting in Wireless Ad Hoc Networks,” Proc. Hot Topics in Networks (HotNets), Nov. 2003.
[6] Click, http://pdos.csail.mit.educlick, 2009.
[7] D. De Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” Proc. ACM MobiCom, Sept. 2003.
[8] R. Draves, J. Padhye, and B. Zill, “Comparison of Routing Metrics for Multi-Hop Wireless Networks,” Proc. ACM SIGCOMM, Aug. 2004.
[9] R. Draves, J. Padhye, and B. Zill, “Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks,” Proc. ACM MobiCom, Sept./Oct. 2004.
[10] R. Dube, C. Rais, K.-E. Wang, and S. Tripathi, “Signal Stability Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks,” IEEE Personal Comm., vol. 4, no. 1, pp. 36-45, Feb. 1997.
[11] Z. Fu, H. Luo, P. Zerfos, S. Lu, L. Zhang, and M. Gerla, “The Impact of Multihop Wireless Channel on TCP Performance,” IEEE Trans. Mobile Computing, vol. 4, no. 2, pp. 209-221, Mar. 2005.
[12] T. Goff, N. Abu-Aahazaleh, D. Phatak, and R. Kahvecioglu, “Preemptive Routing in Ad Hoc Networks,” Proc. ACM MobiCom, July 2001.
[13] Y.C. Hu and D.B. Johnson, “Design and Demonstration of Live Audio and Video over Multi-Hop Wireless Networks,” Proc. Military Comm. Conf. (MILCOM '02), Oct. 2002.
[14] K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, “Impact of Interference on Multi-Hop Wireless Network Performance,” Proc. ACM MobiCom, Sept. 2003.
[15] R. Jain, D. Chiu, and W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” DEC Research Report TR-301, Sept. 1984.
[16] D.B. Johnson, D.A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks,” Ad Hoc Networking, Addison-Wesley, 2001.
[17] R. Karrer, A. Sabharwal, and E. Knightly, “Enabling Large-Scale Wireless Broadband: The Case for TAPs,” Proc. Hot Topics in Networks (HotNets '03), Nov. 2003.
[18] L. Kleinrock and J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six Is a Magic Number,” Proc. Nat'l Telecomm. Conf. (NTC '78), Dec. 1978.
[19] Y. Li, L. Qiu, Y. Zhang, R. Mahajan, and E. Rozner, “Predictable Performance Optimization for Wireless Networks,” Proc. ACM SIGCOMM, Aug. 2008.
[20] Y. Li, L. Qiu, Y. Zhang, R. Mahajan, Z. Zhong, G. Deshpande, and E. Rozner, “Effects of Interference on Throughput of Wireless Mesh Networks: Pathologies and a Preliminary Solution,” Proc. Hot Topics in Networks (HotNets-VI), Nov. 2007.
[21] R. Madan, S. Cui, S. Lall, and A. Goldsmith, “Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless AdHoc Networks,” IEEE Trans. Wireless Comm., 2006.
[22] Mesh Connectivity Layer, http://research.microsoft.com/mesh#software , 2009.
[23] The Network Simulator—ns-2, http://www.isi.edu/nsnamns, 2009.
[24] V. Paxson and M. Allman, “Computing TCP's Retransmission Timer,” IETF Internet draft, http://www3.ietf.org/proceedings/ 00jul/ I-Dpaxson-tcp-rto-01.txt, 2000.
[25] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, Aug./Sept. 1994.
[26] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Workshop Mobile Computing Systems and Applications, Feb. 1999.
[27] S. Rangwala, R. Gummadi, R. Govindan, and K. Psounis, “Interference-Aware Fair Rate Control in Wireless Sensor Networks,” Proc. ACM SIGCOMM, Sept. 2006.
[28] MIT Roofnet, http://www.pdos.lcs.mit.eduroofnet, 2009.
[29] E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, “Simple Opportunistic Routing for Wireless Mesh Networks,” Proc. Second IEEE Workshop Wireless Mesh Networks, Sept. 2006.
[30] Seattle Wireless, http:/www.seattlewireless.net, 2009.
[31] W. Wang, X. Liu, and D. Krishnaswamy, “Robust Routing and Scheduling in Wireless Mesh Networks,” Proc. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), 2007.
[32] C. Westphal, “Opportunistic Routing in Dynamic Ad Hoc Networks: The Oprah Protocol,” Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems (MASS '06), Oct. 2006.
[33] City-Wide Wi-Fi Rolls Out in UK, http://news.bbc.co.uk/2/hi/technology4578114.stm , 2009.
[34] Cities Unleash Free Wi-Fi, http://www.wired.com/gadgets/wireless/news/ 2005/1068999, 2009.
[35] Y. Yuan, H. Yuan, S.H. Wong, S. Lu, and W. Arbaugh, “ROMER: Resilient Opportunistic Mesh Routing for Wireless Mesh Networks,” Proc. IEEE Workshop Wireless Mesh Networks (WiMESH '05), Sept. 2005.
[36] Z. Zhong and S. Nelakuditi, “On the Efficacy of Opportunistic Routing,” Proc. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), June 2007.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool