Sciweavers

1692 search results - page 210 / 339
» A Dynamic Network Interdiction Problem
Sort
View
IMC
2006
ACM
15 years 9 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
163
Voted
MOBICOM
2010
ACM
15 years 3 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
145
Voted
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 10 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
VTC
2007
IEEE
115views Communications» more  VTC 2007»
15 years 9 months ago
The DYMO Routing Protocol in VANET Scenarios
—Coupling Vehicular Ad Hoc Networks (VANETs) with wired networks such as the Internet via access points creates a difficult mix of highly mobile nodes and a static infrastructur...
Christoph Sommer, Falko Dressler
GLOBECOM
2006
IEEE
15 years 9 months ago
Optimal Resource Allocation for Homogeneous Wireless Multicast
— Multicast-based data communication is an efficient communication scheme especially in multihop ad hoc networks where the MAC layer is based on one-hop broadcast from one sourc...
Amr M. Mohamed, Hussein M. Alnuweiri