Sciweavers

344 search results - page 62 / 69
» Maximum Energy Welfare Routing in Wireless Sensor Networks
Sort
View
CN
2010
183views more  CN 2010»
13 years 7 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
IS
2006
13 years 7 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ICC
2008
IEEE
135views Communications» more  ICC 2008»
14 years 2 months ago
Using Soft-Line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Norman S....
INFOCOM
2011
IEEE
12 years 11 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann