K-connected-based WSN topology-control algorithm: K-connected-based topology algorithm LKETA

Authors:
Tao Yang;Yu Xiliang;Sun Pengmin
Affiliations:
The software center in Chong Qing University of Posts and Telecommunications;The software center in Chong Qing University of Posts and Telecommunications;The software center in Chong Qing University of Posts and Telecommunications
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 0

On k-connectivity for a geometric random graph

Random Structures & Algorithms
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proposed a new topology-control algorithms which is based on k-connectivity. In wireless sensor networks, the existing topology-control algorithms now can not meet the needs of WSN in faulttolerance, connectivity, redundancy and so on. In LKETA, the node deletes redundant edges according to the information of local neighbor nodes, and it adjusts transmission power with the power adjustment algorithm to constitute a k-connected sub graph, then it can calculate the topology refresh cycle according to the rate of the neighbor nodes. This algorithm guarantees the connectivity, low the transmitted power of nodes, reduce the redundancy edges, and increase the channel capacity.