scholarly journals An Evaluation of Various Clustering and Routing Protocols in Wireless Sensor Networks

In the recent field of research the wireless sensor network plays an important role. Wireless sensor network is an important technology in this era. A Wireless Sensor Network (WSN) is a distributed network contains enormous sensor nodes with wide range of application. It transmits unlimited and enormous data like image, video, audio and data through end to end network. WSNs offer much solution to remote real time monitoring, recognition of physical occurrence and target tracking applications. This network growth is increasingly rapidly day by day and made the research field in difficult resurgence. The extended network lifetime, effective load balancing and scalability are essential for WSNs. The life time of the wireless network can be extended by the concept of clustering .Clustering is process of grouping the smaller localized networks in highly structured way. Diverse cluster technology available based on the network the clustering concept will be used. Efficient routing algorithm provide the way for efficient usage of bandwidth and reduce the delay in the network . This paper provides the survey of clustering and routing protocols to improve the efficiency in wireless technology in recent years

2014 ◽  
Vol 701-702 ◽  
pp. 1025-1028
Author(s):  
Yu Zhu Liang ◽  
Meng Jiao Wang ◽  
Yong Zhen Li

Clustering the sensor nodes and choosing the way for routing the data are two key elements that would affect the performance of a wireless sensor network (WSN). In this paper, a novel clustering method is proposed and a simple two-hop routing model is adopted for optimizing the network layer of the WSN. New protocol is characterized by simplicity and efficiency (SE). During the clustering stage, no information needs to be shared among the nodes and the position information is not required. Through adjustment of two parameters in SE, the network on any scale (varies from the area and the number of nodes) could obtain decent performance. This work also puts forward a new standard for the evaluation of the network performance—the uniformity of the nodes' death—which is a complement to merely taking the system lifetime into consideration. The combination of these two aspects provides a more comprehensive guideline for designing the clustering or routing protocols in WSN.


2015 ◽  
Vol 14 (10) ◽  
pp. 6142-6146
Author(s):  
Gurpreet Kaur ◽  
Vishal Arora

Wireless sensor networks have become increasingly popular due to their wide range of application. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. Minimizing the energy consumption of a wireless sensor network application is crucial for effective realization of the intended application in terms of cost, lifetime, and functionality. However, the minimizing task is hardly possible as no overall energy cost function is available for optimization. In this paper, we have proposed a modified alogirthm of leach where hard and soft threshold values will be applied for improving the overall throughput and network lifetime.


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.


Author(s):  
Tanya Pathak ◽  
Vinay Kumar Singh ◽  
Anurag Sharma

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.


Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3978 ◽  
Author(s):  
Shiming He ◽  
Yangning Tang ◽  
Zhuozhou Li ◽  
Feng Li ◽  
Kun Xie ◽  
...  

The main challenges of sensing in harsh industrial and biological environments are the limited energy of sensor nodes and the difficulty of charging sensor nodes. Simultaneous wireless information and power transfer (SWIPT) is a non-invasive option to replenish energy. SWIPT harvests energy and decodes information from the same RF signal, which is influencing the design of a wireless sensor network. In multi-hop multi-flow wireless sensor networks, interference generally exists, and the interference has a different influence on SWIPT. Route, interference and SWIPT are dependent. However, existing works consider SWIPT link resource allocation with a given route or only select path for one flow without interference. Therefore, this paper firstly analyzes the influence of interference on SWIPT, and select the SWIPT routing with interference. We design an interference-based information and energy allocation model to maximize the link capacity with SWIPT. Then, we design an interference-aware route metric, formulate SWIPT routing problem, and design an interference-aware SWIPT routing algorithm. The simulation results show that as the number of flows increases, there is more likely to obtain performance gains from interference and SWIPT.


Wireless Sensor Network (WSN) is a huge collection of sensor nodes deployed without any predetermined infrastructure. They are powered by batteries and energy consumption is one of the major issues in WSN. Hence to prolong the lifetime of the networks, it is important to design the energy efficient optimized routing algorithm. In this paper, two hop forwarding scheme in AODV and Fuzzy Logic is proposed to find an optimal routing protocol and intermediate node acknowledgement is deducted by the use of Fuzzy rules. The parameters such as remaining energy, data packet transmission, packet received acknowledgement and number of rounds is given as input to the fuzzy system which gives an optimized routing decision. The efficacy of the proposed algorithm is evaluated using NS2 and compared with Fuzzy-based Energy-Aware Routing Mechanism (FEARM). The simulation results shows that the Fuzzy based AODV routing algorithm reduces the energy consumption, minimizes the routing response packets and improves the network life time compared to other similar routing protocols.


Author(s):  
Maha Salih Abdulridha ◽  
Ghaihab Hassan Adday ◽  
Imad S. Alshawi

The wide deployment of wireless sensor networks is the primary reason behind the advancement of numerous routing protocols. In this context, sensors need to be remotely conveyed in unattended situations. Further, propels in wireless sensor network innovation have ensured accessibility and minimal effort in terms of sensor hubs with a capacity to sense various physical and natural environment conditions, in addition to wireless communication and data processing. Moreover, wireless sensor networks are rather different from regular and cellular networks, which comprise nodes with restricted bandwidth and energy. However, the most important limitation of wireless sensor networks is their characteristic limited energy resources. Furthermore, there is an imbalance of power consumption in their sensor nodes. Therefore, it is preferable to distribute the amount of energy throughout a wireless sensor network to minimize the maintenance and maximize the overall system performance. To this end, this paper suggests a new strategy in wireless sensor network dissemination and routing protocols referred to as the Fast Simple Flooding Strategy, which focuses on energy efficiency as a crucial design objective for routing protocols used in wireless sensor networks, without the overhead of other design factors, and reduces end-to-end latency. Additionally, this new strategy can be listed under flat approaches; it is simple and very fast in delivering the packet to the sink and does not require additional equipment or complex mathematical operations. It also resolves the major drawbacks of classic flooding and gossiping.


2017 ◽  
Vol 16 (2) ◽  
pp. 7586-7590
Author(s):  
Amneet Kaur ◽  
Harpreet Kaur

A Wireless Sensor Network or WSN is supposed to be made up of a large number of sensors and at least one base station. The sensors are autonomous small devices with several constraints like the battery power, computation capacity, communication range and memory. They also are supplied with transceivers to gather information from its environment and pass it on up to a certain base station, where the measured parameters can be stored and available for the end user. In most cases, the sensors forming these networks are deployed randomly and left unattended to and are expected to perform their mission properly and efficiently. As a result of this random deployment, the WSN has usually varying degrees of node density along its area. Sensor networks are also energy constrained since the individual sensors, which the network is formed with, are extremely energy-constrained as well. Wireless sensor networks have become increasingly popular due to their wide range of application. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. Minimizing the energy consumption of a wireless sensor network application is crucial for effective realization of the intended application in terms of cost, lifetime, and functionality. However, the minimizing task is hardly possible as no overall energy cost function is available for optimization.


Wireless Sensor Network is distributed networks of sensors which have the ability to sense, process and communicate. Sensor nodes are also responsible for collection of data. Due to the limited battery power of sensor node energy consumption is an essential issue. To reduce the energy consumption balancing of node load is one of the major task. In this paper, we have used switching algorithm to switch the nodes to balance the node load which further increases the life time of each node by finding the shortest path to destination from the source node based on the threshold energy. Further we applied base localization algorithm to check the lifetime of each node.


Sign in / Sign up

Export Citation Format

Share Document