Based on single-hop flow control mechanism for wireless sensor networks

How to determine the source-visiting sequence among the target sensor nodes and manage the mobile agent (MA) effectively is the crucial problem in Mobile-Agent-based computing model for wireless sensor networks (WSNs). In this paper, we propose a novel improved Directed Diffusion-based MA mechanism (IDDMA) for WSNs. IDDMA uses an improved gradient generation algorithm to set up multiple optimal gradients among sensor nodes. The source nodes will subsequently send two distinct types of the exploratory data packet to implement the discovery of the sources and build the routing tables for the MA routing, respectively. Then, the MA in target region could choose its next-hop node dynamically according to the established routing table for MA in each source node and achieve the data fusion; finally it will return to the Sink. Simulation results show that the mechanism outperforms two existing routing protocols in end-to-end packet delay and average energy consumption.

One of the most effective way to prevent unauthorized and corrupted message being forwarded in wireless sensor network. But there is high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. So to address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial. when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In the existing system, an unconditionally secure and efficient source anonymous message authentication (SAMA) scheme is presented which is based on the optimal modified Elgamal signature (MES) scheme on elliptic curves. This MES scheme is secure against adaptive chosen-message attacks in the random oracle model. This scheme enables the intermediate nodes to authenticate the message so that all corrupted message can be detected and dropped to conserve the sensor power. While achieving compromise resiliency, flexible-time authentication and source identity protection, this scheme does not have the threshold problem. While enabling intermediate nodes authentication, this scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. But by using this method the black hole and gray hole attacks are detected but wormhole attack is doesn't detect. Because the wormhole attack is one of the harmful attacks which degrade the network performance. So, in the proposed system, one innovative technique is introduced which is called an efficient wormhole detection mechanism in the wireless sensor networks. In this method, considers the RTT between two successive nodes and those nodes' neighbor number which is needed to compare those values of other successive nodes. The identification of wormhole attacks is based on the two faces. The first consideration is that the transmission time between two wormhole attack affected nodes is considerable higher than that between two normal neighbor nodes. The second detection mechanism is based on the fact that by introducing new links into the network, the adversary increases the number of neighbors of the nodes within its radius. An experimental result shows that the proposed method achieves high network performance.

The current research work in wireless sensor networks has mostly focused on the resolving issues related to power consumption and computational resource constraints in the wireless sensor networks .To achieve the same various specific routing schemes ,MAC and cross layered protocols and techniques have been proposed and designed .But with recent advances the privacy issues related to the data collected and transmitted by the wireless sensor networks had taken the center stage .Privacy preservation in wireless sensor networks has become more challenging because of the wireless nature of communication in WSN as well as its self organizing architecture. The present paper provides a comparative review of various privacy preserving mechanisms proposed and implemented in wireless sensor networks with respect to the privacy notions of k- anonymity and L-diversity. Along with the discussion and analysis the present work is an effort for the pavement of a way towards the future research in the field of privacy preservation in WSN.

Wireless sensor networks (WSNs) are wireless ad hoc networks of tiny sensor nodes increasingly deployed for multiple civilian and military applications, including patient monitoring, wildlife monitoring, battlefield surveillance, enemy tracking, etc. Like other computer networks, WSNs must be provided of security services such as key management, confidentiality, integrity and authentication. However, the nature of WSNs and their operational requirements introduce new exciting challenges on security design. Key management is a fundamental security service and a hot topic of research in security for WSNs. In this paper, we will review the state of the art on key management for WSNs and provide a glimpse on current and future developments in this area.

Severe energy constraints and hence the low power communication requirements amplify the significance of the energy efficient and preferably cross-layer error control mechanisms in wireless sensor networks (WSN). In this paper, a cross-layer methodology for the analysis of error control schemes in WSNs is presented such that the effects of multi-hop routing and the broadcast nature of the wireless channel are investigated. More specifically, the cross-layer effects of routing, medium access and physical layers are considered. This analysis enables a comprehensive comparison of forward error correction (FEC) and automatic repeat request (ARQ) in WSNs. FEC schemes improve the error resiliency compared to ARQ. In a multi-hop network, this improvement can be exploited by reducing the transmit power (transmit power control) or by constructing longer hops (hop length extension), which can be achieved through channel-aware routing protocols. The results of our analysis reveal that for certain FEC codes, the hop length extension decreases both the energy consumption and the end-to-end latency subject to a target PER compared to ARQ. Thus, FEC codes can be regarded as an important candidate for delay sensitive traffic in WSNs. On the other hand, transmit power control results in significant savings in energy consumption at the cost of increased latency. Moreover, the cases where ARQ outperforms FEC codes are indicated for various end-to-end distance and target PER values

