• Title/Summary/Keyword: Wireless Mesh Networks (WMNs)

Search Result 58, Processing Time 0.038 seconds

Improving the Reliability of IEEE 802.11s Based Wireless Mesh Networks for Smart Grid Systems

  • Kim, Jaebeom;Kim, Dabin;Lim, Keun-Woo;Ko, Young-Bae;Lee, Sang-Youm
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.629-639
    • /
    • 2012
  • A challenge faced by smart grid systems is providing highly reliable transmissions to better serve different types of electrical applications and improve the energy efficiency of the system. Although wireless networking technologies can provide high-speed and cost-effective solutions, their performance may be impaired by various factors that affect the reliability of smart grid networks. Here, we first suggest the use of IEEE 802.11s-based wireless LAN mesh networks as high-speed wireless backbone networks for smart grid infrastructure to provide high scalability and flexibility while ensuring low installation and management costs. Thereafter, we analyze some vital problems of the IEEE 802.11s default routing protocol (named hybrid wireless mesh protocol; HWMP) from the perspective of transfer reliability, and propose appropriate solutions with a new routing method called HWMP-reliability enhancement to improve the routing reliability of 802.11s-based smart grid mesh networking. A simulation study using ns-3 was conducted to demonstrate the superiority of the proposed schemes.

An Efficient Load Balancing Scheme for Multi-Gateways in Wireless Mesh Networks

  • Liu, Junping;Chung, Sang-Hwa
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.365-378
    • /
    • 2013
  • In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

A Signal Detection Technique for OFDMA-based Wireless Mesh Networks with Different Time Delays (서로 다른 지연 시간을 갖는 OFDMA 기반의 Wireless Mesh Networks를 위한 신호 검출 기법)

  • Park, Chang-Hwan;Yoo, Hyun-Il;Kim, Yeong-Jun;Kwon, Dong-Seung;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6C
    • /
    • pp.495-505
    • /
    • 2010
  • In this paper, the effect of Near-Far Problem (NFP) among distributed nodes in OFDMA-based Wireless Mesh Networks (WMNs) is analyzed by investigating statistical characteristics of Time Difference of Arrival (TDoA) and Desired-to-Undesired power Ratio (DUR). In order to overcome the effects of Inter-Symbol Interference (ISI), Inter-Carrier Interference (ICI), and Inter Link Interference (ILI), caused by TDoA in WMNs, we derive effective SINR for each subcarrier, and then, propose the optimal starting point of FFT window which can minimize BER for each subcarrier. In addition, we propose a subcarrier-based Zero Forcing - 2 Dimensional Ordered Successive Interference Cancellation (ZF-2DOSIC) technique for signal detection in WMNs with TDoA. It is verified by simulation that the effective SINR and uncoded BER performances of the proposed signal detection technique for OFDMA-based WMNs are significantly improved, compared with those of conventional technique.

Understanding Channel-diversity Oriented Routing Metrics for Multicast in Wireless Mesh Networks

  • Gao, Hui;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.418-420
    • /
    • 2013
  • Issues on design of routing scheme and routing metric for multicast in multi-channel multi-radio (MCMR) wireless mesh networks (WMNs) are discussed. Emphasis is placed on channel-diversity oriented routing metrics. From case study the conclusion to be drawn is that the key for design of channel-diversity oriented routing metrics is how to construct an optimization function to quantify interdependence between channel assignment and multicast routing throughput.

An Optimal Path Routing in Wireless Mesh Network (무선 메쉬 네트워크에서 최적화된 경로선정을 위한 라우팅)

  • Lee, Ae-Young;Roh, II-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.43-48
    • /
    • 2009
  • Wireless mesh networks, unlike Ad-hoc network, has low mobility and multi-path communication between terminals and other networks because it has the backbone structures. Most studies are advanced on finding the optimal routing path in multi-hop wireless mesh network environment. Various routing metric, minimum number of hops(Hop_count) and ETX, ETT metric, are proposed to wireless mesh networks. However, most metrics cannot identify the high throughput routing paths because this metric uses a different measurement parameters in each direction. So actual delivery rate does not provide to this metric. This paper describes the metric and implementation of IETC as a metric. This paper shows the improvement in performance.

  • PDF

A Priority Time Scheduling Method for Avoiding Gateway Bottleneck in Wireless Mesh Networks (무선 메쉬 네트워크에서 게이트웨이 병목 회피를 위한 우선순위 타임 스케줄링 기법)

  • Ryu, Min Woo;Kim, Dae Young;Cha, Si Ho;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.101-107
    • /
    • 2009
  • In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

A Minimum Interference Channel Assignment Algorithm for Performance Improvement of Large-Scale Wireless Mesh Networks (대규모 무선 메쉬 네트워크의 성능 향상을 위한 최소 간섭 채널 할당 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.964-972
    • /
    • 2009
  • Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

A Rate Separating Multi-Channel Protocol for Improving Channel Diversity and Node Connectivity in IEEE 802.11 Mesh Networks (IEEE 802.11 메쉬 네트워크에서 채널 다양성과 노드 연결성 향상을 위한 레이트 분할 멀티 채널 프로토콜)

  • Kim, Sok-Hyong;Suh, Young-Joo;Kwon, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1152-1159
    • /
    • 2010
  • Wireless Mesh Networks (WMNs) provides Internet accesses to users by forming backbone networks via wireless links. A key problem of WMN is network capacity. For this, multi-channel and multi-rate functions of IEEE 802.11 can be utilized. Depending on channel assignments, multi-channel determines node connectivity and channel diversity. Also, in IEEE 802.11 multi-rate networks, the rate anomaly problem occurs, the phenomenon that low-rate links degrades the performance of high-rate links. In this paper, we propose rate separating multi-channel (RSMC) protocols that improves the node connectivity and channel diversity, and mitigates the rate anomaly problem. RSMC increases the channel diversity by forming tree-based WMNs and decreases the rate anomaly by separating different rate links on the tree via channels. In addition, it uses network connectivity (NC) algorithm to increase the node connectivity. Through simulations, we demonstrate that the RSMC shows improved performance than existing multi-channel protocols in terms of aggregate throughput, node connectivity, channel diversity.

A Study on WMNs Based Routing Metrics for High Throughput Multicast

  • Gao, Hui;Kwag, Young-wan;Lee, Hyung-ok;Park, Jun-seok;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.785-788
    • /
    • 2012
  • There has been growing interest in multicast technologies for wireless mesh networks with increasing demand for enjoying seamless multimedia broadcast service such as mobile IPTV anytime anywhere for any content on any device. This paper addressed the factors that should be considered when designing multicast algorithm in WMNs. Several routing metrics which are adapted for WMNs based multicast are described in detail to show that the main design goal for multicast metric is to achieve high throughput. Those metrics that take into account the characteristics of WMNs such as wireless broadcast advantage or channel diversity can arrange load balancing more effectively.

Adaptive Wireless Network Coding for Infrastructure Wireless Mesh Networks

  • Carrillo, Ernesto;Ramos, Victor
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3470-3493
    • /
    • 2019
  • IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.