Energy efficient all-to-all broadcast in all-wireless networks
All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented a...
Gespeichert in:
| Veröffentlicht in: | Information sciences 2010-05, Vol.180 (10), p.1781-1792 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1792 |
|---|---|
| container_issue | 10 |
| container_start_page | 1781 |
| container_title | Information sciences |
| container_volume | 180 |
| creator | Bein, Doina Zheng, S.Q. |
| description | All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented and unrooted. We study three known heuristics for the minimum-energy broadcast problem: the Broadcast Incremental Power (BIP) algorithm, the Wireless Multicast Advantage-conforming Minimum Spanning Tree (WMA-conforming MST) algorithm, and the Iterative Maximum-Branch Minimization (IMBM) algorithm. Experimental results conducted on various types of networks are reported. We show that neither of these methods is best overall for building all-to-all broadcast trees. |
| doi_str_mv | 10.1016/j.ins.2009.11.013 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671426616</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020025509004836</els_id><sourcerecordid>1671426616</sourcerecordid><originalsourceid>FETCH-LOGICAL-c330t-a9d380fa158e9e1ba8abb6249d705ec76859778886c3a2de644807ceb03eda003</originalsourceid><addsrcrecordid>eNp9kE1LxDAURYMoOI7-AHdduml9L22TFEGQYfyAATe6Dmn6Khk77ZhkHObf27GuXV143PPgHsauETIEFLfrzPUh4wBVhpgB5idshkryVPAKT9kMgEMKvCzP2UUIawAopBAzdr_syX8cEmpbZx31MTFdl8YhHSOp_WAaa0JMXP973ztPHYWQ9BT3g_8Ml-ysNV2gq7-cs_fH5dviOV29Pr0sHlapzXOIqamaXEFrsFRUEdZGmboWvKgaCSVZKVRZSamUEjY3vCFRFAqkpRpyagxAPmc309-tH752FKLeuGCp60xPwy5oFBILLgSKsYpT1fohBE-t3nq3Mf6gEfTRlV7r0ZU-utKIenQ1MncTQ-OGb0deh6MMS8042EbdDO4f-gctaXFR</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671426616</pqid></control><display><type>article</type><title>Energy efficient all-to-all broadcast in all-wireless networks</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Bein, Doina ; Zheng, S.Q.</creator><creatorcontrib>Bein, Doina ; Zheng, S.Q.</creatorcontrib><description>All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented and unrooted. We study three known heuristics for the minimum-energy broadcast problem: the Broadcast Incremental Power (BIP) algorithm, the Wireless Multicast Advantage-conforming Minimum Spanning Tree (WMA-conforming MST) algorithm, and the Iterative Maximum-Branch Minimization (IMBM) algorithm. Experimental results conducted on various types of networks are reported. We show that neither of these methods is best overall for building all-to-all broadcast trees.</description><identifier>ISSN: 0020-0255</identifier><identifier>EISSN: 1872-6291</identifier><identifier>DOI: 10.1016/j.ins.2009.11.013</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Algorithms ; All-to-all broadcast ; Broadcast tree ; Broadcasting ; Convergecast ; Energy efficiency ; Energy use ; Heuristic ; Minimum power ; Multicast ; Networks ; Optimization ; Trees ; Wireless network</subject><ispartof>Information sciences, 2010-05, Vol.180 (10), p.1781-1792</ispartof><rights>2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c330t-a9d380fa158e9e1ba8abb6249d705ec76859778886c3a2de644807ceb03eda003</citedby><cites>FETCH-LOGICAL-c330t-a9d380fa158e9e1ba8abb6249d705ec76859778886c3a2de644807ceb03eda003</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ins.2009.11.013$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Bein, Doina</creatorcontrib><creatorcontrib>Zheng, S.Q.</creatorcontrib><title>Energy efficient all-to-all broadcast in all-wireless networks</title><title>Information sciences</title><description>All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented and unrooted. We study three known heuristics for the minimum-energy broadcast problem: the Broadcast Incremental Power (BIP) algorithm, the Wireless Multicast Advantage-conforming Minimum Spanning Tree (WMA-conforming MST) algorithm, and the Iterative Maximum-Branch Minimization (IMBM) algorithm. Experimental results conducted on various types of networks are reported. We show that neither of these methods is best overall for building all-to-all broadcast trees.</description><subject>Algorithms</subject><subject>All-to-all broadcast</subject><subject>Broadcast tree</subject><subject>Broadcasting</subject><subject>Convergecast</subject><subject>Energy efficiency</subject><subject>Energy use</subject><subject>Heuristic</subject><subject>Minimum power</subject><subject>Multicast</subject><subject>Networks</subject><subject>Optimization</subject><subject>Trees</subject><subject>Wireless network</subject><issn>0020-0255</issn><issn>1872-6291</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAURYMoOI7-AHdduml9L22TFEGQYfyAATe6Dmn6Khk77ZhkHObf27GuXV143PPgHsauETIEFLfrzPUh4wBVhpgB5idshkryVPAKT9kMgEMKvCzP2UUIawAopBAzdr_syX8cEmpbZx31MTFdl8YhHSOp_WAaa0JMXP973ztPHYWQ9BT3g_8Ml-ysNV2gq7-cs_fH5dviOV29Pr0sHlapzXOIqamaXEFrsFRUEdZGmboWvKgaCSVZKVRZSamUEjY3vCFRFAqkpRpyagxAPmc309-tH752FKLeuGCp60xPwy5oFBILLgSKsYpT1fohBE-t3nq3Mf6gEfTRlV7r0ZU-utKIenQ1MncTQ-OGb0deh6MMS8042EbdDO4f-gctaXFR</recordid><startdate>20100515</startdate><enddate>20100515</enddate><creator>Bein, Doina</creator><creator>Zheng, S.Q.</creator><general>Elsevier Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100515</creationdate><title>Energy efficient all-to-all broadcast in all-wireless networks</title><author>Bein, Doina ; Zheng, S.Q.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c330t-a9d380fa158e9e1ba8abb6249d705ec76859778886c3a2de644807ceb03eda003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>All-to-all broadcast</topic><topic>Broadcast tree</topic><topic>Broadcasting</topic><topic>Convergecast</topic><topic>Energy efficiency</topic><topic>Energy use</topic><topic>Heuristic</topic><topic>Minimum power</topic><topic>Multicast</topic><topic>Networks</topic><topic>Optimization</topic><topic>Trees</topic><topic>Wireless network</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bein, Doina</creatorcontrib><creatorcontrib>Zheng, S.Q.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bein, Doina</au><au>Zheng, S.Q.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Energy efficient all-to-all broadcast in all-wireless networks</atitle><jtitle>Information sciences</jtitle><date>2010-05-15</date><risdate>2010</risdate><volume>180</volume><issue>10</issue><spage>1781</spage><epage>1792</epage><pages>1781-1792</pages><issn>0020-0255</issn><eissn>1872-6291</eissn><abstract>All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented and unrooted. We study three known heuristics for the minimum-energy broadcast problem: the Broadcast Incremental Power (BIP) algorithm, the Wireless Multicast Advantage-conforming Minimum Spanning Tree (WMA-conforming MST) algorithm, and the Iterative Maximum-Branch Minimization (IMBM) algorithm. Experimental results conducted on various types of networks are reported. We show that neither of these methods is best overall for building all-to-all broadcast trees.</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.ins.2009.11.013</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0255 |
| ispartof | Information sciences, 2010-05, Vol.180 (10), p.1781-1792 |
| issn | 0020-0255 1872-6291 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671426616 |
| source | Elsevier ScienceDirect Journals Complete |
| subjects | Algorithms All-to-all broadcast Broadcast tree Broadcasting Convergecast Energy efficiency Energy use Heuristic Minimum power Multicast Networks Optimization Trees Wireless network |
| title | Energy efficient all-to-all broadcast in all-wireless networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A28%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Energy%20efficient%20all-to-all%20broadcast%20in%20all-wireless%20networks&rft.jtitle=Information%20sciences&rft.au=Bein,%20Doina&rft.date=2010-05-15&rft.volume=180&rft.issue=10&rft.spage=1781&rft.epage=1792&rft.pages=1781-1792&rft.issn=0020-0255&rft.eissn=1872-6291&rft_id=info:doi/10.1016/j.ins.2009.11.013&rft_dat=%3Cproquest_cross%3E1671426616%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671426616&rft_id=info:pmid/&rft_els_id=S0020025509004836&rfr_iscdi=true |