{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:58:21Z","timestamp":1649030301980},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,2]],"date-time":"2011-08-02T00:00:00Z","timestamp":1312243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s11227-011-0662-9","type":"journal-article","created":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T15:50:54Z","timestamp":1312213854000},"page":"24-41","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks"],"prefix":"10.1007","volume":"62","author":[{"given":"Hwang-Cheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Woungang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Bao","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Chang","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Chang","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,2]]},"reference":[{"key":"662_CR1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/313451.313525","volume-title":"Proc the 5th annual ACM\/IEEE international conference on mobile computing and networking","author":"S Ni","year":"1999","unstructured":"Ni S, Tseng Y, Chen Y, Sheu J (1999) The broadcast storm problem in a mobile ad hoc network. In: Proc the 5th annual ACM\/IEEE international conference on mobile computing and networking, pp\u00a0151\u2013162"},{"key":"662_CR2","volume-title":"Proc the 3rd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems (ACM MSWiM 2000)","author":"H Lim","year":"2000","unstructured":"Lim H, Kim C (2000) Multicast tree construction and flooding in wireless ad hoc networks. In: Proc the 3rd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems (ACM MSWiM 2000), Boston, Massachusetts, USA"},{"issue":"2","key":"662_CR3","first-page":"97","volume":"2","author":"W Peng","year":"2001","unstructured":"Peng W, Lu X (2001) AHBP: an efficient broadcast protocol for mobile ad hoc networks. J Sci Technol 2(2):97\u2013192","journal-title":"J Sci Technol"},{"key":"662_CR4","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/ICC.1997.605303","volume-title":"Proc of IEEE international conference on communications","author":"B Das","year":"1997","unstructured":"Das B, Bhargavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proc of IEEE international conference on communications, pp 376\u2013380"},{"key":"662_CR5","first-page":"7","volume-title":"Proc the 3rd international workshop on discrete algorithms and methods for mobile computing and communications","author":"J Wu","year":"1999","unstructured":"Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc the 3rd international workshop on discrete algorithms and methods for mobile computing and communications, pp 7\u201314"},{"issue":"1","key":"662_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/71.980024","volume":"13","author":"I Stojmenovic","year":"2002","unstructured":"Stojmenovic I, Seddigh M, Xunic J (2002) Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans Parallel Distrib Syst 13(1):14\u201325","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"662_CR7","first-page":"1","volume-title":"Proc the 35th Hawaii international conference on system sciences","author":"KM Alzoubi","year":"2002","unstructured":"Alzoubi KM, Wan PJ, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proc the 35th Hawaii international conference on system sciences, pp 1\u20137"},{"key":"662_CR8","first-page":"353","volume-title":"Proc the IEEE international conference on communications (ICC)","author":"F Dai","year":"2003","unstructured":"Dai F, Wu J (2003) Distributed dominant pruning in ad hoc wireless networks. In: Proc the IEEE international conference on communications (ICC), pp\u00a0353\u2013357"},{"key":"662_CR9","first-page":"363","volume-title":"Proc of the 14th symposium on theoretical computer science (STACS\u201997)","author":"L Kirousis","year":"1997","unstructured":"Kirousis L, Kranakis E, Krizanc D, Pelc A (1997) Power consumption in packet radio networks. In: Proc of the 14th symposium on theoretical computer science (STACS\u201997), pp\u00a0363\u2013374"},{"key":"662_CR10","first-page":"585","volume-title":"Proc IEEE INFOCOM","author":"JE Wieselthier","year":"2000","unstructured":"Wieselthier JE, Nguyen GD, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc IEEE INFOCOM, Tel Aviv, Israel, Mar, pp\u00a0585\u2013594"},{"key":"662_CR11","isbn-type":"print","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. The MIT Press, Cambridge, ISBN-10:0-262-03293-3","ISBN":"http:\/\/id.crossref.org\/isbn\/0262032933"},{"issue":"1","key":"662_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"key":"662_CR13","doi-asserted-by":"crossref","unstructured":"Edmonds J (1967) Optimum branchings. J Res Natl Bur Stand (71B), 233\u2013240","DOI":"10.6028\/jres.071B.032"},{"issue":"6","key":"662_CR14","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","volume":"31","author":"P Humblet","year":"1983","unstructured":"Humblet P (1983) A distributed algorithm for minimum weighted directed spanning trees. IEEE Trans Commun 31(6):756\u2013762","journal-title":"IEEE Trans Commun"},{"key":"662_CR15","first-page":"1","volume-title":"Proc the 5th international conference on wireless communications, networking and mobile computing","author":"LS Chen","year":"2009","unstructured":"Chen LS, Wang HC (2009) BREAC: broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model. In: Proc the 5th international conference on wireless communications, networking and mobile computing, Beijing, China, 24\u201326 Sept, pp 1\u20135"},{"key":"662_CR16","unstructured":"Chen LS, Wang HC, Woungang I, Kuo FC EOBDBR: an efficient optimum branching-based distributed broadcast routing protocol for wireless ad hoc networks. Telecommun Syst J (in press)"},{"issue":"11","key":"662_CR17","first-page":"1141","volume":"8","author":"PC Hsiu","year":"2009","unstructured":"Hsiu PC, Kuo TW (2009) A maximum-residual multicast protocol for large-scale mobile ad hoc networks. IEEE Trans Mob Comput 8(11):1141\u20131153","journal-title":"IEEE Trans Mob Comput"},{"issue":"9","key":"662_CR18","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"JW Jaromczyk","year":"1992","unstructured":"Jaromczyk JW, Toussaint GT (1992) Relative neighborhood graphs and their relatives. Proc IEEE 80(9):1502\u20131517","journal-title":"Proc IEEE"},{"key":"662_CR19","series-title":"Lecture notes for algorithms & data structures","volume-title":"Minimum spanning tree","author":"R Sedgewick","year":"2007","unstructured":"Sedgewick R, Wayne K (2007) Minimum spanning tree. Lecture notes for algorithms & data structures. Princeton University, Princeton"},{"key":"662_CR20","volume-title":"Proc IEEE INFOCOM 2003","author":"J Cartigny","year":"2003","unstructured":"Cartigny J, Simplot D, Stojmenovic I (2003) Localized minimum-energy broadcasting in ad-hoc networks. In: Proc IEEE INFOCOM 2003"},{"issue":"1","key":"662_CR21","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TC.2008.125","volume":"58","author":"J Cartigny","year":"2009","unstructured":"Cartigny J, Ruiz PM, Simplot-Ryl D, Stojmenovic I, Yago CM (2009) Localized minimum-energy broadcasting for wireless multihop networks with directional antennas. IEEE Trans Comput 58(1), 120\u2013131","journal-title":"IEEE Trans Comput"},{"key":"662_CR22","first-page":"174","volume-title":"Lecture notes in computer science","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum J, Karger D, Mirrokni V, Sami R (2005) Subjective-cost policy routing. In: Lecture notes in computer science, vol 3828. Springer, Berlin, pp 174\u2013183"},{"key":"662_CR23","first-page":"37","volume-title":"Lecture notes in computer science","author":"B Courcelle","year":"2007","unstructured":"Courcelle B, Twigg A (2007) Compact forbidden-set routing. In: Lecture notes in computer science, vol 4393. Springer, Berlin, pp 37\u201348"},{"issue":"4","key":"662_CR24","first-page":"23","volume":"23","author":"WCK Yen","year":"2008","unstructured":"Yen WCK (2008) Restricted independent domination problems on graphs. Int J Comput Syst Sci Eng 23(4):23\u201329","journal-title":"Int J Comput Syst Sci Eng"},{"key":"662_CR25","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/CMC.2009.345","volume-title":"Proc international conference on communications and mobile computing","author":"CH Yen","year":"2009","unstructured":"Yen CH, Wang HC (2009) Minimum cost broadcast routing with forbidden set for ad-hoc networks. In: Proc international conference on communications and mobile computing, vol 2, pp 20\u201325"},{"issue":"6","key":"662_CR26","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose P, Morin P, Stojimenovic I, Urmutia J (2001) Routing with guaranteed delivery in ad hoc wireless networks. Wirel Netw 7(6):609\u2013616","journal-title":"Wirel Netw"},{"key":"662_CR27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/345910.345953","volume-title":"Proc 6th annual international conference on mobile computing and networking","author":"B Karp","year":"2000","unstructured":"Karp B, Kung HT (2000) GPSR: greedy perimeter stateless mouting for wireless networks. In: Proc 6th annual international conference on mobile computing and networking, New York, USA, pp 243\u2013254"},{"key":"662_CR28","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/872035.872044","volume-title":"Proc annual symposium on principles of distributed computing","author":"F Kuhn","year":"2003","unstructured":"Kuhn F, Wattenhofer R, Zhang Y, Zollinger A (2003) Geometric ad-hoc routing of theory and practice. In: Proc annual symposium on principles of distributed computing, New York, USA, pp 63\u201372"},{"key":"662_CR29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1049\/cp:20080186","volume-title":"Proc IET international conference on wireless mobile & multimedia networks","author":"D Satyanarayana","year":"2008","unstructured":"Satyanarayana D, Rao SV (2008) A spanner for multimedia applications in ad hoc networks. In: Proc IET international conference on wireless mobile & multimedia networks, pp 231\u2013234"},{"key":"662_CR30","first-page":"1","volume-title":"Proc mobile computing, NTCU","author":"JB Lin","year":"2010","unstructured":"Lin JB, Wang HC, Kuo FC, Ting KC (2010) Distributed broadcast algorithm for wireless ad hoc networks based on RNG and forbidden set. In: Proc mobile computing, NTCU, Taichung, Taiwan, 28 May, pp 1\u20136"},{"key":"662_CR31","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/CyberC.2010.26","volume-title":"Proc cyberc (intl conference on cyber-enabled distributed computing and knowledge discovery)","author":"HC Wang","year":"2010","unstructured":"Wang HC, Lin JB, Kuo FC, Ting KC (2010) Combination of relative neighborhood graph and forbidden set in the design of distributed broadcast algorithms for wireless ad hoc networks. In: Proc cyberc (intl conference on cyber-enabled distributed computing and knowledge discovery), Huangshan, China, 10\u201312 Oct, pp 94\u2013100"},{"key":"662_CR32","first-page":"1","volume-title":"Proc national symposium on telecom (NST)","author":"JB Lin","year":"2010","unstructured":"Lin JB, Wang HC, Kuo FC, Tseng CC, Ting KC (2010) Distributed broadcast algorithms based on variants of relative neighborhood graphs for wireless ad hoc networks. In: Proc national symposium on telecom (NST), Chang-Gung University, Taoyuan, Taiwan, 3\u20134 Dec, pp 1\u20135"},{"key":"662_CR33","volume-title":"Proc IEEE INFOCOM, 2004","author":"XY Li","year":"2004","unstructured":"Li XY, Wang Y, Wan PJ, Song WZ, Frieder O (2004) Localized low-weight graph and its applications in wireless ad hoc networks. In: Proc IEEE INFOCOM, 2004"},{"key":"662_CR34","first-page":"129","volume-title":"Proc ACM international symposium on mobile ad hoc networking & computing","author":"W Peng","year":"2000","unstructured":"Peng W, Lu X (2000) On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proc ACM international symposium on mobile ad hoc networking & computing, pp 129\u2013130"},{"issue":"4","key":"662_CR35","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TWC.2002.804190","volume":"1","author":"WB Heinzelman","year":"2002","unstructured":"Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1(4):660\u2013670","journal-title":"IEEE Trans Wirel Commun"},{"key":"662_CR36","doi-asserted-by":"crossref","unstructured":"Corson S, Macker J (1999) Mobile ad hoc networking (MANET): routing protocol performance issues and evaluations considerations. IETF RFC 2501","DOI":"10.17487\/rfc2501"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0662-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-011-0662-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0662-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T08:19:35Z","timestamp":1638173975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-011-0662-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["662"],"URL":"https:\/\/doi.org\/10.1007\/s11227-011-0662-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,2]]}}}