A Topology Control Method for Multi-path Wireless Sensor Networks

2005 ◽  
pp. 210-219 ◽  
Author(s):  
Zhendong Wu ◽  
Shanping Li ◽  
Jian Xu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Method ◽  
Wireless Sensor

An Energy-Balance Based Distributed Topology Control Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 490-495 ◽  
pp. 1392-1396 ◽  
Author(s):  
Chu Hang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Algorithm ◽  
Path Loss ◽  
Network Connectivity ◽  
Premature Death ◽  
Residual Energy ◽  
Wireless Sensor

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.

scholarly journals Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Junghun Ryu ◽  
Jaewook Yu ◽  
Eric Noel ◽  
K. Wendy Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Interconnection Networks ◽  
Topology Control ◽  
Cayley Graphs ◽  
Small Diameter ◽  
Wireless Sensor ◽  
Control Algorithms ◽  
Transmission Range ◽  
Consensus Protocol

Borel Cayley graphs have been shown to be an efficient candidate topology in interconnection networks due to their small diameter, short path length, and low degree. In this paper, we propose topology control algorithms based on Borel Cayley graphs. In particular, we propose two methods to assign node IDs of Borel Cayley graphs as logical topologies in wireless sensor networks. The first one aims at minimizing communication distance between nodes, while the entire graph is imposed as a logical topology; while the second one aims at maximizing the number of edges of the graph to be used, while the network nodes are constrained with a finite radio transmission range. In the latter case, due to the finite transmission range, the resultant topology is an “incomplete” version of the original BCG. In both cases, we apply our algorithms in consensus protocol and compare its performance with that of the random node ID assignment and other existing topology control algorithms. Our simulation indicates that the proposed ID assignments have better performance when consensus protocols are used as a benchmark application.

Sign in / Sign up

Export Citation Format

Share Document