Sciweavers

92 search results - page 11 / 19
» Minimizing Expected Attacking Cost in Networks
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
Lavy Libman, Ariel Orda
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 6 months ago
Simulated Annealing for Location Area Planning in Cellular networks
LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update ra...
Nilesh B. Prajapati, Rupal R. Agravat, Mosin I. Ha...
LOCA
2009
Springer
14 years 2 months ago
Location Diversity: Enhanced Privacy Protection in Location Based Services
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
Mingqiang Xue, Panos Kalnis, Hung Keng Pung
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 11 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
MOBIHOC
2010
ACM
13 years 5 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...