Sciweavers

1455 search results - page 142 / 291
» Optimal Location Management Algorithms for Mobile Networks
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 6 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
160
Voted
IJWMC
2010
115views more  IJWMC 2010»
15 years 1 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
MOBIHOC
2002
ACM
16 years 4 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
KIVS
1999
Springer
15 years 8 months ago
Strategies for Minimizing the Average Cost of Paging on the Air Interface
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
Dogan Kesdogan, Andrei Trofimov, Dirk Trossen
MUE
2008
IEEE
173views Multimedia» more  MUE 2008»
15 years 11 months ago
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB us...
Do-Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Pete...