Routing Protocol with Optimal Location of Aggregation Point in Wireless Sensor Networks

1IntroductionAdvances in the miniaturization of MicroElectronicand Mechanical Structures(MEMS)haveledto batterypowered sensor nodes that have sensing,communica-tion,and processing capabilities[1~4].Sensor networkshave emerged as an indispensable and i mpo…     

An Energy-Efficient Routing and Self-Organization Algorithm in Wireless Sensor Networks

1IntroductionAs the development of MEMStechnology,the microsensors whichintegrate manyfunctions such as sensing,signal processing and communication have been widelyused[1]. Wireless Sensor Network ( WSN) is construct-ed with hundreds to thousands of sensors and one ormore SINKs .Sensors can sense (monitor) many physi-cal signals such as sound,light ,electronics ,tempera-ture and humidity of the objects in a given region[2 ~3].Sensors transfer these signalsinto sensing data and sendsensin…     

Adaptive Pull�CPush Based Event Tracking in Wireless Sensor Actor Networks

Wireless sensor networks have attracted significant interest for various scientific, military, and e-health applications. Recently a new class of sensor networks ??sensor/actor networks?? has been introducing new research challenges due to the unique coordination requirements among sensors and actors. In sensor/actor networks, actors are the nodes that have the capability to move in the field, equipped with powerful devices and can respond to the events of interest. With this capability, autonomous operation of the network is possible without a centralized controlling mechanism. This, however, requires the network to apply cooperative mechanism to decide when and how monitoring is done to track the event and how the event will be responded. In this regard, little work has been done in terms of co-existing Push and Pull data flows in the network. In this paper, we propose an Adaptive Pull?CPush (APP) based Event Tracking approach that allows sensor-to-actor communication as well as actors coordination in response to the events occurred. APP proposes two models of sensors organization: region-based organization (RAPP) and neighbor-based organization (NAPP) to alert nodes in the vicinity of reported event. APP exploits the mobility of actor nodes to form dynamic responsibility clusters, thus ensuring an event specific response to emergencies. Routing in APP is based on Routing by Adaptive Targeting (RAT), which is a delay-constrained geographical routing protocol. Simulation results reveal significant performance improvement in terms of response time and energy conservation.     

A Tracking-Based Target Locating Algorithm in Wireless Sensor Networks

1　IntroductionAwirelesssensornetworkisusuallycomposedofhundredsorthousandsofsensorsequippedwithcomputation ,sensingandcommunicationdevices,whicharecoordinatedinadistributedmodeinordertomonitoracertaingeographicalregionandcollectinformationontheirsurroundings[1 ] .Thecollecteddataisthenusedtoanswervariousqueries.RecentadvancesinMEMS ,wirelesscommunications,anddigitalelectronicshavemadepossiblethecheapandfastdeploymentofsensornetworks[2 ] .Suchadhoc,self organizingsensornetworksarereceivingin…     

Unequal Clustering Protocols for Wireless Sensor Networks—Taxonomy,Comparison and Simulation

Wireless Sensor Network (WSN) consists of randomly distributed sensor nodes which can collect, process, route and transmit data from their respective environment. Most of the research on WSN is oriented towards optimizing utilization of finite resources of Sensor Nodes to increase the overall network operative time. Recent literature on WSNs reveals that hierarchical routing unequal clustering methodologies are gaining popularity due to energy efficiency, load balancing and scalability. In literature, numerous surveys on clustering methodologies are available which address different equal clustering methods. The unequal clustering protocols, which have their own attributes viz. balance load distribution, hot spot mitigation and energy efficiency, are comparatively less explored. This motivated us to undertake the present study on the taxonomy, comparison and simulation analysis of different methodologies pertaining to less explored unequal clustering protocols. Our base metrics for comparison of different unequal clustering protocols are scalability, energy efficiency & load balancing capability of the resulting network. A comprehensive discussion has also been presented to highlight the various advantages and disadvantages of different unequal clustering protocols. Further, we have summarized the study of unequal clustering protocols in the tabular form.

     

Intelligence Framework Based Analysis of Spatial–Temporal Data with Compressive Sensing Using Wireless Sensor Networks

Wireless sensor networks produce immense sensor readings within a report interval to the sink. So transfer of information in a resource constrained wireless environment is difficult. Compressive sensing overcomes the resource constrains in wireless environment by exploiting sparsity in transfer with fewer measurement and recovery of original signal. In this research Intelligent Neighbor Aided Compressive Sensing (INACS) scheme is proposed for efficient data assembly in spatial and temporal correlated WSNs. Sparse Matrix has been formed with spatial and temporal coordinates for data transfer. In every sensing period, the sensor node just sends the readings within the sensing period to uniquely selected neighbour based on a correlation. The transmission period provides significant improvement with compressed data using INACS with the measurement matrix. Thus INACS provides reduction in number of transmission and higher reconstruction accuracy. INACS has been compared with Compressive wireless sensing for reduction in number of transmissions achieved. The time series analysis with INACS has been done to validate the simultaneous association between number of transmissions and time period.

     

