Sciweavers

714 search results - page 67 / 143
» Time and energy complexity of distributed computation in wir...
Sort
View
MOBIDE
2010
ACM
13 years 9 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
PERCOM
2008
ACM
14 years 8 months ago
ReMo : An Energy Efficient Reprogramming Protocol for Mobile Sensor Networks
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
Pradip De, Yonghe Liu, Sajal K. Das
INFOCOM
2011
IEEE
13 years 8 days 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
DCOSS
2005
Springer
14 years 2 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
AHSWN
2010
177views more  AHSWN 2010»
13 years 9 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi