Search

Recently, there has been a focus on the significance of swarm intelligenceinspired routing algorithms for achieving optimum solutions in biologically inspired wireless sensor networks (WSNs). These protocols depict a network of wireless mobile nodes forming an infrastructure that is agile, dynamic, and independent of a central administrative facility. Among the challenges faced by bio-inspired WSNs, mobility awareness and excessive energy consumption (EC) stand out as significant hurdles, particularly in dynamic models with intermittent connections. This project seeks to tackle these obstacles by deploying the hybrid energy efficiency (HEED) approach to distributed clustering for network system cluster formation, along with fusion routing protocol of particle swarm optimization (PSO) and PIO to select cluster-heads and optimize solutions in bio-inspired WSNs. The success of the suggested approach is assessed using a variety of criteria, such as energy usage, rate of packet delivery, EC, and routing overhead and network lifetime. The methods like ad hoc on-demand distance vector's (AODV) and ant colony optimization (ACO) methods are employed in the testing and validation. In comparison to the reactive AODV routing protocol and ACO, the suggested routing protocol (HPSOPIO) reduces energy usage and increases network lifespan. [ABSTRACT FROM AUTHOR]

This paper presents a survey on the MAC and network layer of Wireless Sensor Networks. Performance requirements of the MAC layer are explored. MAC layer protocols for battery-powered networks and energy harvesting-based networks are discussed and compared. A detailed dis- cussion on design constraints and classification of routing protocols is presented. Several routing protocols are compared in terms of such parameters as: energy consumption, scalability, network lifetime and mobility. Problems that require future research are presented. The cross-layer approach for WSNs is also surveyed. [ABSTRACT FROM AUTHOR]

In the current research on data query for two-tiered WSN, the privacy-preservation range query is one of the hotspots. However, there are some problems in the existing researches in two-tiered wireless sensor networks such as high computational and communication costs for security comparison items and high energy consumption of sensing nodes. In this paper, a privacy-preservation range query protocol based on the integration reversal 0-1 encoding with Bloom filter is researched and designed. In the sensing data submission stage, the optimized reversal 0-1 encoding, HMAC algorithm, AES encryption algorithm and variable-length Bloom filter are used for generating the maximum–minimum comparison encoding and constructing a shorter verification index chain to reduce computational and communication costs of sensing nodes; in the private data range query stage, the base station uses the HMAC algorithm to convert the plaintext query range into the ciphertext query range and sends it to the storage node. In the storage node, the bitmap encoding information of the verification index chain is calculated with the comparison rule of the reversal 0-1 encoding and it is returned to the base station together with the verification index chain and the data ciphertext that compliance with the query rule; in the data integrity verification stage, the integrity of the query results using the verification index chain and bitmap encoding is verified at the base station. In the experimental section, the Cortex-M4 development board equipped with the Alios-Things operating system as sensing node and the Cortex-A9 development board equipped with the Linux operating system as storage node are implemented in this protocol, which is compared with the existing protocols in three aspects: the number of data collected in each cycle, the length of data and the number of data dimensions. The experimental results show that the energy consumption of this protocol is lower under the same experimental environment. [ABSTRACT FROM AUTHOR]

Introduction-- Smart irrigation systems require reliable and energy-efficient communication between the sensors in a Wireless Sensor Network (WSN) and the control system. Objective-- To address this challenge, this paper presents several cluster-based selection protocols, based on the Stable Election Protocol (SEP) and Distributed Energy-Efficient Clustering (DEEC). Methodology-- The presented protocols divide the agriculture field into sub-fields to reduce energy consumption between far sensors and the Base Station (BS). Results-- Comparison with traditional protocols using evaluation metrics such as network throughput, stability, instability period, and lifetime, shows that the presented protocols outperform in terms of all metrics. Conclusions-- The results indicate the effectiveness of the proposed protocols in prolonging the network's lifetime and improving energy efficiency in heterogeneous WSNs, thus supporting the performance of smart irrigation systems. Numerically, using the proposed protocols, the network lifetime increased by 23% compared to conventional SEP. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks consist of a number of low cost, small sensor nodes powered by energy constrained batteries. Due to limited power, memory, and processing capacities of sensor nodes, it is essential to find new methods which improves energy consumption of the nodes and prolongs the lifetime of the network. Cluster head election among sensor nodes has an important role in wireless sensor networks to boost efficiency and lifetime of the network. In this study, a cluster head election method has been proposed and evaluated for heterogeneous wireless sensor networks, which extends the lifetime of the network. Simulation results reveal that the proposed cluster head election method offers a better performance than the SEP and LEACH protocols in terms of network lifetime and is able to provide throughput for a longer period of time. It is found that EECHEP provides efficient use of sensor energy and helps increase the number of surviving cluster head nodes that report to the base station. [ABSTRACT FROM AUTHOR]

Acoustic energy mapping provides the functionality to obtain characteristics of acoustic sources, as: presence, localization, type and trajectory of sound sources. Several beamforming-based techniques can be used for this purpose. However, they rely on the difference of arrival times of the signal at each capture node (or microphone), so it is of major importance to have synchronized multi-channel recordings. A Wireless Acoustic Sensor Network (WASN) can be very practical to install when used for mapping the acoustic energy of a given acoustic environment. However, they are known for having low synchronization between the recordings from each node. The objective of this paper is to characterize the impact of current popular synchronization methodologies as part of the WASN to capture reliable data to be used for acoustic energy mapping. The two evaluated synchronization protocols are: Network Time Protocol (NTP) y Precision Time Protocol (PTP). Additionally, three different audio capture methodologies were proposed for the WASN to capture the acoustic signal: two of them, recording the data locally and one sending the data through a local wireless network. As a real-life evaluation scenario, a WASN was built using nodes conformed by a Raspberry Pi 4B+ with a single MEMS microphone. Experimental results demonstrate that the most reliable methodology is using the PTP synchronization protocol and audio recording locally. [ABSTRACT FROM AUTHOR]

