Sciweavers

1588 search results - page 84 / 318
» Wireless personal area networks
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 8 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
IPPS
2005
IEEE
14 years 2 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
MSN
2005
Springer
179views Sensor Networks» more  MSN 2005»
14 years 2 months ago
Coverage Analysis for Wireless Sensor Networks
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
Ming Liu, Jiannong Cao, Wei Lou, Lijun Chen 0006, ...
ATAL
2008
Springer
13 years 10 months ago
A mobile agent approach to opportunistic harvesting in wireless sensor networks
This demonstration illustrates the feasibility of harvesting data from a WSN by interested parties, either in the WSN coverage area or in a remote location. Embedded and mobile ag...
Richard Tynan, Conor Muldoon, Michael J. O'Grady, ...
TPDS
2008
161views more  TPDS 2008»
13 years 8 months ago
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
You-Chiun Wang, Yu-Chee Tseng