The routing protocols are of great importance to researchers which deal with the QoS, energy consumption, network design and packet overhead. This paper describes a new method for efficient performance of wireless sensor networks concentrating on cluster design strategy. The proposed approach Water-Rippling Shaped Clustering (WARIS), is a hybrid approach applies to cluster the large-scale network which looks like the shape of water rippling. It considers the parameters like per node energy consumption, total network energy consumption, the number of designed clusters and their member nodes, and the time spent during cluster design for evaluating the performance of competing algorithms. Major achievements are improved cluster design, energy aware cluster head (CH) selection method and reducing re-clustering overhead. Simulation results prove the enhancements.

Wireless Sensor Network (WSN) is gradually taking the center stage as the foundation network for the Internet of Things (IoT), however, it is not without its challenges. These include lossy wireless links, limited processing capacity, limited memory and storage, and most importantly limited battery life. These limitations are inherent because of the small form-factor of a sensor device, which could be as small as a finger-tip. Of these challenges, the most pressing is limited battery life or power as this directly affects the network lifetime. Subsequently, the standard WSN architecture presents only one sink, serving as a gateway between the local sensor network, and the external network which in most cases is the Internet. The demanding pressure of routing data through a single sink makes it a Single Point of Failure (SOF), this means if the sink goes down, the entire network goes down. This practice is not only suboptimal but inefficient. In this paper, we propose a Multi-Sink Load Balancing Mechanism (MSLBM) for WSN. This mechanism adaptively and dynamically assigns network loads or traffic to sinks with less instantaneous operational tasks. It operates in such a way that no sink is overloaded with tasks which may result in early battery drainage and inadvertently untimely shutdown of the network. MSLBM was benchmark with related mechanisms with an outstanding performance of 98% Packet Delivery Ratio (PDR), least Latency of 21.7ms, and least Power Consumption of 1.6mW. This, therefore, presents MSLBM as an optimal energy-efficient load-balancing mechanism for a prolonged operational lifetime.

Node failures are inevitable in wireless sensor networks (WSNs) because sensor nodes in WSNs are miniature and equipped with small and often irreplaceable batteries. Due to battery drainage, sensor nodes can fail at any instance. Moreover, WSNs operate in hostile environments and environmental factors may also contribute to nodes failure. Failure of nodes leads to disruption of inter-node connectivity and might also lead to network partitioning. Failure to communicate with each other and with the base station can compromise the basic operation of the sensor network. For restoration of connectivity, a robust recovery mechanism is required. The existing connectivity restoration mechanisms suffer from shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration. As a result, most of these mechanisms lead to the excessive mobility of nodes, which itself causes the utilization of excessive battery. In this work, we propose a novel technique called smart node relocation (SNR). SNR is capable of detecting and restoring the connectivity caused by either single or multiple node failures. For achieving energy efficiency, SNR relies on transmitting a lesser number of control packets. For achieving the goal of being coverage-aware, it tries to relocate only essential nodes while trying to restore connectivity. By performing extensive simulations, we prove that SNR outperforms the existing approaches concerning multiple performance metrics including but not limited to the total number of packets transmitted, total distance moved for connectivity restoration, the percentage reduction in field coverage.

Wireless sensor network (WSN), has been a much attracted area for researchers for quite a while. Even with the extensive research activity over the last few years, WSNs still has a lot of ground to cover. Sensor Networks are basically data- centric wireless self-organizing network which is created by the many individual sensor nodes. They are battery driven devices, and as any battery powered devices it too has a limited lifespan. WSNs are widely used for tracking wild animals and border surveillance, enemy tracking, etc. Hence it may not be possible to recharge batteries frequently so the main objective will be to reduce energy consumption. It can be reduced in many ways like effective node placement, clustering, data aggregation, synchronized transmission etc. In this paper we are analyzing some of the available protocols for our further research.

