• Title/Summary/Keyword: Wireless Mesh Networks

Search Result 233, Processing Time 0.031 seconds

Multi-interface Wireless Mesh Network Testbed using Wireless Distribution System (무선 분산 시스템을 이용한 멀티 인터페이스 무선 메쉬 네트워크 테스트베드)

  • Yoon, Mi-Kyung;Yang, Seung-Chur;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1077-1082
    • /
    • 2009
  • Wireless Mesh Network(WMN) is wireless backbone networks technique which has ease of network configuration and cost of advantage. Recently, WNM released a new product, but most of existing research and technology analysis the performance through the simulation. This paper build the wireless mesh network testbed for actual situation. Testbed supports multi-channel multi-interface using bridge, the Wireless Distribution System and dynamic location-based routing protocol. This routing protocol strongly design against wireless interference using metric for link channel change and real distance. Then, the address of mesh clients assigned by the centralized address management server. Mesh clients is designed and implemented to manage network through Simple Network Management Protocol.

Performance Improvement of Wireless Mesh Networks using TCP Congestion Control Algorithm (TCP 혼잡제어 알고리즘을 이용한 무선 메쉬 네트워크의 성능 개선)

  • Lee, Hye-Rim;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.2
    • /
    • pp.253-259
    • /
    • 2010
  • Wireless mesh network is flexible network like Ad hoc network or bluetooth together based on base station. But, wireless mesh network shows high packet loss and when TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. It is existent problem of TCP congestion control algorithm that TCP unfairness and congestion collapse over wireless mesh network. When TCP operation occurs with the packet loss where is not the congestion loss, it brings the performance degradation which is serious. In this paper, in order to improve efficient TCP congestion control algorithm in wireless mesh network, we proposed that TCP can adaptively regulate the congestion window in wireless link.

The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming (제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링)

  • Kim, Hak-Jin
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.2
    • /
    • pp.61-80
    • /
    • 2016
  • The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

A Design of Wireless Mesh Networks based middleware (Wireless Mesh Networks 기반 미들웨어 설계)

  • Im, Hyeok-Jin;Kang, Hyun-Joong;Ju, Hui-Dong;Lee, Myeong-Hun;Yoe, Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.453-456
    • /
    • 2007
  • In this paper, we describes a design of Wireless Mesh Network based middleware that applied into USN(Ubiquitous Sensor Networks). WMN based middleware is a technique which links data between widely distributed sensor devices and WMN for context-awareness. The use of WMN base middleware in this paper makes possible communication on insufficiently network constructed area by use of WMN. WMN based middleware also anaylze events comprehensively that originated from specific sensor device. Based on the result from analyzed data with predetermined value WMN based middleware will given an order to designated actuator devices. Middleware operate each function of sensor network management and application service separately.

  • PDF

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.

A Distributed Frequency Synchronization Technique for OFDMA-Based Mesh Networks Using Bio-Inspired Algorithm (Bio-inspired 알고리즘을 이용한 OFDMA 기반 메쉬 네트워크의 분산 주파수 동기화 기법)

  • Yoo, Hyun-Jong;Lee, Mi-Na;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.11
    • /
    • pp.1022-1032
    • /
    • 2012
  • In OFDMA-based wireless mesh networks, synchronization of carrier frequencies among adjacent nodes is known to be difficult. In this paper, a distributed synchronization technique is proposed to solve the synchronization problem in OFDMA-based wireless mesh networks by using the bio-inspired algorithm. In the proposed approach, carrier frequencies of all nodes in a mesh network are converged into one frequency by locally synchronizing the frequencies of adjacent nodes. It may take a long time to be converged in some topologies since the convergence characteristic of carrier frequencies in a mesh network may vary depending on the size of the network and deployment of nodes. It is shown that fast frequency synchronization, not heavily depending on the topology, can be achieved through the proposed algorithm with an adjustable weight.

An Efficient Code Assignment Algorithm in Wireless Mesh Networks (무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구)

  • Yeo, Jae-Hyun
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.1
    • /
    • pp.261-270
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

  • PDF

Dual Coalescent Energy-Efficient Algorithm for Wireless Mesh Networks

  • Que, Ma. Victoria;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.6
    • /
    • pp.760-769
    • /
    • 2007
  • In this paper, we consider a group mobility model to formulate a clustering mechanism called Dual Coalescent Energy-Efficient Algorithm (DCEE) which is scalable, distributed and energy-efficient for wireless mesh network. The differences of the network nodes will be distinguished to exploit heterogeneity of the network. Furthermore, a topology control, that is, adjusting the transmission range to further reduce power consumption will be integrated with the cluster formation to improve network lifetime and connectivity. Along with network lifetime and power consumption, clusterhead changes will be measured as a performance metric to evaluate the. effectiveness and robustness of the algorithm.

  • PDF

A Distributed Web-Topology for the Wireless Mesh Network with Directional Antennas

  • Ranjitkar, Arun;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.191-210
    • /
    • 2011
  • Topology management, which includes neighbor discovery, tracking and updating, is a key area that need to be dealt with appropriately to increase network performance. The use of directional antenna in Wireless Mesh Networks is beneficial in constructing backbone networks viewing the properties of directional antenna. The backbone links must be robust to obtain better network performance. In this paper, a simple yet effective topology protocol is presented that performs well compared to its predecessors. Our protocol constructs the topology with the constraints in the number of links per node. The full topology is constructed in two phases. The resultant topology is termed as Web-topology. The topology formed is robust, efficient, and scalable.

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.