The Wireless Sensor Network (WSN) is a network of Sensor Nodes (SN) which adopt radio signals for communication amongst themselves. There is an increase in the prominence of WSN adaptability to emerging applications like the Internet of Things (IoT) and Cyber-Physical Systems (CPS). Data security, detection of faults, management of energy, collection and distribution of data, network protocol, network coverage, mobility of nodes, and network heterogeneity are some of the issues confronted by WSNs. There is not much published information on issues related to node mobility and management of energy at the time of aggregation of data. Towards the goal of boosting the mobility-based WSNs' network performance and energy, data aggregation protocols such as the presently-used Mobility Low-Energy Adaptive Clustering Hierarchy (LEACH-M) and Energy Efficient Heterogeneous Clustered (EEHC) scheme have been examined in this work. A novel Artificial Bee Colony (ABC) algorithm is proposed in this work for effective election of CHs and multipath routing in WSNs so as to enable effective data transfer to the Base Station (BS) with least energy utilization. There is avoidance of the local optima problem at the time of solution space search in this proposed technique. Experimentations have been conducted on a large WSN network that has issues with mobility of nodes. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor networks (UWSNs) contain sensor nodes that sense the data and then transfer them to the sink node or base station. Sensor nodes are operationalized through limited-power batteries. Therefore, improvement in energy consumption becomes critical in UWSNs. Data forwarding through the nearest sensor node to the sink or base station reduces the network's reliability and stability because it creates a hotspot and drains the energy early. In this paper, we propose the cooperative energy-efficient routing (CEER) protocol to increase the network lifetime and acquire a reliable network. We use the sink mobility scheme to reduce energy consumption by eliminating the hotspot issue. We have divided the area into multiple sections for better deployment and deployed the sink nodes in each area. Sensor nodes generate the data and send it to the sink nodes to reduce energy consumption. We have also used the cooperative technique to achieve reliability in the network. Based on simulation results, the proposed scheme performed better than existing routing protocols in terms of packet delivery ratio (PDR), energy consumption, transmission loss, and end-to-end delay. [ABSTRACT FROM AUTHOR]

Serverless computing is a new concept as cloud computing, which dynamically manages the networks and is applied in Serverless Wireless Sensor Networks (SWSN) to help the networks. These networks are becoming famous for monitoring various physical and environmental factors. Serverless computing also facilitates the networks by offering an extensive range of applications. Different applications have been designed for monitoring purposes where the sensor nodes sense the data and transmit it to the base station through single or multi-hop routing. However, existing routing protocols cannot manage the sensor nodes' energy issues because of the complex routing processes and depleted their power before their time. Because of these limitations, the nodes close to BS continuously rely on the network for data forwarding. As a result, these nodes cause energy consumption and lead to a useless state. This paper proposes a serverless architecture and designs an Enhanced Centroid-based Energy Efficient Clustering (ECEEC) protocol for SWSN networks. The proposed serverless architecture provides automated scalability, cost-effective services, and stateless execution. In addition, the proposed protocol offers the cluster head selection and its rotation to maximize the energy efficiency in the network. Furthermore, gateway nodes are chosen in every cluster to overcome the load on the cluster head. Simulation results indicated the excellent performance of the proposed protocol as compared to the existing routing protocols concerning network lifetime and energy consumption. The proposed protocol shows better reliability with nodes failing at 650 rounds compared to 600 rounds, especially with 5 % and 10 % Cluster Heads. The proposed protocol exhibits superior energy efficiency consumption of SNs under varying CH percentages, indicating the protocol's consistent performance across different scenarios. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Clustering is one of the most energy-efficient techniques for extending the lifetime of wireless sensor networks (WSNs). In a clustered WSN, each sensor node transmits the data acquired from the sensing field to the leader node (cluster head). The cluster head (CH) is in charge of aggregating and routing the collected data to the Base station (BS) of the deployed network. Thereby, the selection of the optimum CH is still a crucial issue to reduce the consumed energy in each node and extend the network lifetime. To determine the optimal number of CHs, this paper proposes an Enhanced Fuzzy-based LEACH (E-FLEACH) protocol based on the Fuzzy Logic Controller (FLC). The FLC system relies on three inputs: the residual energy of each node, the distance of each node from the base station (sink node), as well as the node's centrality. The proposed protocol is implemented using the Castalia simulator in conjunction with OMNET++, and simulation results indicate that the proposed protocol outperforms the traditional LEACH protocol in terms of network lifetime, energy consumption, and stability. [ABSTRACT FROM AUTHOR]

In this paper, a Duty Cycling Centralized Hierarchical Protocol (DCCHP) has been proposed for wireless sensor networks. DCCHP is an energy efficient protocol that prolongs the lifetime of the network by applying a duty cycling mechanism named DCM that chooses the nodes that send unimportant data in a certain epoch to be candidates to be put to sleep. But if the proposed equations for choosing the cluster head nodes put any of them in a high priority it works in the active mode. When comparing DCCHP to the previously proposed LEACH-CS, LEACH-C protocols, using a simulation study, DCCHP in average extends the network lifetime 50% more than LEACH-CS and about 60% more than LEACH-C across a different number of nodes in the network scaled up to 1000 nodes. That is because DCCHP chooses the definite number of nodes of unimportant data to be switched to sleeping mode unlike LEACH-CS and unlike LEACH-C which keeps all nodes in active mode. Also an analytical study of energy consumption proves that DCCHP preserves energy consumption more than LEACH-CS and DCCHP. DCCHP has been proposed for applications with scarce resources. [ABSTRACT FROM AUTHOR]

