An energy-efficient capacitated minimum spanning tree algorithm for topology control in Wireless Sensor Networks

2017 ◽  
Author(s):  
Mustafa Asci ◽  
Can Umut Ileri ◽  
Orhan Dagdeviren
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Topology Control ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Wireless Sensor ◽  
Tree Algorithm ◽  
Capacitated Minimum Spanning Tree

scholarly journals Game Theory Based Construction Efficient Topology in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12
Author(s):  
M. J. Abbasi ◽  
Muhammad Shafie Bin Abd Latiff ◽  
Hassan Chizari ◽  
N. Fisal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Topology Control ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Wireless Sensor ◽  
Noncooperative Game ◽  
Power Cost ◽  
Minimum Power

Topology control is one of the most important techniques used in wireless sensor networks; to some extent it can reduce energy consumption in which each node is capable of minimizing its transmission power level while preserving network connectivity. Reducing energy consumption has been addressed through different aspects till now. In this paper, we present a minimum spanning tree- (MST-) based algorithm, called noncooperative minimum spanning tree (NMST), for topology control in wireless multihop networks. In this algorithm, each node constructs its minimum power-cost spanning tree which is a tree and can connect the node with one hop away from its neighbor node in constructed topology. In addition we address the power-cost allocation problem when node acts selfishly. A class of strategies is proposed which construct minimum power-cost spanning tree such that the sum of the power-cost (as proxy of weight), at the same time, is a strong Nash equilibrium for a noncooperative game associated with the problem of efficient topology construction. Simulation results show that NMST can maximize the sensor network lifetimes.

scholarly journals Analysis of clustering in wireless sensor networks

2018 ◽  
Vol 7 (3.3) ◽  
pp. 228
Author(s):  
Arul Stephen C ◽  
Ebenezer Abishek.B ◽  
Dr V.Rajendran
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Energy ◽  
Route Optimization ◽  
Wireless Sensor ◽  
Network Clustering ◽  
Tree Algorithm ◽  
Minimum Energy Consumption

Location based routing using Global Position System used for establishing the nodes in wireless sensor networks making uses of clustering along with the location based routing is used for faster reliable and reduced Hops with minimum energy consumption and by using of minimum spanning tree algorithm to achieve a shortest path in a network. Clustering in wireless sensor network is used for improving network lifetime. We propose effective method called enhanced route optimization in clustering is performed using minimum spanning tree algorithm.  

Sign in / Sign up

Export Citation Format

Share Document