Sciweavers

374 search results - page 51 / 75
» Efficient clustering algorithms for self-organizing wireless...
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 7 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
MOBIHOC
2008
ACM
14 years 7 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
CNSR
2007
IEEE
158views Communications» more  CNSR 2007»
13 years 9 months ago
Bounding the Information Collection Performance of Wireless Sensor Network Routing
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
Qinghua Wang, Tingting Zhang, Stefan Pettersson
JCIT
2008
138views more  JCIT 2008»
13 years 7 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
ICDCS
2007
IEEE
13 years 11 months ago
uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...
Yu Gu, Joengmin Hwang, Tian He, David Hung-Chang D...