Connected P-percent coverage in wireless sensor networks based on degree constraint dominating set approach

In this paper, we propose an algorihm for conneced p-percent coverage probem in Wireless Sensor Networks(WSNs) to improve the over netork life time. In this work, we invstigae the p-pernt coverage problem(PCP) in WSNs which require % of n area should be monitored correctl and to find ou ny additional requirements of the connec p-percent coverge prom. We prose pDCDS algorith which is a learnin autmaton basd algorithm fr PCP pDCDS is a Degreconsained Connected Domining Se based algoithm whch detect the minimum numbe of des to monitor an area. The simulation results demonstrate hat pDCDS can remarkably improve the network lifetime.

Novel approach for information discovery in autonomous wireless sensor networks

Autonomous Wireless sensor networks(WSNs) have sensors that are usually deployed randomly to monitor one or more phenomena. They are attractive for information discovery in large-scale data rich environments and can add value to mission–critical applications such as battlefield surveillance and emergency response systems. However, in order to fully exploit these networks for such applications, energy efficient, load balanced and scalable solutions for information discovery are essential. Multi-dimensional autonomous WSNs are deployed in complex environments to sense and collect data relating to multiple attributes (multi-dimensional data). Such networks present unique challenges to data dissemination, data storage of in-network information discovery. In this paper, we propose a novel method for information discovery for multi-dimensional autonomous WSNs which sensors are deployed randomly that can significantly increase network lifetime and minimize query processing latency, resulting in quality of service (QoS) improvements that are of immense benefit to mission–critical applications. We present simulation results to show that the proposed approach to information discovery offers significant improvements on query resolution latency compared with current approaches.

Energy efficient sleep schedule with service coverage guarantee in wireless sensor networks

Service oriented architecture has been proposed to support collaborations among distributed wireless sensor network (WSN) applications in an open dynamic environment. However, WSNs are resource constraint, and have limited computation abilities, limited communication bandwidth and especially limited energy. Fortunately, sensor nodes in WSNs are usually deployed redundantly, which brings the opportunity to adopt a sleep schedule for balanced energy consumption to extend the network lifetime. Due to miniaturization and energy efficiency, one sensor node can integrate several sense units and support a variety of services. Traditional sleep schedule considers only the constraints from the sensor nodes, can be categorized to a one-layer (i.e., node layer) issue. The service oriented WSNs should resolve the energy optimization issue considering the two-layer constraints, i.e., the sensor nodes layer and service layer. Then, the one-layer energy optimization scheme in previous work is not applicable for service oriented WSNs. Hence, in this paper we propose a sleep schedule with a service coverage guarantee in WSNs. Firstly, by considering the redundancy degree on both the service level and the node level, we can get an accurate redundancy degree of one sensor node. Then, we can adopt fuzzy logic to integrate the redundancy degree, reliability and energy to get a sleep factor. Based on the sleep factor, we furthermore propose the sleep mechanism. The case study and simulation evaluations illustrate the capability of our proposed approach.

A mobile health network disaster management system

A common occurrence in almost all full-scale natural disasters is the rapid destruction of the telecommunication infrastructure as the inevitable unfolds, which tends to halt the necessary communications between the humanitarian operators and the people in need. In such scenarios, the deployment of wireless networks would provide fast and temporary remedies, however these networks normally do not provide services to the end-users and ordinary people, instead they provide connectivity between groups of end-users administered by a local service provider. From a range of services provided to the end-users by the humanitarian operators, healthcare is by far the top priority. This is considered through the utilization of smartphones in a Mobile Health (mHealth) perspective, which is an emerging concept for monitoring and tracking end-user health conditions. This article considers an mHealth system used in a tsunami-stricken disaster scenario, including a discussion on the most recent advances of Device to Device (D2D) and LTE-Direct technologies.

Wireless-based sleep technology for monitoring sleep apnea

Abstract: This paper covers the technical aspects of the wireless-based sleep technology for monitoring sleep apnea, which is a sleep disorder that can be detected via continuous monitoring. In this paper, a wireless system testbed is designed to monitor the patients for the signs of sleep apnea. The testbed is comprised of a number of biomedical sensors, which are used to monitor the related biological parameters related to the patient's sleeping mechanism, such as: nasal airflow, snoring, abdominal, leg, chest, and eye movements, blood oxygen level, blood pressure, and body position. The goal of this paper is to characterize the and model the data traffic generated from the biomedical sensors used in the sleep apnea study and find the network-centric lower traffic limits; minimum frequency deployment and minimum bandwidth required.

Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks

