A Green Geographic Routing in Wireless Sensor Network

2015 ◽  
Vol 15 (03n04) ◽  
pp. 1540003
Author(s):  
XIAO-OU SONG ◽  
ZONG-QIANG LI
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Delay Time ◽  
Relay Node ◽  
Geographic Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Position Information ◽  
The Impact

The routing information is hard to maintain and the energy is limited in highly dynamic wireless sensor network. To solve these problems, energy-saving geographic routing (ESGR) is proposed, which does not maintain the network topology and can save energy. A node broadcast its position information to its neighboring nodes before transmitting data. The neighboring nodes compute the position of the virtual relay node using the data transmitter position, the base station position and the energy consumption for circuits and propagation. The neighboring nodes determine whether to become the relay node through competition based on its position, the destination position and the virtual relay node position. The neighboring nodes compute the delay time distributedly according to the competition strategy. The neighboring node with the shortest delay time can respond to the data sender first and become the sole relay node. The handshake mechanism efficiently prevents the collision among the neighboring nodes during competition, which is of high communication efficiency. When a routing hole is found, the relay region is changed and an approaching destination relay strategy is adopted, which reduces the impact of routing holes. The simulation shows that the proposed algorithm is better than BLR, because of the lower energy consumption and lower packet loss ratio. The ESGR algorithm is more appropriate for highly dynamic wireless network.

scholarly journals An improved cluster formation process in wireless sensor network to decrease energy consumption

2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Information Transfer ◽  
Cluster Head ◽  
High Energy ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Death Time

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.

scholarly journals Trust-Aware and Low Energy Consumption Security Topology Protocol of Wireless Sensor Network

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Low Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Low Energy Consumption

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.

scholarly journals A Hybrid Structure for Data Aggregation in Wireless Sensor Network

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Hedieh Sajedi ◽  
Zahra Saadati
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Aggregation ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Communication Protocol ◽  
Base Station ◽  
Wireless Sensor

In recent years, wireless sensor networks have been used for various applications such as environmental monitoring, military and medical applications. A wireless sensor network uses a large number of sensor nodes that continuously collect and send data from a specific region to a base station. Data from sensors are collected from the study area in the common scenario of sensor networks. Afterward, sensed data is sent to the base station. However, neighboring sensors often lead to redundancy of data. Transmission of redundant data to the base station consumes energy and produces traffic, because process is run in a large network. Data aggregation was proposed in order to reduce redundancy in data transformation and traffic. The most popular communication protocol in this field is cluster based data aggregation. Clustering causes energy balance, but sometimes energy consumption is not efficient due to the long distance between cluster heads and base station. In another communication protocol, which is based on a tree construction, because of the short distance between the sensors, energy consumption is low. In this data aggregation approach, since each sensor node is considered as one of the vertices of a tree, the depth of tree is usually high. In this paper, an efficient hierarchical hybrid approach for data aggregation is presented. It reduces energy consumption based on clustering and minimum spanning tree. The benefit of combining clustering and tree structure is reducing the disadvantages of previous structures. The proposed method firstly employs clustering algorithm and then a minimum spanning tree is constructed based on cluster heads. Our proposed method was compared to LEACH which is a well-known data aggregation method in terms of energy consumption and the amount of energy remaining in each sensor network lifetime. Simulation results indicate that our proposed method is more efficient than LEACH algorithm considering energy consumption.

A Wireless Sensor Network Route Algorithm for Mine Environment

2010 ◽  
Vol 39 ◽  
pp. 482-487
Author(s):  
Gang Zhu Qiao ◽  
Jian Chao Zeng
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Transmission ◽  
High Speed ◽  
Energy Levels ◽  
Cluster Head ◽  
Decisive Role ◽  
Base Station ◽  
Wireless Sensor ◽  
Position Information

The routing protocol which can meet the requirement of underground wireless sensor network plays a decisive role in improving the monitoring quality and the survival time of network. Because of the different energy supplement method of anchor nodes and unknown nodes, these two types of nodes are different energy levels, which determines that the task of the data forwarding should be completed by the blind node as far as possible. By combining the position information and cluster routing technology, a position-based cluster routing (PBCR) protocol is proposed. In the protocol the tunnel is divided into a number of regions and the nodes within the region form a cluster. The protocol chooses the blind node nearest to the base station in the region as cluster head and builds up the chain between the cluster heads as the network data transmission backbone which can help achieve the high-speed data transmission. Simulation results show that the PBCR protocol can ensure a balanced use of node energy and prolong the life cycle of the network.

scholarly journals An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

2018 ◽  
pp. 327-336 ◽  
Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Base Station ◽  
Energy Threshold ◽  
Wireless Sensor ◽  
Data Packets

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).

Energy Consumption Analysis of Secure and Clustered Wireless Sensor Network

2014 ◽  
Vol 5 (1) ◽  
pp. 15-36 ◽  
Author(s):  
Ashim Pokharel ◽  
Ethiopia Nigussie
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Aggregation ◽  
Secure Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Design Strategies

