Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks

We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E) where V and E denote the sensors deployed in the plane and the links among them, respectively. A link between two sensors exists if their Euclidean distance

• Type: Conference
• Year: 2009
• Where: DCOSS
• Authors: Kamrul Islam, Selim G. Akl, Henk Meijer
• Keywords: Connected Dominating Sets, DCOSS 2009, Distributed And Parallel Computing, Sensors, Wireless Sensor Networks