Minimum spanning tree-based delay-aware mobile sink traversal in wireless sensor networks

2017 ◽  
Vol 30 (13) ◽  
pp. e3270 ◽  
Author(s):  
Kumar Nitesh ◽  
Md Azharuddin ◽  
Prasanta Jana
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Mobile Sink ◽  
Wireless Sensor

scholarly journals An Integrated Approach for Constructing Cluster-based Virtual Backbone with Mobile Sink

2019 ◽  
Vol 13 (01) ◽  
pp. 53
Author(s):  
Khalil Al-shqeerat
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Integrated Approach ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Virtual Backbone ◽  
Cluster Heads ◽  
Reduce Energy Consumption

<p class="Abstract">In Wireless Sensor Networks, no physical backbone infrastructure used while all sensor nodes are energy constrained and impractical to recharge. The behavior of networks becomes unstable once the first node dies. The key challenge in such networks is how to reduce energy consumption to increase the network lifetime, especially with the different amount of energy in heterogeneity environments.</p><p class="Abstract">In this paper, the virtual backbone routing solution is suggested to reduce energy consumption in a wireless sensor network. An integrated approach combines both advantages of hierarchical cluster-based architecture and shortest spanning tree topology for constructing a virtual backbone with a mobile sink. The clustering solution is used to divide the network into clusters and reduces the number of nodes included in the communication. On the other hand, the shortest spanning tree technique is used to construct a backbone among all cluster heads and mobile sink every time the sink traverses to a new location. The proposed approach aims to construct an efficient data aggregation spanning tree used to send or receive data between the mobile sink and elected cluster heads in wireless sensor networks. It constructs an efficient virtual backbone to decrease the energy consumption and prolong the lifetime of the network.</p>Performance evaluation results demonstrate how the proposed approach prolongs the lifetime of wireless sensor networks compared to some conventional clustering protocols.

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