• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.683-687
• /
• 2010

In this paper, we propose an anycast routing scheme for large-scale wireless mesh networks, which requires only one-hop local information with no flooding overhead. We develop an analytical model for anycast mesh networks based on an electrostatic theory. A finite difference method contributes to achieving gateway load balancing with constant control overheads. We verify the performance of the proposed scheme by simulations.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.289-296
• /
• 2008

In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.16-23
• /
• 2009

This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3386-3411
• /
• 2019

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.8
• /
• pp.1088-1094
• /
• 2021

This paper proposes a partial BMA (Broadcasting Multiple Access) network structure and D-ARP (Distributed Address Resolution Protocol) method in order to support full mesh routing function in the DAMA (Demand Assigned Multiple Access)-based MF-TDMA (Multi Frequency-Time Division Multiple Access) satellite system. The partial BMA network enables legacy router devices and routing protocols to be adopted in the satellite communication system, and decreases the amount of routing protocol overhead. In addition, we introduce the D-ARP method that help a spoke satellite node acquiring the MAC (Media Access Control) address from remote satellite nodes in none BMA satellite network. The D-ARP method provides the MAC address of remote nodes to each other nodes through the broadcasting-enabled satellite channel. And we lastly evaluate and analysis the network performance of the proposed approach.

• 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.

• 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.