Data aggregation in wireless sensor networks is employed to reduce the communication overhead and prolong the network lifetime. However, an adversary may compromise some sensor nodes, and use them to forge false values as the aggregation result. Previous secure data aggregation schemes have tackled this problem from different angles. The goal of those algorithms is to ensure that the Base Station (BS) does not accept any forged aggregation results. But none of them have tried to detect the nodes that inject into the network bogus aggregation results. Moreover, most of them usually have a communication overhead that is (at best) logarithmic per node. In this paper, we propose a secure and energy-efficient data aggregation scheme that can detect the malicious nodes with a constant per node communication overhead. In our solution, all aggregation results are signed with the private keys of the aggregators so that they cannot be altered by others. Nodes on each link additionally use their pairwise shared key for secure communications. Each node receives the aggregation results from its parent (sent by the parent of its parent) and its siblings (via its parent node), and verifies the aggregation result of the parent node. Theoretical analysis on energy consumption and communication overhead accords with our comparison based simulation study over random data aggregation trees.

Localized ant colony of robots for redeployment in wireless sensor networks

Sensor failures or oversupply in wireless sensor networks (WSNs), especially initial random deployment, create spare sensors (whose area is fully covered by other sensors) and sensing holes. We envision a team of robots to relocate sensors and improve their area coverage. Existing algorithms, including centralized ones and the only localized G-R3S2 [9], move only spare sensors and have limited improvement because non-spare sensors, with area coverage mostly overlapped by neighbour sensors, are not moved, and additional sensors are deployed to fill existing small holes. We propose a localized algorithm, called Localized Ant-based Sensor Relocation Algorithm with Greedy Walk (LASR-G), where each robot may carry at most one sensor and makes decision that depends only on locally detected information. In LASRG, each robot calculates corresponding pickup or dropping probability, and relocates sensor with currently low coverage contribution to another location where sensing hole would be significantly reduced. The basic algorithm optimizes only area coverage, while modified algorithm includes also the cost of robot movement. We compare LASR-G with G-R3S2, and examine both single robot and multi robots scenarios. The simulation results show the advantages of LASR-G over G-R3S2.

An alternative data collection scheduling scheme in wireless sensor networks

Despite significant advancements in wireless sensor networks (WSNs), energy conservation remains one of the most important research challenges. Recently, the problem of energy conservation has been addressed by applying mobile sink as an effective technique that can enhance efficiency of energy consumption in the networks. In this paper, the energy conservation problem is firstly formulated to maximize the lifetime of WSN subject to delay and node energy constraints. Then, to solve the defined energy conservation problem, a data collection scheduling with a mobile sink scheme is proposed. In the proposed approach, the sink movement is governed by a type-2 fuzzy controller to be located at the best location and time to collect sensory data. We conducted extensive experiments to study the effectiveness of the proposed protocol and compared it against the streaming data delivery (SDD) and virtual circle combined straight routing (VCCS) protocols. We observed that the proposed protocol outperforms both SDD and VCCS approaches by reducing energy consumption, minimize delays and enhance data collection quality.

A congestion control scheme based on fuzzy logic in wireless body area networks

One of the major challenges in healthcare wireless body area network (WBAN) applications is to control congestion. Unpredictable traffic load, many-to-one communication nature and limited bandwidth occupancy are among major reasons that can cause congestion in such applications. Congestion has negative impacts on the overall network performance such as packet losses, increasing end-to-end delay and wasting energy consumption due to a large number of retransmissions. In life-critical applications, any delay in transmitting vital signals may lead to death of a patient. Therefore, in order to enhance the network quality of service (QoS), developing a solution for congestion estimation and control is imperative. In this paper, we propose a new congestion detection and control protocol for remote monitoring of patients health status using WBANs. The proposed system is able to detect congestion by considering local information such as buffer capacity and node rate. In case of congestion, the proposed system differentiates between vital signals and assigns priorities to them based on their level of importance. As a result, the proposed approach provides a better quality of service for transmitting highly important vital signs.

RSSI-based localization of a wireless sensor node with a flying robot

