Wireless Mesh Networks (WMN) are considered an attractive alternative to the traditional wired backbone networks for broadband Internet access. However, their capacity is limited due to the nature of the radio channel, which must be shared by the nodes forwarding the traffic from and to the gateway. Therefore, estimating the capacity of WMNs is an important question. The capacity analysis proposed for ad hoc networks can not be directly applied to WMN due to some fundamental differences, e.g. a different traffic pattern and node density. The main contribution of this work is the application of collision domains concept to the 802.16 based WMNs. We consider a simple chain topology but the method can be extended to any arbitrary topology and the real world impairments (interference, fading, etc.) can be easily incorporated in the analysis. The presented results may have important implications for 802.16 mesh networks planning.
{"title":"IEEE 802.16 Wireless Mesh Networks Capacity Estimation Using Collision Domains","authors":"R. Krenz","doi":"10.1109/MESH.2009.28","DOIUrl":"https://doi.org/10.1109/MESH.2009.28","url":null,"abstract":"Wireless Mesh Networks (WMN) are considered an attractive alternative to the traditional wired backbone networks for broadband Internet access. However, their capacity is limited due to the nature of the radio channel, which must be shared by the nodes forwarding the traffic from and to the gateway. Therefore, estimating the capacity of WMNs is an important question. The capacity analysis proposed for ad hoc networks can not be directly applied to WMN due to some fundamental differences, e.g. a different traffic pattern and node density. The main contribution of this work is the application of collision domains concept to the 802.16 based WMNs. We consider a simple chain topology but the method can be extended to any arbitrary topology and the real world impairments (interference, fading, etc.) can be easily incorporated in the analysis. The presented results may have important implications for 802.16 mesh networks planning.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128837373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Various solutions based on both prioritization and resource allocation have been proposed in the literature and standard bodies to support end-to-end Quality of Service (QoS) in wireless multihop scenarios. However, their performance is not satisfactory in terms of achievable overall network throughput and tradeoff between end-to-end delay and network utilization. This paper proposes Time-driven Access and Forwarding (TAF), a novel multilevel solution to guarantee deterministic end-to-end QoS for real-time traffic and improve overall network throughput and utilization in 802.11 mesh networks.
{"title":"Time-Driven Access and Forwarding in IEEE 802.11 Mesh Networks","authors":"M. Baldi, Riccardo Giacomelli","doi":"10.1109/MESH.2009.10","DOIUrl":"https://doi.org/10.1109/MESH.2009.10","url":null,"abstract":"Various solutions based on both prioritization and resource allocation have been proposed in the literature and standard bodies to support end-to-end Quality of Service (QoS) in wireless multihop scenarios. However, their performance is not satisfactory in terms of achievable overall network throughput and tradeoff between end-to-end delay and network utilization. This paper proposes Time-driven Access and Forwarding (TAF), a novel multilevel solution to guarantee deterministic end-to-end QoS for real-time traffic and improve overall network throughput and utilization in 802.11 mesh networks.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127848879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present a framework for performance evaluation and optimization of video applications in mobile multi hop networks. We focus on the perceived video quality de- pending on the simulated mobility model, traffic pattern, retransmission strategy, and the configuration of the routing protocol. Moreover, the functionality of the framework is demonstrated by evaluating the performance of a video surveillance application with multiple mobile sources and sinks. The application is designed for exchanging multimedia content, e.g. audio and video streams, in wireless networks where all nodes are highly mobile.
{"title":"Performance Evaluation Framework for Video Applications in Mobile Networks","authors":"A. Klein, J. Klaue","doi":"10.1109/MESH.2009.15","DOIUrl":"https://doi.org/10.1109/MESH.2009.15","url":null,"abstract":"We present a framework for performance evaluation and optimization of video applications in mobile multi hop networks. We focus on the perceived video quality de- pending on the simulated mobility model, traffic pattern, retransmission strategy, and the configuration of the routing protocol. Moreover, the functionality of the framework is demonstrated by evaluating the performance of a video surveillance application with multiple mobile sources and sinks. The application is designed for exchanging multimedia content, e.g. audio and video streams, in wireless networks where all nodes are highly mobile.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124683245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Pedersen, J. Gutierrez, T. Marciniak, B. Dubalski, A. Zabludowski
N2R structures are a subset of Generalized Petersen Graphs and a potentially good option to be used for implementing degree three networks. The previous works on these structures verify that N2R are better than other degree three regular topologies such as Double Rings or Honeycomb in terms of path distances. The cost of this good performance is a more complex and non-planar interconnection configuration; It is complex to find analytical models to be used, for example for describing topological parameters. This paper proposes and verifies the possibility of approximating real N2R graphs to optimal and ideal graphs, which are much easier to model, obtaining fairly accurate results. A main result of the paper is a simple formula for approximating average distance and diameter given the number of nodes in a N2R graph.
{"title":"Describing N2R Properties Using Ideal Graphs","authors":"J. Pedersen, J. Gutierrez, T. Marciniak, B. Dubalski, A. Zabludowski","doi":"10.1109/MESH.2009.34","DOIUrl":"https://doi.org/10.1109/MESH.2009.34","url":null,"abstract":"N2R structures are a subset of Generalized Petersen Graphs and a potentially good option to be used for implementing degree three networks. The previous works on these structures verify that N2R are better than other degree three regular topologies such as Double Rings or Honeycomb in terms of path distances. The cost of this good performance is a more complex and non-planar interconnection configuration; It is complex to find analytical models to be used, for example for describing topological parameters. This paper proposes and verifies the possibility of approximating real N2R graphs to optimal and ideal graphs, which are much easier to model, obtaining fairly accurate results. A main result of the paper is a simple formula for approximating average distance and diameter given the number of nodes in a N2R graph.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122653409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present experimental results from testbed implementation of a simple monitoring assisted local route recovery scheme for wireless mesh networks (WMN). The scheme exploits the broadcast nature of wireless transmissions at special routers with added monitoring functionalities. These routers passively listen to the transmissions in the neighborhood and compare the forwarding behavior against pre-specified thresholds. If forwarded traffic exceeds the threshold, as a result of a malfunction, e.g., Denial-of-service (DoS) attack or node failure, these routers try to isolate the node causing the problem by routing the traffic around it. The performance evaluation of our scheme shows considerable improvement in data delivery rates over standard routing schemes.
{"title":"A Testbed Implementation of Monitoring Assisted Local Route Recovery Scheme for Wireless Mesh Networks","authors":"Dominic K. H. Heah, Z. Zaidi","doi":"10.1109/MESH.2009.29","DOIUrl":"https://doi.org/10.1109/MESH.2009.29","url":null,"abstract":"In this paper, we present experimental results from testbed implementation of a simple monitoring assisted local route recovery scheme for wireless mesh networks (WMN). The scheme exploits the broadcast nature of wireless transmissions at special routers with added monitoring functionalities. These routers passively listen to the transmissions in the neighborhood and compare the forwarding behavior against pre-specified thresholds. If forwarded traffic exceeds the threshold, as a result of a malfunction, e.g., Denial-of-service (DoS) attack or node failure, these routers try to isolate the node causing the problem by routing the traffic around it. The performance evaluation of our scheme shows considerable improvement in data delivery rates over standard routing schemes.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126958100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Pham, Y. Diao, Yusuke Kato, Ken-ichiro Yagura, Yumi Takaki, C. Ohta
In wireless ad-hoc networks, one of the reasons thatincrease the data packet loss rate is gray zone effect. Thegray zone effect can happen when broadcasting controlpackets with lower rate while transmitting the data packetswith such higher rate or the same PHY data rate. In thiscase, nodes are able to find valid routes but some datapackets may not reach the destination, which causes thehigh packet loss rate. Most research efforts so far haveattempted to modify the routing protocol to take the grayzone effect into consideration. This method, however, couldhave a detrimental performance owning to its high computationalcomplexity. In this paper, by adjusting the suitablebroadcast rate and data transmission rate, we can obtainhigher throughput than the original way. By simulations,we show that our simple approach can improve throughputsignificantly.
{"title":"A Simple Approach on Mitigating the Gray Zone Effect to Improve Throughput in IEEE802.11 Based Ad-Hoc Network","authors":"N. Pham, Y. Diao, Yusuke Kato, Ken-ichiro Yagura, Yumi Takaki, C. Ohta","doi":"10.1109/MESH.2009.9","DOIUrl":"https://doi.org/10.1109/MESH.2009.9","url":null,"abstract":"In wireless ad-hoc networks, one of the reasons thatincrease the data packet loss rate is gray zone effect. Thegray zone effect can happen when broadcasting controlpackets with lower rate while transmitting the data packetswith such higher rate or the same PHY data rate. In thiscase, nodes are able to find valid routes but some datapackets may not reach the destination, which causes thehigh packet loss rate. Most research efforts so far haveattempted to modify the routing protocol to take the grayzone effect into consideration. This method, however, couldhave a detrimental performance owning to its high computationalcomplexity. In this paper, by adjusting the suitablebroadcast rate and data transmission rate, we can obtainhigher throughput than the original way. By simulations,we show that our simple approach can improve throughputsignificantly.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127464676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Pries, D. Staehle, M. Stoykova, B. Staehle, P. Tran-Gia
Wireless Mesh Networks (WMNs) are a promising technology for providing broadband wireless access to the end user. They offer a higher degree of flexibility compared to traditional networks but on the expense of a more complex structure. Thus, planning and optimization of WMNs is a challenge. In this paper, we address this challenge using genetic algorithms. Genetic algorithms are able to evaluate and optimize large-scale WMNs in relatively small computation time. The results prove the effectiveness of the genetic operators to optimize the routing and channel assignment in WMNs.
{"title":"Wireless Mesh Network Planning and Optimization through Genetic Algorithms","authors":"R. Pries, D. Staehle, M. Stoykova, B. Staehle, P. Tran-Gia","doi":"10.1109/MESH.2009.17","DOIUrl":"https://doi.org/10.1109/MESH.2009.17","url":null,"abstract":"Wireless Mesh Networks (WMNs) are a promising technology for providing broadband wireless access to the end user. They offer a higher degree of flexibility compared to traditional networks but on the expense of a more complex structure. Thus, planning and optimization of WMNs is a challenge. In this paper, we address this challenge using genetic algorithms. Genetic algorithms are able to evaluate and optimize large-scale WMNs in relatively small computation time. The results prove the effectiveness of the genetic operators to optimize the routing and channel assignment in WMNs.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129066145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gledson Elias, Mateus Novaes, Gustavo Cavalcanti, D. Porto
Infrastructure Wireless Mesh Networks (IWMNs) have emerged as a promising technology for dynamic selfconfigurable and self-healing networks that provide large coverage, connectivity and resilience based on routing capabilities supported by their constituting nodes. In order to scale up IWMNs, it is an interesting approach to split routing capabilities into a layered routing architecture, in which the base layer is defined by a neighborhood discovery protocol employed to detect the presence and status of neighbor nodes. In such a context, this paper presents SNDP, a scalable neighborhood discovery protocol that has been specifically designed for IWMNs. SNDP adopts a hybrid, collaborative signaling strategy, in which different types of nodes adopt distinct signaling approaches that work together to manage neighborhood concerns. By reducing signaling load, power consumption and neighborhood discovery time, SNDP has the potential to become a better choice than the current work-in progress proposed by the IETF MANET working group.
{"title":"A Scalable Neighborhood Discovery Protocol for Infrastructure Wireless Mesh Networks","authors":"Gledson Elias, Mateus Novaes, Gustavo Cavalcanti, D. Porto","doi":"10.1109/MESH.2009.31","DOIUrl":"https://doi.org/10.1109/MESH.2009.31","url":null,"abstract":"Infrastructure Wireless Mesh Networks (IWMNs) have emerged as a promising technology for dynamic selfconfigurable and self-healing networks that provide large coverage, connectivity and resilience based on routing capabilities supported by their constituting nodes. In order to scale up IWMNs, it is an interesting approach to split routing capabilities into a layered routing architecture, in which the base layer is defined by a neighborhood discovery protocol employed to detect the presence and status of neighbor nodes. In such a context, this paper presents SNDP, a scalable neighborhood discovery protocol that has been specifically designed for IWMNs. SNDP adopts a hybrid, collaborative signaling strategy, in which different types of nodes adopt distinct signaling approaches that work together to manage neighborhood concerns. By reducing signaling load, power consumption and neighborhood discovery time, SNDP has the potential to become a better choice than the current work-in progress proposed by the IETF MANET working group.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"29 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Hamidian, C. Palazzi, T. Y. Chong, J. M. Navarro, U. Korner, M. Gerla
Wireless Mesh Networks (WMNs) have the potentialities to greatly penetrate the marketplace in the next decade. They can be considered a hybrid between wireless infrastructure and ad-hoc networks; no other network infrastructure is needed other than the mesh points, thus providing flexibility in building and expanding the network, allowing for automatic discovery of neighboring nodes, increased reliability and redundancy. In this work, we discuss how WMNs can be practically employed to support communications in an office-wide area. To this aim, we have deployed a real WMN testbed utilizing state-of-the-art technology and analyzed the performance of this architecture when supporting multihop heterogeneous traffic.
{"title":"Deployment and Evaluation of a Wireless Mesh Network","authors":"A. Hamidian, C. Palazzi, T. Y. Chong, J. M. Navarro, U. Korner, M. Gerla","doi":"10.1109/MESH.2009.19","DOIUrl":"https://doi.org/10.1109/MESH.2009.19","url":null,"abstract":"Wireless Mesh Networks (WMNs) have the potentialities to greatly penetrate the marketplace in the next decade. They can be considered a hybrid between wireless infrastructure and ad-hoc networks; no other network infrastructure is needed other than the mesh points, thus providing flexibility in building and expanding the network, allowing for automatic discovery of neighboring nodes, increased reliability and redundancy. In this work, we discuss how WMNs can be practically employed to support communications in an office-wide area. To this aim, we have deployed a real WMN testbed utilizing state-of-the-art technology and analyzed the performance of this architecture when supporting multihop heterogeneous traffic.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to its wireless multi-hop feature, Wireless Mesh Network (WMN)is prone to suffer from many attacks, such as Denial of Service attack(DoS). In the DoS attack, when extortionate high-load flows flood to individual Mesh Routers (MR), they can no longer provide normal services to innocent flows. An active cache based defense solution can detect the existence of attacking flows based on thefrequency of incoming packets and eliminate the attacking flows by discarding packets by a Drop Probability(DP). As shown in our simulation study, the selection and variance of DP have a significant impact on the performance of the defense solution to both attacking flows and innocent flows. In this paper, a series of DP selection and variance methods are employed in our simulation studies. From them, we can optimize the DP methods and correspondingparameter setting of the solution against Dos attack by the analysis on the simulation results.
{"title":"Stochastic Security Performance of Active Cache Based Defense against DoS Attacks in Wireless Mesh Network","authors":"Ye Yan, Jiannong Cao, Zhuo Li","doi":"10.1109/MESH.2009.13","DOIUrl":"https://doi.org/10.1109/MESH.2009.13","url":null,"abstract":"Due to its wireless multi-hop feature, Wireless Mesh Network (WMN)is prone to suffer from many attacks, such as Denial of Service attack(DoS). In the DoS attack, when extortionate high-load flows flood to individual Mesh Routers (MR), they can no longer provide normal services to innocent flows. An active cache based defense solution can detect the existence of attacking flows based on thefrequency of incoming packets and eliminate the attacking flows by discarding packets by a Drop Probability(DP). As shown in our simulation study, the selection and variance of DP have a significant impact on the performance of the defense solution to both attacking flows and innocent flows. In this paper, a series of DP selection and variance methods are employed in our simulation studies. From them, we can optimize the DP methods and correspondingparameter setting of the solution against Dos attack by the analysis on the simulation results.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115251397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：