A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times
This paper proposes a stability-based multicast routing protocol for Mobile Ad hoc Networks (MANETs) and it can simultaneously determine long-living multicast trees that also have close to minimum hop count per source-receiver paths. The proposed protocol is referred to as the MILET protocol, and is...
Gespeichert in:
1. Verfasser: | |
---|---|
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 | 951 |
---|---|
container_issue | |
container_start_page | 947 |
container_title | |
container_volume | |
creator | Meghanathan, N. |
description | This paper proposes a stability-based multicast routing protocol for Mobile Ad hoc Networks (MANETs) and it can simultaneously determine long-living multicast trees that also have close to minimum hop count per source-receiver paths. The proposed protocol is referred to as the MILET protocol, and is based on the inverse of the predicted Link Expiration Times (LET) values. The protocol launches an on-demand source-initiated request-reply broadcast tree construction process and the receiver nodes of the multicast group choose the path with the lowest sum of the link weights to join the multicast tree. By including a `1' in the link weight comprising of the inverse of the LET values, MILET manages to form multicast trees with long-living stable source-receiver paths that also have a lower hop count. Ns-2 based simulation analysis illustrates that MILET forms multicast trees that have at least 50% relatively longer lifetime compared to the other well-known multicast tree routing protocols and the hop count per source-receiver path is at most 7% larger than the minimum. |
doi_str_mv | 10.1109/CCNC.2012.6180965 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6180965</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6180965</ieee_id><sourcerecordid>6180965</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-c3cad8c46242d24d80fe7b8b24c2f1e31e57045ca8214c19e4fad2835841a77f3</originalsourceid><addsrcrecordid>eNo1kMtKAzEYhSMqWGsfQNz8LzA11yazLEO9QK2bCu5KJvNHo9NJSVLRt7dgPZvDx4FvcQi5ZnTKGK1vm2bVTDllfDpjhtYzdUIumVRac6rZ6ymZ1Nr8MxVnZMSFYFVtFL8gk5w_6CGaciP1iNg5PM1XizVs930JzuYCKe5LGN5gl2KJLvbgY4JcbNsjlISYobUZO4gDlHeEMHxhygjRwzIMn7D43oVkSzjM67DFfEXOve0zTo49Ji93i3XzUC2f7x-b-bIKTKtSOeFsZ5yccck7LjtDPerWtFw67hkKhkpTqZw1nEnHapTedtwIZSSzWnsxJjd_3oCIm10KW5t-NseHxC-rk1e8</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Meghanathan, N.</creator><creatorcontrib>Meghanathan, N.</creatorcontrib><description>This paper proposes a stability-based multicast routing protocol for Mobile Ad hoc Networks (MANETs) and it can simultaneously determine long-living multicast trees that also have close to minimum hop count per source-receiver paths. The proposed protocol is referred to as the MILET protocol, and is based on the inverse of the predicted Link Expiration Times (LET) values. The protocol launches an on-demand source-initiated request-reply broadcast tree construction process and the receiver nodes of the multicast group choose the path with the lowest sum of the link weights to join the multicast tree. By including a `1' in the link weight comprising of the inverse of the LET values, MILET manages to form multicast trees with long-living stable source-receiver paths that also have a lower hop count. Ns-2 based simulation analysis illustrates that MILET forms multicast trees that have at least 50% relatively longer lifetime compared to the other well-known multicast tree routing protocols and the hop count per source-receiver path is at most 7% larger than the minimum.</description><identifier>ISSN: 2331-9852</identifier><identifier>ISBN: 9781457720703</identifier><identifier>ISBN: 1457720701</identifier><identifier>EISBN: 145772071X</identifier><identifier>EISBN: 9781457720710</identifier><identifier>EISBN: 9781457720697</identifier><identifier>EISBN: 1457720698</identifier><identifier>DOI: 10.1109/CCNC.2012.6180965</identifier><language>eng</language><publisher>IEEE</publisher><subject>Conferences ; Hop Count ; Link Expiration Time ; Mobile ad hoc networks ; Multicast Routing Protocol ; Receivers ; Routing ; Routing protocols ; Stability ; Tree Lifetime</subject><ispartof>2012 IEEE Consumer Communications and Networking Conference (CCNC), 2012, p.947-951</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/6180965$$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/6180965$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Meghanathan, N.</creatorcontrib><title>A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times</title><title>2012 IEEE Consumer Communications and Networking Conference (CCNC)</title><addtitle>CCNC</addtitle><description>This paper proposes a stability-based multicast routing protocol for Mobile Ad hoc Networks (MANETs) and it can simultaneously determine long-living multicast trees that also have close to minimum hop count per source-receiver paths. The proposed protocol is referred to as the MILET protocol, and is based on the inverse of the predicted Link Expiration Times (LET) values. The protocol launches an on-demand source-initiated request-reply broadcast tree construction process and the receiver nodes of the multicast group choose the path with the lowest sum of the link weights to join the multicast tree. By including a `1' in the link weight comprising of the inverse of the LET values, MILET manages to form multicast trees with long-living stable source-receiver paths that also have a lower hop count. Ns-2 based simulation analysis illustrates that MILET forms multicast trees that have at least 50% relatively longer lifetime compared to the other well-known multicast tree routing protocols and the hop count per source-receiver path is at most 7% larger than the minimum.</description><subject>Conferences</subject><subject>Hop Count</subject><subject>Link Expiration Time</subject><subject>Mobile ad hoc networks</subject><subject>Multicast Routing Protocol</subject><subject>Receivers</subject><subject>Routing</subject><subject>Routing protocols</subject><subject>Stability</subject><subject>Tree Lifetime</subject><issn>2331-9852</issn><isbn>9781457720703</isbn><isbn>1457720701</isbn><isbn>145772071X</isbn><isbn>9781457720710</isbn><isbn>9781457720697</isbn><isbn>1457720698</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kMtKAzEYhSMqWGsfQNz8LzA11yazLEO9QK2bCu5KJvNHo9NJSVLRt7dgPZvDx4FvcQi5ZnTKGK1vm2bVTDllfDpjhtYzdUIumVRac6rZ6ymZ1Nr8MxVnZMSFYFVtFL8gk5w_6CGaciP1iNg5PM1XizVs930JzuYCKe5LGN5gl2KJLvbgY4JcbNsjlISYobUZO4gDlHeEMHxhygjRwzIMn7D43oVkSzjM67DFfEXOve0zTo49Ji93i3XzUC2f7x-b-bIKTKtSOeFsZ5yccck7LjtDPerWtFw67hkKhkpTqZw1nEnHapTedtwIZSSzWnsxJjd_3oCIm10KW5t-NseHxC-rk1e8</recordid><startdate>201201</startdate><enddate>201201</enddate><creator>Meghanathan, N.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201201</creationdate><title>A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times</title><author>Meghanathan, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-c3cad8c46242d24d80fe7b8b24c2f1e31e57045ca8214c19e4fad2835841a77f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Conferences</topic><topic>Hop Count</topic><topic>Link Expiration Time</topic><topic>Mobile ad hoc networks</topic><topic>Multicast Routing Protocol</topic><topic>Receivers</topic><topic>Routing</topic><topic>Routing protocols</topic><topic>Stability</topic><topic>Tree Lifetime</topic><toplevel>online_resources</toplevel><creatorcontrib>Meghanathan, N.</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>Meghanathan, N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times</atitle><btitle>2012 IEEE Consumer Communications and Networking Conference (CCNC)</btitle><stitle>CCNC</stitle><date>2012-01</date><risdate>2012</risdate><spage>947</spage><epage>951</epage><pages>947-951</pages><issn>2331-9852</issn><isbn>9781457720703</isbn><isbn>1457720701</isbn><eisbn>145772071X</eisbn><eisbn>9781457720710</eisbn><eisbn>9781457720697</eisbn><eisbn>1457720698</eisbn><abstract>This paper proposes a stability-based multicast routing protocol for Mobile Ad hoc Networks (MANETs) and it can simultaneously determine long-living multicast trees that also have close to minimum hop count per source-receiver paths. The proposed protocol is referred to as the MILET protocol, and is based on the inverse of the predicted Link Expiration Times (LET) values. The protocol launches an on-demand source-initiated request-reply broadcast tree construction process and the receiver nodes of the multicast group choose the path with the lowest sum of the link weights to join the multicast tree. By including a `1' in the link weight comprising of the inverse of the LET values, MILET manages to form multicast trees with long-living stable source-receiver paths that also have a lower hop count. Ns-2 based simulation analysis illustrates that MILET forms multicast trees that have at least 50% relatively longer lifetime compared to the other well-known multicast tree routing protocols and the hop count per source-receiver path is at most 7% larger than the minimum.</abstract><pub>IEEE</pub><doi>10.1109/CCNC.2012.6180965</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2331-9852 |
ispartof | 2012 IEEE Consumer Communications and Networking Conference (CCNC), 2012, p.947-951 |
issn | 2331-9852 |
language | eng |
recordid | cdi_ieee_primary_6180965 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Conferences Hop Count Link Expiration Time Mobile ad hoc networks Multicast Routing Protocol Receivers Routing Routing protocols Stability Tree Lifetime |
title | A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T20%3A48%3A45IST&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=A%20MANET%20multicast%20routing%20protocol%20for%20stable%20trees%20based%20on%20the%20inverse%20of%20Link%20Expiration%20Times&rft.btitle=2012%20IEEE%20Consumer%20Communications%20and%20Networking%20Conference%20(CCNC)&rft.au=Meghanathan,%20N.&rft.date=2012-01&rft.spage=947&rft.epage=951&rft.pages=947-951&rft.issn=2331-9852&rft.isbn=9781457720703&rft.isbn_list=1457720701&rft_id=info:doi/10.1109/CCNC.2012.6180965&rft_dat=%3Cieee_6IE%3E6180965%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=145772071X&rft.eisbn_list=9781457720710&rft.eisbn_list=9781457720697&rft.eisbn_list=1457720698&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6180965&rfr_iscdi=true |