We consider the problem of navigating a ying robot to a specific sensor node within a wireless sensor network. This target sensor node periodically sends out beacons. The robot is capable of sensing the received signal strength of each received beacon (RSSI measurements). Existing approaches for solving the sensor spotting problem with RSSI measurements do not deal with noisy channel conditions and/or heavily depend on additional hardware capabilities. In this work we reduce RSSI uctuations due to noise by continuously sampling RSSI values and maintaining an exponential moving average (EMA). The EMA values enable us to detect significant decrease of the received signal strength. In this case it is reasoned that the robot is moving away from the sensor. We present two basic variants to decide a new moving direction when the robot moves away from the sensor. Our simulations show that our approaches outperform competing algorithms in terms of success rate and ight time. Infield experiments with real hardware, a ying robocopter successfully and quickly landed near a sensor placed in an outdoor test environment. Traces show robustness to additional environmental factors not accounted for in our simulations.

Security considerations for wireless carrier agonistic bio-monitoring systems

Advances in information and communications technology has led to a significant advances in noncontact portable devices capable of monitoring vital signals of patients. These wearable and implantable bio-monitoring systems allow collections of wearable sensors to be constructed as a Body Area Network (BAN) to record biological data for a subject. Such systems can be used to improve the quality of life and treatment outcomes for patients. One of the main uses for a bio-monitoring system is to record biological data values from a subject and provide them to a doctor or other medical professional. However, wearable bio-monitoring systems raise unique security considerations. In this paper, we discuss some of the security considerations that have arisen in our work around communications agnostic bio-monitoring, and how we have addressed these concerns. Furthermore, the issues related to the identifying and trusting sender and receiver entities are discussed.

Fault tolerance in data gathering wireless sensor networks

In data gathering wireless sensor networks, data loss often happens due to external faults such as random link faults and hazard node faults, since sensor nodes have constrained resources and are often deployed in inhospitable environments. However, already known fault tolerance mechanisms often bring new internal faults (e.g. out-of-power faults and collisions on wireless bandwidth) to the original network and dissipate lots of extra energy and time to reduce data loss. Therefore, we propose a novel Dual Cluster Heads Cooperation (CoDuch) scheme to tolerate external faults while introducing less internal faults and dissipating less extra energy and time. In CoDuch scheme, dual cluster heads cooperate with each other to reduce extra costs by sending only one copy of sensed data to the Base Station; also, dual cluster heads check errors with each other during the collecting data process. Two algorithms are developed based on the CoDuch scheme: CoDuch-l for tolerating link faults and CoDuch-b for tolerating both link faults and node faults; theory and experimental study validate their effectiveness and efficiency. © 2010 The Author Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

Data mining via minimal spanning tree clustering for prolonging lifetime of wireless sensor networks

Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively. © World Scientific Publishing Company.

Dynamic minimal spanning tree routing protocol for large wireless sensor networks

Hundreds or thousands of wireless sensor nodes with limited energy resource are randomly scattered in the observation fields to extract the data messages for users. Because their energy resource cannot be recharged, energy efficiency becomes one of the most important problems. LEACH is an energy efficient protocol by grouping nodes into clusters and using cluster heads (CH) to fuse data before transmitting to the base station (BS). BCDCP improves LEACH by introducing a minimal spanning tree (MST) to connect CHs and adopting iterative cluster splitting algorithm to choose CHs or form clusters. This paper proposes another innovative cluster-based routing protocol named dynamic minimal spanning tree routing protocol (DMSTRP), which improves BCDCP by introducing MSTs instead of clubs to connect nodes in clusters. Simulation results show that DMSTRP excels LEACH and BCDCP in terms of both network lifetime and delay when the network size becomes large.

Mobility increases the risk of malware propagations in wireless networks

In this paper, we study the malware propagation issue in wireless networks, considering the features of channel interference, access competition and possible mobility. We propose a basic spread model based on the uniform scanning strategy. Referring to the wireless transmission and network capacity theories, we provide the bound of infection rate in wireless networks with fixed nodes. Furthermore, we evaluate the impact of mobility on malware propagations. Detailed performance analysis shows that mobility will greatly increase the risk of malware attacks in wireless networks. The results in this paper provide insights on the malware propagation characteristics in wireless networks and fundamental guidelines on designing defence schemes.