APTEEN is a typical routing protocol for wireless sensor networks, but when clustering, cluster heads are randomly selected, which makes it easy to select nodes with low residual energy as cluster heads, thus forming network holes. At the same time, in multi hop transmission, the cluster head near the sink node is overloaded due to forwarding a large amount of data. Aiming at these problems, this paper introduces PSO algorithm and proposes ADCH-EPE-APTEEN routing protocol. In order to make the particle swarm optimization algorithm more suitable for routing protocol, this paper first proposes DCA-PSO based on particle swarm optimization algorithm. DCA-PSO uses the classification adaptive change inertia weight for different states of particles in the optimization process. At the same time, dynamic learning factor is used to improve the influence of particle experience and other particle experience on convergence speed and to improve the optimization accuracy and speed of the algorithm. Secondly, when APTEEN routing protocol is networked, the cluster head is selected by DCA-PSO, in which the residual energy of nodes, the location of nodes, and the energy distribution around nodes are fully taken into consideration. Thirdly, considering the distance between nodes and the sink node, the residual energy and the energy distribution around nodes, a front area is set up in the cluster located in the upper half and the assistant cluster head is selected in the front area through the DCA-PSO algorithm. The simulation results show that the DCA-PSO algorithm can significantly improve the search speed and precision compared with the PSO algorithm. Compared with APTEEN routing protocol, the ADCH-EPE-APTEEN routing protocol can reduce the network energy consumption rate and extend network lifetime by 173%. [ABSTRACT FROM AUTHOR]

IEEE 802.15.4 protocol is intended to accomplish the characteristics of low power and low rate Wireless Sensor Network. It employs carrier sense multiple access with collision avoidance (CSMA/CA) protocol to access the network using either unslotted or slotted mode. This paper concentrates on the unslotted CSMA/CA where the node tends to wait for a very limited backoff exponent value, and cannot perform clear channel assessment until backoff procedure is completed. Therefore, the collision probability and the average delay are high. To enhance the unslotted CSMA/CA performance, this paper proposes a modified unslotted CSMA/CA that divides the backoff delay into Main Backoff and Secondary Backoff. The Markov model for the modified CSMA/CA is presented to assess a single hop IEEE 802.15.4 behavior, and derive expressions for average delay, energy consumption and reliability. An optimization problem is also presented to minimize the delay while guaranteeing energy consumption and reliability constraints for the modified CSMA/CA. OPNET simulation tool is applied to compare the modified to the standard unslotted CSMA, and to validate the Markov model proposed. The results demonstrate that the modified CSMA improves the reliability, while reducing the average delay significantly. [ABSTRACT FROM AUTHOR]

As the use of Wireless Sensor Networks grows, many challenging issues with these networks arise. The utilization of power consumption is one of the most significant issue due to the limited energy constraints of the individual sensor nodes. This limitation imposes a challenge to design the best energy-efficient routing mechanism. This work presented an Energy-Efficient Gossiping protocol (EEGossip) that routes data to the sink by choosing the optimal next node. EEGossip uses Chebyshev distance, residual energy and the sink distance as factors when determining the optimal next node. The result of the proposed work has shown that the proposed protocol improves the total energy consumption of the network and leverages the network lifetime since it decreases the computational overhead and ensures that the best next node is chosen. [ABSTRACT FROM AUTHOR]

In wireless sensor network, replacement of node's battery is very tough task in hostile environments. Therefore, to maximize network lifetime is the ultimate solution. Dividing the sensing region of wireless sensor network into clusters is an excellent approach to gain high energy efficiency and to enhance lifetime of the network. On the other hand, heads of the cluster need additional energy because of additional work such as obtaining data from its member nodes, aggregation of their data, and finally sending it to the base station. To enhance the lifetime of these networks, proper selection of heads plays a vital role. In this paper, we propose proficient bee colony-clustering protocol (PBC-CP) which is based on artificial bee colony algorithm. In PBC-CP approach, we have taken important factors for selection of heads such as node's energy, degree of node, and distance from base station to node. For transmitting the data from cluster head to base station, it chooses the energy-efficient path which further minimizes the energy consumption of sensor network. Simulation experiments show the effectiveness of our proposed approach. [ABSTRACT FROM AUTHOR]

Nodes in original S-MAC protocol just can visit the channel in the scheduling and listening stage. The working schema may result in data latency and high conflict. To solve those above problems, we split scheduling duty into multiple micro-duties. By using different micro-dispersed contention channel, the sensor nodes reduce the collision probability of the data. Aiming at detecting the fixed duty cycle in S-MAC protocol, on the basis of the micro-duty and buffer queue length, this paper presents an adaptive duty cycle and back-off algorithm. While using different back-off algorithm with different duty cycles, sensor node Fast-Binary Exponential Backoff and Conflict-Avoid-Binary exponential Backoff algorithm separated are applied to reduce data latency further reduce the conflict probability. Combining both of the improvements, we propose a modified S-MAC protocol. Comparing the performance of S-MAC protocol and Division-Multiple Access-Media Access Control (MDA-SMAC) protocol on the NS-2 simulation platform, the results show that MDA-SMAC protocol performs better in terms of energy consumption, latency, and effective throughput than S-MAC protocol [ABSTRACT FROM AUTHOR]

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments. [ABSTRACT FROM AUTHOR]

