Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets

Author(s):  
Sushil K. Prasad ◽  
Akshaye Dhawan
Author(s):  
Can Umut Ileri ◽  
Cemil Aybars Ural ◽  
Orhan Dagdeviren ◽  
Vedat Kavalci

An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.


2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Paritosh Ramanan ◽  
Goutham Kamath ◽  
Wen-Zhan Song

With the onset of Cyber-Physical Systems (CPS), distributed algorithms on Wireless Sensor Networks (WSNs) have been receiving renewed attention. The distributed consensus problem is a well studied problem having a myriad of applications which can be accomplished using asynchronous distributed gossip algorithms on Wireless Sensor Networks (WSNs). However, a practical realization of gossip algorithms for WSNs is found lacking in the current state of the art. In this paper, we propose the design, development, and analysis of a novel in situ distributed gossip framework called INDIGO. A key aspect of INDIGO is its ability to perform on a generic system platform as well as on a hardware oriented testbed platform in a seamless manner allowing easy portability of existing algorithms. We evaluate the performance of INDIGO with respect to the distributed consensus problem as well as the distributed optimization problem. We also present a data driven analysis of the effect certain operating parameters like sleep time and wait time have on the performance of the framework and empirically attempt to determine asweet spot. The results obtained from various experiments on INDIGO validate its efficacy, reliability, and robustness and demonstrate its utility as a framework for the evaluation and implementation of asynchronous distributed algorithms.


2013 ◽  
Vol 24 (01) ◽  
pp. 31-50 ◽  
Author(s):  
JOHN AUGUSTINE ◽  
QI HAN ◽  
PHILIP LODEN ◽  
SACHIN LODHA ◽  
SASANKA ROY

We consider the convergecast problem in wireless sensor networks where each sensor has a reading that must reach a designated sink. Since a sensor reading can usually be encoded in a few bytes, more than one reading can readily fit into a standard transmission packet. We assume that each packet hop consumes one unit of energy. Our objective is to minimize the total energy consumed to send all readings to the sink. We show that this problem is NP-hard even when all readings are of fixed size. We then study a class SPEP of distributed algorithms that is completely defined by two properties. Firstly, the packets hop along some shortest path to the sink. Secondly, the nodes use an elementary packing algorithm to pack readings into packets. Our main technical contribution is a lower bound. We show that no algorithm for UCCP that either follows the shortest path or packs in an elementary manner is a (2 − ϵ)-approximation, for any fixed ϵ > 0. To complement this, we show that SPEP algorithms are [Formula: see text]-approximation for UCCP and 3-approximation for CCP, where k ≥ 2 is the number of readings that can fit within a packet. We conclude with some special cases and experimental observations.


Sign in / Sign up

Export Citation Format

Share Document