• Title/Summary/Keyword: Wireless Mesh

Search Result 330, Processing Time 0.023 seconds

An Improved Hierarchical Routing Protocol for Wireless Hybrid Mesh Network (무선 하이브리드 메쉬 네트워크를 위한 개선된 계층구조 라우팅 프로토콜)

  • Ki, Sang-Youl;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.9-17
    • /
    • 2010
  • In this paper we propose an improved hierarchical routing protocol for wireless hybrid mesh network. The proposed method efficiently manages network topology and reduces overhead traffic for setting routing path by considering link stability. The simulation results show that the proposed method outperforms the HOLSR (hierarchical optimized link state routing) method in aggregate goodput, packet delivery ratio, and end-to-end delay.

Effects of Forwarders on TCP Performance in Network Coding for Wireless Mesh Networks (무선 메쉬 네트워크의 네트워크 코딩에서 패킷 전달자들이 TCP 성능에 미치는 영향)

  • Lim, Chan-Sook;Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.39-45
    • /
    • 2010
  • Most traffic in the real internet is TCP traffic. Therefore newly proposed network coding schemes must consider their effects on TCP performance. However, in most studies on network coding, performance evaluation has been conducted using other types of traffic than TCP traffic because network coding has effects on the pattern of packet transmission, which again can impact TCP performance. In most packet transmission schemes based on network coding for wireless mesh networks, it is determined which node, among the ones that received a broadcasted packet, should encode and forward it. In this paper, we examine how the forwarder nodes impact TCP performance.

Cluster-based Minimum Interference Channel Assignment for Multi-Radio Multi-Channel Wireless Mesh Networks (멀티 라디오 멀티 채널 무선 메쉬 네트워크를 위한 클러스터 기반 최소 간섭 채널 할당)

  • Cha, Si Ho;Ryu, Min Woo;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.103-109
    • /
    • 2010
  • Total performance is improved by minimizing the channel interference between links in wireless mesh networks (WMNs). The paper refines on the CB-CA [1] to be suitable for multi-radio multi-channel (MRMC) WMNs. The CB-CA is the cluster-based channel assignment algorithm for one radio three channel WMN based on IEEE 802.11b/g. The CB-CA does not perform the channel scanning and the channel switching between the cluster heads (CHs) and the edge gateway nodes (EGs). However, the use of co-channel for links between CHs and EGs brings the problem of channel interference among many nodes. We propose and evaluate an improved CB-CA algorithm to solve this problem in MRMC WMNs. The proposed algorithm discriminates between transmission channel and receive channel and assigns channels to each interface randomly and advertises this information to neighbor clusters in order to be assigned no-interference channel between clusters. Therefore, the proposed algorithm can minimize the interference between clusters and also improve QoS, since it can use multiple interfaces and multiple channels.

A Study of Distributed Channel Assignment Algorithm Based on Traffic-Awareness in the Wireless Mesh Network (무선 메쉬 네트워크 환경에서 트래픽 가중치에 따른 분산 채널 할당 알고리즘에 관한 연구)

  • Kim, Jae-Wan;Yoon, Jun-Yong;Yang, Chang-Mo;Lee, Seung-Beom;Eom, Doo-Seop
    • Journal of Information Technology Services
    • /
    • v.11 no.2
    • /
    • pp.291-306
    • /
    • 2012
  • Recently, Wireless Mesh Network (WMN) technology recently has been used in various industries. Especially, a number of multi-channel assignment schemes have been presented to improve the throughput of IEEE 802.11-based multi-hop WMN. However, performance of the conventional multi-channel assignment schemes is not enough to satisfy the industry requirements. We, thus, should study more about the multi-channel assignment scheme in order to enhance the performance. This paper proposes a novel channel assignment scheme that employs Multi-channel and Multi-Interface in the WMN. The proposed scheme can obtain the traffic information of the network and the efficient channel assignment result without any message exchanges. We verify the efficiency of the proposed scheme through the mathematical modeling and the real-world experiments. The results show that the proposed scheme improves the throughput of the network compared with the conventional schemes.

A Cluster Based Multi-channel Assignment Scheme for Adaptive Tactical Wireless Mesh Network (무선 메쉬 네트워크의 군 환경 적용을 위한 클러스터 기반 멀티채널 할당 기법)

  • Kim, Young-An
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.880-887
    • /
    • 2011
  • The Wireless Mesh Network(WMN) technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield. Therefore, WMN is frequently used to satisfy needs for internet connection and active studies and research on them are in progress. However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment. Such phenomenon might cause an issue in fairness index. In order to resolve this issue, we proposed a Cluster Based Multi-channel Assignment Scheme(CB-MAS) for adaptive tactical wireless mesh network. In the CB-MAS, the communication between the Cluster-Head(CH) and cluster number nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-MAS can minimize the interference within multi-channel environments. Our Simulation results showed that CB-MAS achieves improved the throughput and fairness index in WMN.

Rate-User-Perceived-Quality Aware Replication Strategy for Video Streaming over Wireless Mesh Networks

  • Du, Xu;Vo, Nguyen-Son;Cheng, Wenqing;Duong, Trung Q.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2103-2120
    • /
    • 2011
  • In this research, we consider the replication strategy for the applications of video streaming in wireless mesh networks (WMNs). In particular, we propose a closed-form of optimal replication densities for a set of frames of a video streaming by exploiting not only the skewed access probability of each frame but also the skewed loss probability and skewed encoding rate-distortion information. The simulation results demonstrate that our method improves the replication performance in terms of user-perceived quality (UPQ) which includes: 1) minimum average maximum reconstructed distortion for high peak signal-to-noise ratio (PSNR), 2) small reconstructed distortion fluctuation among frames for smooth playback, and 3) reasonable average maximum transmission distance for continuous playback. Furthermore, the proposed strategy consumes smaller storage capacity compared to other existing optimal replication strategies. More importantly, the effect of encoding rate is carefully investigated to show that high encoding rate does not always gain high performance of replication for video streaming.

Hybrid FPMS: A New Fairness Protocol Management Scheme for Community Wireless Mesh Networks

  • Widanapathirana, Chathuranga H.;Sekercioglu, Y. Ahmet;Goi, Bok-Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1909-1928
    • /
    • 2011
  • Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encourage node participation in forwarding packets. In general, these protocols can be split into two groups: Incentive-based ones, which are managed centrally, and use credit allocation schemes. In contrast, reputation-based protocols that are decentralized, and rely on information exchange among neighboring nodes. Centrally managed protocols inevitably suffer from scalability problems. The decentralized, reputation-based protocols lacks in detection capability, suffer from false detections and error propagation compared to the centralized, incentive-based protocols. In this study, we present a new fairness protocol management scheme, called Hybrid FPMS that captures the superior detection capability of incentive-based fairness protocols without the scalability problems inherently expected from a centralized management scheme as a network's size and density grows. Simulation results show that Hybrid FPMS is more efficient than the current centralized approach and significantly reduces the network delays and overhead.

CANCAR - Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

  • Pertovt, Erik;Alic, Kemal;Svigelj, Ales;Mohorcic, Mihael
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4205-4227
    • /
    • 2018
  • Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

An Efficient On-Demand Routing Approach with Directional Flooding for Wireless Mesh Networks

  • Kum, Dong-Won;Le, Anh-Ngoc;Cho, You-Ze;Toh, Chai Keong;Lee, In-Soo
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.67-73
    • /
    • 2010
  • Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

Traffic Flow Estimation based Channel Assignment for Wireless Mesh Networks

  • Pak, Woo-Guil;Bahk, Sae-Woong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.68-82
    • /
    • 2011
  • Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.