Sciweavers

1325 search results - page 121 / 265
» Exploring sensor networks using mobile agents
Sort
View
OPODIS
2008
15 years 1 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...
ICC
2008
IEEE
135views Communications» more  ICC 2008»
15 years 6 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
14 years 3 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
JNW
2006
148views more  JNW 2006»
14 years 11 months ago
An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
Mohamed Khalil Watfa, Sesh Commuri
ITNG
2008
IEEE
15 years 6 months ago
Chord-Based Key Establishment Schemes for Sensor Networks
— Because of limited resources at sensor nodes, sensor networks typically adopt symmetric-key algorithms to provide security functions such as protecting communications between n...
Fan Zhang, Zhijie Jerry Shi, Bing Wang