Due to limited energy resources, different design strategies have been proposed in order to achieve better energy efficiency in wireless sensor networks, and organizing sensor nodes into clusters and data aggregation are among such solutions. In this work, secure communication protocol is added to clustered wireless sensor network. Security is a very important requirement that keeps the overall system usable and reliable by protecting the information in the network from attackers. The proposed and implemented AES block cipher provides confidentiality to the communication between nodes and base station. The energy efficiency of LEACH clustered network and with added security is analyzed in detail. In LEACH clustering along with the implemented data aggregation technique 48% energy has been saved compared to not clustered and no aggregation network. The energy consumption overhead of the AES-based security is 9.14%. The implementation is done in Contiki and the simulation is carried out in Cooja emulator using sky motes.

Presenting the Hybrid Algorithm of Honeybee - Harmony in Clustering and Routing of Wireless Sensor Networks

2019 ◽  
Vol 9 (3) ◽  
pp. 357-371
Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zandhesami ◽  
Ali Sedighimanesh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Cluster Head ◽  
Rechargeable Batteries ◽  
Base Station ◽  
Wireless Sensor

Background: Wireless sensor networks are considered as one of the 21st century's most important technologies. Sensors in wireless sensor networks usually have limited and sometimes non-rechargeable batteries, which they are supposed to be preserved for months or even years. That's why the energy consumption in these networks is of a great importance. Objective: One way to improve energy consumption in a wireless sensor network is to use clustering. In clustered networks, one node is known as the cluster head and other nodes as normal members, which normal nodes send the collected data to the cluster head, and the cluster head sends the information to the base station either by a single step or by multiple steps. Method: Using clustering simplifies resource management and increases scalability, reliability, and the network lifetime. Although the cluster formation involves a time- overhead and how to choose the cluster head is another problem, but its advantages are more than its disadvantages. : The primary aim of this study is to offer a solution to reduce energy consumption in the sensor network. In this study, during the selection of cluster heads, Honeybee Algorithm is used and also for routing, Harmonic Search Algorithm is used. In this paper, the simulation is performed by using MATLAB software and the proposed method is compared with the Low Energy Adaptive Clustering Hierarchy (LEACH) and the multi-objective fuzzy clustering algorithm (MOFCA). Result and Conclusion: By simulations of this study, we conclude that this research has remarkably increased the network lifetime with respect to EECS, LEACH, and MOFCA algorithms. In view of the energy constraints of the wireless sensor network and the non-rechargeable batteries in most cases, providing such solutions and using metaheuristic algorithms can result in a significant reduction in energy consumption and, consequently, increase in the network lifetime.

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cumulative Number ◽  
Cluster Heads

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

scholarly journals Clustered Wireless Sensor Network Assisted the Design of Intelligent Art System

2022 ◽  
Vol 2022 ◽  
pp. 1-11
Author(s):  
Yue Zhao
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Base Station ◽  
Network Protocol ◽  
Wireless Sensor ◽  
Intelligent Node ◽  
Simulation Results ◽  
Clustered Network

Based on the principle of cluster wireless sensor network, this article introduces typical routing protocols in wireless sensors, and wireless sensor network protocol in detail analyzes their advantages and disadvantages and addresses their shortcomings. First, in the clustering network, a uniform clustering protocol with multiple hops in the circular network is proposed. The circular network is divided into rings of equal width, and clusters of equal size are set on different rings. Secondly, the ordinary nodes on each layer of the ring send the collected data to the auxiliary intelligent nodes in the cluster in a single-hop manner, and the auxiliary intelligent nodes located on the outer ring transfer the data to the auxiliary intelligent nodes located on the adjacent inner ring. Finally, on the basis of studying the clustering network protocol, this paper proposes a new clustering routing algorithm, a multihop adaptive clustering routing algorithm. The simulation results show that the algorithm can effectively extend the life of the network, save network energy consumption, and achieve network load balance. At the same time, the initial energy of the auxiliary intelligent node is set according to the energy consumption of the ordinary node and the relative distance between the auxiliary intelligent node and the base station on each layer of the ring. The theoretical and simulation results prove that, compared with the clustered network and auxiliary intelligent nodes, the clustered network can extend the life of the network.

scholarly journals EE-LEACH: Energy Enhancement in LEACH to Improve Network Life Time of Homogeneous Wireless Sensor Network

2020 ◽  
Vol 12 (1) ◽  
pp. 205-224
Author(s):  
Anshu Kumar Dwivedi DUBEY
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Reduce Energy Consumption ◽  
Matlab Programming

Purpose ”“ In the recent scenario, there are various issues related to wireless sensor networks such as clustering, routing, packet loss, network strength. The core functionality of primarily wireless sensor networks is sensor nodes that are randomly scattered over a specific area. The sensor senses the data and sends it to the base station. Energy consumption is an important issue in wireless sensor networks. Clustering and cluster head selection is an important method used to extend the lifetime of wireless sensor networks. The main goal of this research article is to reduce energy consumption using a clustering process such as CH determination, cluster formation, and data dissemination.   Methodology/approach/design ”“ The simulation in this paper was finished utilizing MATLAB programming methodology and the proposed technique is contrasted with the LEACH and MOD-LEACH protocols.   Findings ”“ The simulation results of this research show that the energy consumption and dead node ratio are improved of wireless sensor networks as compared to the LEACH and MOD-LEACH algorithms.   Originality/value ”“ In the wireless sensor network there are various constraints energy is one of them. In order to solve this problem use CH selection algorithms to reduce energy consumption and consequently increase network lifetime.

Sign in / Sign up

Export Citation Format

Share Document