Loading…

A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic

Wireless mesh networks (WMNs) are becoming well-known as a new broadband Internet access technology through multihop transmission nowadays. With the tremendous popularity of the group communication, such as Push-to-Talk service, the need to deliver the traffic of push-to-talk over WMNs is becoming i...

Full description

Saved in:
Bibliographic Details
Main Authors: Kado, Y., Lim, A.O., Bing Zhang
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 202
container_issue
container_start_page 197
container_title
container_volume
creator Kado, Y.
Lim, A.O.
Bing Zhang
description Wireless mesh networks (WMNs) are becoming well-known as a new broadband Internet access technology through multihop transmission nowadays. With the tremendous popularity of the group communication, such as Push-to-Talk service, the need to deliver the traffic of push-to-talk over WMNs is becoming important. Since the push-to-talk traffic over WMNs is delay-sensitive traffic, a proactive routing protocol that keep routes continuously updated is ideally best-suited protocol. Among the proactive routing protocols, a tree-based routing (TBR) protocol is a viable routing protocol for WMNs because traffic that is directed to/from a wired network can be well-handled via a portal (a root). However, the performance of TBR protocol can be degraded rapidly when the number of group talking increases, which also leads to the intra-mesh traffics increases in the network. To mitigate this problem, we proposed a centralized tree-based routing protocol, which enables the root to provide the best metric route for intra-mesh traffics. In other words, the proposed protocol can disperse the intra-mesh traffics around the root when an overwhelming traffic volume occurred. Our simulation studies reveal that the proposed protocol outperforms both AODV and TBR protocols in terms of packet delivery ratio, average end-to-end delay, and data throughput as the number of active users becomes larger.
doi_str_mv 10.1109/ICCCN.2007.4317819
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4317819</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4317819</ieee_id><sourcerecordid>4317819</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-edee6c7058fac93002925c36fe33f8ed49376691ee53ac314503ef11b6520c9f3</originalsourceid><addsrcrecordid>eNot0EtPAjEUBeD6SkTkD-imf6B4b19Dl2Tig4hIdIzuyFhuZWS0ph1i-PeSyOoszsm3OIxdIAwRwV1NyrKcDSVAMdQKixG6A3aGWmqN0uDbIetJqwrhtIIjNnC7wb4DPGa9nWCEBGNO2SDnTwDAwuod3GP3Y_7cbZZbHgN_bRK1lDN_oLziM-p-Y1rzp7jpmu8PPk-xiz62mYeY-HyTV6KLoqrbNa9SHULjz9lJqNtMg3322cvNdVXeienj7aQcT0WDhekELYmsL8CMQu2dApBOGq9sIKXCiJbaqcJah0RG1V6hNqAoIL5bI8G7oPrs8t9tiGjxk5qvOm0X-1_UH758UWs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kado, Y. ; Lim, A.O. ; Bing Zhang</creator><creatorcontrib>Kado, Y. ; Lim, A.O. ; Bing Zhang</creatorcontrib><description>Wireless mesh networks (WMNs) are becoming well-known as a new broadband Internet access technology through multihop transmission nowadays. With the tremendous popularity of the group communication, such as Push-to-Talk service, the need to deliver the traffic of push-to-talk over WMNs is becoming important. Since the push-to-talk traffic over WMNs is delay-sensitive traffic, a proactive routing protocol that keep routes continuously updated is ideally best-suited protocol. Among the proactive routing protocols, a tree-based routing (TBR) protocol is a viable routing protocol for WMNs because traffic that is directed to/from a wired network can be well-handled via a portal (a root). However, the performance of TBR protocol can be degraded rapidly when the number of group talking increases, which also leads to the intra-mesh traffics increases in the network. To mitigate this problem, we proposed a centralized tree-based routing protocol, which enables the root to provide the best metric route for intra-mesh traffics. In other words, the proposed protocol can disperse the intra-mesh traffics around the root when an overwhelming traffic volume occurred. Our simulation studies reveal that the proposed protocol outperforms both AODV and TBR protocols in terms of packet delivery ratio, average end-to-end delay, and data throughput as the number of active users becomes larger.</description><identifier>ISSN: 1095-2055</identifier><identifier>ISBN: 9781424412501</identifier><identifier>ISBN: 1424412501</identifier><identifier>EISSN: 2637-9430</identifier><identifier>EISBN: 142441251X</identifier><identifier>EISBN: 9781424412518</identifier><identifier>DOI: 10.1109/ICCCN.2007.4317819</identifier><language>eng</language><publisher>IEEE</publisher><subject>Degradation ; Delay ; IP networks ; Portals ; Routing protocols ; Spread spectrum communication ; Telecommunication traffic ; Throughput ; Traffic control ; Wireless mesh networks</subject><ispartof>2007 16th International Conference on Computer Communications and Networks, 2007, p.197-202</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/4317819$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4317819$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kado, Y.</creatorcontrib><creatorcontrib>Lim, A.O.</creatorcontrib><creatorcontrib>Bing Zhang</creatorcontrib><title>A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic</title><title>2007 16th International Conference on Computer Communications and Networks</title><addtitle>ICCCN</addtitle><description>Wireless mesh networks (WMNs) are becoming well-known as a new broadband Internet access technology through multihop transmission nowadays. With the tremendous popularity of the group communication, such as Push-to-Talk service, the need to deliver the traffic of push-to-talk over WMNs is becoming important. Since the push-to-talk traffic over WMNs is delay-sensitive traffic, a proactive routing protocol that keep routes continuously updated is ideally best-suited protocol. Among the proactive routing protocols, a tree-based routing (TBR) protocol is a viable routing protocol for WMNs because traffic that is directed to/from a wired network can be well-handled via a portal (a root). However, the performance of TBR protocol can be degraded rapidly when the number of group talking increases, which also leads to the intra-mesh traffics increases in the network. To mitigate this problem, we proposed a centralized tree-based routing protocol, which enables the root to provide the best metric route for intra-mesh traffics. In other words, the proposed protocol can disperse the intra-mesh traffics around the root when an overwhelming traffic volume occurred. Our simulation studies reveal that the proposed protocol outperforms both AODV and TBR protocols in terms of packet delivery ratio, average end-to-end delay, and data throughput as the number of active users becomes larger.</description><subject>Degradation</subject><subject>Delay</subject><subject>IP networks</subject><subject>Portals</subject><subject>Routing protocols</subject><subject>Spread spectrum communication</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Traffic control</subject><subject>Wireless mesh networks</subject><issn>1095-2055</issn><issn>2637-9430</issn><isbn>9781424412501</isbn><isbn>1424412501</isbn><isbn>142441251X</isbn><isbn>9781424412518</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNot0EtPAjEUBeD6SkTkD-imf6B4b19Dl2Tig4hIdIzuyFhuZWS0ph1i-PeSyOoszsm3OIxdIAwRwV1NyrKcDSVAMdQKixG6A3aGWmqN0uDbIetJqwrhtIIjNnC7wb4DPGa9nWCEBGNO2SDnTwDAwuod3GP3Y_7cbZZbHgN_bRK1lDN_oLziM-p-Y1rzp7jpmu8PPk-xiz62mYeY-HyTV6KLoqrbNa9SHULjz9lJqNtMg3322cvNdVXeienj7aQcT0WDhekELYmsL8CMQu2dApBOGq9sIKXCiJbaqcJah0RG1V6hNqAoIL5bI8G7oPrs8t9tiGjxk5qvOm0X-1_UH758UWs</recordid><startdate>200708</startdate><enddate>200708</enddate><creator>Kado, Y.</creator><creator>Lim, A.O.</creator><creator>Bing Zhang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200708</creationdate><title>A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic</title><author>Kado, Y. ; Lim, A.O. ; Bing Zhang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-edee6c7058fac93002925c36fe33f8ed49376691ee53ac314503ef11b6520c9f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Degradation</topic><topic>Delay</topic><topic>IP networks</topic><topic>Portals</topic><topic>Routing protocols</topic><topic>Spread spectrum communication</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Traffic control</topic><topic>Wireless mesh networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Kado, Y.</creatorcontrib><creatorcontrib>Lim, A.O.</creatorcontrib><creatorcontrib>Bing Zhang</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 Xplore / Electronic Library Online (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>Kado, Y.</au><au>Lim, A.O.</au><au>Bing Zhang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic</atitle><btitle>2007 16th International Conference on Computer Communications and Networks</btitle><stitle>ICCCN</stitle><date>2007-08</date><risdate>2007</risdate><spage>197</spage><epage>202</epage><pages>197-202</pages><issn>1095-2055</issn><eissn>2637-9430</eissn><isbn>9781424412501</isbn><isbn>1424412501</isbn><eisbn>142441251X</eisbn><eisbn>9781424412518</eisbn><abstract>Wireless mesh networks (WMNs) are becoming well-known as a new broadband Internet access technology through multihop transmission nowadays. With the tremendous popularity of the group communication, such as Push-to-Talk service, the need to deliver the traffic of push-to-talk over WMNs is becoming important. Since the push-to-talk traffic over WMNs is delay-sensitive traffic, a proactive routing protocol that keep routes continuously updated is ideally best-suited protocol. Among the proactive routing protocols, a tree-based routing (TBR) protocol is a viable routing protocol for WMNs because traffic that is directed to/from a wired network can be well-handled via a portal (a root). However, the performance of TBR protocol can be degraded rapidly when the number of group talking increases, which also leads to the intra-mesh traffics increases in the network. To mitigate this problem, we proposed a centralized tree-based routing protocol, which enables the root to provide the best metric route for intra-mesh traffics. In other words, the proposed protocol can disperse the intra-mesh traffics around the root when an overwhelming traffic volume occurred. Our simulation studies reveal that the proposed protocol outperforms both AODV and TBR protocols in terms of packet delivery ratio, average end-to-end delay, and data throughput as the number of active users becomes larger.</abstract><pub>IEEE</pub><doi>10.1109/ICCCN.2007.4317819</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1095-2055
ispartof 2007 16th International Conference on Computer Communications and Networks, 2007, p.197-202
issn 1095-2055
2637-9430
language eng
recordid cdi_ieee_primary_4317819
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Degradation
Delay
IP networks
Portals
Routing protocols
Spread spectrum communication
Telecommunication traffic
Throughput
Traffic control
Wireless mesh networks
title A Study of Wireless Mesh Network Routing Protocols for Push-to-Talk Traffic
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T10%3A17%3A07IST&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%20Study%20of%20Wireless%20Mesh%20Network%20Routing%20Protocols%20for%20Push-to-Talk%20Traffic&rft.btitle=2007%2016th%20International%20Conference%20on%20Computer%20Communications%20and%20Networks&rft.au=Kado,%20Y.&rft.date=2007-08&rft.spage=197&rft.epage=202&rft.pages=197-202&rft.issn=1095-2055&rft.eissn=2637-9430&rft.isbn=9781424412501&rft.isbn_list=1424412501&rft_id=info:doi/10.1109/ICCCN.2007.4317819&rft.eisbn=142441251X&rft.eisbn_list=9781424412518&rft_dat=%3Cieee_6IE%3E4317819%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-edee6c7058fac93002925c36fe33f8ed49376691ee53ac314503ef11b6520c9f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4317819&rfr_iscdi=true