Low Loss Energy-Aware Routing Protocol for Data Gathering Applications in Wireless Sensor Network

In recent years, Wireless device networks have achieved associate degree attention on a world level. This comprises small sensors with restricted power and restricted resources. The applicability of wireless sensor networks (WSNs) in various fields such as medical research and civilian applications is proliferating enormously. Every routing protocol designed for WSNs should be energy-efficient, reliable and prolong the network lifetime. Due to the resources and energy constraints in WSNs, routing can be considered as a matter of contention in networks. This research proposes a beacon-enabled least-time and energy-efficient routing protocol with single-level data-aggregation using an IEEE 802.15.4. Considering the low complexness and low power consumption it is appropriate for low-rate wireless personal area networks as WSNs. On comparison of the proposed protocol with the popular ad hoc and other WSN routing protocols, the results show that the proposed protocol outperforms the routing protocols in the literature in terms of latency, throughput, and average energy consumption.

Due to miniaturization of hardware and availability of low-cost, low-power sensors, Wireless Sensor Network and Multimedia Sensor Network applications are increasing day by day. Each application has a specific quality of service and experience requirements. The design of routing and MAC protocol which can fulfill the requirements of the application is challenging given the constrained nature of these devices. Considerable efforts are directed towards the design of energy efficient QoS-aware routing protocols. In this article, we present state of the art review of routing protocols for Wireless Multimedia Sensor Networks while addressing the challenges and providing insight into research issues.

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

Current and potential applications of wireless sensor networks (WSNs) include military sensing, physical security, traffic surveillance, and environment monitoring, etc. Due to the fact that WSNs are composed of a large number of low-cost but energy constrained nodes, scalable and energy-efficient routing protocols are requisite for the WSN applications. In this paper, we study energy-efficient geographic routing protocols in environmentally powered WSNs, where the sensor nodes are capable of extracting energy from the environment. We propose a protocol, geographic energy-aware blacklisting routing with energy supply (GEBRES), which makes routing decision locally by jointly taking into account multiple factors-the realistic wireless channel condition, packets advancement to the destination, the energy availability on the node with environmental energy supply. Simulation results show that GEBRES is more energy efficient than the corresponding residual energy based protocols without considering the property of the energy changing (including recharging and consuming) rate. In particular, given the same energy and traffic models, GEBRES maintains higher minimum residual energy on nodes and achieves better load balancing in terms of having a smaller standard deviation of residual energy among nodes. GEBRES exhibits a little degradation on end-to-end delay, but does not compromise the end-to-end throughput performance

In most of the applications of wireless sensor networks (WSNs), nodes operate in unattended environments and are, therefore, vulnerable to variety of attacks. Due to dynamic and unpredictable changing behavior of nodes, the reliable data delivery is a challenging task. For WSNs, the traditional cryptographic and authentication-based solutions cannot be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust-based solutions have proved to be more effective to address nodes' misbehavior attacks. However, the existing solutions give rise to high energy consumption and control overheads in pursuit of trust estimation and network-wide dissemination, which not only adds to network congestion but also undermines network lifetime. In this paper, we present a trust and energy aware routing protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving and faulty nodes. Moreover, TERP incorporates a composite routing function that encompasses trust, residual-energy, and hopcounts of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes, while routing data using shorter paths. The simulation results demonstrate reduced energy consumption, improved throughout and network lifetime of TERP when compared with the existing work.

Security problems have become obstacles in the practical application of wireless sensor networks (WSNs), and intrusion detection is the second line of defense. In this paper, an intrusion detection based on dynamic state context and hierarchical trust in WSNs is proposed, which is flexible and suitable for constantly changing WSNs characterized by changes in the perceptual environment, transitions of states of nodes, and variations in trust value. A multidimensional two-tier hierarchical trust mechanism in the level of sensor nodes (SNs) and cluster heads (CHs) considering interactive trust, honesty trust, and content trust is put forward, which combines direct evaluation and feedback-based evaluation in the fixed hop range. This means that the trust of SNs is evaluated by CHs, and the trust of CHs is evaluated by neighbor CHs and BS; in this way, the complexity of evaluation is reduced without evaluations by all other CHs in networks. Meanwhile, the intrusion detection mechanism based on a self-adaptive dynamic trust threshold is described, which improves the flexibility and applicability and is suitable for cluster-based WSNs. The experiment simulation and evaluation indicate that the mechanism we proposed outperforms the existing typical system in malicious detection and resource overhead.

