Multi-hop Wireless Sensor Networks Research Articles

Opportunistic Fountain Coding With Coordinative Routing

Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected transmission counts (ETX) performance and to reduce computational complexity of fountain decoding at each relay in multi-hop wireless sensor networks. The full recovery in existing cooperative fountain coded networks is replaced by a new partial decoding and recoding mechanism in which both the recovered and the unrecovered packets at the intermediate nodes are considered as recoding candidates. Numerical results show that the proposed algorithm is superior to the existing opportunistic routing-based fountain code schemes.

An improved routing protocol for raw data collection in multihop wireless sensor networks

Wireless sensor networks (WSNs) are an effective and efficient method for collecting data from a target area, and prolonging the lifetime of WSNs has been a focus of scientific research due to the limited energy of sensor nodes. However, traditional studies of WSNs are based on the assumption that WSNs collect aggregated data with redundant sensor nodes in an ideal radio environment. These assumptions may not be acceptable in practical applications. To address this problem, this paper introduces a novel application scenario for WSNs in which raw data are collected by a multihop network without redundant sensor nodes, and a new hybrid tree-based and cluster-based routing protocol for raw data collection (HTC-RDC) is proposed to prolong the lifetime of WSNs that can work in novel application scenarios. The experimental results demonstrate that the proposed HTC-RDC enables the WSNs to achieve their expected functions and prolongs the network lifetime by an average of 11.4% compared to the existing protocols in the explored application scenario.

ICIC: A Dual Mode Intra-Cluster and Inter-Cluster Energy Minimization Approach for Multihop WSN

Energy minimization is one of the paramount issues in designing of the wireless sensor network and becomes more complex for multi-hop transmission. Furthermore, selection of multi hop route for the packets transmission is also a tedious task. In this paper, we propose an intra-cluster and inter-cluster (ICIC) energy minimization strategy for multihop wireless sensor network (WSN). In the proposed strategy, in intra cluster communication, a dynamic duty cycle allocation based on the cluster head (CH) node distance from the child nodes for the energy minimization is presented. In the inter cluster communication, minimum energy consumption route is chosen for the transmission of packets to base station (BS). The proposed strategy is compared with four state of the art techniques i.e., HEEMP, LEACH, MLEACH, and SEP protocols of clustering. The evaluation of the proposed and existing strategies is done in two different scenarios i.e., number of round and number of nodes. Results of the simulation show that the proposed strategy transmits more packets and has lower number of dead nodes than other strategies. Furthermore, proposed strategy utilizes more network energy and more energy for relaying.

Implementation and evaluation of a 2.4 GHz multi-hop WSN: LoS, NLoS, different floors, and outdoor-to-indoor communications

In this paper, the communication reliability of a 2.4 GHz multi-hop wireless sensor network (WSN) in various test scenarios is evaluated through experiments. First, we implement an autonomous communication procedure for a multi-hop WSN on Tmote sky sensor nodes; 2.4 GHz, an IEEE 802.15.4 standard. Here, all nodes including a transmitter node (Tx), forwarder nodes (Fw), and a base station node (BS) can automatically work for transmitting and receiving data. The experiments have been tested in different scenarios including: i) in a room, ii) line-of-sight (LoS) communications on the 2nd floor of a building, iii) LoS and non-line-of-sight (NLoS) communications on the 1st floor to the 2nd floor, iv) LoS and NLoS communications from outdoor to the 1st and the 2nd floors of the building. The experimental results demonstrate that the communication reliability indicated by the packet delivery ratio (PDR) can vary from 99.89% in the case of i) to 14.40% in the case of iv), respectively. Here, the experiments reveal that multi-hop wireless commutations for outdoor to indoor with different floors and NLoS largely affect the PDR results, where the PDR more decreases from the best case (i.e., the case of a)) by 85.49%. Our research methodology and findings can be useful for users and researchers to carefully consider and deploy an efficient 2.4 GHz multi-hop WSN in their works, since different WSN applications require different communication reliability level.

Secure user authentication mechanism for IoT-enabled Wireless Sensor Networks based on multiple Bloom filters

