TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS

2013 ◽  
Vol 24 (01) ◽  
pp. 31-50 ◽  
Author(s):  
JOHN AUGUSTINE ◽  
QI HAN ◽  
PHILIP LODEN ◽  
SACHIN LODHA ◽  
SASANKA ROY
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Lower Bound ◽  
Distributed Algorithms ◽  
Shortest Path ◽  
Wireless Sensor ◽  
Fixed Size ◽  
Sensor Reading ◽  
Special Cases ◽  
Elementary Manner

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.

scholarly journals Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 5409-5414
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Shortest Path ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

On Vertex Cover Problems in Distributed Systems

2016 ◽  
pp. 1-29 ◽  
Author(s):  
Can Umut Ileri ◽  
Cemil Aybars Ural ◽  
Orhan Dagdeviren ◽  
Vedat Kavalci
Keyword(s):  
Wireless Sensor Networks ◽  
Distributed Systems ◽  
Sensor Networks ◽  
Communication Networks ◽  
Distributed Algorithms ◽  
Data Aggregation ◽  
Undirected Graph ◽  
Vertex Cover ◽  
Research Area ◽  
Wireless Sensor

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.

Stochastic Multi-Hop Model of Coding-Based Reprogramming Protocols in Lossy Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 2120-2123
Author(s):  
Jun Wei Li ◽  
Shi Ning Li ◽  
Yu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Dynamic Process ◽  
Analytical Approach ◽  
Static Model ◽  
Wireless Sensor ◽  
Shortest Path Algorithm ◽  
Data Packets

Reprogramming in lossy wireless sensor networks is a dynamic process. Dijkstra’s shortest path algorithm is used in previous work to represent the multi-hop propagation of data packets, however, it is not accurate enough to use a static model to capture the behaviors of stochastic multi-hop propagation. In this paper, we propose a stochastic multi-hop model in the analytical approach by randomly setting weight values for links between nodes. From simulations, the results of the analytical approach match that of simulations when incorporated with the stochastic multi-hop model.

Sign in / Sign up

Export Citation Format

Share Document