The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2013 vol.12)
pp: 489-501
Quanjun Chen , Australian Centre for Field Robot. (ACFR), Univ. of Sydney, Sydney, NSW, Australia
S. S. Kanhere , Sch. of Comput. Sci. & Eng., Univ. of New South Wales, Sydney, NSW, Australia
M. Hassan , Sch. of Comput. Sci. & Eng., Univ. of New South Wales, Sydney, NSW, Australia
In geographic routing, nodes need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions. We contend and demonstrate that periodic beaconing regardless of the node mobility and traffic patterns in the network is not attractive from both update cost and routing performance points of view. We propose the Adaptive Position Update (APU) strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. APU is based on two simple principles: 1) nodes whose movements are harder to predict update their positions more frequently (and vice versa), and (ii) nodes closer to forwarding paths update their positions more frequently (and vice versa). Our theoretical analysis, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that APU can significantly reduce the update cost and improve the routing performance in terms of packet delivery ratio and average end-to-end delay in comparison with periodic beaconing and other recently proposed updating schemes. The benefits of APU are further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
telecommunication traffic, broadcasting, mobile ad hoc networks, radiowave propagation, routing protocols, sparse network, adaptive position update, mobile ad hoc networks, forwarding decisions, periodic broadcasting, beacon packets, geographic location coordinates, geographic routing protocols, periodic beaconing, node mobility, traffic patterns, routing performance, APU strategy, position updates, mobility dynamics, forwarding patterns, NS2 simulations, greedy perimeter stateless routing protocol, GPSR, packet delivery ratio, end-to-end delay, updating schemes, realistic network scenarios, localization error, realistic radio propagation, Topology, Routing protocols, Routing, Network topology, Mobile computing, Accuracy, Mobile communication, routing protocols, Wireless communication, algorithm/protocol design and analysis
Quanjun Chen, S. S. Kanhere, M. Hassan, "Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.12, no. 3, pp. 489-501, March 2013, doi:10.1109/TMC.2012.20
[1] J. Hightower and G. Borriello, "Location Systems for Ubiquitous Computing," Computer, vol. 34, no. 8, pp. 57-66, Aug. 2001.
[2] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom, pp. 243-254, Aug. 2000.
[3] L. Blazevic, S. Giordano, and J.-Y. LeBoudec, "A Location Based Routing Method for Mobile Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 4, no. 2, pp. 97-110, Mar. 2005.
[4] Y. Ko and N.H. Vaidya, "Location-Aided Routing (LAR) in Mobile Ad Hoc Networks," ACM/Baltzer Wireless Networks, vol. 6, no. 4, pp. 307-321, Sept. 2002.
[5] T. Camp, J. Boleng, B. Williams, L. Wilcox, and W. Navidi, "Performance Comparison of Two Location Based Routing Protocols for Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 1678-1687, June 2002.
[6] D. Johnson, Y. Hu, and D. Maltz, The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4, IETF RFC 4728, vol. 15, pp. 153-181, Feb. 2007.
[7] C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, July 2003.
[8] J. Li, J. Jannotti, D.S.J.D. Couto, D.R. Karger, and R. Morris, "A Scalable Location Service for Geographic Ad Hoc Routing," Proc. ACM MobiCom, pp. 120-130, Aug. 2000.
[9] Z.J. Haas and B. Liang, "Ad Hoc Mobility Management with Uniform Quorum Systems," IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 228-240, Apr. 1999.
[10] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, "Geographic Routing without Location Information," Proc. ACM MobiCom, pp. 96-108, Sept. 2003.
[11] S. Lee, B. Bhattacharjee, and S. Banerjee, "Efficient Geographic Routing in Multihop Wireless Networks," Proc. ACM MobiHoc, pp. 230-241, May 2005.
[12] Q. Chen, S.S. Kanhere, M. Hassan, and K.C. Lan, "Adaptive Position Update in Geographic Routing," Proc. Int'l Conf. Comm. (ICC '06), pp. 4046-4051, June 2006.
[13] M. Heissenbuttel, T. Braun, M. Walchli, and T. Bernoulli, "Evaluating of the Limitations and Alternatives in Beaconing," Ad Hoc Networks, vol. 5, no. 5, pp. 558-578, 2007.
[14] Y. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic Routing Made Practical," Proc. Second Conf. Symp. Networked Systems Design and Implementation, pp. 217-230, May 2005.
[15] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing," Proc. ACM MobiHoc, pp. 267-278, June 2003.
[16] B. Blum, T. He, S. Son, and J. Stankovic, "IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks," technical report, Dept. of Computer Science, Univ. of Virginia, 2003.
[17] M. Zorzi and R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance," IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 349-365, Oct.-Dec. 2003.
[18] M. Heissenbuttel et al., "BLR: Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks," Computer Comm., vol. 27, pp. 1076-1086, July 2004.
[19] P. Casari, M. Nati, C. Petrioli, and M. Zorzi, "Efficient Non Planar Routing around Dead Ends in Sparse Topologies Using Random Forwarding," Proc. IEEE Int'l Conf. Comm. (ICC), pp. 3122-3129, June 2007.
[20] S. Basagni, M. Nati, C. Petrioli, and R. Petroccia, "ROME: Routing over Mobile Elements in WSNs," Proc. 28th IEEE GlobeCom, pp. 5221-5227, Dec. 2009.
[21] P. Nain, D. Towsley, B. Liu, and Z. Liu, "Properties of Random Direction Models," Proc. IEEE INFOCOM, pp. 1897-1907, Mar. 2005.
[22] C. Bettstetter, H. Hartenstein, and X. Prez-Cos, "Stochastic Properties of the Random Waypoint Mobility Model," Wireless Networks, vol. 10, no. 5, pp. 555-567, Sept. 2004.
[23] Q. Chen, S.S. Kanhere, and M. Hassan, "Mobility and Traffic Adaptive Position Update for Geographic Routing," Technical Report UNSW-CSE-TR-1002, School of Computer Science and Eng., Univ. of New South Wales, UNSW1002.pdf, 2010.
[24] L.M. Feeney and M. Nilsson, "Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment," Proc. IEEE INFOCOM, pp. 1548-1557, 2001.
[25] C. Bettstetter, "Connectivity of Wireless Multihop Networks in a Shadow Fading Environment," Wireless Network, vol. 11, no. 5, pp. 571-579, 2005.
[26] G. Zhou, T. He, S. Krishnamurthy, and J.A. Stankovic, "Impact of Radio Irregularity on Wireless Sensor Networks," Proc. ACM MobiSys, pp. 125-138, 2004.
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool