Search

Copyright of Journal of Agricultural Science & Technology (1008-0864) is the property of Journal of Agricultural Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Wireless sensor networks (WSNs) were projected to wind up plainly the texture of our condition and society. However, they are yet not ready to defeat various operational difficulties, for example, limited system lifetime, which suppress their general deployment. To prolong WSN lifetime, most of the existing clustering schemes are geared towards homogeneous WSN and heterogeneous WSN. This paper is a comparative review on the critical problem of system lifetime of WSN and extravagantly looks at seven distinguished but prominent routing protocols namely LEACH, TEEN, PEGASIS, DEEC, DDEEC, EDEEC and EDDEEC for some general situations. [ABSTRACT FROM AUTHOR]

An ad hoc network is a group of wireless nodes that create a system without any federal control or access point. MANET stands for Mobile Ad-hoc Network. MANET is robust infrastructure less wireless network. MANET can be designed either by mobile nodes or by both staticnodes. In this paper we review of two well-known routing protocols AODV and DSDV for MANET and also provide comparison between AODV and DSDV protocol. Further this review will help the other researcher for study and understand which routing protocols perform better with respect to different network senarios. [ABSTRACT FROM AUTHOR]

Different data aggregation protocols are required in wireless sensor network (WSN) to reduce computational and communication power consumption of various nodes to enhance battery lifetime of the nodes. Recent advances in WSN have led to many new protocols specifically designed to conserve the energy of the nodes and increase the lifetime of the nodes. This paper presents an overview of what WSN is and why data aggregation is required and it also focuses on reducing the power consumption of WSN by using clustered based approached protocols namely LEACH by taking certain Clustering Parameters into consideration like number of nodes, overlapping, algorithm complexity. [ABSTRACT FROM AUTHOR]

Guaranteeing end-to-end data security in wireless sensor networks (WSNs) is important and has drawn much attention of researchers over past years. Because an attacker may take control of compromised sensor nodes to inject bogus reports into WSNs, enhancing data authenticity becomes a necessary issue in WSNs. Unlike PCREF (Yang et al. in IEEE Trans Comput 64(1):4-18, 2015) (LEDS, Ren et al. in IEEE Trans Mobile Comput 7(5):585-598, 2008), digital signature rather than message authentication polynomials (message authentication codes) is adopted by our protocol in en-route filtering. Keeping the advantages of clusters in PCREF and overcoming the drawbacks in LEDS, an enhanced and efficient cluster-based security protocol is proposed in this paper. The proposed protocol can guarantee end-to-end data authentication with the aid of digital signature and exhibits its effectiveness and efficiency through security analysis and performance analysis. Our analytical results show that the proposed protocol significantly outperforms the closely related protocols in the literature in term of security strength and protocol overhead. [ABSTRACT FROM AUTHOR]

Recently, the pipeline-forwarding has been proposed as a new technique to resolve the end-to-end latency problem of the duty-cycle MAC protocols in Wireless Sensor Networks (WSNs). Some protocols based on this technique such as PMAC and PRI-MAC have shown an improvement not only in terms of reducing end-to-end latency but also in terms of reducing power consumption. In these protocols, however, the sensor nodes still waste a significant amount of energy for unnecessary idle listening during contention period of upstream nodes to check the channel activity. This paper proposes a new pipeline-forwarding duty-cycle MAC protocol, named RP-MAC (Reduced Pipelined duty-cycle MAC), which tries to reduce the waste of energy. By taking advantage of ACK mechanism and shortening the handshaking procedure, RP-MAC minimizes the time for checking the channel and therefore reduces the energy consumption due to unnecessary idle listening. When comparing RP-MAC with the existing solution PRI-MAC and RMAC, our QualNet-based simulation results show a significant improvement in term of energy consumption. [ABSTRACT FROM AUTHOR]

Coverage is a key metric in evaluating the monitoring capacity and quality of services in wireless sensor networks. The energy consumption of self-contained sensors is also a challenging problem for energy-efficient use while still achieving better coverage performance. Although techniques have been developed to mitigate the problem of area coverage, particularly together with efficient clustering methods, none focuses intensively on the sensor activation stage, which is used to maintain coverage while optimizing energy usage. In this research, we thus propose a cover set to find the minimum set of sensors that completely cover the sensing ranges within an interest area as a criterion for sensor activation. Our main goal is to select an optimal number of active sensors considering residual energy and the cover set and to keep alive the important sensors for the sensing coverage task as long as possible. Additionally, this research proposes an area coverage-aware clustering protocol (ACACP) with energy consumption optimization with respect to the activation sensor, network clustering, and multi-hop communication to improve overall network lifetime while preserving coverage. Throughout the intensive simulation, given a diversity of deployments with scalability concern, the results demonstrate the effectiveness of ACACP when compared with other competitive approaches such as ECDC and DECAR, including state-of-the-art clustering protocols such as LEACH, in terms of coverage ratio and overall network lifetime. [ABSTRACT FROM AUTHOR]

