Earticle

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.

In this paper, the effect of time difference of arrival (TDoA) is investigated for distributed nodes in OFDMA-based wireless mesh networks (WMNs). In order to minimize the interferences caused by TDoA in WMNs, the optimal starting point of FFT window at the receiver side of a node is derived by maximizing the effective SINR for each subcarrier. Also, a signal detection technique, called two dimensional ordered successive interference cancellation (TD-OSIC), is proposed for WMNs with TDoAs. It was shown via simulation that the proposed technique can achieve effective SINR and BER performances similar to the ideal case (no TDoA), even in WMNs with large TDoAs.

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

Wireless Mesh Networks is increasingly being applied widely with explosive traffic demand. This leads to a great challenge for traditional routing protocols in ensuring Quality of Service. We propose a QoS-guaranteed intelligent routing algorithm in this paper for WMN with heavy traffic load using reinforcement learning to improve its performance. We build a reward function for the Q-Learning algorithm to choose a route so that the packet delivery ratio is the highest. Concurrently, the learning rate coefficient is flexibly changed to determine constraints of the end-to-end delay. Our performance evaluations show that the proposed algorithm has significantly improved performance compared with other well-known routing algorithms.

전통적으로 예상 전송 시간 메트릭을 라우팅으로 사용하는 인프라스트럭처 무선 메쉬 네트워크는 모 바일 유저에게 심각한 지연을 발생한다. 캐시를 갖는 메쉬 라우터를 통해 성능 향상을 기대할 수 있지만, 콘 텐츠 인기도, 캐시 비용 및 다운로드 지연을 고려한 캐싱 할당 기법에 대한 연구는 부족하다. 이러한 문제점 을 해결하고자 모바일 유저 수의 증가에 따라 성능을 극대화할 수 있는 최적화 기반 사용자 중심의 캐싱 기 법을 제안한다. 또한 메타 휴리스틱 기법인 유전 알고리즘 (일정 교차/변이)을 적용하여 예상 지연 시간을 줄 이며 캐시 적중률에 만족하는 최적의 모바일 유저 수를 찾는다. 이는 인프라스트럭처 무선 메쉬 네트워크를 운영하는 통신 사업자가 다양한 캐싱 비용, 라우터 속도, 콘텐츠 인기도를 고려한 목표 캐시 적중률을 만족할 뿐만 아니라 성능 향상을 기대할 수 있다.

In infrastructure wireless mesh networks (WMNs), in order to improve mobile users􍾨 satisfaction for the given cache hit ratio, we investigate an User centric Cache Allocation (UCA) scheme while reducing cache cost in a mesh router (MR) and expected transmission time (ETT) for content search in cache. To minimize ETT values of mobile users, a genetic algorithm based UCA (GA-UCA) scheme is provided. The goal is to maximize mobile users􍾨 satisfaction via our well defined utility, which considers content popularity and the number of mobile users. Finally, through solving optimization problem we show the optimal cache can be allocated for UCA and GA-UCA. Besides, a WMN provider can find the optimal number of mobile users for user centric cache allocation in infrastructure WMNs.

산업용 IoT는 비용 효율적이고 넓은 커버리지를 제공하는 무선 메쉬 네트워크에 관심이 많았다. 하지만, 무 선 메쉬 네트워크는 멀티홉 환경의 심각한 성능 절하를 겪는다. 이를 극복하기 위해 메쉬 라우터에 캐시를 장착하는 연구가 많았으나 캐시 파워 소모 모델 연구는 적었다. 최근 캐시 파워 효율 기반 모델은 캐시까지 콘텐츠 전달 파워 를 모두 측정했기 때문에 무선 메쉬 네트워크에서 쓰기에 부적절합니다. 본 논문은 CPU의 동작속도가 캐시 크기에 비례한다는 사실을 이용하여 캐시 적중률 기반 파워 소모 모델을 제안하고, 기존 캐시 파워 효율 기반 소모 모델과 비교하여 정확하게 측정되었다. 제안된 캐시 적중률 기반 파워 소모 모델은 산업용 IoT에서 무선 메쉬 네트워크를 구성할 시 에너지 효율적인 캐시 운용을 위한 참조 모델로 활용되길 기대합니다.