Artificial bee colony or ABC is an interesting meta-heuristic algorithm designed to solve various continuous optimization problems. However, it cannot be directly applied to solve discrete problems such as clustering of sensor nodes in the wireless sensor networks (WSNs). For this purpose, in this paper, we present a chaotic discrete version of the ABC algorithm, denoted as chaotic discrete ABC (CDABC). By using the CDABC algorithm, we propose a novel clustering protocol that can be used to organize WSNs into multiple levels of clusters to reduce their energy consumption. The main objective of this protocol is to improve WSN's lifetime by selecting appropriate nodes as cluster heads in each clustering level and reducing the energy costs of the inter-cluster and intra-cluster communications. Extensive simulations results validate the effectiveness of the proposed CDABC-based multi-level clustering protocol in improving the network lifetime. [ABSTRACT FROM AUTHOR]

Achieving reliable and energy-saving broadcast is the main issue discussed in this study. Firstly, a multi-hop broadcast model is introduced, and the energy consumption and reliability of the network are defined in this study. Then five broadcast-based automatic repeat request (ARQ) protocols (automatic retransmission N times, stop-and-wait end-to-end-ARQ, stop-and-wait hop-by-hop-ARQ, stop-and-wait hop-by-hop oriented implicit ARQ, stop-and-wait hop-by-hop implicit and explicit ARQ) are proposed to realise the reliable transmission. Secondly, based on five protocols, the relationship between the system reliability and the number of retransmissions of the root node is established analytically, and the maximum number of retransmissions is solved under the required system reliability. Thirdly, the energy consumptions of the root node are calculated, and then the analytical expressions of the minimum system energy consumption are obtained separately according to five broadcast-based retransmission mechanisms. Finally, the relationships between the maximum number of retransmissions, energy consumption and reliability, the broadcast probability and feedback probability are discussed in the numerical analysis. Specially, for better energy-saving, the modulation technique should be adopted to choose suitable protocol based on a dynamic hop threshold. [ABSTRACT FROM AUTHOR]

WSN became a key technology for ubiquitous living and remains an active research due to wide range of applications. Energy awareness is a critical design issue in WSN. Clustering is the most popular energy efficient technique and provides various advantages like energy efficiency, lifetime, scalability and less delay; but it leads to hot spot problem. To overcome this, unequal clustering is proposed. In unequal clustering, the cluster size varies proportionally to the distance to Base Station (BS). Absence of recent and detailed survey papers in unequal clustering approaches stimulated us to perform this study. In this paper, a comprehensive survey of various unequal clustering approaches with their objectives, characteristics etc., is presented. Also, the classifications of unequal clustering approaches are made and compared based on various cluster properties, Cluster Head (CH) properties and clustering process. [ABSTRACT FROM AUTHOR]

The Low-Efficiency Adaptive Clustering Hierarchical (LEACH) protocol, a hierarchical routing protocol, has the advantage of simple implementation and can effectively balance network loads. However, to date there has been a lack of consideration for its use in heterogeneous energy network environments. To solve this problem, the Energy-Coverage Ratio Clustering Protocol (E-CRCP) is proposed, which is based on reducing the energy consumption of the system and utilizing the regional coverage ratio. First, the energy model is designed. The optimal number of clusters is determined based on the principle of "minimum energy consumption", and the cluster head selection is based on the principle of "regional coverage maximization". In order to balance the network load as much as possible, in the next iteration of cluster head selection, the cluster head with the lowest residual energy and the highest energy consumption is replaced to prolong the network's life. Our simulated results demonstrate that the proposed method has some advantages in terms of longer network life, load balancing, and overall energy consumption in the environment of a heterogeneous energy wireless sensor network. [ABSTRACT FROM AUTHOR]

A Wireless Sensor Network comprises many small wireless nodes that helps to sense, gather, process and communicate. One of its primary concerns is to optimize the consumption of energy and extend the network lifespan. The sensor nodes can be clustered to increase its lifespan further and this can be accomplished by choosing cluster head for every cluster and by performing data fusion on the cluster head (CH). The proposed system is using an energy efficient hierarchical routing protocol named Energy Optimized Dynamic Clustering (EODC) for clustering large ad-hoc WSNs and direct the data to reach the sink. The collected data is received by the sink from the set of cluster heads after every round. The cluster head is selected using the Particle Swarm Optimization (PSO) approach; the allocation of cluster members is based on the Manhattan distance. The metrics used to find the fitness function are location, link quality, energy of the active and inactive nodes. The system employs the shortest path approach to communicate between the cluster heads till it reaches the base station. By this, the energy efficiency and network lifetime have been increased. The analysis and outcomes show that the EODC was found to outperform the existing protocol which compares with this algorithm. [ABSTRACT FROM AUTHOR]

As the use of Wireless Sensor Networks grows, many challenging issues with these networks arise. The utilization of power consumption is one of the most significant issue due to the limited energy constraints of the individual sensor nodes. This limitation imposes a challenge to design the best energy-efficient routing mechanism. This work presented an Energy-Efficient Gossiping protocol (EEGossip) that routes data to the sink by choosing the optimal next node. EEGossip uses Chebyshev distance, residual energy and the sink distance as factors when determining the optimal next node. The result of the proposed work has shown that the proposed protocol improves the total energy consumption of the network and leverages the network lifetime since it decreases the computational overhead and ensures that the best next node is chosen. [ABSTRACT FROM AUTHOR]