Statistics show that remote innovation is picking up popularity day by day. Today, person sitting at either end of the nation can speak with each other with the aid of wireless technology. Mobile ad hoc Network (MANETs) is a type of wireless ad hoc network which is a collection of mobile devices that creates random topology for communication. The fineness of MANETs is that it not required any central controller or base station. MANETs is only a network in which devices worked as a host as well as router. Routing in ad hoc networks has become a popular research topic. There are several routing protocols have been developed for ad hoc networks. In MANET, it is very stiff task to predict the performance of routing protocol under varying network conditions and scenarios. This review paper is discussing the three approaches of routing protocols such as Reactive (On demand), Proactive (table driven) and Hybrid routing protocols within their advantage and disadvantage. [ABSTRACT FROM AUTHOR]

Improving Performance of Synchronous Transmission-Based Protocols Using Capture Effect over Multichannels [ABSTRACT FROM AUTHOR]

The emerging use of multi-homed wireless devices along with simultaneous multi-path data transfer offers tremendous potentials to improve the capacity of multi-hop wireless networks. The use of simultaneous data transfer over separate disjoint paths in multi-hop wireless networks to increase network capacity is a less explored subject, mainly because of the challenges it triggers for the reliable transport layer protocols. Reliable transport layer protocols generally use packet sequence number as a mean to ensure delivery. As such, the out-of-order packet arrival in reliable transport layer protocols triggers receiver buffer blocking that causes throughput degradation and prevents the reliable multi-path transport layer protocol to realize its vast potential. This paper focuses on integrating network coding with a reliable multi-path transport layer protocol to resolve the receiver buffer blocking problem. We propose an adaptive network coding mechanism to desensitize the receiver against packet reordering and consequently eliminate the receiver buffer blocking problem. Our state-of-the-art network coding scheme uses a combination of Q-learning and logistic regression for rare data events to control the number of redundant packets based on the network dynamics. We confirmed the veracity of our proposed scheme by a queuing theory based mathematical model. Moreover, the effectiveness of the proposed scheme is demonstrated through simulations and testbed experiments. [ABSTRACT FROM AUTHOR]

Broadcasts for duty-cycled wireless sensor networks (WSNs) has been extensively studied recently. However, in this paper, we investigate a constraint-based forwarding for multi-hop broadcasts in asynchronous duty-cycled operations, and propose a novel Delay-Constrained and Energy-Balanced broadcast protocol called DCEB protocol. In DCEB protocol, without any central node, a distributed algorithm for constructing a broadcast backbone is presented, including its energy-balanced maintenance mechanism. Then, the decision conditions for broadcast forwarding time with or without delay constraint are deduced. Different from current studies, DCEB neither assumes time synchronization for sleep scheduling, which requires all neighboring nodes to wake up at the same time, nor assumes duty-cycled awareness, which makes the protocol difficult to use in duty-cycled WSNs. Under different network configurations, we evaluate DCEB protocol with real sensors and confirm that DCEB reduces much more broadcast cost by the decision conditions and provides better broadcast performance than the Unicast Scheme. [ABSTRACT FROM AUTHOR]

The modern developments of micro sensor devices have lead to the a number of protocols in the field of wireless sensor networks( WSNs). The sensor networks are capable enough to collect information and transmit it to the end user. But storage capacity, computing capability and limited energy are the major constraints for the wireless sensor networks. This paper describes the components of the wireless sensor networks and then a review of various energy conservation techniques is given. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) is the network of finite potential observing gadgets called sensors. The resource constraint behavior of WSN entails diverse problems in its motif and performance that reduces its execution. Wireless sensor network be unlike to other networks in phrase of accession of aggregation of energy, because at the time of sensors observing and sending the observed data to other sensors, which are covered by the network, a reasonable amount of energy gets reduced. So to overcome this, several routing, potentially organized and data broadcasting protocols are particularly constructed, in which energy devouring is an important design issue that conserves the durability of the network, thereby the lifetime of WSN gets increased. Hierarchical routing protocols which follows an approach of clustering such as Low Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP), Distributed Energy Efficient Clustering (DEEC) and Threshold Sensitive Energy Efficient Networks (TEEN) are well known for the purpose of keeping up the energy effective. Here we compare these four protocols in phrase of number of nodes dead, packet delivery ratio, number of nodes alive and packets delivered to cluster heads. [ABSTRACT FROM AUTHOR]

