Sciweavers

1070 search results - page 187 / 214
» On maximum lifetime routing in Wireless Sensor Networks
Sort
View
SENSYS
2009
ACM
15 years 6 months ago
Collection tree protocol
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
Omprakash Gnawali, Rodrigo Fonseca, Kyle Jamieson,...
IWQOS
2004
Springer
15 years 5 months ago
Robust communications for sensor networks in hostile environments
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...
Ossama Younis, Sonia Fahmy, Paolo Santi
92
Voted
MOBIHOC
2006
ACM
15 years 11 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
IPSN
2007
Springer
15 years 5 months ago
Active sensing platform for wireless structural health monitoring
This paper presents SHiMmer, a wireless platform for sensing and actuation that combines localized processing with energy harvesting to provide long-lived structural health monito...
D. Musiani, K. Lin, Tajana Simunic Rosing
ICCCN
2007
IEEE
15 years 6 months ago
On Improving the Precision of Localization with Minimum Resource Allocation
— Autonomous localization of nodes in wireless sensor networks is essential to minimize the complex self organization task and consequently enhancing the overall network lifetime...
Frank Reichenbach, Dirk Timmermann