Sciweavers

11565 search results - page 1900 / 2313
» Computing Minimal Mappings
Sort
View
PERCOM
2005
ACM
16 years 7 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
EWSN
2007
Springer
16 years 7 months ago
Energy Consumption of Minimum Energy Coding in CDMA Wireless Sensor Networks
Abstract. A theoretical framework is proposed for accurate performance analysis of minimum energy coding schemes in Coded Division Multiple Access (CDMA) wireless sensor networks. ...
Benigno Zurita Ares, Carlo Fischione, Karl Henrik ...
EWSN
2007
Springer
16 years 7 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...
EWSN
2006
Springer
16 years 7 months ago
FlexCup: A Flexible and Efficient Code Update Mechanism for Sensor Networks
Abstract. The ability to update the program code installed on wireless sensor nodes plays an import role in the highly dynamic environments sensor networks are often deployed in. S...
Andreas Lachenmann, Daniel Minder, Kurt Rothermel,...
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 5 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
« Prev « First page 1900 / 2313 Last » Next »