Multi-constrained Max–Min Fair Resource Allocation in Multi-channel Wireless Sensor Networks

Wireless Personal Communications - Recent rich applications for the Internet of Things are demanding large bandwidth for communication which can cause congestion within multi-hop wireless sensor...     

Indoor Radio Propagation and Interference in 2.4 GHz Wireless Sensor Networks: Measurements and Analysis

In wireless sensor networks (WSNs), the performance and lifetime are significantly affected by the indoor propagation and the interference from other technologies using the 2.4 GHz band. Next to an overview of the propagation and coexistence issues in the literature, we present a model for analysing these effects in WSNs. We also present our measurements results on the indoor propagation, the interference of the microwave oven (MWO) and their impact on the performance of the WSN. The propagation measurements reveal significant influence of the multipath: changing a node position with a few centimetres or changing the communication channel can lead up to 30 dB difference in the received power. The power leakage of MWO has been observed around $-$ 20 dBm at 1 m distances to the oven. This leads to extra retries of the 802.15.4 messages which matches our simulation results: the packet success ratio at first try decreases to 30–40 %, which increases the average active time of the sensor, closely located to the MWO. We observe that the ON–OFF pattern of the MWO could be exploited by WSNs to improve the performance.     

Is Localization of Wireless Sensor Networks in Irregular Fields a Challenge?

Wireless Personal Communications - Wireless sensor networks have been considered as an emerging technology for numerous applications of cyber-physical systems. These applications often require the...     

Diagnosis of Wireless Sensor Networks in Presence of Permanent and Intermittent Faults

In this paper we consider the problem of distributed fault diagnosis in Wireless Sensor Networks (WSNs). The proposed Fault Diagnosis Algorithm (FDA) aims to handle both permanent and intermittent faults. The sensor nodes with permanent communication faults can be diagnosed by using the conventional time-out mechanism. In contrast, it is difficult to detect intermittent faults due to their inherent unpredictable behavior. The FDA is based on the comparison of sensor measurements and residual energy values of neighboring sensor nodes, exploiting their spatial correlations. To handle intermittent faults, the comparisons are made for \(r\) rounds. Two special cases of intermittent faults are considered: one, when an intermittently faulty node sends similar sensor measurement and similar residual energy value to some of its neighbors in all \(r\) rounds; another, when it sends these values, either or both of which deviates significantly from that of some neighbors in all \(r\) rounds. Through extensive simulation and analysis, the proposed scheme is proved to be correct, complete, and efficient to handle intermittent faults and hence, well suited for WSNs.     

A Novel Hybrid Optimization for Cluster‐Based Routing Protocol in Information-Centric Wireless Sensor Networks for IoT Based Mobile Edge Computing

Wireless Personal Communications - In present days, the utilization of mobile edge computing (MEC) and Internet of Things (IoT) in mobile networks offers a bottleneck in the evolving technological...     

P-Zone： Connectivity-based Packet Path Tracing in Wireless Sensor Networks

In large-scale Wireless sensor networks （WSNs）, the network status is complex and unpredictable, which brings great challenges to practical network design and management. Tracing the route path of each data packet in the network is an important way to observe network behaviors and understand network dynamics. However, tracing the full route path of each packet could be highly challenging, due to the hard resource con- straint in WSNs. Our previous work proposes a hash-based path tracing mechanism, and leverages network connectivity and node locations to reduce the computational complexity. However, the node locations may be unavailable in some scenarios. In this work, we further propose a location-free enhancement to the hash-based path tracing mechanism, called P-Zone. P-Zone requires only network connectivity information to reduce the computational complexity. Theoretical analysis and practical simulations are conducted to evaluate the effectiveness and performance of our design. The results indicate that P-Zone can significantly reduce the computational complexity of the hashbased path tracing mechanism, while effectively tracing the full route path of each packet in the network in a real-time manner, and outperforms the state-of-the-art methods.     

Distributed and Energy Efficient Self-Organization for On–Off Wireless Sensor Networks

