Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees
In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to c...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 400 |
|---|---|
| container_issue | |
| container_start_page | 396 |
| container_title | |
| container_volume | |
| creator | Kumar, B.R.A. Reddy, L.C. Rajan Hiremath, P.S. |
| description | In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based multicasting in ad-hoc networks for route failure tolerance. |
| doi_str_mv | 10.1109/ICCSIT.2009.5234527 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5234527</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5234527</ieee_id><sourcerecordid>5234527</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-e4ec1182607fbacc7f3c54bdf1b7f14f025f3de36d024610c6b3c688d507d14d3</originalsourceid><addsrcrecordid>eNotUM1OAjEYrDEkCvIEXPoCYL-2u90eyUZlE9REuWO3_WqK-0O23RjfXgjMZTKZn8MQsgC2AmD6sSrLz2q34ozpVcaFzLi6IXOtCpBcypNk_JZMrwI0TMj0nNVMKA13ZB7jgZ1wCmol78nXRz8mpN6EZhyQpr7BwXSJtmOTgjUx0dDR174ODdK1o5ve0jdMv_3wE-kYQ_dNXYiHPpwroQvt2NJ4NF13dtKAGB_IxJsm4vzKM7J7ftqVm-X2_aUq19tl0CwtUaIFKHjOlK-NtcoLm8naeaiVB-kZz7xwKHLHuMyB2bwWNi8KlzHlQDoxI4vLbEDE_XEIrRn-9teDxD_H2llL</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kumar, B.R.A. ; Reddy, L.C. ; Rajan ; Hiremath, P.S.</creator><creatorcontrib>Kumar, B.R.A. ; Reddy, L.C. ; Rajan ; Hiremath, P.S.</creatorcontrib><description>In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based multicasting in ad-hoc networks for route failure tolerance.</description><identifier>ISBN: 1424445191</identifier><identifier>ISBN: 9781424445196</identifier><identifier>EISBN: 9781424445202</identifier><identifier>EISBN: 1424445205</identifier><identifier>DOI: 10.1109/ICCSIT.2009.5234527</identifier><identifier>LCCN: 2009903791</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Costs ; dijoint ; failure ; Fault tolerance ; minimum ; Mobile ad hoc networks ; multicast ; Multicast algorithms ; Multicast protocols ; Redundancy ; Robustness ; Routing protocols ; spanning ; Unicast</subject><ispartof>2009 2nd IEEE International Conference on Computer Science and Information Technology, 2009, p.396-400</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5234527$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5234527$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kumar, B.R.A.</creatorcontrib><creatorcontrib>Reddy, L.C.</creatorcontrib><creatorcontrib>Rajan</creatorcontrib><creatorcontrib>Hiremath, P.S.</creatorcontrib><title>Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees</title><title>2009 2nd IEEE International Conference on Computer Science and Information Technology</title><addtitle>ICCSIT</addtitle><description>In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based multicasting in ad-hoc networks for route failure tolerance.</description><subject>Ad hoc networks</subject><subject>Costs</subject><subject>dijoint</subject><subject>failure</subject><subject>Fault tolerance</subject><subject>minimum</subject><subject>Mobile ad hoc networks</subject><subject>multicast</subject><subject>Multicast algorithms</subject><subject>Multicast protocols</subject><subject>Redundancy</subject><subject>Robustness</subject><subject>Routing protocols</subject><subject>spanning</subject><subject>Unicast</subject><isbn>1424445191</isbn><isbn>9781424445196</isbn><isbn>9781424445202</isbn><isbn>1424445205</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotUM1OAjEYrDEkCvIEXPoCYL-2u90eyUZlE9REuWO3_WqK-0O23RjfXgjMZTKZn8MQsgC2AmD6sSrLz2q34ozpVcaFzLi6IXOtCpBcypNk_JZMrwI0TMj0nNVMKA13ZB7jgZ1wCmol78nXRz8mpN6EZhyQpr7BwXSJtmOTgjUx0dDR174ODdK1o5ve0jdMv_3wE-kYQ_dNXYiHPpwroQvt2NJ4NF13dtKAGB_IxJsm4vzKM7J7ftqVm-X2_aUq19tl0CwtUaIFKHjOlK-NtcoLm8naeaiVB-kZz7xwKHLHuMyB2bwWNi8KlzHlQDoxI4vLbEDE_XEIrRn-9teDxD_H2llL</recordid><startdate>200908</startdate><enddate>200908</enddate><creator>Kumar, B.R.A.</creator><creator>Reddy, L.C.</creator><creator>Rajan</creator><creator>Hiremath, P.S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200908</creationdate><title>Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees</title><author>Kumar, B.R.A. ; Reddy, L.C. ; Rajan ; Hiremath, P.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-e4ec1182607fbacc7f3c54bdf1b7f14f025f3de36d024610c6b3c688d507d14d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Ad hoc networks</topic><topic>Costs</topic><topic>dijoint</topic><topic>failure</topic><topic>Fault tolerance</topic><topic>minimum</topic><topic>Mobile ad hoc networks</topic><topic>multicast</topic><topic>Multicast algorithms</topic><topic>Multicast protocols</topic><topic>Redundancy</topic><topic>Robustness</topic><topic>Routing protocols</topic><topic>spanning</topic><topic>Unicast</topic><toplevel>online_resources</toplevel><creatorcontrib>Kumar, B.R.A.</creatorcontrib><creatorcontrib>Reddy, L.C.</creatorcontrib><creatorcontrib>Rajan</creatorcontrib><creatorcontrib>Hiremath, P.S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kumar, B.R.A.</au><au>Reddy, L.C.</au><au>Rajan</au><au>Hiremath, P.S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees</atitle><btitle>2009 2nd IEEE International Conference on Computer Science and Information Technology</btitle><stitle>ICCSIT</stitle><date>2009-08</date><risdate>2009</risdate><spage>396</spage><epage>400</epage><pages>396-400</pages><isbn>1424445191</isbn><isbn>9781424445196</isbn><eisbn>9781424445202</eisbn><eisbn>1424445205</eisbn><abstract>In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based multicasting in ad-hoc networks for route failure tolerance.</abstract><pub>IEEE</pub><doi>10.1109/ICCSIT.2009.5234527</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424445191 |
| ispartof | 2009 2nd IEEE International Conference on Computer Science and Information Technology, 2009, p.396-400 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5234527 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Ad hoc networks Costs dijoint failure Fault tolerance minimum Mobile ad hoc networks multicast Multicast algorithms Multicast protocols Redundancy Robustness Routing protocols spanning Unicast |
| title | Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T10%3A36%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Route%20failure%20tolerant%20multicast%20in%20Mobile%20Ad%20Hoc%20Networks%20using%20disjoint%20minimum%20spanning%20trees&rft.btitle=2009%202nd%20IEEE%20International%20Conference%20on%20Computer%20Science%20and%20Information%20Technology&rft.au=Kumar,%20B.R.A.&rft.date=2009-08&rft.spage=396&rft.epage=400&rft.pages=396-400&rft.isbn=1424445191&rft.isbn_list=9781424445196&rft_id=info:doi/10.1109/ICCSIT.2009.5234527&rft_dat=%3Cieee_6IE%3E5234527%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424445202&rft.eisbn_list=1424445205&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5234527&rfr_iscdi=true |