Sciweavers

374 search results - page 16 / 75
» Efficient clustering algorithms for self-organizing wireless...
Sort
View
JCO
2006
153views more  JCO 2006»
13 years 7 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
VTC
2007
IEEE
164views Communications» more  VTC 2007»
14 years 2 months ago
Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
Chih-Yu Wen, Jun-Koh Chen, William A. Sethares
TPDS
2002
173views more  TPDS 2002»
13 years 7 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
SUTC
2008
IEEE
14 years 2 months ago
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different typ...
Vasanth Iyer, Rammurthy Garimella, M. B. Srinivas
MOBIHOC
2010
ACM
13 years 5 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...