The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.11)
pp: 111-124
Chai Kiat Yeo , Centre for Multimedia & Network Technol., Nanyang Technol. Univ., Singapore, Singapore
Shengbo Yang , Centre for Multimedia & Network Technol., Nanyang Technol. Univ., Singapore, Singapore
ABSTRACT
This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR. Both theoretical analysis and simulation results show that POR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.
INDEX TERMS
routing protocols, geography, mobile ad hoc networks, virtual destination-based void handling, reliable data delivery, mobile ad hoc networks, data packets, routing protocols, large-scale networks, position-based opportunistic routing protocol, POR protocol, geographic routing, Routing protocols, Geographic information systems, Switches, Robustness, Ad hoc networks, Large-scale systems, Position control, mobile ad hoc network., Geographic routing, opportunistic forwarding, reliable data delivery, void handling
CITATION
Chai Kiat Yeo, Shengbo Yang, "Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.11, no. 1, pp. 111-124, January 2012, doi:10.1109/TMC.2011.55
REFERENCES
[1] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, 1998.
[2] M. Mauve, A. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” IEEE Network, vol. 15, no. 6, pp. 30-39, Nov./Dec. 2001.
[3] D. Chen and P. Varshney, “A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks,” IEEE Comm. Surveys and Tutorials, vol. 9, no. 1, pp. 50-67, Jan.-Mar. 2007.
[4] D. Son, A. Helmy, and B. Krishnamachari, “The Effect of Mobility Induced Location Errors on Geographic Routing in Mobile Ad Hoc Sensor Networks: Analysis and Improvement Using Mobility Prediction,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 233-245, July/Aug. 2004.
[5] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 243-254, 2000.
[6] S. Biswas and R. Morris, “EXOR: Opportunistic Multi-Hop Routing for Wireless Networks,” Proc. ACM SIGCOMM, pp. 133-144, 2005.
[7] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” Proc. ACM SIGCOMM, pp. 169-180, 2007.
[8] E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, “SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 12, pp. 1622-1635, Dec. 2009.
[9] A. Balasubramanian, R. Mahajan, A. Venkataramani, B.N. Levine, and J. Zahorjan, “Interactive WiFi Connectivity for Moving Vehicles,” Proc. ACM SIGCOMM, pp. 427-438, 2008.
[10] K. Zeng, Z. Yang, and W. Lou, “Location-Aided Opportunistic Forwarding in Multirate and Multihop Wireless Networks,” IEEE Trans. Vehicular Technology, vol. 58, no. 6, pp. 3032-3040, July 2009.
[11] S. Das, H. Pucha, and Y. Hu, “Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 2, pp. 1228-1239, Mar. 2005.
[12] R. Flury and R. Wattenhofer, “MLS: An Efficient Location Service for Mobile Ad Hoc Networks,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 226-237, 2006.
[13] E. Felemban, C.-G. Lee, E. Ekici, R. Boder, and S. Vural, “Probabilistic QoS Guarantee in Reliability and Timeliness Domains in Wireless Sensor Networks,” Proc. IEEE INFOCOM, pp. 2646-2657, 2005.
[14] D. Chen, J. Deng, and P. Varshney, “Selection of a Forwarding Area for Contention-Based Geographic Forwarding in Wireless Multi-Hop Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 5, pp. 3111-3122, Sept. 2007.
[15] N. Arad and Y. Shavitt, “Minimizing Recovery State in Geographic Ad Hoc Routing,” IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 203-217, Feb. 2009.
[16] Y. Han, R. La, A. Makowski, and S. Lee, “Distribution of Path Durations in Mobile Ad-Hoc Networks - Palm's Theorem to the Rescue,” Computer Networks, vol. 50, no. 12, pp. 1887-1900, 2006.
[17] W. Navidi and T. Camp, “Stationary Distributions for the Random Waypoint Mobility Model,” IEEE Trans. Mobile Computing, vol. 3, no. 1, pp. 99-108, Jan./Feb. 2004.
[18] R. Groenevelt, “Stochastic Models for Mobile Ad Hoc Networks,” PhD dissertation, Universite de Nice, Sophia Antipolis, France, 2005.
[19] The Network Simulator ns-2, http://www.isi.edu/nsnamns, 2011.
[20] M. Marina and S. Das, “On-Demand Multipath Distance Vector Routing in Ad Hoc Networks,” Proc. Ninth Int'l Conf. Network Protocols (ICNP '01), pp. 14-23, Nov. 2001.
[21] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM, pp. 1312-1321, 2003.
[22] S. Mueller, R. Tsang, and D. Ghosal, “Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges,” Performance Tools and Applications to Networked Systems, pp. 209-234, Springer, 2004.
[23] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, “Highly Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 5, no. 4, pp. 11-25, 2001.
[24] A. Valera, W. Seah, and S. Rao, “Improving Protocol Robustness in Ad Hoc Networks through Cooperative Packet Caching and Shortest Multipath Routing,” IEEE Trans. Mobile Computing, vol. 4, no. 5, pp. 443-457, Sept./Oct. 2005.
[25] B. Deb, S. Bhatnagar, and B. Nath, “ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks,” Proc. Ann. IEEE Int'l Conf. Local Computer Networks (LCN '03), pp. 406-415, 2003.
[26] A. Tsirigos and Z. Haas, “Analysis of Multipath Routing-Part I: The Effect on the Packet Delivery Ratio,” IEEE Trans. Wireless Comm., vol. 3, no. 1, pp. 138-146, Jan. 2004.
[27] A. Tsirigos and Z. Haas, “Analysis of Multipath Routing, Part 2: Mitigation of the Effects of Frequently Changing Network Topologies,” IEEE Trans. Wireless Comm., vol. 3, no. 2, pp. 500-511, Mar. 2004.
[28] Z. Ye, S. Krishnamurthy, and S. Tripathi, “A Framework for Reliable Routing in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, pp. 270-280, 2003.
[29] M.-H. Lu, P. Steenkiste, and T. Chen, “Design, Implementation and Evaluation of an Efficient Opportunistic Retransmission Protocol,” Proc. ACM MobiCom, pp. 73-84, 2009.
[30] F. Wu, T. Chen, S. Zhong, L.E. Li, and Y.R. Yang, “Incentive-Compatible Opportunistic Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 303-314, 2008.
[31] X. Huang, H. Zhai, and Y. Fang, “Robust Cooperative Routing Protocol in Mobile Wireless Sensor Networks,” IEEE Trans. Wireless Comm., vol. 7, no. 12, pp. 5278-5285, Dec. 2008.
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool