• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.304-310
• /
• 2008

In a wireless mesh network, there are two types of nodes: mesh routers and mesh clients. These two contradistinct network entities will be characterized and modeled depending on their role in the network. Mesh routers are essentially not mobile unlike the mesh clients. The differences on these nodes should be noted in any protocol design. In this paper, we present a mobility management for wireless mesh network (WMN). This mobility management handles movement of wireless mesh clients as it leaves from a coverage area of a wireless mesh router to another. We consider signaling overhead and mobility as performance metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.89-94
• /
• 2009

In wireless mesh network, nodes are communicates as like as Ad-Hoc. Nodes of Wireless Mesh Network must have a good QoS and a algorithm for good path. ETX, ETT and WCETT are proposed Wireless Mesh Network routing methods. But these have Interference problem. This paper propose ETI(Expected Transmission Interference) based on ETT for good path selection. This paper show the algorithm and improved performance in simulation than other algorithms.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2787-2794
• /
• 2011

A mesh node, a component of a mesh network, is connected with the network by dynamic routing using routing protocol and collects the information of adjacent or connected mesh nodes for its self-management and settings. Also, it relays packets between the mesh nodes and provides AP(Access Point) with its corresponding functions based on IEEE 802.11 a/b/g for clients' access to the network. In this paper, the study focused on the design and performance tests of Wireless Mesh Network(WMN) which is applied to the wireless communication network for the CBTC(Communications Based Train Control) system. The WMN was established on a K-AGT test-line (Kyeongsan city, Gyeongsangbuk-do), and to verify the applicability, its operation and performances are checked by measuring the data throughput, delay latency, quality measurements such as transmission loss, radio interference and path recovery and setup between the on-board and wayside.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.875-887
• /
• 2010

The workgroup of IEEE 802 proposed the IEEE 802.16 standard, also known as WiMAX, to provide broadband wireless access (BWA). The standard specifies two operational modes, one is popular PMP mode, and the other is optional mesh mode. In the mesh mode, the network entry process-NetEntry is the pivotal procedure for mesh network topology formulation and thus, influences the accessibility of whole mesh network. Unfortunately, the NetEntry process suffers from the hidden neighbor problem, in which new neighborship emerges after a new node comes in and results in possible collisions. In this paper, we propose a new SN-protected NetEntry process to address the problem. Simulation results show that the new proposed NetEntry process is more stable compared with the standard-based NetEntry process.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.417-424
• /
• 2007

Mesh networks using WLAN technology have been paid attention as a key wireless access technology. However, many technical issues still exist for its successful deployment. One of those issues is the routing problem that addresses the path setup through a WLAN mesh network for the data exchanges between a station and a wired network. Since the characteristics of a WLAN mesh network can be very dynamic, the use of single routing protocol would not fit for all environments whether it is reactive or proactive. Therefore, it is required to develop an adaptive routing protocol that modifies itself according to the changes in the network parameters. As a logical first step for the development, an analytical model considering all the dynamic features of a WLAN mesh network is required to evaluate the performance of a reactive and a proactive routing scheme. In this paper, we propose an analytical model that makes us scrutinize the impact of the network and station parameters on the performance of each routing protocol. Our model includes the size of a mesh network, the density of stations, mobility of stations. and the duration of network topology change. We applied our model to the AODV that is a representative reactive routing protocol and DSDV that is a representative proactive routing protocol to analyze the tradeoff between AODV and DSDV in dynamic network environments. Our model is expected to help developing an adaptive routing protocol for a WLAN mesh network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.454-456
• /
• 2005

본 논문은 Wireless Mesh Network를 위한 새로운 MAC 프로토콜의 설계에 관해 기술한다. Mesh Network는 Mesh Router에 의해 무선 인프라를 구성한다. WMN(Wireless Mesh Network)는 고정된 상태의 Mesh Router에 의한 인프라를 구성하고 인터넷과 같은 기존의 인프라와 연결되는 구조적 특징을 가진다. 또한 다양한 응용분야의 지원을 위한 QoS(Quality of Service)가 요구되어지기 때문에 end-to-end 전송 지연, 공정성, 그리고 데이터 손실 등 많은 사항을 고려한 프로토콜의 설계가 요구된다. 본 논문에서는 WMN의 이러한 특징을 지원하기 위한 토폴로지의 제안과 TDMA를 활용한 MAC 프로토콜을 설계하였으며, NS-2 시뮬레이션을 통해 성능을 측정하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.778-785
• /
• 2020

Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.117-126
• /
• 2009

Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, etc., This paper presents a secure and efficient authentication mechanism for Wireless mesh network. The validity of proposed mechanism is provided by BAN logic and the efficiency of suggested mechanism is showed through the performance evaluation.

• Journal of Advanced Navigation Technology
• /
• v.19 no.1
• /
• pp.53-59
• /
• 2015

We consider the problems that consist of designing time, establishment cost, delay time and reliability in designing a mesh network when given link costs and traffic requirements between nodes. Designing time, establishment cost and delay time are less, reliability is higher in designing a mesh network. One of the problems designing time is solved by mesh network topology optimization and routing (MENTOR) algorithm that Aaron Kershenbaum propose, but the others remain. In this paper we propose a new mesh network design algorithm with small computational complexity that the others are solved. The result of the proposed algorithm is better than MENTOR's in total establishment cost, delay time and reliability.