Sciweavers

7 search results - page 1 / 2
» dialm 2003
Sort
View
DIALM
2003
ACM
133views Algorithms» more  DIALM 2003»
13 years 10 months ago
Ad-hoc networks beyond unit disk graphs
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks whi...
Fabian Kuhn, Aaron Zollinger
DIALM
2003
ACM
99views Algorithms» more  DIALM 2003»
13 years 10 months ago
Spatio-temporal data reduction with deterministic error bounds
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Hu Cao, Ouri Wolfson, Goce Trajcevski
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
13 years 10 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
DIALM
1999
ACM
150views Algorithms» more  DIALM 1999»
13 years 9 months ago
Mobile computing in next generation wireless networks
In this paper, we attempt to describe the evolving status of wireless communications and its impact on the future of mobile computing. We present a historical perspective and eluc...
Prathima Agrawal, David Famolari