• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.103-110
• /
• 2009

We propose a novel routing protocol selection scheme based on the application feature in wireless mesh network. Each application has its own feature such as its packet size. For example, text messenger generates short size packets and file transfer application generates long size packets. Routing protocols in wireless mesh network discover the route with different features. Some find shortest hop routes; others find the routes consisting of high bandwidth though they have more hops. The proposed scheme selects the routing protocol by matching the feature of routing protocol and that of application. This paper shows the system that we have developed for supporting mesh routing as well as the proposed scheme and experimental results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.51-58
• /
• 2010

Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost. However, there is a bottleneck problem in wireless mesh network since the traffic is aggregated into a gateway. Placement of multi-radio can easy the bottleneck problem, but without careful design it results in unnecessary system cost increasement. In this paper, we propose a system cost minimization through differential antenna placement where optimum antenna placement is determined by the required wireless link capacity. With CPLEX program, optimum number of antennae is determined as a function of local user traffic and gateway capacity. From numerical analysis, it is confirmed that our proposed model can solve bottleneck problem, and at the same time save the system cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.455-463
• /
• 2004

In this paper, we deal with a ring-mesh network design problem arising from the deployment of WDM for the optical internet. The ring-mesh network consists of ring topology and full mesh topology for satisfying traffic demand while minimizing the cost of OAOMs and OXCs. The problem seeks to find an optimal clustering of traffic demands in the network such that the total number of node assignments is minimized, while satisfying ring capacity and node cardinality constraints. We formulate the problem as a mixed-integer programming model and prescribe a tabu search heuristic procedure Promising computational results within 3% optimality gap are obtained using the proposed method.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.41-51
• /
• 2016

Smart metering systems have become widespread around the world. RF mesh communication systems have contributed to the creation of smarter and more reliable power systems. This paper presents an algorithm for positioning GPRS concentrators to attain delay constraints for a ZigBee-based mesh network. The proposed algorithm determines the number and placement of concentrators using integer linear programming and a queueing model for the given mesh network. The solutions given by the proposed algorithm are validated by verifying the communication network performance through simulations.

• Journal of Information Technology Services
• /
• v.11 no.2
• /
• pp.291-306
• /
• 2012

Recently, Wireless Mesh Network (WMN) technology recently has been used in various industries. Especially, a number of multi-channel assignment schemes have been presented to improve the throughput of IEEE 802.11-based multi-hop WMN. However, performance of the conventional multi-channel assignment schemes is not enough to satisfy the industry requirements. We, thus, should study more about the multi-channel assignment scheme in order to enhance the performance. This paper proposes a novel channel assignment scheme that employs Multi-channel and Multi-Interface in the WMN. The proposed scheme can obtain the traffic information of the network and the efficient channel assignment result without any message exchanges. We verify the efficiency of the proposed scheme through the mathematical modeling and the real-world experiments. The results show that the proposed scheme improves the throughput of the network compared with the conventional schemes.

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

In OFDMA-based wireless mesh networks, synchronization of carrier frequencies among adjacent nodes is known to be difficult. In this paper, a distributed synchronization technique is proposed to solve the synchronization problem in OFDMA-based wireless mesh networks by using the bio-inspired algorithm. In the proposed approach, carrier frequencies of all nodes in a mesh network are converged into one frequency by locally synchronizing the frequencies of adjacent nodes. It may take a long time to be converged in some topologies since the convergence characteristic of carrier frequencies in a mesh network may vary depending on the size of the network and deployment of nodes. It is shown that fast frequency synchronization, not heavily depending on the topology, can be achieved through the proposed algorithm with an adjustable weight.

• The Journal of Engineering Geology
• /
• v.26 no.3
• /
• pp.325-330
• /
• 2016

The second phase of low- and intermediate-level waste (LILW) disposal facility is under planned on the sedimentary rock in unsaturated zone. In this study, we created two meshes which were a matrix continuum mesh and a fracture continuum mesh to carry out 2 dimensional numerical modeling for groundwater flow in the unsaturated zone containing fractures focused on the second phase of LILW disposal facility. Two continuum meshes were developed using MINC in meshmaker module of TOUGH2 code. A fracture continuum mesh was included the k-field distribution of the permeability derived from the Discrete Fractured Network (DFN) modeling. To apply the unsaturated zone for the modeling, the gridding steps to generate mesh were developed. Each step to generate a mesh consisted of definition of materials, setting the initial conditions and creating grids using MINC. The methodology development of meshes in this study will be applied for more precise modeling of groundwater flow and mass transport.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.189-198
• /
• 2008

In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.