• 한국인터넷방송통신학회논문지
• /
• 제9권6호
• /
• pp.43-48
• /
• 2009

무선 메쉬 네트워크(Wireless mesh networks, WMNs)는 Ad-hoc 네트워크와는 달리 백본망 구조를 가지고 있기 때문에 이동성이 적고, 단말들이나 다른 망들과 다중경로로 통신이 가능하다. 무선 메쉬 네트워크에서는 기존의 ad-hoc 네트워크의 알고리즘을 보완한 ETX, ETT, MIC 등과 같은 라우팅 경로선정 메트릭이 제안되고 있다. 제안된 다양한 라우팅 메트릭에는 최소의 흡수를 고려하는 Hop_count, 링크 품질을 고려하는 ETX(Expected Transmission Count)나 ETT(Expected Transmission Time)와 같은 metric이 존재한다. 하지만 ETX의 경우 전송률을 구할 때 각 방향에서 측정패킷의 조건이 달라 실질적인 전송률을 제공해주지 못한다는 단점이 있다. 본 논문에서는 ETX를 개선하여 hop_count를 반영하고, 실질 전송률을 고려하는 IETC(Improved Expected Transmission with hop count)를 제안하였다. 실험을 통해 제안된 메트릭이 전송율과 경로 선정에 있어서 기존 메트릭보다 나은 결과를 보였다.

• 한국통신학회논문지
• /
• 제34권2A호
• /
• pp.113-123
• /
• 2009

최근에 무선 메쉬 네트워크는 기존의 무선 네트워크의 단점을 해결하기 위한 차세대 네트워크 기술로서 많은 연구가 이루어지고 있다. 특히, mobile WiMAX 기반의 무선 메쉬 네트워크는 여러 가지 측면에서 많은 장점을 가지고 있어 더욱 주목받고 있다. 이 논문에서 우리는 mobile WiMAX 기반의 무선 메쉬 네트워크를 위한 2계층 핸드오버 방안을 제안한다. Mobile WiMAX의 2계층 핸드오버 방안은 무선 메쉬 네트워크의 특성을 고려하지 않기 때문에, mobile WiMAX 기반의 무선 메쉬 네트워크에서 많은 핸드오버 실패를 유발한다. 제안하는 핸드오버 방안은 기존의 핸드오버 방안보다 핸드오버 시에 더 적은 지연시간을 달성하면서 데이터 손실이 발생하지 않는다. 시뮬레이션을 통해서 제안한 핸드오버 방안이 핸드오버 시에 발생할 수 있는 핸드오버 지연 문제와 데이터 손실 문제를 개선할 수 있음을 보였다.

• 대한임베디드공학회논문지
• /
• 제7권5호
• /
• pp.209-217
• /
• 2012

In the present, Wireless Sensor Network(WSN) has been used for the purpose of the military operation with surveillance systems and for collecting useful information from the natural environment. Basically, low-power, easy deployment and low cost are the most important factors to be deployed for WSNs. Lots of researches have been studied to meet those requirements, especially on the node capacity and battery lifetime improvements. Recently, the study of wireless mesh networks applied into the surveillance systems has been proceeded as a solution of easy deployment. In this paper, we proposed large-scale intelligent multi-layer surveillance systems based on QoS assuring Wireless Mesh Networks and implemented them in the real testbed environment. The proposed system explains functions and operations for each subsystem as well as S/W and H/W architectures. Experimental results are shown for the implemented subsystems and the performance is satisfactory for the surveillance system. We can identify the possibility of the implemented multi-layer surveillance system to be used in practice.

• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.61-80
• /
• 2016

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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.384-393
• /
• 2015

This paper proposes an insect behavior-inspired routing algorithm for large-scale wireless mesh networks. The proposed algorithm is adapted from the behavior of an insect called Bombyx mori, a male silkmoth. Its unique behavior is its flying technique to find the source of pheromones. The algorithm consists of two steps: the shortest-path algorithm and the zigzag-path algorithm. First, the shortest-path algorithm is employed to transmit data. After half of the total hops, the zigzag-path algorithm, which is based on the movement of the male B. mori, is applied. In order to adapt the biological behavior to large-scale wireless mesh networks, we use a mesh topology for implementing the algorithm. Simulation results show that the total energy used and the decision time for routing of the proposed algorithm are improved under certain conditions.

• 한국통신학회논문지
• /
• 제35권11B호
• /
• pp.1607-1617
• /
• 2010

본 논문에서는 무선 메쉬 네트워크의 특성에 맞게 수정한 라우팅 프로토콜인 MA-CBRP를 제안한다. MA-CBRP는 애드 혹 네트워크의 여러 계층적 라우팅 프로토콜 중에서도 CBRP 프로토콜 구조를 기반으로 하는 프로토콜이다. MA-CBRP에서, 메쉬 라우터는 CBRP의 Hello 메시지와 유사한 ANN 메시지를 주기적으로 전송한다. ANN 메시지는 메쉬 네트워크 내의 모든 클라이언트가 자신의 캐시에 메쉬 라우터로의 경로를 저장하고 주기적으로 갱신하도록 하며, 오버헤드를 줄이기 위해 CBRP의 Hello 메시지와는 다르게 응답을 요구하지 않는다. 메쉬 클라이언트는 ANN 메시지를 수신한 후에 메쉬 라우터에서 자신까지의 경로가 바뀐 경우에만 메쉬 라우터에게 ANN으로 얻은 경로의 역순으로 JOIN 메시지를 보내어 경로정보를 메쉬 라우터에게 등록하여 경로 관리에 따른 부하를 줄이고 경로를 더 빠르게 찾을 수 있다. 결과적으로, 네트워크에 이동하는 클라이언트의 수에 상관없이 CBRP보다 평균적으로 7%정도 낮은 오버헤드를 보여주며, 경로를 찾는데 걸리는 시간은 거의 동일한 수준을 보여주었다.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.629-639
• /
• 2012

A challenge faced by smart grid systems is providing highly reliable transmissions to better serve different types of electrical applications and improve the energy efficiency of the system. Although wireless networking technologies can provide high-speed and cost-effective solutions, their performance may be impaired by various factors that affect the reliability of smart grid networks. Here, we first suggest the use of IEEE 802.11s-based wireless LAN mesh networks as high-speed wireless backbone networks for smart grid infrastructure to provide high scalability and flexibility while ensuring low installation and management costs. Thereafter, we analyze some vital problems of the IEEE 802.11s default routing protocol (named hybrid wireless mesh protocol; HWMP) from the perspective of transfer reliability, and propose appropriate solutions with a new routing method called HWMP-reliability enhancement to improve the routing reliability of 802.11s-based smart grid mesh networking. A simulation study using ns-3 was conducted to demonstrate the superiority of the proposed schemes.

• 전기전자학회논문지
• /
• 제13권1호
• /
• pp.94-100
• /
• 2009

In recent years, the wireless mesh network (WMN) has been an emerging technology to provide Internet access to fixed and mobile wireless devices. The main goal of this paper is the design and simulation of a new MAC protocol based on the multi-path routing information for wireless mesh networks. The information about multiple paths discovered in the network layer is exploited by the MAC layer in order to forward a frame over the best hop out of multiple hop choices. The performance of our approach is compared with conventional 802.11 MAC through the simulation. The results show that our scheme exhibits a significantly better performance rather than conventional 802.11 MAC protocol in terms of packet overhead, end-to-end throughput and delay.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.