In geographic routing, not much effort has been given to improving position update mechanism used by nodes in wireless Ad-Hoc networks which is an important issue in order to precisely maintain the geographic position of nodes. Nodes are periodically broadcasting beacon updates that contain geographic location coordinates to the nodes in their vicinity. This is an accepted scheme for maintaining neighbor’s positions. We are solving the problem of high beacon overhead caused by generation of beacons while considering mobility and traffic load of the network. For example, if the beacon interval is too short for nodes that move very slow, i.e. not rapidly changing position, periodic beaconing will create unnecessary amount of beacon updates. In the same way, nodes which are broadcasting lot of data packets will generate the same amount of beacons as the nodes that have fewer data packet to transmit which leads to needless waste of energy. To make progress on these problems, we propose Adaptive Energy-Efficient (AEE) mechanism for geographic routing. Based on mobility and traffic load of the network, AEE adapts the beaconing interval to the value that corresponds to the network’s demands. We have embedded AEE into well know Greedy Perimeter Stateless Routing protocol (GPSR), and compared it with regular GPSR. We ran extensive simulations in Network Simulator 2 (NS-2) for both networks with high and low initial energy level. Results have shown that AEE reduces beacon overhead up to 90 percent, AEE also reduces energy consumption and the number of packet collision up to 83 percent, without worsening packet delivery fraction of the network. This adaptive method that reduces the number of collision and prolongs the battery usage of each node in the network can be very useful for MANET or VANET where system is completely ad-hoc and no infrastructure is used and nodes are relying on their own power sources.

In geographic routing, not much effort has been given to improving position update mechanism used by nodes in wireless Ad-Hoc networks which is an important issue in order to precisely maintain the geographic position of nodes. Nodes are periodically broadcasting beacon updates that contain geographic location coordinates to the nodes in their vicinity. This is an accepted scheme for maintaining neighbor’s positions. We are solving the problem of high beacon overhead caused by generation of beacons while considering mobility and traffic load of the network. For example, if the beacon interval is too short for nodes that move very slow, i.e. not rapidly changing position, periodic beaconing will create unnecessary amount of beacon updates. In the same way, nodes which are broadcasting lot of data packets will generate the same amount of beacons as the nodes that have fewer data packet to transmit which leads to needless waste of energy. To make progress on these problems, we propose Adaptive Energy-Efficient (AEE) mechanism for geographic routing. Based on mobility and traffic load of the network, AEE adapts the beaconing interval to the value that corresponds to the network’s demands. We have embedded AEE into well know Greedy Perimeter Stateless Routing protocol (GPSR), and compared it with regular GPSR. We ran extensive simulations in Network Simulator 2 (NS-2) for both networks with high and low initial energy level. Results have shown that AEE reduces beacon overhead up to 90 percent, AEE also reduces energy consumption and the number of packet collision up to 83 percent, without worsening packet delivery fraction of the network. This adaptive method that reduces the number of collision and prolongs the battery usage of each node in the network can be very useful for MANET or VANET where system is completely ad-hoc and no infrastructure is used and nodes are relying on their own power sources.

