• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.8
• /
• pp.488-490
• /
• 2014

This paper deals with distributed time and frequency synchronization algorithms using the flocking technique for OFDMA-based wireless mesh networks. We propose a time and frequency synchronization model taking into account channel propagation delays existing in wireless mesh networks, and analyze the convergence condition of the proposed synchronization algorithm. Convergence performance of the proposed synchronization algorithm is analyzed via computer simulation in terms of synchronization parameters in the time and frequency synchronization model.

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.325-335
• /
• 2017

Hybrid radio frequency/free space optical (RF/FSO) wireless mesh networks have attracted increasing attention for they can overcome the limitations of RF and FSO communications and significantly increase the throughput of wireless mesh networks (WMNs). In this article, a resource assignment optimization scheme is proposed for hybrid RF/FSO wireless mesh networks. The optimization framework is proposed for the objective of maximizing throughput of overall hybrid networks through joint transmission slot assignment, FSO links allocation and power control with the consideration of the fading nature of RF and FSO links. The scheme is formulated as an instance of mixed integer linear program (MILP) and the optimal solutions are provided using CPLEX and Gurobi optimizers. How to choose the appropriate optimizer is discussed by comparing their performance. Numerous simulations are done to demonstrate that the performance of our optimization scheme is much better than the current case of having the same topology.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.54-62
• /
• 2007

We propose a novel authentication protocol for wireless mesh network. The proposed authentication protocol is based on the password scheme for convenience of users. The proposed protocol is evaluated through three analyses. The correctness of the proposed protocol is proved using the GNY analysis. By the security analysis, we show that the proposed protocol is resistant to various attacks. For the performance analysis, we implemented the protocol in Linux operating system based laptop and measured the transmission time. The analytic results show that the proposed protocol provides the secure wireless mesh network without considerable performance degradation.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.160-167
• /
• 2013

Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.1014-1021
• /
• 2012

In this paper, we analyze practical factors to apply the network coding (NC) in the IEEE 802.11s wireless mesh networks. First, we introduce the procedure of the NC in the wireless network. And then we suggest important factors that can cause lower NC gain than theoretical gain. Simulation results show that the NC in wireless networks can reduce the network load but it can cause increased power consumption of wireless nodes. Furthermore, the NC gain can be considerably reduced under the inappropriate network conditions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.525-528
• /
• 2008

We propose a IDS node selection scheme for intrusion detection in wireless mesh networks. The proposed scheme considers network survivability and energy consumption. To utilize wireless resources efficiently, we apply a set covering problem (SCP) to IDS nodes selection problem. Our proposed scheme also considers congested networks.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.516-526
• /
• 2007

Wireless mesh network is not only WLAN technology but it says core technology for implementation of ubiquitous network and we have to application on a various field through connection with the sensor network. However, there are limited to 100mW in the maximum power because WLAN is used into transmission frequency band to ISM band. The mesh network based on WLAN is essential study for a long distance transmission in the limited maximum power that it is doing to cost-efficient network of backbone. Therefore, in this paper, we have presented an conquerable method to limitation of reaching distance of wireless mesh network and made several experiments to presentation the proposed method. The results show that it is possible to rise a long distance transmission and power efficiency into application of various antenna and function definition and implementation of device driver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.629-648
• /
• 2012

Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.