Sciweavers

1455 search results - page 81 / 291
» Optimal Location Management Algorithms for Mobile Networks
Sort
View
EURONGI
2005
Springer
15 years 9 months ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...
ROBOCOMM
2007
IEEE
15 years 10 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
ICOIN
2003
Springer
15 years 9 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
IROS
2009
IEEE
186views Robotics» more  IROS 2009»
15 years 10 months ago
A statistical approach to gas distribution modelling with mobile robots - The Kernel DM+V algorithm
— Gas distribution modelling constitutes an ideal application area for mobile robots, which – as intelligent mobile gas sensors – offer several advantages compared to station...
Achim J. Lilienthal, Matteo Reggente, Marco Trinca...
IAT
2010
IEEE
15 years 2 months ago
Using Negotiation to Reduce Redundant Autonomous Mobile Program Movements
Distributed load managers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This paper shows that systems of Autonomou...
Natalia Chechina, Peter King, Phil Trinder