Sciweavers

27 search results - page 2 / 6
» Construction algorithms for k-connected m-dominating sets in...
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 4 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. Prev...
Fei Dai, Jie Wu
IWCMC
2006
ACM
13 years 10 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
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...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
INFOCOM
2012
IEEE
11 years 7 months ago
A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks
—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...
Hongyu Zhou, Hongyi Wu, Miao Jin
IEEEIA
2009
13 years 2 months ago
Agent Based Multipath Routing in Wireless Sensor Networks
recently, mobile agents have been used to solve many problems in wireless sensor networks. Agents are usually transferred from a node to another to aggregate the sensed data and si...
Rabie A. Ramadan
JCIT
2008
138views more  JCIT 2008»
13 years 4 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan