{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:29Z","timestamp":1754157929686,"version":"3.41.2"},"reference-count":11,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T00:00:00Z","timestamp":1258675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11,20]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Many applications of mobile<jats:italic>ad hoc<\/jats:italic>networks require real\u2010time 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 aims to investigate this issue.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>This paper investigates the notion of location\u2010based data consistency in mobile<jats:italic>ad hoc<\/jats:italic>networks, and analyzes the tradeoff between data consistency and timeliness of data exchange among nodes within a location\u2010based group in a geographical area of interest.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Using a Petri net performance model, performance characteristics of location\u2010based data consistency maintenance algorithms are analyzed and design conditions under which the system can tradeoff consistency for timeliness (reflecting the response 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<jats:italic>ad hoc<\/jats:italic>network are identified.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The system designer can deploy the optimal area size identified in the analysis for maximizing membership and data consistency based on the \u201cI am alive\u201d beaconing interval used at runtime while satisfying the response time requirement for propagating a state change.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370911008866","type":"journal-article","created":{"date-parts":[[2009,12,5]],"date-time":"2009-12-05T07:17:20Z","timestamp":1259997440000},"page":"497-516","source":"Crossref","is-referenced-by-count":2,"title":["Performance characteristics of location\u2010based group membership and data consistency algorithms in mobile<i>ad hoc<\/i>networks"],"prefix":"10.1108","volume":"5","author":[{"given":"Jeffery W.","family":"Wilson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.R.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022021520141287300_b1","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S. and Charron\u2010Bost, B. (1996), \u201cOn the impossibility of group membership\u201d, 15th ACM Symposium on Principles of Distributed Computing, New York, pp. 322\u201030.","DOI":"10.1145\/248052.248120"},{"key":"key2022021520141287300_b2","unstructured":"Dahmann, J. and Wilson, J.W. (2003), \u201cMDA and HLA: Applying standards to development, integration and test of the single integrated air picture integrated architecture behavior model\u201d, paper presented qt the Fall Simulation Interoperability Workshop (SIW), Orlando, FL."},{"key":"key2022021520141287300_b3","doi-asserted-by":"crossref","unstructured":"Fisher, M.J., Lynch, N.A. and Paterson, M.S. (1985), \u201cImpossibility of distributed consensus with one faulty process\u201d, Journal of the ACM, Vol. 32, April, pp. 427\u201069.","DOI":"10.1145\/3149.214121"},{"key":"key2022021520141287300_b4","doi-asserted-by":"crossref","unstructured":"Huang, Q., Julien, C. and Roman, G.\u2010C. (2004), \u201cRelying on safe distance to achieve strong partitionable group membership in ad hoc networks\u201d, IEEE Transactions on Mobile Computing, Vol. 3 No. 2, pp. 192\u2010205.","DOI":"10.1109\/TMC.2004.14"},{"key":"key2022021520141287300_b5","unstructured":"Killijian, M.\u2010O., Cunningham, R., Meier, R., Mazare, L. and Cahill, V. (2001), \u201cTowards group communication for mobile participants\u201d, paper presented at the ACM 1st International Workshop on Principle of Mobile Computing, Newport, RI."},{"key":"key2022021520141287300_b6","unstructured":"Kleinrock, L. (1975), Queueing Systems, John Wiley & Sons, New York, NY."},{"key":"key2022021520141287300_b7","unstructured":"Lin, Y.B., Chang, L.F. and Noerpel, A. (1995), \u201cModeling hierarchical microcell and macrocell PCS architecture\u201d, ICC, June."},{"key":"key2022021520141287300_b8","doi-asserted-by":"crossref","unstructured":"Manjeshwar, A.A., Zeng, Q.A. and Agrawal, D.P. (2002), \u201cAn analytical model for information retrieval in wireless sensor networks using enhanced APTEEN protocol\u201d, IEEE Trans. Parallel and Distributed Systems, Vol. 13 No. 12, pp. 1290\u2010302.","DOI":"10.1109\/TPDS.2002.1158266"},{"key":"key2022021520141287300_b9","doi-asserted-by":"crossref","unstructured":"Perkins, C. and Royer, E. (1999), \u201cAd\u2010hoc on\u2010demand distance vector routing\u201d, paper presented at the 2nd IEEE Workshop on Mobile Computing Systems and Applications, February.","DOI":"10.1109\/MCSA.1999.749281"},{"key":"key2022021520141287300_b10","doi-asserted-by":"crossref","unstructured":"Roman, G.\u2010C., Huang, A. and Hazemi, A. (2001), \u201cConsistent group membership in ad hoc networks\u201d, IEEE International Conference on Software Engineering, pp. 381\u20108.","DOI":"10.1109\/ICSE.2001.919111"},{"key":"key2022021520141287300_b11","unstructured":"Stochastic Petri Net Package (SPNP) (1999), User's Manual, Version 6, Department of Electrical and Computer Engineering, Duke University, Duham, NC."}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370911008866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008866\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008866\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:15Z","timestamp":1753403055000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/4\/497-516\/374788"}},"subtitle":[],"editor":[{"given":"D.A.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,11,20]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11,20]]}},"alternative-id":["10.1108\/17427370911008866"],"URL":"https:\/\/doi.org\/10.1108\/17427370911008866","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,11,20]]}}}