Recently, the use of wireless sensor networks has spread to applications areas that are not viable or costefficient to be run on other types of networks. Due to some critical tasks done in these types of networks, the majority of sensor networks applications should be dependable and should be run continuously and reliably without interruption. Hence, the two more significant dependability factors that should be nowadays taken into account in developing wireless sensor networks applications are ‘availability’ and ‘reliability’ of application services. The specific characteristics and constraints of wireless sensor networks require a different interpretation of these two factors when developing applications for such networks. In this paper, we propose a middleware layer mechanism for satisfying these two factors as more important dependability issues in sensor networks applications. We propose an event-based middleware service that is specifically designed for wireless sensor networks in which a group of sensor nodes forms a cluster and a replicated service is run on each cluster head. The communication model among cluster members and cluster head is based on the publish/subscribe scheme. We show how the replicated services and communication model in cluster nodes satisfy dependability issues and increase the availability and reliability of applications running under the proposed middleware.

The Wireless Sensor Network (WSN) applications are today not only limited to the research stage rather it has been adopted practically in many defense as well as general civilians applications. It has been witness that extensive research have been conducted towards energy efficient routing and communication protocols and it has been reached to an acceptable stages, but without having a secure communications wide acceptance of the application is not likely. Due to unique characteristics of WSN, the security schemes suggested for other wireless networks are not applicable to WSN. This paper introduces an novel tree based technique called as Secure Tree based Routing with Energy Efficiency or STREE using clustering approximation along with lightweight key broadcasting mechanism in hierarchical routing protocol. The outcome of the study was compared with standard SecLEACH to find that proposed system ensure better energy efficiency and security.

A staggering number of applications rely on the network architecture to carry out their tasks, which has led to a fast growth in wireless sensor networks (WSN). The possibility of harmful activity and data theft is growing as a result of the growth in devices and data. Thus, the network’s regular users have an impact on legitimate data delivery, which lowers customer happiness and worsens network standards. The data have been saved using a variety of security procedures that have been developed in past research studies. However, harmful activity continues to engage in its illegal operations despite their efforts to safeguard data transmission in the network. As a result, a number of recent research projects have concentrated on predicting innovative techniques and processes to offer security in WSN. In comparison to existing methods, this work attempted to offer an effective tighter security for WSN and suggested an ML‐Based Secured Routing Protocol (MLSRP) for WSN with improved energy efficiency and overall performance. Energy efficiency is the main requirement of WSNs, hence a clustered network is proposed where the data are routed through the cluster head nodes. In this paper, a multicriteria based decision‐making (MCDM) model is used by the MLSRP to perform data routing, clustering, and cluster head election while also analyzing a number of network characteristics that might affect the quality of a node, route, and data. In NS2 software, the suggested framework is put into practice and simulated. The results are then validated to gauge performance. The observed quantitative results reveal that the proposed MLSRP method attains an improved network lifetime by 5% and network throughput of 6%. It reduces energy consumption by 40%, curtails overhead to 37%, and minimizes end‐to‐end delay by 30% than the other conventional methods. The suggested framework performs better than others when its total performance is compared to that of older methods.

Wireless sensor networks (WSNs) consist of a large number of small, low data rate and inexpensive nodes that communicate in order to sense or control a physical phenomenon. The major difference between the WSN and the traditional wireless network is that sensors are very sensitive to energy consumption. Moreover, the performance of the sensor network applications highly depends on the lifetime of the network and we expect the lifetime of several months to several years. Thus, energy saving is crucial in designing long-lived wireless sensor networks. Many researchers have focused on developing energy efficient cluster based protocols for WSNs, but there has not been much research on event driven WSNs and, their focus is on continuous driven networks. In this paper, we propose a modified algorithm of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol which is a well known energy efficient clustering algorithm for WSNs. Our modified protocol called “Adaptive and Energy Efficient Clustering Algorithm for Event-Driven Application in Wireless Sensor Networks (AEEC)” is aimed at prolonging the lifetime of a sensor network by balancing energy usage of the nodes. AEEC makes the nodes with more residual energy have more chances to be selected as cluster head. Also, we use elector nodes which take the responsibility of collecting energy information of the nearest sensor nodes and selecting the cluster head. We compared the performance of our AEEC algorithm with the LEACH protocol using simulations .

