{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:17:48Z","timestamp":1776791868057,"version":"3.51.2"},"reference-count":7,"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> We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form a forward node set on carry out a broadcast process. Each node, upon receiving a broadcast packet, determines whether to forward the packet or not based on two neighborhood coverage conditions proposed in this paper. These coverage conditions depend on neighbor connectivity and history of visited nodes, and in general, resort to global network information. Using local information such as k-hop neighborhood information, the forward node set is selected through a distributed and local pruning process. The forward node set can be constructed and maintained through either a proactive process (i.e., \"up-to-date\") or a reactive process (i.e., \"on-the-fly\"). Several existing broadcast algorithms can be viewed as special cases of the coverage conditions with k-hop neighborhood information. Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the coverage conditions, and self-pruning based on 2- or 3-hop neighborhood information is relatively more cost-effective. <\/jats:p>","DOI":"10.1142\/s0129054103001686","type":"journal-article","created":{"date-parts":[[2003,6,19]],"date-time":"2003-06-19T04:43:20Z","timestamp":1055997800000},"page":"201-221","source":"Crossref","is-referenced-by-count":51,"title":["BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING"],"prefix":"10.1142","volume":"14","author":[{"given":"JIE","family":"WU","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FEI","family":"DAI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2001.925680"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2002.1038347"},{"key":"rf9","author":"Peng W.","journal-title":"Journal of Science and Technology, Beijing, China"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.980024"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013763825347"},{"key":"rf17","author":"Wu J.","journal-title":"Wireless Communication and Mobile Computing"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:14Z","timestamp":1565123954000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,4]]}},"alternative-id":["10.1142\/S0129054103001686"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001686","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}