Population protocols (Angluin et al. in PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinite sequences of interactions satisfying a strong fairness constraint. A population protocol is well specified if for every initial configuration C of devices, and every computation starting at C, all devices eventually agree on a consensus value depending only on C. If a protocol is well specified, then it is said to compute the predicate that assigns to each initial configuration its consensus value. While the computational power of well-specified protocols has been extensively studied, the two basic verification problems remain open: Is a given protocol well specified? Does a given protocol compute a given predicate? We prove that both problems are decidable by reduction to the reachability problem of Petri nets. We also give a new proof of the fact that the predicates computed by well-defined protocols are those definable in Presburger arithmetic (Angluin et al. in PODC, 2006). [ABSTRACT FROM AUTHOR]

With the development of electronic technology and communication protocols, wireless sensor network technology is developing rapidly. In a sense, the traditional static wireless sensor network has been unable to meet the needs of new applications. However, the introduction of mobile nodes extends the application of wireless sensor networks, despite the technical challenges. Because of its flexibility, the mobile wireless sensor network has attracted great attention, and even small, self-controlled mobile sensor devices have appeared. At present, mobile node localization has become one of the hotspots in wireless sensor networks. As the storage energy of wireless sensor network nodes is limited, and the communication radius is small, many scientists have focused their research direction on the location algorithm of mobile nodes. According to the continuity principle of mobile node movement, in this paper we propose an improved mobile node localization algorithm based on the Monte Carlo Location (MCL) algorithm, and the method can reduce the sampling interval effectively. First of all, this paper introduces the structure and classification of wireless sensor localization technology. Secondly, the principle of the Monte Carlo Location algorithm is described in detail. Thirdly, we propose an efficient method for mobile node localization based on the MCL algorithm. Finally, the effectiveness and accuracy of the new algorithm are verified by comparative analysis. [ABSTRACT FROM AUTHOR]

Coverage is an intriguing problem in the domain of wireless sensor networks for supervising and tracking applications as an indicator of quality of service (QoS). Target coverage problem pertains to maximize the network lifetime while considering the resource scarcity. The paper proposes a hybrid scheduling protocol for target coverage for wireless sensor networks which determines the number of set covers for monitoring all the targets using the probabilistic coverage model, node contribution and trust values. The optimal observation probability is obtained for the parameter values of the sensing and communication characteristics of the nodes using Analytic Hierarchy Process (AHP) and probabilistic coverage model. The proposed protocol uses a node scheduling technique using Fuzzy Logic to activate the nodes to form the set covers. The proposed protocol is validated for a smaller network and is simulated for a real large network. The simulation results show that the performance of proposed protocol improves the network efficiency in terms of coverage, network lifetime and reliability in terms of trust factor. The comparison results show that the proposed protocol improves the performance in terms of the number of set covers, network lifetime and number of active nodes compared to disjoint set cover protocol. The simulation results show that the network lifetime and performance under constant performance is improved up to 200%. [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]

The aim of the article was to compare the effectiveness of the selected routing protocols for wireless sensor networks taking into account a number of specific parameters as network troughput, packet error rate and message buffer capacity for different network topologies. The simulation research was conducted in open source OMNeT++ environment. In order to achieve the assumed requirements, four different-sized network topologies were established and AODV and DYMO routing protocols were adapted. [ABSTRACT FROM AUTHOR]

This study evaluates the consistency between the bicycle torque of the proposed system, and a Schoberer Rad Messtechnik (SRM) system. The torque was measured while a trainer was cycling indoors, and the measured values were compared with those of the SRM system. A Bland-Altman statistical analysis indicated that the measured values agreed with the SRM within 95%. The mean absolute percentage error and root mean square error between the measurements of the proposed system and the SRM system were 8.25%, and 1.86, respectively. The results show that the bicycle torque can be measured accurately and transmitted using ZigBee wireless protocol. [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]

The increasingly dense deployments of wireless CSMA networks arising from applications of Internet-of-things call for an improvement to mitigate the interference among simultaneous transmitting wireless devices. For cost efficiency and backward compatibility with legacy transceiver hardware, a simple approach to address interference is by appropriately configuring the carrier sensing thresholds in wireless CSMA protocols, particularly in dense wireless networks. Most prior studies of the configuration of carrier sensing thresholds are based on a simplified conflict graph model, whereas this paper considers a realistic signal-to-interference-and-noise ratio model. We provide a comprehensive study for two effective wireless CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, in two aspects: (1) static approach that sets a universal carrier sensing threshold to ensure interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions. We also provide simulation studies to evaluate the starvation ratio, fairness, and goodput of our approaches. [ABSTRACT FROM PUBLISHER]

Concurrent MAC protocols can improve channel usage of wireless sensor networks (WSNs), and provide a high-performance infrastructure for data intensive applications. Most of the existing concurrent MAC protocols are based on proactively constructed physical interference models, i.e., PRR-SINR models (PSM). However, it incurs relatively high bandwidth and energy overheads to construct PSM for WSNs. In this paper, we propose NoPSM, which does not take PSM as base to determine transmission concurrency. Instead, the base of NoPSM is reactively constructed interference relationships by passively analyzing overlapping relationships among time logs of block data transmissions and corresponding reception status of each packet in blocks. In this way, NoPSM has two salient features. First, NoPSM is able to construct interference relationships among nodes quickly and accurately along with block data transmissions without needs of network downtime. Second, based on the constructed interference relationships, NoPSM can make decisions of transmission concurrency with a comprehensive criterion, which not only estimates quality of any active links after initiating a new link, but also estimates throughput improvement gained from concurrent transmissions. NoPSM has been implemented in Tinyos-2.1 and extensively evaluated in TOSSIM. Experimental results show that NoPSM improves system throughput by up to 60 percent compared with a traditional CSMA protocol, which cannot exploit potential transmission concurrency. Moreover, NoPSM can gain up to 55 percent throughput improvement as compared to an existing reactive concurrent MAC. [ABSTRACT FROM PUBLISHER]

This paper presents new challenges for the development of reconfigurable wireless sensor networks (RWSNs) that adapt dynamically their behaviors to their environment under different properties. An RWSN is a set of networked nodes that execute reconfigurable software tasks for the control of local sensors. We propose a new design methodology named RWiN of an RWSN using unified modeling language (UML) to analyze, construct, develop, and verify easily RWSN architectures. For that, we formulate a metamodel of RWSN based on UML to describe a zone-based architecture that uses a communication protocol for the optimization of distributed reconfigurations. To control the design complexity, we model each agent of this architecture by nested state machines. To verify the temporal constraints by communicating agents, each one is modeled by a timed automaton. The paper’s contribution is applied to a case study, which is simulated with TRMSim-WSN and UPPAAL environment to expose the originality of this new architecture. [ABSTRACT FROM AUTHOR]

This paper represents wireless sensor networks using numerous topologies of ZigBee. Along with coordinator load, the uses of coordination with such networks were inspected. The investigation has been accomplished via the use of various plots in the OPNET Modeler simulator. The results of the simulation explore the use of coordination with mesh and tree routing to verify the suitability of the topology. It also demonstrates some of the implemented features of the ZigBee protocol and IEEE 802.15.4 MAC specification, using OPNET's ZigBee model suite, like: Mesh routing vs. tree routing, Roaming between Personal Area Network (PANs) & Failure and Recovery procedures. The simulation has been carried out for 20 minutes to investigate the response of routing topologies on the delay, coordinator load and the MAC Load and the data have been collected. The results indicate that the End to End delay, number of hops and MAC load for mesh routing is lower than the tree routing. The results also show that in case of failure and recovery procedures, the simulated networks perform according to the ZigBee Standard. [ABSTRACT FROM AUTHOR]

In this paper, we propose an efficient and secure key establishment protocol that is tailored for Wireless Mesh Networks. The protocol is based on identity-based key establishment, but without the utilization of a trusted authority for private key generation. Instead, this task is performed by the collaboration of mesh nodes; a number of users exceeding a certain threshold form a coalition to generate private keys for the network users. We performed simulative performance evaluation in order to show the effect of both the threshold value and the network size, i.e., total number of nodes, on the latency of key establishment and on the success percentage of user private key generation. Results reveal a trade-off between resiliency and efficiency; increasing the threshold value also increases the resiliency of the network, but negatively effects its latency and success percentage. For the threshold values that are smaller than 10 and for a minimum of 40 mesh nodes, at least 93% of the user private keys can be computed within at most 2 min. We also discuss the security of our protocol. We show that our protocol is secure against both outsider malicious and insider semi-honest adversaries. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), preserving coverage of the target area by the sensor nodes is crucial to deliver certain services. However, a few sensor nodes die during the network operation due to energy constraints which may break the coverage of the target area. We refer this as a coverage hole problem. In this paper, we propose a new algorithm called CHD-CR which attempts to restore the coverage after detecting a coverage hole in the target area. The proposed algorithm mainly consists of coverage hole detection (CHD) and coverage restoration (CR) phases. We design an efficient local mechanism for coverage hole detection and energy efficient technique for its restoration. We test the performance of the proposed algorithm through simulation and the results are compared with the existing algorithms. Simulation results show that the proposed CHD-CR algorithm outperforms the existing algorithms in terms of coverage preservation for longer time. [ABSTRACT FROM AUTHOR]

