{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T15:51:40Z","timestamp":1693842700057},"reference-count":6,"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> In this paper, we study broadcasting protocols where nodes use some of their neighbors to forward messages. We propose a new protocol based on a variant of neighbor elimination scheme using RNG graph to ensure a full coverage of the network. The computation of RNG uses two kinds of distance: a geometrical one and and neighborhood-based distance that permits to use our protocol without positioning system. This protocol, called RRS for RNG Relay Subset, provides a self-selecting forwarding neighbor operating mode which guarantees a fair broadcast loading. In RRS a node v is a relay for a node u if and only if v is a neighbor of u and v has a RNG-neighbor which is not covered by u transmission. Moreover, experiments with 802.11-like MAC layer show that RRS is efficient. <\/jats:p>","DOI":"10.1142\/s0129054103001716","type":"journal-article","created":{"date-parts":[[2003,6,19]],"date-time":"2003-06-19T08:43:20Z","timestamp":1056012200000},"page":"253-265","source":"Crossref","is-referenced-by-count":25,"title":["RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS"],"prefix":"10.1142","volume":"14","author":[{"given":"JULIEN","family":"CARTIGNY","sequence":"first","affiliation":[{"name":"IRCICA\/LIFL, Univ. Lille 1, B\u00e2t. M3 Cit\u00e9 Scientifique, 59655 Villeneuve d'Ascq Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRAN\u00c7OIS","family":"INGELREST","sequence":"additional","affiliation":[{"name":"IRCICA\/LIFL, Univ. Lille 1, B\u00e2t. M3 Cit\u00e9 Scientifique, 59655 Villeneuve d'Ascq Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"SIMPLOT","sequence":"additional","affiliation":[{"name":"IRCICA\/LIFL, Univ. Lille 1, B\u00e2t. M3 Cit\u00e9 Scientifique, 59655 Villeneuve d'Ascq Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13705"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013981509844"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/584066.584069"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1109\/71.980024"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013763825347"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:39:18Z","timestamp":1565138358000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":6,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,4]]}},"alternative-id":["10.1142\/S0129054103001716"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001716","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}