{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:46:21Z","timestamp":1791319581318,"version":"4.3.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0743-7315(02)00029-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T23:28:10Z","timestamp":1051745290000},"page":"87-96","source":"Crossref","is-referenced-by-count":27,"title":["Self-stabilizing multicast protocols for ad hoc networks"],"prefix":"10.1016","volume":"63","author":[{"given":"Sandeep K.S.","family":"Gupta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pradip K","family":"Srimani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(02)00029-1_BIBBFC93","doi-asserted-by":"crossref","unstructured":"T. Ballardie, P. Francis, J. Crowcroft, Core based trees (CBT): an architecture for scalable inter domain multicast routing, in: SIGCOMM, ACM, 1993, pp. 85\u201395.","DOI":"10.1145\/166237.166246"},{"issue":"1&2","key":"10.1016\/S0743-7315(02)00029-1_BIBCS94","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10637199408915459","article-title":"A self-stabilizing distributed algorithm for all-pairs shortest path problem","volume":"4","author":"Chandrasekar","year":"1994","journal-title":"Parallel Algorithms Appl."},{"issue":"2","key":"10.1016\/S0743-7315(02)00029-1_BIBDEF96","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/90.490743","article-title":"The PIM architecture for wide-area multicast routing","volume":"4","author":"Deering","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBGBS00","unstructured":"S.K.S. Gupta, A. Bouabdallah, P.K. Srimani, Self-stabilizing protocol for shortest path tree for multicast routing in mobile networks, Lecture Notes in Computer Science, vol. 1900, Springer, Berlin, April 2000, pp. 600\u2013604."},{"key":"10.1016\/S0743-7315(02)00029-1_BIBGS99","doi-asserted-by":"crossref","unstructured":"S.K.S. Gupta, P.K. Srimani, Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks, in: Proceedings of the DIMACS Workshop on Mobile Networks and Computing, Rutgers University, NJ, March 1999.","DOI":"10.1090\/dimacs\/052\/05"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBHDL02","doi-asserted-by":"crossref","unstructured":"Z. Haas, J. Deng, B. Liang, P. Papadimitratos, S. Sajama, Wireless ad hoc networks in: J. Proakis (Ed.), Encyclopedia of Telecommunications, Wiley, New York, 2002.","DOI":"10.1002\/0471219282.eot185"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBHS84","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1984"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBKAR72","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, Plenum Press, New York, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBKES97","series-title":"An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network","author":"Keshav","year":"1997"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBKZ89","doi-asserted-by":"crossref","unstructured":"A. Khanna, J. Zinky, The revised arpanet routing metric, in: ACM SIGCOMM\u201989, August 1989.","DOI":"10.1145\/75246.75252"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBMP88","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(88)90185-8","article-title":"Minimum-cost spanning tree as a path finding problem","volume":"26","author":"Maggs","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-7315(02)00029-1_BIBPD96","series-title":"Computer Networks","author":"Peterson","year":"1996"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBPER01","unstructured":"C. Perking (Ed.), Ad Hoc Networking, Addison\u2013Wesley, Reading, MA, 2001."},{"issue":"1","key":"10.1016\/S0743-7315(02)00029-1_BIBSCH93","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/151254.151256","article-title":"Self-stabilization","volume":"25","author":"Schneider","year":"1993","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0743-7315(02)00029-1_BIBSTO02","doi-asserted-by":"crossref","unstructured":"I. Stojmenovic (Ed.) Handbook of Wireless Networks and Mobile Computing, Wiley, New York, 2002.","DOI":"10.1002\/0471224561"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502000291?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502000291?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T17:09:23Z","timestamp":1584464963000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731502000291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0743731502000291"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(02)00029-1","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}