节点文献
通讯网络中一类连通性问题研究
A research on connectivity in communication networks
【摘要】 考虑通信网络中一类连通性问题。假设某地区面积为S,均匀随机分有n个网站,任意两个网站之间距离小于r(n)时,这两个网站之间可以直接通信,得到的结果是r(n)满足条件πr~2(n)=((logn+c(n))/n)S时,该通信网络随c(n)→+∞以概率1连通。
【Abstract】 This paper mainly considers the connectivity in wireless communication networks. Suppose that the square in certain area is S.Let n stations be placed randomly, uniformly and independently in this area.Further suppose that any two stations can directly communicate each other if their distance is no more than r(n).It obtains the results that the communication networks is asymptotically connected with probability 1 if and only if c(n) converges to positive infinite,under the conditionπr~2(n) =logn+c(n)/n S.
【基金】 国家自然科学基金项目(10531070);中国地质大学(武汉)优秀青年教师基金项目(CUGQNL0816)
- 【文献出处】 华中师范大学学报(自然科学版) ,Journal of Huazhong Normal University(Natural Sciences) , 编辑部邮箱 ,2009年02期
- 【分类号】TN915.01
- 【下载频次】45