[1] Y. Wang, T. Wu, W.lee, and C.Ke, "A novel geographic routing srategy over VANET," In 24th International Conference on advanced Information Networking and Applications Workshops (WAINA), April 2010
[2] Chai K Toh, " Ad Hoc Mobile Wireless Networks: Protocols and Systems” 2002
[3] Tomas Krag and Sebastian Büettrich (2004-01-24). "Wireless Mesh Networking". O'Reilly Wireless Dev Center. Retrieved 2009-01-20.
[4] B. Karp and H. T. Kung, "Greedy perimeter stateless routing for wireless networks," in ACM/IEEE MOBICOM, August 2000, pp. 243-254.
[5] Q. Chen"Analysis and Application of Hop Count in Multi-hop Wireless Ad-hoc Networks" Department of Computer Science and Engineering University of New South Wales 2009
[6] X. Xiang , Z. Zhou and X. Wang "Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks," Proc. IEEE INFOCOM, 2007
[7] Y. Jia, W. Ying-you and Z. Hong "A solution to outdated neighbor problem in wireless sensor networks,” (2010) Proceedings - 2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010, 5, art. no. 5563956, pp. 277-280.
[8] Q. Chen, S. S. Kanhere, and M. Hassan, "Adaptive Position Update for Geographic Routing in Mobile Ad-hoc Networks," IEEE Transactions on mobile computing, vol. 12, no. 3, March 2013
[9] The VINT Project. The UCB/LBNL/VINT Network Simulator-ns 2.http://www.isi.edu/nsnam/ns/
[10] X. Li, J. Yang, A. Nayak and I. Stojmenovic, Localized Geographic Routing to a Mobile Sink with Guaranteed Delivery in Sensor Networks,&rdquo, IEEE J. Selected Areas in Comm., vol. 30, no. 9, pp. 1719-1729, Oct. 2012.
[11] H. de Oliveira , A. Boukerche , E. Nakamura and A. Loureiro "An efficient directed localization recursion protocol for wireless sensor networks", IEEE Trans. Comput., vol. 58, no. 5, pp.677 -691 2009
[12] F.C. Yu, Y.H. Choi, S.H. Park, E.S. Lee, M.S. Jin, and S.H. Kim, "Sink Location Service for Geographic Routing in Wireless Sensor Networks", IEEE Wireless Communications & Networking Conference(WCNC 2008), March, 2008, Las Vegas, USA
[13] C. Perkins, E. Belding-Royer and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing,IETF RFC 3561, July 2003
[14] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker and I. Stoica, “Geographic Routing without Location Information,&rdquo”, Proc. ACM MobiCom, pp. 96-108, Sept. 2003
[15] Q. Chen, S.S. Kanhere, M. Hassan and K.C. Lan, ``Adaptive Position Update in Geographic Routing,&rdquo”, Proc. Int',l Conf. Comm. (ICC ',06), pp. 4046-4051, June 2006.
[16] M. Heissenbuttel and T. Braun, "BLR: beacon-less routing algorithm for mobile ad-hoc networks," Elsevier's Comp. Commun. Journal, vol. 27, no. 11, pp. 1076-1086, July 2004
[17] S. Ruhrup, “Theory and Practice of Geographic Routing,” Department of Computer Science, University of Freiburg, Germany, February 2009
[18] R. Ghosh and J. J. Garcia-Luna-Aceves, “Automatic Routing Using Multiple Prefix Labels,” Proc. IEEE Globecom 2012, Dec. 3-7, 2012.
[19] S. Funke and N. Milosavljevic, “Guaranteed-Delivery GeographicRouting under Uncertain Node Locations,” Proc. IEEE INFOCOM,2007
50
[20] Syue, Syue-Ju; Chin-Liang Wang; Gauthier, V.; Pei-Shan Tsai, "Coverage-Extended Cooperative Geographic Routing with Optimal Power Allocation for Wireless Multihop Networks," Vehicular Technology Conference (VTC Spring), 2012 IEEE 75th , vol., no., pp.1,6, 6-9 May 2012
[21] Shao Tao; Ananda, A.L.; Chan Mun Choon, "Greedy Face Routing with Face ID Support in Wireless Networks," Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on , vol., no., pp.625,630, 13-16 Aug. 2007
[22] Ming Li, "Ripple Effect: an Improved Geographic Routing with Local Connectivity Information," Telecommunication Networks and Applications Conference, 2008. ATNAC 2008. Australasian , vol., no., pp.252,257, 7-10 Dec. 2008
[23] Biao Zhou; Lee, Y.-Z.; Gerla, M., "“Direction” assisted Geographic Routing for mobile ad hoc networks," Military Communications Conference, 2008. MILCOM 2008. IEEE , vol., no., pp.1,7, 16-19 Nov. 2008
[24] Rong Ding; Lei Yang, "A Reactive Geographic Routing Protocol for wireless sensor networks," Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2010 Sixth International Conference on , vol., no., pp.31,36, 7-10 Dec. 2010
[25]