Using Minimum Connected Dominating Set for Mobile sink path planning in Wireless Sensor Networks

Wireless sensor networks are a motivating area of research and have a variety of applications. Given that these networks are anticipated to function without supervision for extended periods, there is a need to propose techniques to enhance the performance of these networks without consuming the essential resource sensor nodes have, which is their battery energy. In this paper, we propose a new sink node mobility model based on calculating the minimum connected dominating set of a network. As a result, instead of visiting all of the static sensor nodes in the network, the mobile sink will visit a small number or fraction of static sensor nodes to gather data and report it to the base station. The proposed model's performance was examined through simulation using the NS-2 simulator with various network sizes and mobile sink speeds. Finally, the proposed model's performance was evaluated using a variety of performance metrics, including End-To-End delay, packet delivery ratio, throughput, and overall energy consumption as a percentage

LAACAD: Load bAlancing k-area coverage through autonomous deployment in wireless sensor networks

Session 6B: Coverage & LocalizationAlthough the problem of k-area coverage has been intensively investigated for dense wireless sensor networks (WSNs), how to arrive at a k-coverage sensor deployment that optimizes certain objectives in relatively sparse WSNs still faces both theoretical and practical difficulties. In this paper, we present a practical algorithm LAACAD (Load bAlancing k-Area Coverage through Autonomous Deployment) to move sensor nodes toward k-area coverage, aiming at minimizing the maximum sensing range required by the nodes. LAACAD enables purely autonomous node deployment as it only entails localized computations. We prove the convergence of the algorithm, as well as the (local) optimality of the output. We also show that our optimization objective is closely related to other frequently considered objectives. Therefore, our practical algorithm design also contributes to the theoretical understanding of the k-area coverage problem. Finally, we use extensive simulation results both to confirm our theoretical claims and to demonstrate the efficacy of LAACAD. © 2012 IEEE.postprin

Distributed Fault-Tolerant Algorithm for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are a set of tiny autonomous and interconnected devices. These nodes are scattered in a region of interest to collect information about the surrounding environment depending on the intended application. In many applications, the network is deployed in harsh environments such as battlefield where the nodes are susceptible to damage. In addition, nodes may fail due to energy depletion and breakdown in the onboard electronics. The failure of nodes may leave some areas uncovered and degrade the fidelity of the collected data. Therefore, establish a fault-tolerant mechanism is very crucial. Given the resource-constrained setup, this mechanism should impose the least overhead and performance impact. This paper focuses on recovery process after a fault detection phase in WSNs. We present an algorithm to recover faulty node called Distributed Fault-Tolerant Algorithm (DFTA).The performance evaluation is tested through simulation to evaluate some factors such as: Packet delivery ratio, control overhead, memory overhead and fault recovery delay. We compared our results with referenced algorithm: Fault Detection in Wireless Sensor Networks (FDWSN), and found that our DFTA performance outperforms that of FDWSN

Autonomous deployment for load balancing k-surface coverage in sensor networks

published_or_final_versio

An Effective Approach for Recovering From Simultaneous Node Failures in Wireless Sensor Networks

In wireless sensor - actor networks, sensors probe their surroundings and forward their data to actor nodes. Actors collaboratively respond to achieve predefined application mission. Since actors have to coordinate their operation, it is nec essary to maintain a stron gly connected network topology at all times. Failure of one or multiple actors may partition the inter - actor network into disjoint segments, and thus hinders the network operation. Autonomous detection and rapid recovery procedures ar e highly desirable in such a case . One of the effective recovery methodologies is to autonomously reposition a subset of the actor nodes to restore connectivity. Contemporary recovery schemes either impose high node relocation overhead or extend some of th e inter - actor data pat hs. This paper overcomes these shortcomings and presents extended version of DCR named RAM, to handle one possible case of a multi - actor failure with Least - Disruptive topology Repair (LeDiR) algorithm for minimal topological changes . Upon failure detection , the backup actor initiates a recovery process that relocates the least num ber of nodes

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network

An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks

Wireless sensor networks (WSNs) have recently achieved a great deal of attention due to its numerous attractive applications in many different fields. Sensors and WSNs possesses a number of special characteristics that make them very promising in many applications, but also put on them lots of constraints that make issues in sensor network particularly difficult. These issues may include topology control, routing, coverage, security, and data management. In this thesis, we focus our attention on the coverage problem. Firstly, we define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We then solve it by proposing a novel, completely localized and distributed scheduling approach, naming Distributed Energy-efficient Scheduling for k-coverage (DESK) such that the energy consumption among all the sensors is balanced, and the network lifetime is maximized while still satisfying the k-coverage requirement. Finally, in related work section we conduct an extensive survey of the existing work in literature that focuses on with the coverage problem

makeSense: Simplifying the Integration of Wireless Sensor Networks into Business Processes

A wide gap exists between the state of the art in developing Wireless Sensor Network (WSN) software and current practices concerning the design, execution, and maintenance of business processes. WSN software is most often developed based on low-level OS abstractions, whereas business process development leverages high-level languages and tools. This state of affairs places WSNs at the fringe of industry. The makeSense system addresses this problem by simplifying the integration of WSNs into business processes. Developers use BPMN models extended with WSN-specific constructs to specify the application behavior across both traditional business process execution environments and the WSN itself, which is to be equipped with application-specific software. We compile these models into a high-level intermediate language—also directly usable by WSN developers—and then into OS-specific deployment-ready binaries. Key to this process is the notion of meta-abstraction, which we define to capture fundamental patterns of interaction with and within the WSN. The concrete realization of meta-abstractions is application-specific; developers tailor the system configuration by selecting concrete abstractions out of the existing codebase or by providing their own. Our evaluation of makeSense shows that i) users perceive our approach as a significant advance over the state of the art, providing evidence of the increased developer productivity when using makeSense; ii) in large-scale simulations, our prototype exhibits an acceptable system overhead and good scaling properties, demonstrating the general applicability of makeSense; and, iii) our prototype—including the complete tool-chain and underlying system support—sustains a real-world deployment where estimates by domain specialists indicate the potential for drastic reductions in the total cost of ownership compared to wired and conventional WSN-based solutions