In this article, we propose an efficient Bloom filter and fuzzy extractor based user authentication technique, which is significant for an Internet of Things (IoT)-enabled multi-hop Wireless Sensor Networks (IoT-WSNs). The novelty of the proposed authentication technique is that it prevents fraudulent querying data delivery at the starting phase (i.e., at the querying sensor node itself) to stop false or counterfeit data flooding (which can exhaust the resources of IoT-WSNs) from the resource-constrained IoT-enabled sensor nodes to the nearby gateway node. The proposed authentication technique has the ability to significantly reduce the Bloom filter based false positive for user authentication in IoT-WSNs, while also preserving the constraint resources of WSNs. To estimate the security robustness of the proposed protocol based on the security goals of IoT-WSNs, we perform the formal security analysis using the random oracle and Real-Or-Random (ROR) models, informal security analysis and also the formal security verification using a widely-recognized automated software validation tool, known as Automated Validation of Internet Security Protocols and Applications (AVISPA). Next, communication and computational overheads analysis reveal that the proposed protocol is appropriate for resource-constrained sensor nodes. Furthermore, a correlative security feature and complexity analysis outcomes validate that the proposed protocol is reliable, secure, and efficient in comparison with other existing state of art related user authentication protocols.

Zone Head Selection Algorithm Based on Fuzzy Logic for Wireless Sensor Networks

Clustering extends energy resources, improves scalability and preserves communication bandwidth of the network. Clustering is either categorized as static and dynamic or as equal and unequal. Hot-spots issue needs a high overhead and is prone to connectivity problems in the wireless sensor network and this can be only possible because of unequal clustering. In this paper a zone divisional method based on fuzzy logic has been proposed. This method uses a fuzzy logic to form clusters and allot nodes to them for the reduction of energy consumption, and extends the age of the sensor network. The simulation and results section shows that the outperformance of the proposed algorithm, where the (EAUCF) energy-aware unequal clustering fuzzy, (LEACH) lowenergy adaptive clustering hierarchy, (EAMMH) energy-aware multi-hop multi-path hierarchical, and (TTDFP) two-tier distributed fuzzy logic-based protocol for efficient data aggregation in multi-hop wireless sensor networks algorithms. The proposed algorithm has better results in terms of energy consumption minimization, load balancing, and prolongation of the network lifetime.

A New Joining Algorithm for Multi-hop Non-mobile Wireless Sensor Networks

Wireless Sensor Networks (WSN) are divided into two categories as single-hop and multi-hop according to the connection states of the sensor nodes. In the single-hop WSNs, the sensor nodes communicate directly with the management unit (coordinator node). On the other hand, in multi-hop WSNs, the sensor nodes, which are out of the coverage area of the coordinator node communicate with the coordinator over other joined sensor nodes. Multi-hop WSNs preferred for complex applications where there are many sensor nodes. In such applications, connecting to the network and maintaining the continuity in the network is difficult and requires very complicated algorithms for sensor nodes. In this study, a new network-joining algorithm for multi-hop WSNs has been proposed and designed. According to the algorithm, there is a management unit which is named as coordinator node (CN) for maintaining the network connectivity and the nodes which are the members of the network sends network joining requests over a common contention-based channel for joining the network. If there is a coordinator node in the coverage area, the sensor node joins directly to the network and coordinator allocates an appropriate channel to the new node. If the channel has multiple users, it is used as time-shared. If the sensor node is out of coverage area, directly joining to the network is impossible. In this case, the sensor node sends a relay request to the other joined sensor nodes. The available sensor node responds to this relay request via handshake. The sensor node uses the relay node’s channels as shared by using time-sharing methods. Therefore, the new node joins the network from the relay node’s channel. The main goal of this algorithm is to speed up joining of sensor nodes to the networks in multi-hop WSNs. Also, another goal is maximizing the continuity of the sensor nodes in the network. Thus, the algorithm improves performance and ensures data transfer continuity of WSNs.

Fuzzy Logic Based Zone Head Selection Algorithm for Wireless Sensor Networks

Hot-spots are a problem that comes in the cluster-based routing protocol that employs multi-hop communication due to this problem the energy among the sensor nodes is not balanced. The hot-spots issue requires high overhead and is prone to connectivity issues in the sensor network this can be only possible because of unequal clustering. In this method, we have to act on all the nodes of the sensor network for communication. This process consumes high system energy if the numbers of nodes are very high. To offer guaranteed connectivity, decrease high usage and complexity, a fuzzy logic-based zone divisional method has been proposed in this paper. Use fuzzy logic to create clusters and assign nodes to them to decrease the consumption of energy and the age of the network prolongation. The simulation and results section shows the outperformance of the proposed protocol, where the (LEACH) low-energy adaptive clustering hierarchy, (EAUCF) energy-aware unequal clustering fuzzy,(EAMMH) energy-aware multi-hop multi-path hierarchical, and (TTDFP) two-tier distributed fuzzy logic-based protocol for efficient data aggregation in multi-hop wireless sensor networks algorithms. The proposed algorithm has better results in terms of energy consumption minimization, and prolongation of the network lifetime.

