Computer Science ›› 2013, Vol. 40 ›› Issue (Z6): 287-290.

Previous Articles     Next Articles

Analysis to Connectivity of Wireless Ad hoc Simulating Networks with Random Mobility Models

LIU Yan-tao,WANG Bo,AN Jian-ping and LIU Heng   

  • Online:2018-11-16 Published:2018-11-16

Abstract: The connectivity of wireless ad hoc networks were studied,including uniform networks,Poisson networks,networks using random waypoint model,and networks using random direction model.The analysis was based on the minimum degree theorem in geometric random graphs.The node degree was calculated by using the probability density function of node distribution.The quantitative relationship among 1-connectivity,node number and communication range was illustrated.It was shown that the connectivity decreased by the sequence of uniform networks,networks using random direction model,and networks using random waypoint model.

Key words: Wireless Ad hoc networks,Mobility models,Geometric random graphs,Connectivity

[1] Takagi H,Kleinrock L.Optimal transmission ranges for ran-domly distributed packet radio terminals [J].IEEE trans.on communications,1984:246-257
[2] Ni J,Chandler S.Connectivity properties of a random radio network[C]∥Proc.of IEE Communications.Aug 1994:289-296
[3] Kleinrock L,Silvester J A.Optimum transmission radii for pac-ket radio networks or why six is a magic number[C]∥Proc.of IEEE Telecommunication Conference.Dec 1978
[4] Mathar R,Mattfeldt J.Analyzing routing strategy NFP in multihop packet radio network on a line[C]∥IEEE Trans on Communications.1995:977-988
[5] Hou T,Li V.Transmission range control in multihop packet radio networks[C]∥IEEE Trans on Communications.Jan.1986:38-44
[6] Cheng Y,Robertazzi T G.Critical connectivity phenomena inmultihop radio models[J].IEEE trans on communications,1989,37(7):770-777 (下转第314页)(上接第290页)
[7] Li H,Yu D.A statistical study of neighbor node properties in Ad hoc network[C]∥Proceedings of the International Confe-rence on Parallel Processing Workshops(ICPPW’02).2002
[8] Bettstetter C.On the minimum node degree and connectivity of a wireless multihop network[C]∥Proceeding of ACM International Symposium on Mobile Ad hoc Networking and Computing(MobiHoc).June 2002
[9] Santi P,Blough D M,Vainstein F.A probabilistic analysis for the range assignment problem in ad hoc networks[C]∥Proceeding of ACM International Symposium on Mobile Ad hoc Networking and Computing(MobiHoc).Oct 2001
[10] Miller L E.Probability of a two-hop connection in a random mobile network[C]∥2001Conference on Information Sciences and Systems.March 2001:21-23
[11] Panchapakesan P,Manjunath D.On the transmission range indense ad-hoc radio networks[C]∥Proc.SPCOMM 2001.Bangalore,India,July 2001:1-38
[12] Penrose M D.On k-connectivity for a geometric random graph[J].Wiley Random Structures and Algorithms,1999,15(2):145-164
[13] Xue F,Kumar P R.The number of neighbors needed for connectivity of wireless networks[C]∥Wireless Networks.2004:169-181
[14] Bollobas B.Random graphs[M].Cambridge University Press,2001
[15] Penrose M.Random geometric graphs[M].Oxford university press,2003
[16] Boudec J L.Understanding the simulation of mobility modelswith palm calculus[EB/OL].technical report,http://lcawww.epfl.ch/publications/leboudec,2005
[17] 刘宴涛,安建平,卢继华,等.无线自组织网络个体移动模型分析[J].通信学报,2010,31(2):36-43
[18] Upton G J G,Fingleton B.Spatial data analysis by example[M].Jone Wiley & Sons,1985
[19] Boudec J L,Vojnovic M.The random trip model:stability,stationary regime,and perfect simulation[J].IEEE/ACM trans.on networking,2006,14(6):1153-1166

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!