Abstract Mobile sink has been used by many routing algorithms to improve the network lifetime in wireless sensor networks. Sink mobility brings new challenges to the sensor network. It suggests that sink position is continuously propagated through the network area to keep all sensor nodes updated with the direction of forwarding data to the sink. Unfortunately, frequent sink position updates can lead to both high-energy consumption and increased collisions in the network. In this paper, a new routing algorithm for wireless sensor networks is proposed, which uses a virtual multi-ring shaped infrastructure to advertise the mobile sink position to the network. In addition, the proposed algorithm supports several mobile sinks in the network. Simulation results indicate that the proposed algorithm reduces energy consumption and delay, and prolongs the sensor network lifetime when compared with the other similar algorithms. [ABSTRACT FROM AUTHOR]

The evolution of Wireless Sensor Networks has led to the development of protocols that must comply with their new restrictions while being efficient in terms of energy consumption and time. We focus on a collision resolution protocol, the so-called Two Cell Sorted (2CS-WSN). We propose three different ways to improve its performance by minimizing the collision resolution time or the energy consumption. After evaluating these proposals and carrying out the comparison with the original protocol, we recommend an improvement to the protocol which reduces the elapsed time by early 8% and the number of retries and conflicts more than 40%. [ABSTRACT FROM AUTHOR]

In this paper, with an objective to increase stable region of WSN, stability enhancement for LEACH (SE-LEACH) protocol is propound which is capable of balancing the load ensuring all nodes dissipate power in similar fashion. Since best candidate selection is utmost requirement to play the role of cluster head, the selection criteria considers node density, residue energy, farness from base station & power dissipation if chosen as cluster head. Also, non-cluster head nodes elect their cluster head on the basis of residual energy, node density, the power it will dissipate during the round and distance to that cluster head. Simulation experiments are performed for two cases wherein a base station is kept at the center of the network in one hand and at far off distance on the other hand. Simulation results are compared with LEACH and MODLEACH which validate the extension of stability region and exhibit load balanced network for proposed protocol. [ABSTRACT FROM AUTHOR]

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment. [ABSTRACT FROM AUTHOR]

Nowadays, Wireless Sensor Networks (WSNs) are pondered as an exploration subject. Currently, progress in electronic communications has directed to multi-purpose Sensor Nodes (SNs) with less price and power consumption. Energy efficiency is a major concern in WSNs as the sensor nodes are battery-operated devices. Clustering based techniques are implemented through data aggregation to make equal energy consumption among SNs for energy efficient data transmission. The existing clustering techniques make use of distinct Harmony Search Algorithm (HSA), Low-Energy Adaptive Clustering Hierarchy (LEACH) and Particle Swarm Optimization (PSO) algorithms. However, these algorithms have exploration exploitation trade-off and local search constraint individually. In order to obtain a global search with faster convergence, Efficient Energy Clustering Protocol (EECP) based on Genetic Algorithm (GA) is recently proposed to detect their immediate neighbors, balance energy consumption load among data transmission routes and energy efficient cluster head selection. The proposed algorithm exhibited high search efficiency and dynamic capability that improves lifetime of SNs. The presentation of the proposed algorithm was assessed using throughput, packet delivery ratio, energy consumption and end to end delay. The proposed algorithm showed an improvement in energy consumption and throughput by 95 and 90 Mbps respectively than existing clustering algorithm. [ABSTRACT FROM AUTHOR]

Abstract Wireless Sensor Networks (WSNs) have emerged as one of the prominent area of research in the recent times. Sensor-MAC (S-MAC) protocol is one of the Medium Access Control(MAC)protocols, which follows the idea of periodic listen and sleep. In other words, node is active till the time it receives the data packets, otherwise it goes in sleep mode by turning its radio off. However, this protocol lacks in energy conservation due to unnecessary listening to the channel in idle mode. In this paper, we have proposed a new analytical model in which energy is reduced on the basis of the activities it performs in the active mode. A comparison is made between all the different possibilities which can occur at a node, when it listens unnecessarily to the medium. Various energy consuming modes of S-MAC protocol such as transmission, reception, sensing and listening are considered. The proposed work results in the minimizing the energy and reducing the delay in time as compared to that of basic S-MAC protocol. [ABSTRACT FROM AUTHOR]

Both the backoff time and idle listening are the key issues affecting the performance of wireless sensor networks. Therefore, the energy-efficient and traffic-adaptive Z-medium access control protocol is proposed in this study. Firstly, it avoids idle listening by setting a fixed contention window in single round to effectively improve the fairness in the backoff strategy. At the same time, it ensures the nodes with less residual energy have priority to access channel and realise the load balance. Secondly, the protocol uses the improved explicit contention notification (ECN) mechanism to reduce the energy consumption caused by sending the ECN messages repeatedly in a period of time and prolong the network lifetime. Lastly, the channel flags are introduced at the top of data frames to make an appointment on the channel so as to avoid the idle listening. Simulation results show that, when, compared with other similar algorithms, the collision rate is reduced by at least 14.2%, the time when the first node dies is prolonged by at least 135 rounds, and the average network energy consumption is reduced by at least 23%. [ABSTRACT FROM AUTHOR]

