Sciweavers

5901 search results - page 977 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 3 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
AAECC
2006
Springer
74views Algorithms» more  AAECC 2006»
15 years 9 months ago
Nested Codes for Constrained Memory and for Dirty Paper
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
Hans Georg Schaathun, Gérard D. Cohen
MOBIHOC
2002
ACM
16 years 2 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
134
Voted
WCNC
2010
IEEE
15 years 7 months ago
Prioritized Resource Sharing in WiMax and WiFi Integrated Networks
Abstract—In order to ensure fair access and efficiency of bandwidth usage in wireless integrated networks, resource allocation algorithms should be well designed. In this paper,...
Nirmal Andrews, Yogesh Reddy Kondareddy, Prathima ...
INFOCOM
2006
IEEE
15 years 9 months ago
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
Michael J. Neely