Efficient and reliable routing protocol is one of the key technologies in wireless sensor networks, and it has been concerned by a lot of researchers. In light of the random selection of cluster head in low energy adaptive clustering hierarchy protocol algorithm, the residual energy of nodes, node location and node density are not considered. Through theoretical deduction and mathematical calculation, the study found that it is a NP - hard problem. A swarm intelligence algorithm was introduced into the clustering algorithm of wireless sensor network, and an efficient and reliable clustering algorithm for wireless sensor networks (WSNs) based on quantum artificial bee colony algorithm was proposed. Considering the residual energy of nodes, node location and node density, and the energy consumption of the network is balanced. Experiments show that the proposed routing protocol outperforms other work in most cases by reducing the network energy consumption for WSNs by more than 13%, which indicates the feasibility of the authors' approach for efficient and reliable routing protocol in wireless sensor networks. [ABSTRACT FROM AUTHOR]

In case of detector network the nodes loss some quantity of energy once performing the communication. To boost the lifetime of network a energy economical communication approach is needed. In case of multicast network an collective approach is employed by LEACH protocol by creation of chain of nodes. The given work is the improvement over the LEACH protocol individual to some parameter. Here we are proposing the three call parameters to pick following node in network. These parameters embrace the space, energy and also the residual energy. The projected work can improve the potency even in case of engorged and congested network and improve the network life. Sensing element network is the large set of small sensors that transfer small piece of data. As it forms a huge range of sensors it suffers from the matter of QOS. Every sensing element node consumes some energy with totally different communication operations. If no external energy is provided to them, a sensing element can be dead because it participates for long-standing within the communication. The planned work is proposed to improve the network life-time in case of LEACH protocol. It's a Cluster based protocol and transfer information to at least one of its neighbor node supported distance. During this planned work we are going to take the choice primarily based on the remaining energy on transmission. If the remaining energy is a smaller amount than the threshold, it'll communicate to some compromising node rather than effective distance node. The work is about to provide higher utilization of energy and to enhance the node and network life. [ABSTRACT FROM AUTHOR]

