98 search results - page 4 / 20 » Approximating minimum independent dominating sets in wireles... |
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
ESA
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
JPDC
2007
13 years 7 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...