Multifactorial evolutionary optimization to maximize lifetime of wireless sensor network

Prolonging network lifetime is a crucial issue for wireless sensor networks, as sensor nodes operate on limited amounts of battery energy, and replacing or recharging nodes is still quite challenging. One approach is using relay nodes to alleviate sensors’ energy usage when transmitting data. In this work, we tackle the issues of relay node assignment for wireless single-hop sensor and multi-hop sensor networks in three-dimensional terrains. Traditionally, researchers have focused on solving relay node selection for either single-hop or multi-hop networks, one at a time. We propose MFRSEA, a multifactorial evolutionary algorithm utilizing a network random key representation, a constraint-aware fitness function, and a novel crossover operator in order to optimize for both network types simultaneously. Experimental results show that our method outperforms the baseline in several key metrics.

An multilevel efficient energy clustering protocol with secure routing (MEECSR) in WSNs

ABSTRACT Nowadays the interest of research by the researchers is dominating in various areas of wireless sensor networks (WSNs) domain. The task of reducing energy consumption and spreading WSN lifetime are very impressive. Increase of energy stability and developing an advanced routing mechanism is one of the main issues in WSNs. There is a rising concern about protection of data from sensors and these low power devices are not suitable to complex cryptographic algorithms. Hence, the lifetime optimization and security are two conflicting design issues that are not filled to multi-hop wireless sensor networks. This paper presents a multilevel efficient energy clustering protocol with secure routing (MEECSR) protocol with two adjustable parameters: energy balance mastery and probabilistic random walking to avoid the above conflicts. The protocol for energy consumption of a given network topology is severely displaced, which greatly reduces the lifetime of the sensor networks. Also a quantifiable security method is proposed to address the source location privacy. The protocol provides an admirable trade-off between routing efficiency and energy balance can significantly extend the lifetime of the sensor networks in all scenarios. Further, the non-uniform energy deployment shows an increase in the lifetime of the network and the total number of packets delivered. This paper shows the simulation results of security and energy efficiency with different parameters.

Multicast Traffic Throughput Maximization through Joint Dynamic Modulation and Coding Schemes Assignment, and Transmission Power Control in Wireless Sensor Networks.

The paper concerns multicast packet traffic throughput maximization in multi-hop wireless sensor networks with time division multiple access to radio channel. We assume that the modulation and coding schemes (MCSs) that are used by the (broadcasting) nodes as well as the transmission power of the nodes are adjustable. This leads to the main research question studied in this paper: to what extent traffic throughput can be increased by proper MCSs assignment and transmission power control (TPC) at the nodes? To answer this question, we introduce mixed-integer programming formulations for joint MCSs assignment and TPC optimization, together with a solution algorithm. Finally, we present a numerical study illustrating the considerations of the paper. The numerical results show a significant gain being achieved by proper MCSs assignment, which is further increased by applying TPC.

An multilevel efficient energy clustering protocol with secure routing (MEECSR) in WSNs

ABSTRACT Nowadays the interest of research by the researchers is dominating in various areas of wireless sensor networks (WSNs) domain. The task of reducing energy consumption and spreading WSN lifetime are very impressive. Increase of energy stability and developing an advanced routing mechanism is one of the main issues in WSNs. There is a rising concern about protection of data from sensors and these low power devices are not suitable to complex cryptographic algorithms. Hence, the lifetime optimization and security are two conflicting design issues that are not filled to multi-hop wireless sensor networks. This paper presents a multilevel efficient energy clustering protocol with secure routing (MEECSR) protocol with two adjustable parameters: energy balance mastery and probabilistic random walking to avoid the above conflicts. The protocol for energy consumption of a given network topology is severely displaced, which greatly reduces the lifetime of the sensor networks. Also a quantifiable security method is proposed to address the source location privacy. The protocol provides an admirable trade-off between routing efficiency and energy balance can significantly extend the lifetime of the sensor networks in all scenarios. Further, the non-uniform energy deployment shows an increase in the lifetime of the network and the total number of packets delivered. This paper shows the simulation results of security and energy efficiency with different parameters.

