An environment-aware mobility model for wireless ad hoc network

Computer Networks

Volumn 54, Issue 9, 2010, Pages 1470-1489

  Ahmed, Sabbir ^a   Karmakar, Gour C ^a   Kamruzzaman, Joarder ^a  

^a UNIVERSITY OF BALLARAT   (Australia)

Author keywords

Ad hoc network; Environment aware; Mobility model

Indexed keywords

ARBITRARY SHAPE; COST EFFECTIVE; DEPLOYMENT SCENARIOS; ENVIRONMENT-AWARE; ENVIRONMENTAL CONTEXTS; FLEXIBLE POSITIONING; FREE SPACE; MOBILITY MODEL; MOVEMENT PATTERN; NODE MOVEMENT; PERFORMANCE EVALUATION; PERFORMANCE MEASUREMENTS; REAL WORLD SITUATIONS; REAL-WORLD SCENARIO; SIGNAL ATTENUATION; SIGNIFICANT IMPACTS; SIMULATION ENVIRONMENT; UNIVERSITY CAMPUS;

ANCHORS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORK PERFORMANCE EVALUATION; COMPUTER SIMULATION; INTELLIGENT AGENTS; LANDFORMS; MOBILE AD HOC NETWORKS; MODELS; SIGNAL PROCESSING;

AD HOC NETWORKS;

EID: 77955655057     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.12.005     Document Type: Article

References (44)

