Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
ANEJOS: a java based simulator for ad hoc networks
Future Generation Computer Systems
User mobility modeling and characterization of mobility patterns
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
International Journal of Wireless and Mobile Computing
| Hi-index | 0.00 |
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.