• 한국통신학회논문지
• /
• 제39A권8호
• /
• pp.488-490
• /
• 2014

본 논문은 OFDMA 기반 무선 메쉬 네트워크에서 플로킹 기법을 활용한 분산 시간 및 주파수 동기화 알고리듬을 다룬다. 채널전송 지연의 영향을 고려하지 않는 기존 플로킹 기법과 달리, 본 논문에서는 실제 무선 메쉬 네트워크 환경을 고려하기 위하여 시간 및 주파수 동기를 맞추기 위한 동기화 파라미터를 설정하고, 제안된 시간 및 주파수 동기화 모델의 수렴조건과 동기화 파라미터 설정범위를 분석 도출한다. 그리고 모의실험을 통하여 동기화 파라미터에 설정에 따른 제안된 기법의 시간 및 주파수 동기화의 수렴성능을 검증한다.

• Current Optics and Photonics
• /
• 제1권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.

• 대한전자공학회논문지TC
• /
• 제44권5호
• /
• pp.54-62
• /
• 2007

본 논문에서는 무선 메쉬 네트워크에서 사용자의 편의를 위하여 패스워드에 기반한 방식의 인증 프로토콜을 제안한다. 제안하는 프로토콜의 성능 분석을 위해서 GNY Logic 분석, Security 분석, 전송지연시간 분석을 하였다. 우선 GNY logic 분석을 통하여 프로토콜의 신뢰성을 증명하였으며, 다양한 공격에 대한 Security 분석을 통하여 인증 프로토콜이 여러 가지 공격에 대하여 강한 면모를 가지고 있는 것을 보였다. 또한 전송지연시간 분석으로 제안하는 인증 프로토콜이 무선 메쉬 네트워크 내에서 데이터 전송 지연에 큰 영향을 미치지 않음을 증명하기 위해 Linux 시스템에서 구현하여 전송지연시간을 측정하였다. 이러한 세 가지 분석 결과 제안하는 인증 프로토콜은 무선 메쉬 네트워크의 성능에 큰 영향을 미치지 않으면서도 안전한 무선 메쉬 네트워크 환경을 제공한다는 것을 보였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권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)
• /
• 제13권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.

• 한국통신학회논문지
• /
• 제37B권11호
• /
• pp.1014-1021
• /
• 2012

본 논문에서는 네트워크 코딩을 IEEE 802.11s기반 무선 메쉬 네트워크에 적용을 위한 고려사항에 대하여 분석해 본다. 네트워크 코딩을 무선 네트워크에 적용하기 위한 동작과정을 살펴보고, 이론적인 네트워크 코딩의 이득을 감소시킬 수 있는 중요 요소를 제시한다. 네트워크 성능 평가를 통하여, 네트워크 코딩은 네트워크 처리량 같은 네트워크 성능을 향상할 수는 있지만 전력 소모량 측면에서는 오히려 더 안 좋은 성능이 나타나는 것을 살펴볼 수 있었다. 또한 네트워크 코딩이 적용되기 부적절한 환경에서는 네트워크 코딩 성능이 크게 저하되는 것을 살펴 볼 수 있었다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• 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.

• 한국멀티미디어학회논문지
• /
• 제10권4호
• /
• pp.516-526
• /
• 2007

무선 메쉬 네트워크는 WLAN 기술뿐만 아니라, 센서 네트워크와의 연동을 통해 다양한 분야에 응용할 수 있으며, 유비쿼터스 네트워크 구현을 위한 핵심기술이라 할 수 있다. 그러나 WLAN은 ISM 대역을 전송 주파수 대역으로 사용하기 때문에, 최대 전력이 100mW로 제한된다. 최대 전력이 제한된 상황에서 WLAN기반의 메쉬 네트워크가 비용 효율적인 백본망의 역할을 수행하기 위해서는 장거리 전송을 위한 연구가 필수적이다. 따라서 본 논문에서는 실험 결과를 통해 무선 메쉬 네트워크 단점인 도달거리의 한계를 극복할 수 있는 방안을 제시하였으며 그 효과성을 보였다. 제안한 방법은 다양한 안테나의 적용 및 디바이스 드라이버의 함수 정의와 구현으로 장거리 전송과 전력효율을 높일 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• 제어로봇시스템학회논문지
• /
• 제22권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.