scholarly journals Energy Efficient Multipath Routing Algorithm for Wireless Multimedia Sensor Network

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3642 ◽  
Author(s):  
Genta ◽  
K.Lobiyal ◽  
Abawajy
Keyword(s):  
Energy Consumption ◽  
Performance Analysis ◽  
Routing Protocols ◽  
Traffic Accidents ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Data Communication ◽  
High Energy ◽  
Wireless Multimedia

Wireless multimedia sensor networks (WMSNs) are capable of collecting multimedia events, such as traffic accidents and wildlife tracking, as well as scalar data. As a result, WMSNs are receiving a great deal of attention both from industry and academic communities. However, multimedia applications tend to generate high volume network traffic, which results in very high energy consumption. As energy is a prime resource in WMSN, an efficient routing algorithm that effectively deals with the dynamic topology of WMSN but also prolongs the lifetime of WMSN is required. To this end, we propose a routing algorithm that combines dynamic cluster formation, cluster head selection, and multipath routing formation for data communication to reduce energy consumption as well as routing overheads. The proposed algorithm uses a genetic algorithm (GA)-based meta-heuristic optimization to dynamically select the best path based on the cost function with the minimum distance and the least energy dissipation. We carried out an extensive performance analysis of the proposed algorithm and compared it with three other routing protocols. The results of the performance analysis showed that the proposed algorithm outperformed the three other routing protocols.

scholarly journals Energy Efficient Cross Layer Based Multi-Hop Clustered Routing Protocol For Wireless Sensor Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 11996-12003
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocols ◽  
Cluster Head ◽  
High Energy ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cross Layer ◽  
User Friendly

Wireless Sensor network becomes an essential part of Internet of things paradigm due their scalability, ease of deployment and user-friendly interface. However, certain issues like high energy consumption, low network lifetime and optimum quality of service requirement force researchers to develop new routing protocols. In WSNs, the routing protocols are utilized to obtain paths having high quality links and high residual energy nodes for forwarding data towards the sink. Clustering provide the better solution to the WSN challenges by creating access points in the form of cluster head (CH). However, CH must tolerate additional burden for coordinating network activities. After considering these issues, the proposed work designs a moth flame optimization (MFO) based Cross Layer Clustering Optimal (MFO-CLCO) algorithm to consequently optimize the network energy, network lifetime, network delay and network throughput. Multi-hop wireless communication between cluster heads (CHs) and base station (BS) is employed along with MFO to attain optimum path cost. The simulation results demonstrate that the proposed scheme outperforms existing schemes in terms of energy consumption, network lifetime, delay and throughput.

Performance Analysis of Energy Efficient Opportunistic Routing Protocols in Wireless Sensor Network

2019 ◽  
Vol 09 ◽  
Author(s):  
Premkumar Chithaluru ◽  
Rajeev Tiwari ◽  
Kamal Kumar
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Data Communication ◽  
Opportunistic Routing ◽  
Link Quality ◽  
Delivery Ratio ◽  
Performance Parameters ◽  
Wireless Medium ◽  
Reduce Energy Consumption

Background: Energy Efficient wireless routing has been an area of research particularly to mitigate challenges surrounding performance in category of Wireless Networks. Objectives: The Opportunistic Routing (OR) technique was explored in recent times and exhibits benefits over many existing protocols and can significantly reduce energy consumption during data communication with very limited compromise on performance. Methods : Using broadcasting nature of the wireless medium, OR practices to discourse two foremost issues of variable link quality and unpredictable node agility in constrained WSNs. OR has a potential to reduce delay in order to increase the consistency of data delivery in network. Results : Various OR based routing protocols have shown varying performances. In this paper, a detailed conceptual and experimental analysis is carried out on different protocols that uses OR technique for providing more clear and definitive view on performance parameters like Message Success Rate, Packet Delivery Ratio and Energy Consumption.

scholarly journals Unequal Clustering Multipath Routing Algorithm for Wireless Sensor Network based on Clustering and Ant Colony

2021 ◽  
Vol 3 (3) ◽  
pp. 156-160
Author(s):  
Jin Yong-xian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Selection Probability ◽  
Factor Node

To improve the energy efficiency of the wireless sensor network (WSN), and extend the network life. This paper proposes an improved unequal clustering multipath routing algorithm (UCMRA). The algorithm improves the formula of cluster head selection probability and competition radius, and considers the energy factor, node density, optimal number of cluster heads, etc. Experimental results show that, compared with the traditional algorithm, UCMRA has more stable cluster head distribution, less energy consumption and longer network lifetime.

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 Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

scholarly journals A Cross Unequal Clustering Routing Algorithm for Sensor Network

2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Energy Loss ◽  
Sensor Network ◽  
Routing Algorithm ◽  
High Energy ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Long Distance ◽  
Cluster Heads

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

Energy-Efficient Routing Protocol on Mobile Sink in Wireless Sensor Network

2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Model Simulation ◽  
Cluster Head ◽  
Mobile Sink ◽  
High Energy ◽  
Residual Energy ◽  
Energy Efficient Routing ◽  
Simulation Results

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.

scholarly journals Lecr: Less Energy Consumption Routing in Internet of Things

2020 ◽  
Vol 8 (5) ◽  
pp. 855-859 ◽  
Keyword(s):  
Energy Consumption ◽  
Internet Of Things ◽  
Traffic Management ◽  
Routing Algorithm ◽  
High Energy ◽  
Base Station ◽  
Experimental Result ◽  
Battery Lifetime ◽  
Iot Devices ◽  
Information Collecting

Internet of Things (IoT) constitutes a network of various devices has an equipment with the mandatory facility of communication and optional facilities of sensing, information collecting, storage and processing. IoT network has been used for research and development purpose in many application areas such as military environment, traffic management, and e-healthcare system. IoT network was enormous in scale and complexity, mainly in terms of energy efficiency because battery lifetime is limited. The previous routing protocols for IoT are difficult and require a huge memory use and high energy consumption which are insufficient for IoT network processing. For that reason, an efficient routing algorithm needed to decrease energy consumption while communication. To tackle this problem, this paper proposes Less Energy Consumption Routing (LECR) algorithm. This algorithm reduces energy consumption using 4 ways in IoT, (1) Sleep and Wake up Scheduling, (2) Route Discovery in IoT Base Station (3) Less Power Consumption Route for Communication (4) Reduce Overhead while Routing. The experimental result proves the LECR algorithm reduces IoT devices battery drain and increases lifetime of the IoT network efficiently

Sign in / Sign up

Export Citation Format

Share Document