finding current specific location of each node and updating the location server in manet
M.Anandharaj,K.Ravikumar
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:1 Year: 26 June,2014 Pages:354-363
Abstract
We consider the location service in a mobile ad-hoc network(MANET), where each node needs to maintain its location information by 1)frequently updating its location information within its neighboring region, which is called neighborhood update (NU), 2)Occasionally updating its location information to certain distributed location server in the network, which is called location server update(LSU). The tradeoff between the operation costs in location updates and the performance losses of the target application due to location inaccuracies imposes a crucial question for nodes to decide the optimal strategy to update their location information, where the optimality is in the sense of minimizing the overall costs. This chapter reviews research on routing in ad hoc and sensor wireless networks in the view of node mobility, changes in node activity, and availability of methods to determine absolute or relative coordinates of each node. Various approaches in literature are classified according to some criteria. Mobility is apparently a very difficult problem to handle in ad hoc networks, and all proposed solutions have significant drawbacks. Additional problems arise with ‘sleep’ period operation, that is changes in node’s activity status with or without mobility. While significant progress has been made on the routing with known destination location, location updates issue to enable efficient routing requires further investigation. A trade-off exists between the costs in location update operations, on one hand, and the additional incurred costs in (position-based) routing due to location errors, on the other hand. In this paper, Under a Markovian mobility model, the location update decision problem is modeled as a Markovian Decision Process (MDP)
Kewords
Location update, mobile ad hoc network,MDP, routing algorithm, LSU and NU
Reference
[1]M.Mauve, j.Widmer, and H. Hannes, “A Survey on position Based Routing in Mobile Ad Hoc Networks,” Proc, IEEE Network, PP.30-39, Nov/Dec 2001. [2]Y.C. Tseng, S.L Wu W.H. Liao, and C,M Chao “Location Awareness in Ad Hoc Wireless Mobile Networks” Proc IEEE computer, pp 46-52 June 2001 [3]S.J. Barnes, “Location-Based Services The State of the Art” e-Service vol 2, no 3, pp 59-70 2003. [4]I.Stojmenovic, “Location updates for Efficient Routing in Ad Hoc Networks,” Handbook, of Wireless Networks and Mobile Computing, pp 451-471 wiley,2002. [5]T. Park and K.G. Shin, “Optimal Tradeoffs for location-based Routing in Large-Scale Ad Hoc Networks,” IEEE/ACM Trans. Networking vol 13, no 2, pp.398-410, Apr. 2005. [6]R,C, Shah, A. Wolisz, and J.M. Rabaey. “On the Performance of Geographic Routing in the Presence of Localization Errors.”proc. IEEE Int Conf. [7]J. Li et al. “A Scalable Location Service for Geographic Ad Hoc Routing, Proc. Acm MobiCom. Pp 120-130, 2000” [8]Y.B. Ko and N.H. Vaidya, “Location-Aided Routing in Mobile Ad Hoc Networks,” ACM Wireless\ Networks j., Vol 6, no 4, pp 307-321. [9]M.L. Puterman, Markov Decision Processes Discrete Stochastic Dynamic Programming Wiley. [10]U. Madhow, M. Honig, and K. Steiglitz, “Optimization of Wireless Resources for Personal Communications Mobility Tracking, “IEEE/ACM Trans. Networking,” vol. 3, no. 6, pp 698-707 [11]V.W.S. Wong and V.C.M. leung, “An Adaptive Distance-Based Location Update Algorithm for Next-Generation PSC Networks,” IEEE J. Selected Areas on Comm., vol 19, no 10, pp.1942-1952, 2001. [12] J. Chen, P. Druschel, and D. Subramanian, A new approach to routing with dynamic metrics, Proc. IEEE INFOCOM, 1999. [13] S. Capkun, M. Hamdi, J.P. Hubaux, GPS-free positioning in mobile ad-hoc networks, Proc. Hawaii Int. Conf. on System Sciences, January 2001. [14] J.H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, Proc. IEEE INFOCOM, March 2000. [15] S. Datta, I. Stojmenovic, J. Wu, Internal node and shortcut based routing with guaranteed delivery in wireless networks, 2000. [16] W. Su, S.J. Lee, M. Gerla, Mobility prediction in wireless networks, Proc. IEEE MILCOM, October 2000. [17] I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-11, December 1999. [18] I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-09, September 1999. [19] K. Wu and J. Harms, Location trace aided routing in mobile ad hoc networks, Proc. IEEE ICCCN, Las Vegas, Oct. 2000. [20] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris, A scalable location service for geographic ad hoc routing, Proc. MOBICOM 2000, 120-130. [21] K.N. Amouris, S. Papavassiliou, M. Li, A position based multi-zone routing protocol for wide area mobile ad-hoc networks, Proc. 49th IEEE Vehicular Technology Conference, 1999, 1365-1369. [22] D. Estrin, R. Govindan, J. Heidemann, S. Kumar, Next century challenges: Scalable coordination in sensor networks, Proc. MOBICOM, 1999, Seattle, 263-270. [23] H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. on Communications, 32, 3, 1984, 246-257.