Reducing energy consumption is a key challenge in the design of any routing protocol dedicated to wireless sensor networks (WSNs). In this study, the authors introduce a new low energy consumption protocol based on a cooperative relaying technique. The proposed protocol is called distributed cooperative relaying low energy adaptive clustering hierarchy (DCRLEACH) protocol, and is a way of improving the LEACH protocol. The authors have exploited cooperative relaying transmission techniques, in order to enhance LEACH for large-scale WSNs, whereby, a cluster head cooperates with the most energetic nodes in order to transmit collected data to the sink. To evaluate the energy efficiency of the proposed DCR-LEACH, they derive the expressions of energy consumption by applying a cooperative relaying technique and simulate the DCR-LEACH using NS-2 for three different scenarios. To confirm the efficiency of the DCR-LEACH protocol, they compare the proposed scheme with both LEACH and multi-hop routing LEACH (MR-LEACH) protocols. The experimental results prove that for large-scale WSNs, the performance of DCR-LEACH protocol is better than MR-LEACH and conventional LEACH in terms of network lifetime, energy consumption, and number of data transmission. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) are harshly challenged by limited energy. It’s essential to use available energy in efficient manner to maintain sustainability in networks. Sensor nodes once after deployment start depleting their energy in various roles; some may on sensing; some may on communication, some may on aggregating etc. After intense survey its proven fact that communication is the biggest reason of energy consumption. To reduce communication energy requirements clustering plays a very important role. Clustering employs that only cluster heads will participate for communicating aggregated information to far located base station. Challenge comes when cluster heads are managing both roles as heads as well as relay nodes. The role of relay node may require that they are aggregating and communicating their own data as well as other data received due to multi hop communication. This paper focuses on how relay nodes can strengthen clustering. Cluster Heads can save their energy and have prolonged life if sensor networks are optioned with separate relay nodes. This paper has proposed modified Mutual Exclusive Distributive Clustering (MEDC) protocol along relay node. Proposed solution will work to chase relay nodes different from cluster heads and will improve network lifetime further. [ABSTRACT FROM AUTHOR]

The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained. [ABSTRACT FROM AUTHOR]

This paper presents the design of a wireless sensor network particularly designed for remote monitoring and control of industrial parameters. The article describes the network components, protocol and sensor deployment, aimed to accomplish industrial constraint and to assure reliability and low power consumption. A particular case of study is presented. The system consists of a base station, gas sensing nodes, a tree-based routing scheme for the wireless sensor nodes and a real-time monitoring application that operates from a remote computer and a mobile phone. The system assures that the industrial safety quality and the measurement and monitoring system achieves an efficient industrial monitoring operations. The robustness of the developed system and the security in the communications have been guaranteed both in hardware and software level. The system is flexible and can be adapted to different environments. The testing of the system confirms the feasibility of the proposed implementation and validates the functional requirements of the developed devices, the networking solution and the power consumption management. [ABSTRACT FROM AUTHOR]

Mobile sink groups play crucial roles to perform their own missions in many wireless sensor network (WSN) applications. In order to support mobility of such sink groups, it is important to design a mechanism for effective discovery of the group in motion. However, earlier studies obtain group region information by periodic query. For that reason, the mechanism leads to significant signaling overhead due to frequent flooding for the query regardless of the group movement. Furthermore, the mechanism worsens the problem by the flooding in the whole expected area. To deal with this problem, we propose a novel mobile sink group support scheme with low communication cost, called Region-Shift-based Mobile Geocasting Protocol (RSMGP). In this study, we utilize the group mobility feature for which members of a group have joint motion patterns. Thus, we could trace group movement by shifting the region as much as partial members move out of the previous region. Furthermore, the region acquisition is only performed at the moment by just deviated members without collaboration of all members. Experimental results validate the improved signaling overhead of our study compared to the previous studies. [ABSTRACT FROM AUTHOR]

Fuel utilization efficiency and cost reduction are two major goals in designing in-vehicle networks. Aiming to address these two issues, we investigate in-vehicle networking protocols from both wired and wireless perspectives by first presenting representative solutions in each area, then identifying the challenges to current solutions, and finally advocating the use of the automotive Ethernet. Also, we propose a priority-based scheduler for the automotive Ethernet. Our preliminary experiments show that the proposed scheduler is effective and flexible, and thus is applicable to next-generation in-vehicle networks. We hope that further studies in this area can be inspired by our work and will be forthcoming in years to come. [ABSTRACT FROM AUTHOR]

Power consumption is a primary interest in Wireless Sensor Networks (WSNs), and a large number of strategies have been proposed to evaluate it. However, those approaches usually neither consider reliability issues nor the power consumption of applications executing in the network. A central concern is the lack of consolidated solutions that enable us to evaluate the power consumption of applications and the network stack also considering their reliabilities. To solve this problem, we introduce a fully automatic solution to design power consumption aware WSN applications and communication protocols. The solution presented in this paper comprises a methodology to evaluate the power consumption based on the integration of formal models, a set of power consumption and reliability models, a sensitivity analysis strategy to select WSN configurations and a toolbox named EDEN to fully support the proposed methodology. This solution allows accurately estimating the power consumption of WSN applications and the network stack in an automated way. [ABSTRACT FROM AUTHOR]

Wireless sensor network WSN consists of small sensor nodes with limited resources, which are sensing, gathering and transmitting data to base station. Sensors of various types are deployed ubiquitously and widely in varied environments for instance, wildlife reserves, battlefields, mobile networks and office building. Sensor nodes are having restricted and non replenishable power resources and this is regarded as one of the main of their critical limits. All applied techniques and protocols on sensor nodes must take into consideration their power limitation. Data aggregation techniques are used by sensor nodes in order to minimize the power consumption by organizing the communication among sensor nodes and eliminating the redundant of sensed data. This paper proposed lightweight modification on data aggregation technique named Energy Aware Distributed Aggregation Tree EADAT. The main principle of this development is using the available information in sensor nodes to pass the role of parent node among sensor nodes in each cluster. The process of passing parent node role is based on nominating the sensor nodes which have higher power on regular bases. A model based on tree network architecture is designed for validation purpose and is used with NS2 simulator to test the proposed development. EADAT and EADAT with proposed development are applied on the designed model and the results were promising. [ABSTRACT FROM AUTHOR]

