Sciweavers

58 search results - page 9 / 12
» Probabilistic Routing in Intermittently Connected Networks
Sort
View
97
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
GLOBECOM
2008
IEEE
15 years 20 days ago
Probabilistic Path Selection in Opportunistic Cognitive Radio Networks
Abstract—We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of eve...
Hicham Khalife, Satyajeet Ahuja, Naceur Malouch, M...
WICON
2008
15 years 1 months ago
Towards distributed network classification for mobile ad hoc networks
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communi...
Dimitrios Antonellis, Ahmed Mansy, Konstantinos Ps...
SIGCOMM
2000
ACM
15 years 4 months ago
Delayed internet routing convergence
This paper examines the latency in Internet path failure, failover and repair due to the convergence properties of interdomain routing. Unlike switches in the public telephony net...
Craig Labovitz, Abha Ahuja, Abhijit Bose, Farnam J...
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
14 years 11 months ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone