Connectivity And Topology Of Wireless Networks

1041 Words5 Pages
Connectivity and topology control: Some approaches tried to improve the system reliability by carefully designing the connectivity or topology of wireless networks. Paper [50] addresses the problem of fault tolerant deployment of wireless ad-hoc networks. Based on the pre-assumed transmission range, the authors propose a scheme to calculate the probability that a given network is k-connected. Based on the intensive deployment, the redundant sensor nodes are used to cope the random working nodes failure. Following the similar idea, a distributed algorithm is proposed in [52]. By deploying calculated necessary number of extra nodes in the given network, the objective of fault-tolerant topology control can be achieved. However, due to the limited space and cost constraint, adding redundant nodes to a deployed WSN may not always be an acceptable solution. Another fault-tolerant topology control algorithm is presented by Li and Hou in [53], in which a spanning subgraph is computed by each node. If a pair of vertices is not k-connected, an extra edge will be added between these two vertices. The authors further prove that the resultant global network is k-connected. In [54], by considering the mobility of nodes, the author shows the mobility resilient topology control protocols. The author classifies the topology control protocols into two types. 1) In this case, the topology is built and maintained by each node based on its own knowledge about its neighbors. According to its own
Open Document