scholarly journals A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Matheswaran Saravanan ◽  
Muthusamy Madheswaran
Keyword(s):  
Simulated Annealing ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Spanning Tree ◽  
Simulated Annealing Algorithm ◽  
Minimum Spanning Tree ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Bee Algorithm

Wireless sensor network (WSN) consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST) routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST). The proposed algorithm computes the distance-based Minimum Spanning Tree (MST) of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

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.

scholarly journals Hierarchical Energy Efficient Routing in Wireless Sensor Networks and its Challenges

2019 ◽  
Vol 9 (1) ◽  
pp. 4024-4027
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Route Of Transmission

Wireless sensor network consists of various sensor nodes connected through wireless media. Sensor nodes are tiny devices having lesser energy capabilities. Sensor nodes are either ad-hoc or mobile in their environment. Wireless sensor network route of transmission media is discovered by routing protocols and responsible for secure communication between sensor nodes. Energy is a precious resource of sensor nodes, and the entire lifetime of WSNs is depending on the energy capability of the sensor nodes. The fundamental problem is how to organize topology of WSN for deployed sensor nodes with lesser power consumption as possible. Major problems in wireless sensor networks which consume extra energy are interference, control message overhead, packet delay, unnecessary transmission, and bandwidth utilization. Therefore, energy efficient techniques are needed to overcome these problems. Hierarchical routing is the best routing method for finding optimal path between sensor nodes which enhance the lifetime of the network. This paper focuses towards various hierarchical energy efficient routing in wireless sensor networks and analyzes various features of WSN that should consider during designing of routing protocols.

scholarly journals ENERGY EFFICIENT ROUTING PROTOCOL FOR INCREASING LIFETIME OF WIRELESS SENSOR NETWORK

2020 ◽  
Vol 5 (2) ◽  
pp. 240-248
Author(s):  
Tanya Pathak ◽  
Vinay Kumar Singh ◽  
Anurag Sharma
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Design ◽  
Energy Efficient Routing

In the recent years, an efficient design of a Wireless Sensor Network has become important in the area of research. The major challenges in the design of Wireless Sensor Network is to improve the network lifetime. The main difficulty for sensor node is to survive in that monitoring area for the longer time that means there is a need to increase the lifetime of the sensor nodes by optimizing the energy and distance. There are various existing routing protocols in which optimal routing can be achieved like Data-Centric, Hierarchical and Location-based routing protocols. In this paper, new power efficient routing protocol is being proposed that not only select the shortest path between the source node and sink node for data transmission but also maximizes the lifetime of the participating nodes by selecting the best path for sending the data packet across the network. The main objective of this research is to develop a faster algorithm to find the energy efficient route for Wireless Sensor Network. Simulation results shows that this strategy achieves long network lifetime when compared to the other standard protocols.

scholarly journals Disjoint Spanning Tree Based Reliability Evaluation of Wireless Sensor Network

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3071
Author(s):  
Sonam Lata ◽  
Shabana Mehfuz ◽  
Shabana Urooj ◽  
Asmaa Ali ◽  
Nidal Nasser
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Spanning Tree ◽  
Large Scale ◽  
Spanning Trees ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Stable Operation ◽  
Communication Reliability

Wireless sensor networks (WSNs) are becoming very common in numerous manufacturing industries; especially where it is difficult to connect a sensor to a sink. This is an evolving issue for researchers attempting to contribute to the proliferation of WSNs. Monitoring a WSN depends on the type of collective data the sensor nodes have acquired. It is necessary to quantify the performance of these networks with the help of network reliability measures to ensure the stable operation of WSNs. Reliability plays a key role in the efficacy of any large-scale application of WSNs. The communication reliability in a wireless sensor network is an influential parameter for enhancing network performance for secure, desirable, and successful communication. The reliability of WSNs must incorporate the design variables, coverage, lifetime, and connectivity into consideration; however, connectivity is the most important factor, especially in a harsh environment on a large scale. The proposed algorithm is a one-step approach, which starts with the recognition of a specific spanning tree only. It utilizes all other disjoint spanning trees, which are generated directly in a simple manner and consume less computation time and memory. A binary decision illustration is presented for the enumeration of K-coverage communication reliability. In this paper, the issue of computing minimum spanning trees was addressed and it is a pertinent method for further evaluating reliability for WSNs. This paper inspects the reliability of WSNs and proposes a method for evaluating the flow-oriented reliability of WSNs. Further, a modified approach for the sum-of-disjoint products to determine the reliability of WSN from the enumerated minimal spanning trees is proposed. The proposed algorithm when implemented for different sizes of WSNs demonstrates its applicability to WSNs of various scales. The proposed methodology is less complex and more efficient in terms of reliability.

scholarly journals Research Trends in Energy-Efficient Routing Protocols for Wireless Sensor Network

2020 ◽  
Vol 9 (5) ◽  
pp. 425-431
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing

The technological advances in wireless communication systems and digital data processing techniques has given rise to many innovative intelligent networks. One such network is wireless sensor network (WSN). In recent past, huge growth has been perceived in the applications of WSN. In wireless sensor network, the battery powered sensor nodes are scattered in a monitoring area and it is impossible to replace the batteries of sensor nodes after deployment. Therefore, energy efficiency remains a prime concern in design of WSNs. The routing protocols help to find energy efficient routes and increases the lifetime of WSNs. The cluster-based routing techniques play an important role in design of energy efficient WSNs. However, authors analyzed two types of sensor networks in the literature such as homogeneous and heterogeneous networks. In homogeneous clustering, all sensor nodes possess same level of initial energy and cluster head (CH) formation probability of each node in such networks remains equal. In heterogeneous clustering, the nodes are bifurcated into three energy levels such as normal node, advanced node and super node. Therefore, the CH formation probability of a node in such network depends on the type of node. This paper presented a survey on recent energy efficient routing protocols in homogeneous as well as heterogeneous wireless sensor networks. The energy efficient routing protocols are classified based on some quality of service (QoS) metrics such as energy efficiency, network lifetime, network stability, cluster head selection threshold and heterogeneity levels.

An Energy Efficient Routing Scheme for Mobile Wireless Sensor Network with Mobile Sink

2017 ◽  
Vol 7 (8) ◽  
pp. 100
Author(s):  
Ravneet Pal Kaur ◽  
Maninder Singh
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor Network ◽  
Mobile Wireless Sensor

In wireless sensor network, the sensor nodes find the route towards the sink to transmit the sensory information such as temperature, pressure etc of a particular area. The sensor nodes transmit the data directly to sink or it relays the data through neighbor nodes using single or multi-hop links. Each time when nodes send their data to static sink, the data is passed through the nearer nodes of sink to it. As soon as the nodes near to the sink become dead, the entire network will be useless as there will be no communication to the sink node. So, to conserve the energy we use mobile sink approach. Thus with the inclusion of mobile sink in WSN, new paradigm called mobile wireless sensor network came into existence. In this paper, to conserve energy and to perform energy efficient routing, we have proposed chain-based energy efficient routing scheme for mobile wireless sensor network (CB-EERM)which is using mobile sink and media access approach where sink moves from one position to another position in sensor field and sojourn at a particular location to collect the whole aggregated data from the various  leader(aggregator)nodes in chain using media access approach. The proposed mobile scheme CB-EERM is validated through simulation and compared with traditional static approach using metrics such as energy consumption, throughput, delay and packet delivery ratio where proposed approach outperforms the existing scheme.

Sign in / Sign up

Export Citation Format

Share Document