There are many differences between the routing protocol design of a wireless sensor network and wireless ad-hoc network. Highly restricted resource and frequent node failure are two major challenges. Relevant technical research into wireless sensor network has become an issue of intense interest. In recent years, achievements in research on routing protocol of wireless sensor network have been summarized, analyzed and compared. Features of wireless sensor networks have been introduced and key factors of its routing protocol design have been introduced. According to the realization features of protocol, routing protocol of wireless sensor network has been divided into five categories, and each category of important protocols has been elaborated and analyzed. Finally, the features of these protocols are summarized and compared and the development trend of such research has been forecasted. [ABSTRACT FROM AUTHOR]

Similar to terrestrial networks, underwater wireless networks (UWNs) also aid several critical tasks including coastal surveillance, underwater pollution detection, and othermaritime applications. Currently, once underwater sensor nodes are deployed at different levels of the sea, it is nearly impossible or very expensive to reconfigure the hardware, for example, battery. Taking this issue into account, considerable amount of research has been carried out to ensure minimum energy costs and reliable communication between underwater nodes and base stations. As a result, several different network protocols were proposed for UWN, including MAC, PHY, transport, and routing. Recently, a new paradigm was introduced claiming that the intermittent nature of acoustic channel and signal resulted in designing delay tolerant routing schemes for the UWN, known as an underwater delay tolerant network. In this paper, we provide a comprehensive survey of underwater routing protocols with emphasis on the limitations, challenges, and future open issues in the context of delay tolerant network routing. [ABSTRACT FROM AUTHOR]

In recent years, user authentication has emerged as an interesting field of research in wireless sensor networks. Most recently, in 2016, Chang and Le presented a scheme to authenticate the users in wireless sensor network using a password and smart card. They proposed two protocols [ABSTRACT FROM AUTHOR]

To simplify the certificate management in public key infrastructure, key management protocols for wireless sensor networks typically use identity-based cryptography for negotiating the shared key. However, current identity-based key management protocols are mainly based on the bilinear map technique, which requires high computation costs on sensor nodes, resulting in short lifetimes of sensor nodes. To address this issue, we present a novel identity-based key management protocol called Identity-Based Key Management using Lagrange Interpolation (IBKML). Similar to the protocols of this field, IBKML can provide confidentiality and integrity protections for the negotiated key. However, compared to other well-known approaches, IBKML is based on Lagrange interpolation instead of bilinear map, which employs only a few modular multiplication operations. Because modular multiplication is much more efficient than bilinear pairing, IBKML can reduce the computation costs on sensor nodes significantly. Experimental results show that the proposed protocol is feasible for real applications. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Nowadays, with the ubiquitous presence of the Internet of Things industry, the application of emerging sensor networks has become a focus of public attention. Unattended sensor nodes can be comprised and cloned to destroy the network topology. This paper proposes a novel distributed protocol and management technique for the detection of mobile replicas to tolerate node failures. In our scheme, sensors' location claims are forwarded to obtain samples only when the corresponding witnesses meet. Meanwhile, sequential tests of statistical hypotheses are applied to further detect the cloned node by witnesses. The combination of randomized detection based on encountering and sequential tests drastically reduces the routing overhead and false positive/negative rate for detection. Theoretical analysis and simulation results show the detection efficiency and reasonable overhead of the proposed method. [ABSTRACT FROM AUTHOR]