Industrial IoT has much interested in wireless mesh networks (WMNs) due to cost effectiveness and coverage. According to the advance in caching technology, WMNs have been researched to overcome the throughput degradation of multihop environment. However, there is few researches of cache power consumption models for WMNs. In particular, a wired line based cache power consumption model in content-centric networks is not still proper to WMNs. In this paper, we split the amount of cache power from the idle power consumption of CPU, and then the cache hit ratio proportional power consumption model (CHR-model) is proposed. The proposed CHR-model provides more accurate power consumption in WMNs, compared with the conventional cache power efficiency based consumption model (CPE-model). The proposed CHR-model can provide a reference model to improve energy-efficient cache operation for Industrial IoT.

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.

최근 중소기업의 현장에서도 무선 통신 기술을 활발히 활용하고 있는 추세이다. 무선 메쉬 네트워크는 기존의 무선 네트워크의 단점을 해결하기 위한 차세대 네트워크 기술로 많은 연구가 이루어지고 있다. 무선 메쉬 네트워크는 802.11을 사용하므로 메쉬 클라이언트의 이동시 하드 핸드오버가 발생된다. 네트워크에서 핸드오버의 지연시간의 증가는 이동성에 있어 매우 큰 문제가 된다. 따라서 본 논문에서는 핸드오버 지연시간을 줄이기 위해 이전 채널정보를 이용한 PCISS(Previous Channel Information based Selective Scanning)을 제안한다. PCISS 기법은 이동하는 메쉬 클라이언트가 가지고 있던 이전 채널 정보를 기반으로 채널을 검색하여 사용하기 때문에 핸드오버 지연시간의 90%이상을 차지하는 프로브지연(Probe Delay)을 최소화할 수 있다. 제안하는 PCISS 기법은 기존 전체 검색과 선택적 검색에 비해 핸드오버 지연 시간을 감소시켜, 링크계층에서 기존 방식보다 6.5배 빠르게 채널을 검색함을 증명하였다.

Recently Wireless Communication technologies are widely used in Small And Medium Business fields. Wireless mesh networks have been studied as the next generation technology to solve problem of conventional wireless networks. Wireless mesh network uses a 802.11 when make up of network. mesh clients occurs Hard handover moving between ones. This increases the handover latency of the network mobility is a very great issues. Consequently, this paper propose a channel information previously methods to reduce the handover latency selective channels. Proposed scheme accounts for more than 90% of the probe delay to minimize the client had to move the mesh based on the old channel to retrieve information. Through simulation, the proposed scheme had shorter handover delay time than transitional full scan and selective scan. Through results of evaluation, the suggest PCISS scheme more fast 6.5% than transitional scheme.

ITS와 WAVE 등의 도입 및 스마트 폰의 광범위한 보급에 따라 WMN 기술은 IEEE802.11 기반의 AP의 무선접속 범위를 확장시키기 위한 효율적인 기술로서 인정받고 있다. 본 논문에서는 WMN 구현에 있어서 대부분의 메쉬 라우터가 갖고 있는 다중 인터페이스 / 다중 채널 기능을 활용하여 전반적인 통신 속도 및 처리율 향상을 위한 MAC 프로토콜을 제안하고 컴퓨터 시뮬레이션을 통하여 성능을 검증하였다.

Spurred by the advent of ITS and WAVE (Wireless access in vehicular environments) as well as the wide-spread use of smart phones, WMN technology is considered to be a promising technology for extending the Internet access coverage supported by the IEEE802.11 based access points. In this paper, we propose a new MAC protocol which can efficiently utilize the multi-interface multi-channel communication capabilities supposedly equipped in most mesh routers, thereby increasing the network throughput considerably. We also verified its performance through computer simulations.

본 논문에서는 한 도시(원주시)를 대상으로 안정적이면서 높은 경제 절감 효과를 얻을 수 있는 광대역 무선 Smart-city형 네트워크 커버리지를 제안하고자 한다. 이를 위하여 해당 지역에 대한 사전 지리적 조사를 실시하고 환경에 적합한 장비를 선택하여 네트워크 망의 추가 및 복구가 쉬운 무선 메쉬 네트워크망을 설계하였고 시뮬레이션을 통해 기존에 구축되어 있는 네트워크망과 그 성능을 비교, 평가하고 고찰하였다. 본 논문이 추구하는 목표는 연구를 통해 무선 메쉬 네트워크의 경비 절감 효과 및 우수한 성능을 평가 받고 이를 활용하여 그린 IT의 기초가 될 수 있는 미래지향적 도심 통합 네트워크를 제안하는데 있다.

