Sciweavers

1662 search results - page 181 / 333
» Soft Computing in Wireless Sensors Networks
Sort
View
177
Voted
PERCOM
2009
ACM
16 years 1 months ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
ICDS
2009
IEEE
16 years 1 months ago
A Hybrid Approach for Clustering-Based Data Aggregation in Wireless Sensor Networks
—In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controll...
Woo Sung Jung, Keun Woo Lim, Young-Bae Ko, Sang-Jo...
EWSN
2007
Springer
16 years 6 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...
IJSNET
2006
106views more  IJSNET 2006»
15 years 7 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue
ICNP
2009
IEEE
16 years 1 months ago
oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
Lu Su, Bolin Ding, Yong Yang, Tarek F. Abdelzaher,...