Access the full text.
Sign up today, get DeepDyve free for 14 days.
Karen Wang, Baochun Li (2002)
Group mobility and partition prediction in wireless ad-hoc networks2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2
A. McDonald, T. Znati (1999)
A mobility-based framework for adaptive clustering in wireless ad hoc networksIEEE J. Sel. Areas Commun., 17
X. Hong, M. Gerla, G. Pei, Ching-Chuan Chiang (1999)
A group mobility model for ad hoc wireless networks
Karen Wang, Baochun Li (2002)
Efficient and guaranteed service coverage in partitionable mobile ad-hoc networksProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2
C. Perkins (2001)
Ad Hoc Networking
Miguel López, P. Manzoni (2001)
ANEJOS: a Java based simulator for ad hoc networksFuture Gener. Comput. Syst., 17
T. Camp, Jeff Boleng, Vanessa Davies (2002)
A survey of mobility models for ad hoc network researchWirel. Commun. Mob. Comput., 2
D. Turgut, Sajal Das, R. Elmasri, B. Turgut (2002)
Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approachGlobal Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 1
G. Pei, M. Gerla, X. Hong, Ching-Chuan Chiang (1999)
A wireless hierarchical routing protocol with group mobilityWCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), 3
Young-Bae Ko, N. Vaidya (1998)
Location-aided routing (LAR) in mobile ad hoc networks
Shengming Jiang, D. He, J. Rao (2001)
A prediction-based link availability estimation for mobile ad hoc networksProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 3
M. Zonoozi, P. Dassanayake (1997)
User Mobility Modeling and Characterization of Mobility PatternsIEEE J. Sel. Areas Commun., 15
W. Su, Sung-Ju Lee, M. Gerla (2000)
Mobility prediction in wireless networksMILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155), 1
P. Johansson, Tony Larsson, Nicklas Hedman, B. Mielczarek, M. Degermark (1999)
Scenario-based performance analysis of routing protocols for mobile ad-hoc networksProceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
One of the most important issues associated with group mobility predicts the partition time. The existing algorithms predict partition time assuming that the partitioned groups move in opposite direction with the same speed and coverage. Thus, QoS is not guaranteed, since these algorithms could not accurately predict partition time in practical situations. We propose a partition prediction algorithm and server selection algorithm considering network partition in any direction, at any speed and with different coverage of groups. The analytical and simulation results show that our algorithm can predict partition time and select a child server more accurately in real situations.
International Journal of Wireless and Mobile Computing – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.