Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

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.

Download Full-text

Performance of Algorithms using Domination Theory in Wireless Sensor Network with NS2

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.c9022.019320 ◽

2020 ◽

Vol 9 (3) ◽

pp. 3671-3677

Keyword(s):

Wireless Sensor Network ◽

Sensor Network ◽

Transmission Control Protocol ◽

Dominating Set ◽

Independent Set ◽

Connected Dominating Set ◽

Wireless Sensor ◽

Water Sensor ◽

Approximation Heuristic ◽

Algorithmic Approaches

To prologue about a wireless sensor network let us understand network originally; how to connect host computers as well as communicate. Computers that are connected together are represented as topology, there are different types to name them star, bus, mesh, and grid. Researchers represented it as TCP i.e., transmission control protocol that has to be a wired connection through the network. As researcher worked, even without wired connection to the host computers could even be communicated through UDP called user datagram protocol. UDP gave nativity to the wireless sensor network, it has its own pros and cons. Now a day, there are a number of types of wireless sensor network like adhoc network, under water sensor network and vehicular sensor network. An organized design of routing protocol is available in wireless sensor network, and then Connected Dominating Set (CDS) is broadly used as a essential part as a backbone. To construct the Connected Dominating Set with its size as minimum, meta-heuristic, greedy, approximation, heuristic and distributed algorithmic approaches are predictable. These approaches are concentrated on deriving independent set and then constructing the Connected Dominating Set using Steiner tree, Unit Disk Graph and algorithms gives better result when graph has lesser number of nodes. For the networks that are generated in a fixed simulation area. A new approach is used for building Connected Dominating Set based on the concept of Edge Dominating Set

Download Full-text

Connected Dominating Set in Wireless Sensor Network

Advances in Wireless Technologies and Telecommunication - Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures ◽

10.4018/978-1-5225-0486-3.ch003 ◽

2017 ◽

pp. 62-85 ◽

Cited By ~ 1

Author(s):

Jasaswi Prasad Mohanty ◽

Chittaranjan Mandal

Keyword(s):

Wireless Sensor Network ◽

Sensor Network ◽

Dominating Set ◽

Research Problem ◽

Connected Dominating Set ◽

Wireless Sensor ◽

Virtual Backbone ◽

Open Problems ◽

Main Research ◽

Comprehensive Survey

In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constrained. There is no physical backbone infrastructure. So, for effective communication between the nodes, a virtual backbone can be used. A virtual backbone can be formed by constructing the Connected Dominating Set (CDS). In past few years, efficient and fast construction of CDS in a wireless network is the main research problem in topology control. In this chapter, the authors have given a comprehensive survey of the CDS construction algorithms with their merit and demerits. They concluded the chapter with some open problems and interesting issues in this field are proposed.

Download Full-text

ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM

Discrete Mathematics Algorithms and Applications ◽

10.1142/s1793830911000961 ◽

2011 ◽

Vol 03 (01) ◽

pp. 9-15 ◽

Cited By ~ 2

Author(s):

WEIPING SHANG ◽

XIUMEI WANG

Keyword(s):

Wireless Sensor Network ◽

Approximation Algorithms ◽

Sensor Network ◽

Dominating Set ◽

Connected Dominating Set ◽

Wireless Sensor ◽

Virtual Backbone ◽

Dominating Set Problem

Connected dominating set (CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm in wireless sensor network. Most recent research has extensively focused on the construction of connected dominating set. However, the nodes in the CDS need to dominate all its neighbors, and then some nodes cover a large number of neighboring nodes. Therefore, it is desirable to construct a capacitated dominating set, each node can dominate only a certain number of neighbors. In this paper, we study capacitated dominating set and connected capacitated dominating set, and propose two approximation algorithms with small approximation ratios.

Download Full-text