Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

Abstract

We propose a notion of extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NPcompleteness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are non-trivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.

Opportunistic coding across on‐route dominating nodes in a flow‐orientedSDNenabledWSN

“…In a multi‐hop transmission environment, the SDN controller inspects a routing mechanism to determine the optimum path between the communicating nodes. The importance of the connected dominating set (CDS)‐based techniques in the optimum route selection of data packets is incredible in wireless networks 19,20 . Hence, an assembly of a lightweight NC and CDS‐based routing mechanism over SDN‐WSN can further boost the network throughput and network lifespan.…”

“…The importance of the connected dominating set (CDS)-based techniques in the optimum route selection of data packets is incredible in wireless networks. 19,20 Hence, an assembly of a lightweight NC and CDS-based routing mechanism over SDN-WSN can further boost the network throughput and network lifespan.…”

Statistical mechanics of the directed 2-distance minimal dominating set problem

“…communication networks [1], locating servers [2] and copying a distributed directory [3]. There are various types of L-MDS problem, such as Liar's dominating set [4], the extended dominating set [5], the 2-distance paired dominating set [6], the [1, 2]dominating set [7], the (σ, ρ ) dominating set [8], and the k-tuple dominating set [9]. The DMDS has wide application in the field of biological networks, such as for the spread of infectious disease [10], genetic regulation [11,12] and chemical reactions and metabolic regulation [13], and it is also applied in social, information and neuroscience fields [14][15][16][17][18][19].…”