Establishing a unified time reference may be required for the operation of Wireless Sensor Networks (WSNs). Such a requirement may be imposed by the management strategy in the network, e.g., using time based medium access arbitration, or simply due to the dynamic nature of the application, e.g. target tracking. Contemporary clock synchronization protocols introduce significant messaging overhead and thus do not suit the resource-constrained WSNs. In the paper, we propose a novel solution called Synchronization through Piggybacked Reference Timestamps (SPiRT). SRiRT exploits the popularity of two-tier network architectures in WSN, where nodes are grouped into disjoint clusters. Each cluster-head synchronizes its clock to that of a reference node in the network through message exchange. Since cluster members can overhear the cluster-head transmissions, SPiRT takes advantages of such synchronization traffic to adjust the clock of the cluster members. SPiRT calls for appending the reference timestamps in the cluster-head messages so that a cluster member can estimate their clock adjustment. This cuts on energy consumption and increases the synchronization efficiency of SPiRT. We further propose an extension of SPiRT (E-SPiRT) that operates over multi-hop in order to achieve network-wide (global) synchronization. SPiRT and E-SPiRT are validated through simulation and implementation on a Micaz based testbed. The validation results confirm the effectiveness of SPiRT and E-SPiRT and show that they outperform competing schemes in the literature. [ABSTRACT FROM AUTHOR]

Designing a Wireless Sensor Network (WSN) to achieve a high Quality of Service (QoS) (network performance and durability) is a challenging problem. We address it by focusing on the performance of the 802.15.4 communication protocol because the IEEE 802.15.4 Standard is actually considered as one of the reference technologies in WSNs. In this paper, we propose to control the sustainable use of resources (i.e., energy consumption, reliability and timely packet transmission) of a wireless sensor node equipped with photovoltaic cells by an adaptive tuning not only of the MAC (Medium Access Control) parameters but also of the sampling frequency of the node. To do this, we use one of the existing control approaches, namely the viability theory, which aims to preserve the functions and the controls of a dynamic system in a set of desirable states. So, an analytical model, describing the evolution over time of nodal resources, is derived and used by a viability algorithm for the adaptive tuning of the IEEE 802.15.4 MAC protocol. The simulation analysis shows that our solution allows ensuring indefinitely, in the absence of hardware failure, the operations (lifetime duration, reliability and timely packet transmission) of an 802.15.4 WSN and one can temporarily increase the sampling frequency of the node beyond the regular sampling one. This latter brings advantages for agricultural and environmental applications such as precision agriculture, flood or fire prevention. Main results show that our current approach enable to send more information when critical events occur without the node runs out of energy. Finally, we argue that our approach is generic and can be applied to other types of WSN. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network consists of large number of nodes densely deployed in ad hoc manner. Usually, most of the application areas of WSNs require two-dimensional (2D) topology. Various emerging application areas such as airborne networks and underwater wireless sensor networks are usually deployed using three-dimensional (3D) network topology. In this paper, a static 3D cluster-based network topology has been proposed for airborne networks. A network protocol stack consisting of various protocols such as TDMA MAC and dynamic routing along with services such as time synchronization, Cluster Head rotation, and power level management has been proposed for this airborne network. The proposed protocol stack has been implemented on the hardware platform consisting of number of TelosB nodes. This 3D airborne network architecture can be used to measure Air Quality Index (AQI) in an area. Various parameters of network such as energy consumption, Cluster Head rotation, time synchronization, and Packet Delivery Ratio (PDR) have been analyzed. Detailed description of the implementation of the protocol stack along with results of implementation has been provided in this paper. [ABSTRACT FROM AUTHOR]

Underwater sensor networks have enabled a new era in scientific and industrial underwater monitoring and exploration applications. However, these networks are energy-constrained and, more problematically, energy-hungry, as a consequence of the use of underwater acoustic links. In this work, we thoroughly review potential techniques for greening underwater sensor networks. In a top-down approach, we discuss the principal design and challenges of the appealing highlighted techniques. We also exemplify their use by surveying recent proposals in underwater sensor networks. Finally, we describe potential future research directions for energy conservation in underwater networks. [ABSTRACT FROM PUBLISHER]

Cyber-physical systems (CPSs) have recently become an important research field not only because of their important and varied application scenarios, including transportation systems, smart homes, surveillance systems, and wearable devices but also because the fundamental infrastructure has yet to be well addressed. Wireless sensor networks (WSNs), as a type of supporting infrastructure, play an irreplaceable role in CPS design. Specifically, secure communication in WSNs is vital because information transferred in the networks can be easily stolen or replaced. Therefore, this paper presents a novel distributed low-storage clone detection protocol (LSCD) for WSNs. We first design a detection route along the perpendicular direction of a witness path with witness nodes deployed in a ring path. This ensures that the detection route must encounter the witness path because the distance between any two detection routes must be smaller than the witness path length. In the LSCD protocol, clone detection is processed in a nonhotspot region where a large amount of energy remains, which can improve energy efficiency as well as network lifetime. Extensive simulations demonstrate that the lifetime, storage requirements, and detection probability of our protocol are substantially improved over competing solutions from the literature. [ABSTRACT FROM AUTHOR]

Opportunistic routing is a new paradigm in routing for wireless sensor network which chooses the node closest to the target node for forwarding the data. It uses the broadcasting nature of wireless sensor networks. Opportunistic routing has increased the efficiency, throughput and reliability of sensor networks. Many energy saving techniques has been introduced using opportunistic routing in wireless sensor networks for increasing the network lifetime. In this article we have elaborated the basic concept of Opportunistic routing, different areas in which it has been claimed to be beneficial, some protocols their metrics and their drawbacks. [ABSTRACT FROM AUTHOR]

