Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
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
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Bluetooth: vision, goals, and architecture
ACM SIGMOBILE Mobile Computing and Communications Review
QoS issues in ad hoc wireless networks
IEEE Communications Magazine
Exploring group mobility for replica data allocation in a mobile environment
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
On the Effect of Group Mobility to Data Replication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Stability-based multi-objective clustering in mobile ad hoc networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Agenda driven mobility modelling
International Journal of Ad Hoc and Ubiquitous Computing
Optimizing communication in mobile ad hoc network clustering
Computers in Industry
Hi-index | 0.00 |
Wireless ad-hoc networks consist of mobile nodes interconnected by multi-hopwireless paths. Unlike conventional wireless networks, ad-hoc networks haveno fixed network infrastructure or administrative support. Because of thedynamic nature of the network topology and limited bandwidth of wirelesschannels, Quality-of-Service (QoS) provisioning is an inherently complex anddifficult issue. In this paper, we propose a fully distributed and adaptivealgorithm to provide statistical QoS guarantees with respect toaccessibility of services in an ad-hoc network. In this algorithm,we focus on the optimization of a new QoS parameter of interest, serviceefficiency, while keeping protocol overheads to the minimum. To achievethis goal, we theoretically derive the lower and upper bounds of serviceefficiency based on a novel model for group mobility, followed by extensivesimulation results to verify the effectiveness of our algorithm.