1. A. Jardosh, E.M. Belding-Royer, K.C. Almeroth, and S. Suri Real world environment models for mobile ad hoc networks IEEE Journal on Special Areas in Communications-Special Issue on Wireless Ad hoc Networks 23 3 2005 622 632
2. G. Lu, G. Manson, and D. Belis Mobility modeling in mobile ad hoc networks with environment-aware Journal of Networks 1 1 2006 54 63
3. S. Ahmed, G. Karmakar, J. Kamruzzaman, Geographic constraint mobility model for ad hoc network, in: IEEE/ACM MASCOTS, USA, 2008, pp. 337-346.
4. The ns-2 network simulator, 〈URL http://www.isi.edu/nsnam/ns/〉.
5. B. Karp, H. Kung, Gpsr: greedy perimeter stateless routing for wireless networks, in: MobiCom, USA, 2000, pp. 243-254.
6. T. Camp, J. Boleng, and V. Davies A survey of mobility models for ad hoc network research Wireless Communications and Mobile Computing 2 2002 483 502
7. F. Bai, and A. Helmy A survey of mobility modeling and analysis in wireless ad hoc networks Wireless Ad hoc and Sensor Networks, Wireless Ad Hoc and Sensor Networks 2004 Kluwer Academic Publishers
8. B. Pazand, C. McDonald, A critique of mobility models for wireless network simulation, in: ACIS-ICIS, Melbourne, 2007, pp. 141-146.
9. Q. Zheng, X. Hong, S. Ray, Recent advances in mobility modeling for mobile ad hoc network research, in: ACMSE, Alabama, USA, 2004, pp. 70-75.
10. G. Liljana, and P. Ramjee Ad Hoc Networking Towards Seamless Communications 2006 Springer Chapter 7, pp. 173-209
11. D.J. Patterson, L. Liao, K. Gajos, M. Collier, N. Livic, K. Olson, S. Wang, D. Fox, H. Kautz, Opportunity knocks: a system to provide cognitive assistance with transportation services, in: International Conference on Ubiquitous Computing (UbiComp), Lecture Notes in Computer Science, vol. 3205, 2004, pp. 433-450.
12. W. Hsu, K. Merchant, H. Shu, C. Hsu, and A. Helmy Weighted waypoint mobility model and its impact on ad hoc networks Mobile Computing and Communications Review 9 1 2005 59 63
13. M. Kim, D. Kotz, S. Kim, Extracting a mobility model from real user traces, in: INFOCOM, Barcelona, Spain, 2006, pp. 1-13.
14. C. Bettstetter Mobility modeling in wireless networks: categorization, smooth movement, and border effects ACM Mobile Computing and Communications Review 5 3 2001 55 67
15. E. Royer, P. Melliar-Smith, L. Moser, An analysis of the optimum node density for ad hoc mobile networks, in: IEEE International Conference on Communications (ICC), vol. 3, 2001, pp. 857-861.
16. Z.J. Haas, A new routing protocol for the reconfigurable wireless networks, in: IEEE International Conference on Universal Personal Communications, (ICUPC), IEEE, San Diego, California, USA, 1997, pp. 562-566.
17. S. Leng, L. Zhang, H. Fu, and J. Yang Mobility analysis of mobile hosts with random walking in ad hoc networks Computer Networks 51 2007 2514 2528
18. X. Hong, M. Gerla, G. Pei, and C.-C. Chiang A group mobility model for ad hoc wireless networks International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM) 1999 ACM Press 53 60
19. M. Sanchez, and P. Manzoni Anejos: a java based simulator for ad-hoc networks Future Generation Computer Systems 17 5 2001 573 583
20. I. Khider, W. Furong, Y.W. Hua, and Sacko A survey of geographic restriction mobility models Journal of Applied Sciences 7 3 2007 442 450
21. J. Tian, J. Haehner, C. Becker, I. Stepanov, K. Rothermel, Graph-based mobility model for mobile ad hoc network simulation, in: Annual Simulation Symposium, San Diego, CA, USA, 2002, p. 337.
22. Q. Zheng, X. Hong, J. Liu, An agenda based mobility model, in: Annual Simulation Symposium (ANSS), 2006.
23. Q. Zheng, X. Hong, J. Liu, D. Cordes, and W. Huang Agenda driven mobility modeling International Journal of Ad Hoc and Ubiquitous Computing 5 1 2010 22 36
24. J. Ghosh, S.J. Philip, and C. Qiao Socialogical orbit aware location approximation and routing (solar) in manet Ad Hoc Networks 5 2 2007 189 209
25. P. Johansson, T. Larsson, N. Hedman, B. Mielezarek, M. Degermark, Scenario-based performance analysis of routing protocols for mobile ad-hoc networks, in: MobiCom, 1999, pp. 195-206.
26. P. Venkateswaran, R. Ghosh, A. Das, S.K. Sanyal, and R. Nandi An obstacle based realistic ad-hoc mobility model for social networks Journal of Networks 1 2 2006 37 44
27. A.-K.H. Souley, and S. Cherkaoui Advanced mobility models for ad hoc network simulations Systems Communications 2005 50 55
28. L.J. Guibas, J. Hershberger, Optimal shortest path queries in a simple polygon, in: Annual Symposium on Computational Geometry, 1987, pp. 50-63.
29. F. Li, R. Klette, Finding the shortest path between two points in a simple polygon by applying a rubberband algorithm, in: Advances in Image and Video Technology, vol. 4319/2006, 2006, pp. 280-291.
30. O. Arikan, S. Chenney, D.A. Forsyth, Efficient multi-agent path planning, in: Eurographic Workshop on Computer Animation and Simulation, 2001, pp. 151-162.
31. L. Blazevic, J.-Y.L. boudec, and S. Giordano A location-based routing method for mobile ad hoc networks IEEE Transaction on Mobile Computing 4 2 2005 97 110
32. Walking, 〈URL http://en.wikipedia.org/wiki/Walking〉.
33. B. Zalik Two efficient algorithms for determining intersection points between simple polygons Computers and Geosciences 26 2000 137 151
34. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2002 MIT Press, McGraw-Hill
35. F. Aurenhammer Voronoi diagrams-a survey of a fundamental geometric data structure ACM Computing Surveys 23 3 1991 345 405
36. G. Toussaint The relative neighborhood graph of a finite planar set Pattern Recognition 12 4 1980 261 268
37. K. Gabriel, and R. Sokal A new statistical approach to geographic variation analsis Systematic Zoology 18 1969 259 278
38. T.S. Rappaport Wireless Communications Principles and Practice second ed. 2001 Prentice Hall
39. F.J. Martinez, C.-K. Toh, J.-C. Cano, C.T. Calafate, P. Manzoni, Realistic radio propagation models (rpms) for vanet simulations, in: WCNC, 2009.
40. S. Marinoni, H.H. Kari, Ad hoc routing protocol performance in a realistic environment, in: ICN/ICONS/MCL, 2006.
41. A. Mahajan, N. Potnis, K. Gopalan, A. Wang, Modeling vanet deployment in urban settings, in: MSWIM, 2007, pp. 151-158.
42. J. Hahner, D. Dudkowski, P.J. Marron, K. Rothermel, Quantifying network partitioning in mobile ad hoc networks, in: MDM, 2007, pp. 174-181.
43. L. Kleinrock, J. Silvester, Optimum transmission radii for packet radio network or why six is a magic number, in: IEEE National Telecommunications Conference, 1978, pp. 4.3.1-4.3.5.
44. W. Kiess, and H.J. Widmer Hierarchical location service for mobile ad-hoc networks SIGMOBILE Mobile Computing and Communications Review 8 4 2004 47 58