With the explosion of big data, the implementation of distributed machine learning mechanisms in wireless sensor networks (WSNs) is becoming required for reducing the number of data traveling throughout the network and for identifying anomalies promptly and reliably. In WSNs, the above need has to be considered along with the limited energy and processing resources available at the nodes. In this paper, we tackle the resulting complex problem by designing a multi-criteria protocol CINE that stands for “Clustered distributed learnIng exploiting Node centrality and residual Energy” for distributed learning in WSNs. More specifically, considering the energy and processing capabilities of nodes, we design a scheme that assumes that nodes are partitioned in clusters and selects a central node in each cluster, called cluster head (CH), that executes the training of the machine learning (ML) model for all the other nodes in the cluster, called cluster members (CMs). In fact, CMs are responsible for executing the inference only. Since the CH role requires the consumption of more resources, the proposed scheme rotates the CH role among all nodes in the cluster. The protocol has been simulated and tested using real environmental data sets.

Real-time monitoring applications may generate delay sensitive traffic that is expected to be delivered within a firm delay boundary in order to be useful. In this context, a previous work proposed an End-to-End Delay (EED) estimation mechanism for Wireless Sensor Networks (WSNs) to preview potential useless packets, and to early discard them in order to save processing and energy resources. Such estimation mechanism accounts delays using timers that make use of an Exponentially Weighted Moving Average (EWMA) function where the smoothing factor is a constant defined prior to the WSN deployment. Later experiments showed that, in order to enhance the estimation results, such smoothing factor should be defined as a function of the network load.

The study aims to understand the various types of faults occur in a wireless sensor network (WSN). The primary objective of the fault‐tolerant technique is to enhance the robustness and self‐healing capacity of sensor network. The resource constraint environment, remote deployment and harsh monitoring conditions frequently invite different types of faults in WSN. The fault can be handled in two ways such as fault tolerance and fault prevention method. The novelty of this state‐of‐art is, the authors propose two new algorithms named Uniform Energy Clustering for fault tolerance and Population‐Based Clustering for fault prevention. The result of the simulation is satisfactory in comparison to existing algorithms such as Low Energy Adaptive Clustering Hierarchy, Stable Election Protocol, Virtual Area Partition – Energy and Energy‐Aware Multi‐Hop Multi‐Path Hierarchical protocols. In addition to these new algorithms, they also propose a unique taxonomy on fault which is based on sensitivity issues of specific applications.

Monitoring and response for emergency environments is a novel application area for the deployment of wireless sensor networks. In this context, delay-bounded delivery and robust routing is the essential operating criteria in order to ensure safe and timely response for emergency scenarios. Existing routing mechanisms for wireless sensor networks are not well suited for hazard situations, especially as they do not consider critical and dynamic network scenarios. In this paper, a novel delay-bounded and robust routing protocol is presented. The protocol adapts to handle dynamic emergency scenarios and works well with the routing “hole” problem. Theoretical analysis and simulation results indicate that our protocol is well suited for dynamic emergency scenarios when compared with other related work.

In wireless sensor networks, the voting technique is used to extract a reliable result from redundant information. This paper proposes a fast and tolerant voting mechanism (FTVM), which greatly reduces the polling delay at one election with the CDMA technique. This work also adopts intrusion detection techniques to identity the compromised nodes and replaces them with backup nodes, such that the tolerance of the network is improved by a large degree.Keywordswireless sensor networksintrusion detectionCDMAdata fusion

One key issue in networked systems that influences whether the deployed system will be able to provide timing guarantees is the Medium Access Control (MAC) protocol and its configurations. MAC protocols can be classified broadly into two categories: contention- and schedule-based. The contention-based protocols can easily adjust to the topology changes as new nodes may join and others may die after deployment. These protocols are based on Carrier Sense Multiple Access (CSMA) mechanisms and have higher costs due to potential interference, message collisions, overhearing, and idle listening than the schedule-based counterparts. Schedule-based protocols can avoid those problems by defining precise schedules, but they have strict time synchronization requirements. In this chapter we discuss scheduling approaches and mechanisms in wireless sensor networks. It sheds light on the medium access layer protocols, explains the mechanism of time-division medium access protocols, and finally how schedules are achieved within those protocols. The capacity to define schedules in wireless sensor networks is very important for planning operation-timings in the whole DCS.KeywordsWireless Sensor NetworksProvide Timing GuaranteesIdle ListeningTDMA ProtocolTime Division Multiple Access (TDMA)These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.