计算机科学 ›› 2013, Vol. 40 ›› Issue (Z6): 287-290.
刘宴涛,汪博,安建平,刘珩
LIU Yan-tao,WANG Bo,AN Jian-ping and LIU Heng
摘要: 以无线自组织网络的连通性作为研究对象,根据几何随机图中最小度原理,结合均匀分布、泊松分布、随机点模型网络、随机方向模型网络等几种网络的节点概率分布,计算网络中节点的最小度,得到网络1-连通度与节点数和通信半径的定量关系,证明网络连通性按照均匀网络、随机方向模型网络和随机点模型网络的次序减弱。
[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! |
|