In this paper, broadband wireless smart city network coverage was implemented targeting a city (Wonju) using the wireless mesh network. Through this, we could provide wireless network that can easily add network and be repaired easily and have high economic effect. In order to implement broadband wireless smart city network coverage, wireless mesh network has been designed through pre-survey of the region and appropriate selecting of equipment. In addition, the designed network is examined, evaluated and compared with existing network though simulation. The aim of this paper is to prove high cost saving effect of wireless mesh network and its superior performance and to suggest future oriented integrated network of Green IT though research.

The cluster-based routing protocol (CBRP) is a grouping mechanism that supports unicast and multicast path discovery for low congestion and packet loss in routing mechanisms for multi-hop wireless mesh networks. No simulation analyses or comparisons with other routing protocols have been reported. In this paper, we have evaluated the performance of the CBRP and compared it to AODV and OLSR through software simulations. The scheme indicates several better performance levels in terms of the channel capacity, path discovery, packet delivery ratio, and end-to-end delay, at the sacrifice of routing overhead degradation.

This paper proposes a cooperated mutual authentication scheme for mobile base stations (MBS) that construct a Wireless Mesh Network (WMN) in the Tactical Information Communication Networks (TICN). To enhance the fighting capabilities and survivability of soldiers in battlefields, it is crucial to secure the communication and commands between soldiers and commanders. To achieve this goal, a reliable mutual authentication method is required to approve between MBS and the soldiers in the network. We apply EAP-TLS (Extensible Authentication Protocol – Transport Layer Security) for mutual authentication between mobile base stations that each hold authentication servers [1]. Also, we propose a cooperative authentication scheme that can substitute the authentication process between MBS and ultimately reduce the authentication overhead. We evaluate the proposed scheme using the Qualnet 5.0 simulator to verify the performance of our proposed schemes in Tactical Networks.

커뮤니티 네트워크는 이기종(heterogeneous) 노드들이 시간과 장소에 구애받지 않고 정보를 공유할 수 있는 통신 환경을 말한다. 이를 위해 이동 노드들은 사전에 구성된 통신 인프라 시설에 의존하지 않고 자가 구성될 수 있어야 하고 노드의 이동성으로 인해 변경되는 네트워크 토폴로지에 적응할 수 있어야 한다. 준-인프라 기반 무선 애드-혹 네트워크는 이러한 요구사항을 지원하기에 적합한 통신 기술이다. 본 논문에서는 준-인프라기반 애드-혹 네트워크 프로토콜의 실험에 용이한 평가 도구인 VTC(virtual topology coordinator) 시스템을 제안한다. VTC는 모든 통신장비 간 단일 홉 통신만이 가능한 작은 공간에서도 선택적 MAC(Medium Access Control) 프레임 수신 메커니즘을 이용하여 다중 홉 네트워크 토폴로지를 가상으로 구성하도록 해준다. VTC 시스템은 실제의 무선 특성을 모두 반영하기는 어려우나 시뮬레이션을 통한 검증보다는 실 특성을 보다 다양하게 반영시킬 수 있다.

Community network is a communication environment where heterogeneous devices can access and communicate with each other at any time and at any space to share information. To do so, mobile devices are required to be self-configured even in absence of communication infrastructures. Semi-infrastructured wireless ad-hoc network is a promising solution to meet with such a requirement. This paper proposes the VTC(virtual topology coordinator) system as an evaluation tool for examining network protocols that are intended to be deployed in the semi-infrastructured ad-hoc networks. VTC emulates multi-hops wireless network topology virtually using a mechanism of selective receiving MAC frame in a small area, where only a single hop communication is available. VTC system cannot consider all properties introduced in real wireless network, but do more wireless properties than verification through simulation.