A wireless sensor network is a collection of tiny sensor nodes that are deployed to monitor a physical environment. These sensor nodes are generally powered by non-renewable batteries and maybe deployed in harsh environment. Thus, energy resource is precious that makes protocols design for this kind of networks a crucial challenge. Especially, in physical layer, orthogonal modulations as PPM or FSK are suitable. The commonly used models to investigate the network lifetime are based on a linear battery discharge. Really, the battery discharge is closely bonded to the discharge current, and typically is non-linear. This paper presents a performance analysis of both PPM and FSK modulations used in battery powered wireless sensor node. A Rakhmatov-Vrudhula-Wallach model is used to evaluate the used battery charge for a given instantaneous current load. By numerical results, it is proved that PPM modulation outperforms FSK one in term of battery charge use for different network density and for different M-ary signaling schemes. [ABSTRACT FROM AUTHOR]

Periodical extraction of raw sensor readings is one of the most representative and comprehensive applications in Wireless sensor networks. In order to reduce the data redundancy and the communication load, in-network data aggregation is usually applied to merge the packets during the routing process. Aggregation protocols with deterministic routing pre-construct the stationary structure to perform data aggregation. However, the overhead of construction and maintenance always outweighs the benefits of data aggregation under dynamic scenarios. This paper proposes an Adaptive Data Aggregation protocol with Probabilistic Routing for the periodical data collection events. The main idea is to encourage the nodes to use an optimal routing structure for data aggregation with certain probability. The optimal routing structure is defined as a Multi-Objective Steiner Tree, which can be explored and exploited by the routing scheme based on the Ant Colony Optimization and Genetic Algorithm hybrid approach. The probabilistic routing decision ensures the adaptability for some topology transformations. Moreover, by using the prediction model based on the sliding window for future arriving packets, the adaptive timing policy can reduce the transmission delay and can enhance the aggregation probability. Therefore, the packet transmission converges from both spatial and temporal aspects for the data aggregation. Finally, the theoretical analysis and the simulation results validate the feasibility and the high efficiency of the novel protocol when compared with other existing approaches. [ABSTRACT FROM AUTHOR]

Sensors cooperate and coordinate with each other to disseminate sensed data in the network. In establishing coordination among sensors such that they can access the shared wireless medium, Medium Access Control (MAC) protocol plays an important role. In this article, we presented an analytical study on some popular MAC protocols for Wireless Sensor Networks (WSNs). Based on the design techniques, MAC protocols for WSNs are classified into two main categories: single-layer and cross-layer. MAC protocols such as S-MAC, T-MAC, B-MAC and X-MAC are selected to study the design approaches of single-layer genre. BoX-MAC-1 and BoX-MAC-2 are selected to analyze cross-layer design approaches. This survey paper aims at reporting an implementation viewpoint of different design approaches of MAC protocols in WSN. We have considered mixed WSNs that exhibits node movement (e.g., static, mobile) and changes in communication medium (e.g., air, water). Representative protocols are implemented in Castalia simulator and evaluated on the basis of important performance metrics such as energy consumption, network lifetime, throughput and end-to-end delay. The merits and demerits of different protocols are also compared. [ABSTRACT FROM AUTHOR]

wireless sensor network enables the regular monitoring of military, civil and other application. This paper proposes a new improved cluster algorithm of LEACH protocol which is intended to balance the energy consumption of the entire network and extend the lifetime of the network . In this paper we propose a leach protocol that works on network layer in OSI model. Leach protocol stands for Low-Energy Adaptive Clustering Hierarchy, a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network . LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.. It proides a better results than conventional protocols. [ABSTRACT FROM AUTHOR]

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime. [ABSTRACT FROM AUTHOR]

