{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:03:46Z","timestamp":1781039026870,"version":"3.54.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,4]]},"abstract":"<jats:p> A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defined to be the set of vertices dominated by a particular vertex in the dominating set. As it is NP-complete to determine whether a given graph has a weakly-connected dominating set of a particular size, we present a zonal distributed algorithm for finding small weakly-connected dominating sets. In this new approach, we divide the graph into regions, construct a weakly-connected dominating set for each region, and make adjustments along the borders of the regions to produce a weakly-connected dominating set of the entire graph. We present experimental evidence that this zonal algorithm has similar performance to and provides better cluster connectivity than previous algorithms. <\/jats:p>","DOI":"10.1142\/s0129054103001741","type":"journal-article","created":{"date-parts":[[2003,6,19]],"date-time":"2003-06-19T04:43:20Z","timestamp":1055997800000},"page":"305-322","source":"Crossref","is-referenced-by-count":57,"title":["A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS"],"prefix":"10.1142","volume":"14","author":[{"given":"YUANZHU PETER","family":"CHEN","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, V5A 1S6, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ARTHUR L.","family":"LIESTMAN","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, V5A 1S6, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume":"4","author":"Alzoubi K. M.","journal-title":"KICS Journal of Communications and Networks"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90126-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00233-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"rf12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. L.","year":"1979"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200845"},{"key":"rf15","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic M. C.","year":"1980"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"rf17","volume-title":"Fundamentals of Domination in graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf18","first-page":"46","volume":"4","author":"Royer E. M.","journal-title":"IEEE Personal Communications"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:23Z","timestamp":1565123963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,4]]}},"alternative-id":["10.1142\/S0129054103001741"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001741","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}