A Clustering TDMA and Code Block Binding Algorithms to Enhance the Node Energy and Security of the Network

2020 ◽  
Vol 116 (1) ◽  
pp. 767-775
Author(s):  
M. Mohammed Mustafa ◽  
V. Parthasarathy
Keyword(s):  
Node Energy

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

scholarly journals Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

2009 ◽  
Vol 5 (1) ◽  
pp. 33-52 ◽  
Author(s):  
Saoucene Mahfoudh ◽  
Pascale Minet
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Idle State ◽  
Time Simulation ◽  
Simulation Results ◽  
Remaining Time ◽  
Slot Reuse ◽  
Node Energy

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

scholarly journals Energy-Efficient Routing Control Algorithm in Large-Scale WSN for Water Environment Monitoring with Application to Three Gorges Reservoir Area

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yuanchang Zhong ◽  
Lin Cheng ◽  
Liang Zhang ◽  
Yongduan Song ◽  
Hamid Reza Karimi
Keyword(s):  
Three Gorges Reservoir ◽  
Large Scale ◽  
Water Environment ◽  
Maximum Energy ◽  
Base Station ◽  
Three Gorges Reservoir Area ◽  
Three Gorges ◽  
Environment Monitoring ◽  
Cluster Heads ◽  
Node Energy

The typical application backgrounds of large-scale WSN (wireless sensor networks) for the water environment monitoring in the Three Gorges Reservoir are large coverage area and wide distribution. To maximally prolong lifetime of large-scale WSN, a new energy-saving routing algorithm has been proposed, using the method of maximum energy-welfare optimization clustering. Firstly, temporary clusters are formed based on two main parameters, the remaining energy of nodes and the distance between a node and the base station. Secondly, the algorithm adjusts cluster heads and optimizes the clustering according to the maximum energy-welfare of the cluster by the cluster head shifting mechanism. Finally, in order to save node energy efficiently, cluster heads transmit data to the base station in single-hop and multihop way. Theoretical analysis and simulation results show that the proposed algorithm is feasible and advanced. It can efficiently save the node energy, balance the energy dissipation of all nodes, and prolong the network lifetime.

scholarly journals Optimization Algorithm for Lifetime of Mobile Wireless Sensor Networks Based on Grid

2019 ◽  
Vol 15 (01) ◽  
pp. 44
Author(s):  
Ren Song
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Control Method ◽  
Optimization Method ◽  
Gradient Algorithm ◽  
Wireless Sensor ◽  
Premature Failure ◽  
Method Optimization ◽  
Mobile Wireless Sensor ◽  
Node Energy

To avoid premature failure due to excessive energy consumption of some nodes in the network, the node energy consumption problem was considered. Network life was maximized. For the problem of node energy consumption, multiple methods such as the shortest path method, optimization method, and power control method were used to solve the problem of optimization of the survival time of the wireless sensor network in different scenarios and improve the network lifetime. The results showed that the sub-gradient algorithm could balance the node energy consumption and the number of neighbor nodes and extend the maximum network lifetime. Therefore, under certain conditions, the algorithm is better than the algorithm using fixed transmission power.

Sign in / Sign up

Export Citation Format

Share Document