This paper presents a novel home automation system named HASITE (Home Automation System based on Intelligent Transducer Enablers), which has been specifically designed to identify and configure transducers easily and quickly. These features are especially useful in situations where many transducers are deployed, since their setup becomes a cumbersome task that consumes a significant amount of time and human resources. HASITE simplifies the deployment of a home automation system by using wireless networks and both self-configuration and self-registration protocols. Thanks to the application of these three elements, HASITE is able to add new transducers by just powering them up. According to the tests performed in different realistic scenarios, a transducer is ready to be used in less than 13 s. Moreover, all HASITE functionalities can be accessed through an API, which also allows for the integration of third-party systems. As an example, an Android application based on the API is presented. Remote users can use it to interact with transducers by just using a regular smartphone or a tablet. [ABSTRACT FROM AUTHOR]

Many applications in Wireless Sensor Networks ( WSNs ) require all data to be transmitted with minimal or without loss, what implies that reliability is an important characteristic. In any WSN , there are two basic approaches to recover erroneous packets. One way is to use Automatic Repeat reQuest ( ARQ ), and another is Forward Error Correction ( FEC ). The error-control systems for applications based on ARQ use error detection coupled with retransmission requests to maximize reliability at some cost to throughput. Error detection is generally provided by the lower protocol layers which use checksums (e.g. Cyclic Redundancy Checksums ( CRCs )) to discard corrupted packets and trigger retransmission requests. In these solutions event a single erroneous bit can render a packet useless to the end user. Having in mind that in WSNs the power is scarce and is primarily consumed by wireless transmission and reception, we propose to use FEC rather than ARQ . FEC is a way of correcting packets by transmitting additional information bits with aim to reduce the frequency of retransmission requests. During this, data bytes are optionally encoded after being fragmented with Error Correcting Code ( ECC ) to recover data bits in case of small number of bit errors. Various FEC encoding schemes such as erasure and Hamming based codes are available. The choice of the encoding schemes depends on the applications and error characteristics (error models/patterns) of the wireless channel. Erasure encoding is preferable for usage when the error pattern is burst dominated, while Hamming encoding when noise causes random errors. Our observations show that most bit errors are single-bit or double-bit errors and burst errors are present but rare. In this work, an efficient Hamming based FEC encoding scheme of relatively low complexity called Two Dimensional-Single Error Correcting-Double Error Detecting ( 2D-SEC-DED ), intended to minimize packet retransmissions and to save energy, has been developed. Such FEC scheme can be used to correct all single-bit and 99.99%of double/multiple-bit errors. Since the radio block is dominant energy consumer within a Sensor Node (S N ), we focus our attention to answer the question: which is the adequate metric to use, and under what conditions to accurately characterize the quality of the communication, related to reliable data transfer, with minimal energy consumption. To this end, as first, in a case when the bit error is not high and most errors are single-bit, we show that 2D SEC-DED encoding scheme is more energy efficient in comparison to erasure encoding. As second, the advantages of using 2D-SEC-DED in respect to CRC ( NO-FEC ) encoding, concerning decreasing the energy consumption and increasing the reliability of the radio block are derived through implementation of two versions of the Rendezvous Protocol for Long Living ( RPLL ) referred as Modified- RPLL ( M-RPLL as FEC based) and Ordinary- RPLL ( O-RPLL as NO-FEC ), respectively. [ABSTRACT FROM AUTHOR]

The wireless sensor networking (WSN) systems have been used for several applications from target tracking to environment monitoring. Recently, there has been increased interest in the design of WSN protocols for delay-sensitive applications, such as military surveillance, health monitoring, and infrastructure security. In this paper, we apply gene regulatory networks (GRN) principles to the WSN system and analyze a reaction-diffusion mechanisms for decentralized node scheduling design. Using control theory, we verify that the proposed scheme guarantees system stability. Also, we provide conditions of system parameters to ensure system convergence and stability. Simulation results indicate that the proposed scheme achieves superior performance with energy balancing as well as desirable delay compared with other wellknown schemes. [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]

This paper studies the potential of a novel approach to ensure more efficient and intelligent assignment of capacity through medium access control (MAC) in practical wireless sensor networks. Q-Learning is employed as an intelligent transmission strategy. We review the existing MAC protocols in the context of Q-learning. A recently-proposed, ALOHA and Q-Learning based MAC scheme, ALOHA-Q, is considered which improves the channel performance significantly with a key benefit of simplicity. Practical implementation issues of ALOHA-Q are studied. We demonstrate the performance of the ALOHA-Q through extensive simulations and evaluations in various testbeds. A new exploration/exploitation method is proposed to strengthen the merits of the ALOHA-Q against dynamic the channel and environment conditions. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSN), the clustering technique reduces energy efficiency and network lifetime. In this paper, a Fuzzy-based clustering architecture is proposed for cooperative communication in WSN in order to overcome this issue. In this work, a Cluster Head (CH) is chosen based on the parameters residual energy, trust, signal-to-interference-plus-noise ratio and load. Then, the intra-cluster routing is performed using network coding-based probabilistic routing scheme. The fuzzy-based clustering protocol helps in determining the cooperative node (CN) which joins the cluster. Finally, particle swarm optimization is used to establish the optimum path between each CN and the CH for data transmission. The simulation results show that the proposed technique enhances the network lifetime and energy efficiency. [ABSTRACT FROM AUTHOR]

