Connectivity of Wireless Multihop Networks

摘要：

Some fundamental topological characteristics of wireless multihop networks are studied in this paper. A necessary condition of that a wireless multihop network is connected is given out. And a new compute method of connectivity is given out. Suppose that the all nodes are distributed in a bounded square Ω according to Homogenous Poisson Process. A lower bound of the probability that C is connected is given out, with well considering the boundary effects. And a lower bound of the probability that G is k-connected and has k mutually vertex-disjoint backbone trees is also given out, with well considering the boundary effects, where k e N, k ≤ V| -1.

关键词： k-connectivity connecrivity backbone tree quasidegree

作者: Gui-Lin Lu Han-Xing Wang

作者单位: School of Math.& Information, Shanghai Lixin University of Commerce, Shanghai 201620,China Departmen School of Math.&Information, Shanghai Lixin University of Commerce, Shanghai 201620,China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 35-39

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）