In this paper, we obtain the optimal number of interfaces/channels in wireless mesh networks by simulation. The simulation study is done in static multi-channel multi-interface environment. When many nodes use a single interface/channel, collisions of RTS/CTS result in network performance degradation. To avoid such degradation and reduce interference among adjacent nodes, use of multi-interface/channel is considered. 802.11a and 802.11b offer 12 and 3 orthogonal channels and multi-interface/channel scheme could be applied. But rare research about the optimal number of interfaces/channels has been studied. In this paper, simulation study for the optimal number of interfaces/channels in wireless mesh network is performed.

Wireless mesh networks (WMNs) are wireless networks that are composed of mesh routers and mesh clients. Mesh routers have minimal mobility and form the backbone of WMNs. IEEE 802.11s-based WMNs have a default routing protocol, namely, a hybrid wireless mesh protocol (HWMP). In tree-based proactive mode, HWMP is completely centralized and constrained by the root node, which causes a bottleneck at the root node. In reactive mode, HWMP always initiates path discovery message broadcasting, which uses unnecessary power resources. In this paper, we propose a new routing protocol for WMNs based on HWMP. This protocol, which we refer to as the decentralized hybrid wireless mesh protocol (DHWMP), provides a different root for different transmissions. We also perform simulations to compare the performance of the proposed scheme with existing routing protocols, including HWMP, ad hoc on-demand distance vector (AODV) routing, and optimized link state routing (OLSR).

Wireless Mesh Networks (WMNs) are have secured a significant position in the technological world due to their unique characteristics. These networks are dynamic, self-healing, and self-organizing in which the nodes reflexively set-up and maintain mesh connectivity with each other. Having these characteristics, WMNs enjoy great benefits such as low-upfront costs, reliability, and prompt troubleshooting. Despite all these fringe benefits, one of the greatest challenges in wireless mesh networks is that they are exposed to a number of hazardous security vulnerabilities. In this paper we investigate WMNs security attacks, security goals and various defense mechanisms for defending the attacks.

Wireless mesh networks (WMNs) have been proposed for realizing their goals, such as throughput and full connectivity, in wireless networks. The interference between nodes in WMNs is a critical limiting factor. Understanding of interference needs to develop novel approaches, such as channel re-assignment, route selection, and fair scheduling. Actually, throughput of WMNs has degraded when reassigning channels due to the intra and inters interference. In this paper, we study the extent problem of interference, which spreads the trials of channel re-assignment toward neighbor mesh routers. In particular, the extent of interference causes additional throughput degradation when compared to a pair-wise interference to a small fraction of the links. This implies that the pair-wise interference measurements may be optimistic when used to drive protocols in wireless mesh networks. We newly define an analytical model, which is referred to as a ripple effect problem. The defined model is a formal model of interference to estimate the maximum rate at which flows can safely send traffic without overloading network. The proposed model can exemplify how protocols should take the extent of interference into account. The simulation results show that the proposed model can exactly evaluate the attempts of channel re-assignment occurred from mesh networks.

Wireless mesh networks (WMNs) are wireless access networks based on IP technologies, which combine the advantages of WLANs and ad hoc networks and have thus become broadband access networks with high capacity, high speed and wide coverage. Due to the multi-hop characteristics of WMNs, security has become a critical issue in WMNs and a simple and effective distributed key management is essential for the development of secure WMNs. In this paper, we propose a distributed key management scheme in WMNs by combing several key technologies, such as ECC, (t, n) threshold cryptography, verifiable secret sharing, etc. Based on a zone-based hierarchical model, our proposed key management scheme is comprised of two parts: group key management in the backbone network and session key establishment in the zone networks. We also show the security and the effectiveness of the proposed scheme through analysis and simulations.

Combining the advantages of WLANs and ad hoc networks, wireless mesh networks (WMNs) are wireless access networks based on IP technologies and have become effective broadband access networks with high capacity, high speed and wide coverage. Security is a crucial and urgent problem in WMNs as in other types of networks and a simple and effective distributed key management is essential for the establishment of secure WMNs. In this paper, we present an effective distributed key management scheme based on several technologies, such as ad hoc network model, ECC, (t, n) threshold cryptographic method, verifiable secret sharing and so on, and demonstrate its effectiveness through analysis and experiment.