In Underwater Wireless Sensor Networks (UWSN), the existing scheduling technique causes propagation delay or overhead issue. Also the data collision is likely to occur. In order to overcome this issue, in this paper, we propose to design a cluster-based MAC protocol for collision avoidance and TDMA scheduling in UWSN. Initially, the clusters are formed and cluster heads (CHs) are elected as per the energy-efficient hierarchical clustering algorithm. The cluster members, which are one-hop neighbors of CH, schedule the data sending times for all cluster members. The energy consumption analytical model is derived to show the average energy consumed by each CH. Finally, conflict-free scheduling is performed by using Spatial- Temporal-Confliction-Table. This allows nodes to transmit at the same time as long as their packets arrive during different times at the intended destinations. Simulation results show that the proposed MAC protocol reduces the delay and energy consumption while by increasing the packet delivery ratio. [ABSTRACT FROM AUTHOR]

ABSTRACT With the development and maturation of the wireless communication technologies, the wireless sensor networks have been widely applied in different environments to acquire specific information. The wireless medical sensor networks (WMSNs), as a professional application of the wireless sensor networks in medicine, have attracted more and more attention because of its potential in improving the quality of healthcare services. Through the WMSNs, the parameters of patients' vital signs can be gathered from the sensor nodes equipped on the body of the patients and then can be accessed by the healthcare professionals by using a mobile device. By reason of the open feature of wireless communication, how to guarantee secure communication becomes an important issue. On the other hand, because the vital signs parameters are sensitive to the patients' health status and no one wants to reveal it to the others except the healthcare professionals, the protection of patients' privacy becomes another key issue for WMSNs applications. User authentication protocol with anonymity is the most basic and commonly used method to resolve the security and privacy issues of WMSNs. Recently, He et al. proposed an enhanced authentication protocol for healthcare applications using WMSNs to protect the security and privacy problems. However, we find that their scheme is incorrect in authentication and session key agreement phase. Besides, their scheme has no wrong password detection mechanism, which will not only waste the unnecessary computation and communication costs, but also may deduce the denial of service problem. In this paper, the biometric is introduced as the third authentication factor, and a new user anonymous authentication protocol based on WMSNs is designed so as to remove the drawbacks of the protocol of He et al. Compared with previous protocols, the new presented protocol enhances the security and also keeps the computation efficiency. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Energy conserving MAC protocols performing adaptive duty-cycling mechanism have been widely studied to improve the energy efficiency in Wireless Sensor Networks (WSNs). In particular, several asynchronous low power listening (LPL) MAC protocols such as B-MAC, X-MAC and ContikiMAC transmit a long preamble or consecutive data packets for an efficient rendezvous between senders and receivers. However, the rendezvous results in the challenging problem of unnecessary channel utilization since the senders occupy a large portion of the medium. Furthermore, when a traffic generation time overlaps with other neighbouring nodes, they frequently encounter spatially-correlated contention incurring excessive channel contention. In this paper, we propose a novel traffic distribution scheme called an Energy Efficient Transmission Alignment (EETA), that shifts a traffic generation time of the application layer. By using a MAC layer feedback including contention information, the cross-layer framework determines whether the node delays its transmission or not. EETA is robust from the heavy contending environment due to its traffic distribution feature. We evaluate the performance of EETA through diverse experiments on the TelosB platform. The results show that EETA improves the overall energy efficiency by up to 35%, and reduces the latency by up to 48% compared to the existing scheme. [ABSTRACT FROM AUTHOR]

We report the development of a network of wireless ultralow-power sensors to be deployed on freight railway cars, with the main purpose of detecting derailment events and alerting the engineer in the cab of the leading locomotive. Because no power bus is available on freight cars, we plan to rely on energy scavenging from vibrations; therefore, minimization of the power consumption has been one of our main priorities. We have, therefore, focused on ultralow-power hardware and strived to reduce the time intervals during which it is in active mode, achieving an average power consumption of $\sim 0.5$ mW with an active cycle of $\sim 20$ ms every 2 s. We discuss the overall concept that we propose, including the self-initialization protocol and the communication strategy that we have developed, and present the results of measurements on a prototype network that we have implemented. [ABSTRACT FROM AUTHOR]