BibTeX
@MISC{_,
author = {},
title = {},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — Many applications of mobile ad hoc networks require real-time data consistency among moving nodes within a geographical area of interest to function correctly, such as those that support disaster recovery and battlefield command and control. While it is operationally desirable to maintain data consistency among nodes within a large geographical area, the time and network resources required to propagate state changes to all nodes place practical limits on network size. This paper investigates the notion of location-based data consistency in mobile ad hoc networks, and analyzes the tradeoff between data consistency and timeliness of data exchange among nodes within a location-based group in a geographical area of interest. Using a Petri net performance model, we analyze performance characteristics of location-based data consistency maintenance algorithms and identify design conditions under which the system can tradeoff consistency for timeliness (reflecting the time to propagate a state change) while satisfying the imposed data consistency requirement, when given a set of parameters characterizing the application in the underlying mobile ad hoc network.
Keyphrases
mobile ad hoc network state change data consistency geographical area petri net performance model abstract many application data consistency requirement data exchange design condition large geographical area location-based data consistency disaster recovery location-based group performance characteristic real-time data consistency battlefield command practical limit location-based data consistency maintenance algorithm network resource network size