In this paper, we utilize clustering to achieve energy efficiency for the on–off wireless sensor network, whose member nodes alternate between active and inactive states. In the proposed Distributed and Energy Efficient Self Organization (DEESO) scheme, the head election is adjusted adaptively to the remaining battery levels of local active nodes, which is a completely distributed approach compared to LEACH that relying on other routing schemes to access global information. Furthermore, we apply the Adaptive Channel Assignment (ACA) to address the on-off topology changes. Simulation results show that DEESO delivers 184% amount of data to the base station as LEACH for the same amount of energy consumption and the effective network lifetime is extended by around 50%.     

Automata Based Hybrid PSO–GWO Algorithm for Secured Energy Efficient Optimal Routing in Wireless Sensor Network

The main objective in wireless sensor networks is to exploit efficiently the sensor nodes and to prolong the lifetime of the network. The discussion of energy is a significant concern to extend the lifetime of the network. Moreover, a nature inspired hybrid optimization approach called hybrid Particle Swarm Optimization–Grey Wolf Optimizer (PSO–GWO) is used in this work to efficiently utilize the energy and to transmit the data securely in an augmented path. A Learning Dynamic Deterministic Finite Automata (LD²FA) has been innovated and initiated to learn the dynamic role of the environment. LD²FA is mainly used to provide the learned and accepted string to hybrid PSO–GGWO so that the routes are optimized. Hybrid PSO–GWO is used to choose the optimal next node for each path to obtain the optimal route. The simulation results are obtained in MATLAB for 100–700 sensor nodes in a region of 500 × 500 m² which demonstrate that the proposed LD²FA based Hybrid PSO–GWO algorithm obtains better results when compared with existing algorithms. It is observed that LD²FA based Hybrid PSO–GWO has an increase of 18% and 48% betterment in lifetime of the network than PSO and GLBCA, nearly 57% and 75% increase in network lifetime when compared with GA and LDC respectively. It also shows an improvement of 24% increase compared to cluster-based IDS, nearly a rise of 90% throughput when compared with lightweight IDS. The consumption of energy is reduced by 13% and 15% than PSO and GA and an increase of 15% utilization of energy than LDC. Therefore, LD²FA based Hybrid PSO–GWO is been considered to efficiently utilize energy in an optimal route.

     

A sub-nanosecond Synchronized MAC – PHY cross-layer design for Wireless Sensor Networks

In this paper, we present a Wireless Sensor node implementation which aims at solving two major issues in Wireless Sensor Networks. This solution provides nanosecond-scale synchronization between nodes and high data-rate transmission thanks to cross-layer design and the time-domain properties of UltraWide Band (UWB) modulation schemes. The high data rate is achieved through a specific implementation of a IR-UWB physical layer. Specific algorithms are also implanted into the MAC and physical layers and form a cross-layered synchronization protocol for deterministic Wireless Sensor Networks named WiDeCS (Wireless Deterministic Clock Synchronization). This protocol propagates master time reference to nodes of a cluster tree network. WiDeCS Cross layered scheme is possible thanks to flag signals rising in the physical layer. These signals, owing to the UWB time domain properties, capture precise timestamps of transmission and reception. Hardware level simulations show a clock synchronization precision of 2 ns with a 2 GHz bandwidth signal, and an ASIC demonstrator shows 374 ps synchronization precision and 677 ps of standard deviation with the same bandwidth. In this paper, the physical layer implementation is detailed, and the cross-layered WiDeCS scheme is demonstrated.     

An Energy-Aware Geographical Forwarding Protocol Utilizing Adaptive Sleeping in Wireless Sensor Networks

1IntroductionA wireless sensor network is the combination of thephysical world and information technology.Sensor net-works can contain hundreds of thousands of cheap sens-ing nodes that work in the formof Ad Hoc networks,monitoring the environment andrepo…     

Multi-Fractal Characteristics of Mobile Node’s Traffic in Wireless Mesh Network with AODV and DSDV Routing Protocols

The analysis of traffic characteristics can be used for performance evaluation, design and implementation of routing protocols in WMNs (Wireless Mesh Networks). Higher bursty traffic will cause larger queue size, which means more dropping packets, and thus affects other metrics. Because burstiness can be modeled by multi-fractal characteristics effectively, multi-fractal characteristics of mobile node’s traffic in WMNs are analyzed with typical proactive and reactive routing protocols, which are DSDV (Destination Sequenced Distance Vector) and AODV (Ad hoc On-demand Distance Vector), respectively. Three types of traffic models are used to generate traffic at application level, which corresponding to open-loop and closed-loop scenarios. With different configurations, the probability distribution of inter-arrival time and multi-fractal characteristics of traffic at mobile node and gateway are analyzed with DSDV and AODV protocols. Results show that inter-arrival time with AODV and DSDV protocols possesses heavy-tailed property. And traffic with DSDV protocol exhibits more multi-fractal characteristics than that with AODV protocol, which can explain the higher routing performance of AODV.