Target tracking applications in wireless sensor networks need to achieve energy efficiency, tracking accuracy, and certain real-time constraints in response to fast-moving targets. From a layer view, an energy-efficient cross-layer communication protocol that consists of a medium access control layer and network routing layer is necessary for joint optimization. Due to the interference and contention over the wireless medium, the limited resources of battery-operated sensor nodes, and the dynamic topology of large-scale networks, this cross-layer design becomes a challenging task. In this research, we exploit a cluster routing algorithm over large-scale networks and propose a low-duty-cycle medium access control (MAC) algorithm to reduce collision, idle-listening, and overhearing. In addition, our work focuses on the joint optimization of routing and a MAC strategy for achieving a good trade-off between low delay, energy efficiency, and tracking accuracy. To deploy this protocol in a real tracking application, we also propose a clustering synchronization procedure that does not require distributing the global timing information over the complete network to achieve network-wide time synchronization. An analytical model and extensive simulations are proposed to evaluate and compare the performance of our work with existing protocols. Simulation and analysis results show that our approach achieves better communication delay and thus better tracking error while maintaining reasonable energy consumption compared to other cases. [ABSTRACT FROM AUTHOR]

In wireless sensor networks applications, events occur occasionally; therefore, the design of protocols has been focused on saving energy mainly. As consequence of this protocol design strategy most of these energy-efficient protocols limit the use of wireless sensor networks to those applications where a fast response time and the bandwidth are not important. This paper proposes the LEMR-multichannel protocol (Latency, Energy, MAC and Routing, for its acronym in English). LEMR-multichannel is a communication protocol based on a multilayer design which involves the physical, medium access and network layer, which not only preserves the energy efficiency of current protocols but also coordinates the transfer of packets from source to destination in such a way that the network performance in terms of bandwidth, delay and jitter is improved significantly. The LEMR-multichannel superiority in terms of these variables is shown when it is compared with other well-known protocols (TMAC and YMAC), through several simulation experiments. [ABSTRACT FROM AUTHOR]

Duty cycling mode is widely adopted in wireless sensor networks to save energy. Existing duty-cycling protocols cannot well adapt to different data rates and dynamics, resulting in a high energy consumption in real networks. Improving those protocols may require global information or heavy computation and thus may not be practical, leading to many empirical parameters in real protocols. To fill the gap between the application requirement and protocol performance, in this paper, we analyze the energy consumption for duty cycled sensor networks with different data rates. Our analysis shows that existing protocols cannot lead to an efficient energy consumption in various scenarios. Based on the analysis, we design a light-weight adaptive duty-cycling protocol (LAD), which reduces the energy consumption under different data rates and protocol dynamics. LAD can adaptively adjust the protocol parameters according to network conditions such as data rate and achieve an optimal energy efficiency. To make LAD practical in real network, we further pre-calculate optimal parameters offline and store them on sensor nodes, which significantly reduces the computation time. We theoretically validate the performance improvement of the protocol. We implement the protocol in TinyOS and extensively evaluate it on 40 TelosB nodes. The evaluation results show the energy consumption can be reduced by 28.2-40.1 percent compared with state-of-the-art protocols. Results based on data from a 1,200-node operational network further show the effectiveness and scalability of the design. [ABSTRACT FROM AUTHOR]

Overall energy of network is a major issue in current sensor network. This paper proposes (GDCP) GPS (Global Positioning System) based reactive communication protocol for Static WSN (Wireless Sensor Network) to extend the life time of entire network. In GDCP, energy efficient routing is achieved using local communication among sensor nodes. While routing, packets are routed via reliable shortest path from source node to sink node. The shortest path is determined with the help of a Neighbouring Table (NT) of a node. This table stores information such as location, distance to neighbour node and distance to a sink node. If the neighbouring node has sufficient energy and its distance to a sink node is less than other neighbours then it becomes the receiver and packet forwards to neighbour node. After receiving the packet, receiver becomes sender node and it checks its neighbouring table for minimum sink node's distance and sufficient energy. This process continues till the packet reaches the sink node. Sink node is assumed to move from one location to another as its neighbour node's energy becomes less than threshold energy. Energy consumption is analysed on 100 static sensor nodes and one sink node. A simulated result shows that overall energy of network is improved. [ABSTRACT FROM AUTHOR]

Opportunistic forwarding has emerged as a promising technique to address the problem of unreliable links typical in wireless sensor networks and improve energy efficiency by exploiting multiuser diversity. Timer-based solutions, such as timer-based contention, form promising schemes to allow opportunistic next hop relay selection. However, they can incur significant idle listening and thus reduce the lifetime of the network. To tackle this problem, we propose to exploit emerging wake-up receiver technologies that have the potential to considerably reduce the power consumption of wireless communications. A careful design of MAC protocols is required to efficiently employ these new devices. In this work, we propose Opportunistic Wake-Up MAC (OPWUM), a novel multihop MAC protocol using timer-based contention. It enables the opportunistic selection of the best receiver among its neighboring nodes according to a given metric (e.g., the remaining energy), without requiring any knowledge about them. Moreover, OPWUM exploits emerging wake-up receivers to drastically reduce nodes power consumption. Through analytical study and exhaustive networks simulations, we show the effectiveness of OPWUM compared to the current state-of-the-art protocols using timer-based contention. [ABSTRACT FROM AUTHOR]