Sciweavers

1093 search results - page 37 / 219
» Probabilistic Location and Routing
Sort
View
IPL
2010
112views more  IPL 2010»
13 years 6 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
INFOCOM
2011
IEEE
13 years 4 days ago
The resilience of WDM networks to probabilistic geographical failures
—Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (su...
Pankaj K. Agarwal, Alon Efrat, Shashidhara K. Ganj...
MOBIHOC
2003
ACM
14 years 8 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
OR
2007
Springer
13 years 8 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
COMSWARE
2007
IEEE
14 years 2 months ago
Integrated Data Location in Multihop Wireless Networks
Abstract— Multihop wireless networks are ideal as infrastructures for location-aware network applications, particularly for disaster recovery operations. However, one missing com...
Irfan Sheriff, Prashanth Aravinda Kumar Acharya, A...