Localization and Tracking of Mobile Jammer Sensor Node Detection in Multi-Hop Wireless Sensor Network

Background: The jammer in a wireless sensor network is located and tracked with open access and shared nature of the wireless medium. The existing algorithms mainly track the stationary jammer. Mobile jammer often moves from one place to another becoming difficult. Mobile jammer location tracker algorithm is proposed to find the location of a mobile jammer with four steps selection i.e., initial examining node, determination of supporting node, trilateration localization and examining group handover. Objective: In this research paper an algorithm is proposed for finding the location of mobile jammer in wireless sensor network. Finding location faces a huge difficulty due to non-supportive working between the multi hop wireless sensor network and jammer. The existing algorithms are used to find the location of stationary jammers only. Mobile jammers frequently change their position from time to time. Therefore jamming increases between the node to node communications in the multi hop wireless sensor network. Methods: The multi hop wireless sensor network is deployed with n number of stationary nodes in a particular area. The omni directional antenna is fitted with those stationary nodes and the transmission powers of the nodes are also constant. The direction-finding table is maintained and keep on updating for an interval of each node. The position of the nodes is tracked with the GPS devices or by existing location finding algorithm. The nodes in the multi hop wireless sensor network are installed in A*A square area uniformly and randomly. The transmitting node is tp node. The received signal to noise ratio is threshold STNR. Neighbor list records the neighbor node of the multi hop wireless sensor networks. Results and Conclusion: The proposed idea of localization and tracking system of mobile jammer is estimated efficiently by the multi hop wireless sensor network with the simulator MATLAB. The nodes in multi hop wireless sensor network are installed in A*A area square uniformly and randomly.

Research on energy-efficient routing algorithm based on SWIPT in multi-hop clustered WSN for 5G system

As one of the basic supporting technologies of 5G system, wireless sensor networks technology is facing a new challenge to improve its transmission energy efficiency. This paper considers combining simultaneous wireless information and power transfer (SWIPT) technique and routing technique, and applying them to multi-hop clustered wireless sensor networks (MCWSN), where each node can decode information and harvest energy from a received radio-frequency signal. And the relay nodes in MCWSN can utilize the harvest energy to forward data to their next hop nodes according to the routing scheme. First, we formulate an energy-efficient routing problem of MCWSN with SWIPT. Then, a heuristic energy efficient cooperative SWIPT routing algorithm (EECSR) is presented to find a transmission path with the maximum energy efficiency. Specifically, in EECSR, the resource allocation problem in each hop of the path is transformed to some equivalent convex optimization problems, which are resolved via dual decomposition. Moreover, a distributed routing protocol based on EECSR is proposed. As far as we know, this is the first solution that considers energy efficiency optimization based on routing and SWIPT in MCWSN. Simulation results show that our EECSR algorithm has high energy efficiency and good robustness. And our distributed routing protocol has better real-time performance than traditional protocols.

CLUSTER BASED ROUTING PROTOCOLS IN WSN SENSOR

Over the past few years we can observe the WSNs or Wireless Sensor Network applications in various fields increasing immensely. The energy efficiency, network lifetime and clustering process prime goal is the working network's optimization is the focus of many of the routing algorithm. Keeping in mind the network homogeneity, for network performance reinforcement we suggest instead of single path to use multiple paths. For WSNs, Reinforcement Intelligence Routing Protocol (RIRP)[1]. In the multihop wireless sensor networks an efficient and effective method for security improvements local monitoring has worked well [2]. But taking in consideration the power consumption in the current practice of local monitoring is costly. For ensuring long-lived operations in the sensor network reinforcement intelligent routing protocol is critical [3]. For ensuring both the aspects improvement in security and long-lived operations, the development of mechanism that is effective and incorporated with the Reinforcement protocol is an open problem. With the help of local monitoring to solve this issue, section of the traffic going in and out of its neighbors is supervised by each node to keep a check on any suspicious behavior like unlikely long delays in packet forwarding [4]. To integrate the existing reinforcement protocol of the network and without any niggardly in the consumption of energy in the local monitoring with the help of a protocol [5]. In comparison to other protocols in this protocol the region of instability starts later. At a constant rate the nodes of the RIRP or Reinforcement Intelligent Routing Protocol dies. Few problems such as cluster head selection process, network lifetime and network stability are evaluated and worked in the technique proposed here [6]. To reduce the overload consumption as much as possible the nodes switches in between the active and sleep mode.