Wireless sensor networks (WSNs) comprise nodes with restricted battery power that are deployed to observe some physical event within the sensor field. Information gathering is typical, but an important operation in several applications of WSNs. It is important to control the sensor network for longer period of time in an energy-efficient manner for gathering information. Hence, it is perpetually fascinating to design protocols that are energy efficient, have prolonged lifetime and can support event-driven applications. This paper proposes a protocol referred to as distance-based residual energy-efficient stable election protocol (DRESEP) that is nearly optimal for event-driven information gathering applications in sensor networks. The key idea of DRESEP is moving gathered information from sensor nodes to cluster head (CH) depending upon perceived changes. Dual-hop communication between CHs and base station is introduced to achieve energy minimization. Further, the results demonstrate that the proposed algorithm significantly outperforms existing algorithms in terms of energy optimization and system lifetime.

Energy efficient collaborative proactive routing protocol for Wireless Sensor Network

In recent times, different routing protocols have been proposed in the Internet of Things enabled Underwater Wireless Sensor Networks (IoT-UWSNs) to explore the underwater environment for different purposes, i.e., scientific and military purposes. However, high Energy Consumption (EC), End to End (E2E) delay, low Packet Delivery Ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in Underwater Wireless Sensor Network (UWSN). The high E2E delay, EC and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. So, this paper presents two energy efficient routing protocols namely: Shortest Path-Collision avoidance Based Energy Efficient Routing (SP-CBE2R) protocol and Improved-Collision avoidance Based Energy Efficient Routing (Im-CBE2R) protocol. At this end, both routing protocols minimize the probability of void hole occurrence and in return minimizes the EC and E2E delay. In both routing protocols, courier nodes are positioned at different strategic locations to keep the greedy forwarding continuous. The proposed routing protocols are also analyzed by varying the Packet Size (PS) and Data Rate (DR). Additionally, various simulations have been performed to authenticate the proposed routing protocols. Simulation results show that the proposed routing protocols outperform the baseline routing protocols in counterparts.

Wide usage of wireless sensor network (WSN) is the reason for development of many routing protocols. Recent advances in WSN observe the increased interest in the potential use in applications like Military, Environmental, Health, Vehicular, Mechanical stress levels on attached objects, disaster management etc. Wireless sensor networks are callously restricted by storage capacity, energy and computing power. So it is essential to design an energy efficient aware protocol in order to augment the network lifetime. WSN also has the influencing features to perform remote communication, it is also shrouded with various loopholes in its precise operation, where majority of the communication issues are raised from deployment of existing standards of routing protocols and algorithm. Sensors are expected to be remotely deployed in unnoticed environments. Routing as one key technologies of wireless sensor network has now become very important research work because the applications of WSN is everywhere, it is impractical that there is a routing protocol suitable for all applications. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs like Multipath Multispeed Protocol (MMSPEED), Braided Multipath Routing Protocol, Energy-Aware Routing to improve network performance are also discussed. Massive research work has already been carried out in past to introduce some of the effective routing protocols to enable robust communication system in WSN. Advantages and disadvantages of each routing algorithm are discussed thereafter. This paper also discusses the critical open issues that are yet to be solved. This paper compares and summarizes the performances of routing protocols.

In real-life applications of wireless sensor networks (WSNs), optimization of the network operation is required to extend its lifetime. A framework is proposed that enables practical development of centralized cluster-based protocols supported by optimization methods for the WSNs. Based on this framework, a protocol using harmony search algorithm (HSA), a music-based meta-heuristic optimization method, is designed and implemented in real time for the WSNs. It is expected to minimize the intra-cluster distances between the cluster members and their cluster heads (CHs) and optimize the energy distribution of the WSNs. The study of HSA cluster-based protocol is carried out in a real case where the WSNs equipped with the proposed protocol are deployed in an indoor environment to monitor the ambient temperature for fire detection. A comparison is made with the well-known cluster-based protocols developed for WSNs such as low-energy adaptive clustering hierarchy-centralized (LEACH-C) and a cluster-based protocol using Fuzzy C-Means (FCM) clustering algorithm. Experimental results demonstrate that the proposed protocol using HSA can be realized in centralized cluster-based WSNs for safety and surveillance applications in building environments. From the obtained experimental test results, it can be seen that the WSNs lifetime has been extended using the proposed HSA protocol in comparison with that of LEACH-C and FCM protocols.