Interference Aware Dominating Set for Sensor Network

2006 ◽  
Author(s):  
L. Gewali ◽  
K. Mohamad ◽  
Min Tun
Keyword(s):  
Sensor Network ◽  
Dominating Set

scholarly journals Enhanced PEGASIS using Dynamic Programming for Data Gathering in Wireless Sensor Network

2019 ◽  
Vol 7 (1) ◽  
pp. 176-199
Author(s):  
Mohammad Robihul Mufid ◽  
M. Udin Harun Al Rasyid ◽  
Iwan Syarif
Keyword(s):  
Dynamic Programming ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Transfer ◽  
Dominating Set ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Power Efficient ◽  
Adaptive Clustering

A number of routing protocol algorithms such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) have been proposed to overcome the problem of energy consumption in Wireless Sensor Network (WSN) technology. PEGASIS is a development of the LEACH protocol, where within PEGASIS all nodes are active during data transfer rounds thus limiting the lifetime of the WSN. This study aims to propose improvements from the previous PEGASIS version by giving the name Enhanced PEGASIS using Dynamic Programming (EPDP). EPDP uses the Dominating Set (DS) concept in selecting a subset of nodes to be activated and using dynamic programming based optimization in forming chains from each node. There are 2 topology nodes that we use, namely random and static. Then for the Base Station (BS), it will also be divided into several scenarios, namely the BS is placed outside the network, in the corner of the network, and in the middle of the network. Whereas to determine the performance between EPDP, PEGASIS and LEACH, an analysis of the number of die nodes, number of alive nodes, and remaining of energy were analyzed. From the experiment result, it was found that the EPDP protocol had better performance compared to the LEACH and PEGASIS protocols in terms of number of die nodes, number of alive nodes, and remaining of energy. Whereas the best BS placement is in the middle of the network and uses static node distribution topologies to save more energy.

TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET

2009 ◽  
Vol 01 (04) ◽  
pp. 485-498 ◽  
Author(s):  
ZHAO ZHANG ◽  
QINGHAI LIU ◽  
DEYING LI
Keyword(s):  
Wireless Sensor Network ◽  
Approximation Algorithms ◽  
Sensor Network ◽  
Connected Graph ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Performance Ratio ◽  
Wireless Sensor ◽  
Vertex Set

A vertex set D of a connected graph G is a (k, r)-connected dominating set ((k, r)-CDS) if every vertex in V(G)\D is at most r-hops away from at least k vertices in D. Finding a minimum (k, r)-CDS has wireless sensor network as its background. In this paper, we give two approximation algorithms to compute a minimum (k, r)-CDS, which improves previous works in regard of performance ratio.

Sign in / Sign up

Export Citation Format

Share Document