Energy-Aware Routing for Software-Defined Multihop Wireless Sensor Networks

In this paper, we propose an energy-aware routing algorithm and a control overhead reduction technique for prolonging the network lifetime of software-defined multihop wireless sensor networks (SDWSNs). This is an effort to optimize the energy consumption of WSNs that provide services to the Industrial Internet of Things (IIoT). A centralized controller grants a global view of the sensor network by introducing extra control overhead in the network, but this leads to extra energy costs. However, our new algorithm takes advantage of this global view and balances the network energy by selecting paths with the highest remaining energy level among multiple paths for each sensor node. We also identify key functions draining energy from the SDWSN and minimize their impact by implementing a data packet aggregation function, and minimizing the control overhead by keeping track of the sensor nodes' routing tables using a simple checksum function. We show that the proposed approach prolongs the network lifetime of the WSN by 6.5% on average compared to the standard shortest-path algorithm, and that the control overhead is reduced by approximately 12% while still maintaining a very high packet delivery ratio.

Energy Optimization in Multi-Hop Wireless Sensor Networks based on Proposed Harmony Search Routing Algorithm

Spread application of wireless sensor networks (WSNs), has led many researchers aiming at energy optimization in these networks. The Proposed Energy Efficient Harmony Search Routing Algorithm (PEEHSRA) in accordance with a novel energy model is stated in this study to minimize the amount of energy consumption in WSNs. We first proposed an energy model on the basis of modulation scheme parameters for multi-hop transmission. Then, in order to develop a harmony search routing algorithm, pitch adjustment rate in the harmony memory was introduced based on both, the proposed energy model, and the node’s distance. Also, an energy-efficient fitness function was determined, which results in the most energy-efficient route for the network. At the end, four modulations including MQAM, MQPSK, OQPSK and MFSK were applied and the most energy-efficient one with corresponding parameters was specified. By comparing the results of the proposed method to the state-of-the-art studies, the improvements in extending the lifetime of the network was proved. These findings seem quite useful in designing an energy-efficient multi-hop WSN and pave the way for enhancement of the widespread applications in these networks.

Reliable Link Level Routing Algorithm in Pipeline Monitoring Using Implicit Acknowledgements.

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.

A lightweight security and privacy-aware routing scheme for energy-constraint multi-hop wireless sensor networks

Unique constraints associated with wireless sensor networks notably, limited resources and physical exposure of sensor nodes have warranted the need for a lightweight and low energy demand security mechanisms for wireless sensor networks (WSNs). Most of the existing security schemes demand computational power beyond the computational capacity of WSNs making them unsuitable security schemes for WSNs' routing protocols. In this work, a lightweight security and privacy scheme for WSNs' routing protocol is developed. An elliptic curve cryptography, scalar blinding, symmetric encryption, and modified Diffie Hellman key exchange protocol are adopted to evolve an additive perturbation that ensures data integrity, and an effective authentication that ensure confidentiality during routing. The security analysis shows that the scheme is secured against possible known attacks and performs better than some of the considered state-of-the-art schemes used in WSNs. Both the analytical and experimental results not only show that the proposed scheme requires lower computational power but with increase level of security and speed.

An Unequally Clustered Multi-hop Routing Protocol Based on Fuzzy Logic for Wireless Sensor Networks

Wireless sensor networks (WSNs) is associated with a new exemplification of a real-time embedded system used for various applications that make the traditional infrastructure-based network seem infeasible. Due to imbalanced energy consumption among nodes, WSN has challenges with better utilization of energy and system enhancement. Clustering has been a better approach in this sequence. Therefore, this paper will utilize a fuzzy logic-based clustering protocol (unequal clustering) with multi-hop transmission for load balancing, energy consumption minimization, and network lifetime prolongation. The protocol forms unequal clusters with cluster head (CH) being selected by fuzzy logic with competition radius. Node distance to the base station, concentration, and residual energy are input variables. The simulation and results section displays the outperformance of the proposed protocol, where the low-energy adaptive clustering hierarchy (LEACH), energy-aware multi-hop multi-path hierarchical (EAMMH), energy-aware unequal clustering fuzzy (EAUCF), and two-tier distributed fuzzy logic-based protocol (TTDFP) for efficient data aggregation in multi-hop wireless sensor networks algorithms.