110 search results - page 4 / 22 » On Constructing k-Connected k-Dominating Set in Wireless Net... |
JSAC
2010
13 years 4 months ago
2010
Abstract—Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k...
ICDCS
2008
IEEE
14 years 6 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
JPDC
2007
13 years 5 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...