Sciweavers

2092 search results - page 221 / 419
» A Theory of Non-Deterministic Networks
Sort
View
MOBICOM
2003
ACM
15 years 5 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
88
Voted
SENSYS
2003
ACM
15 years 5 months ago
Spatiotemporal multicast in sensor networks
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
124
Voted
SENSYS
2003
ACM
15 years 5 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
133
Voted
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 2 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
IMC
2007
ACM
15 years 2 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...