Sciweavers

Share
JPDC
2006

On constructing k-connected k-dominating set in wireless ad hoc and sensor networks

8 years 9 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. In this paper, we propose the construction of a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and fault tolerance. Four localized k-CDS construction protocols are proposed. The first protocol randomly selects virtual backbone nodes with a given probability pk, where pk depends on the value of k and network condition, such as network size and node density. The second one maintains a fixed backbone node degree of Bk, where Bk also depends on the network condition. The third protocol is a deterministic approach. It extends Wu and Dai's coverage condition, which is originally designed for 1-CDS construction, to ensure the formation of a k-CDS. The last protocol is a hybrid of probabilistic...
Fei Dai, Jie Wu
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JPDC
Authors Fei Dai, Jie Wu
Comments (0)
books