• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.454-456
• /
• 2005

본 논문은 Wireless Mesh Network를 위한 새로운 MAC 프로토콜의 설계에 관해 기술한다. Mesh Network는 Mesh Router에 의해 무선 인프라를 구성한다. WMN(Wireless Mesh Network)는 고정된 상태의 Mesh Router에 의한 인프라를 구성하고 인터넷과 같은 기존의 인프라와 연결되는 구조적 특징을 가진다. 또한 다양한 응용분야의 지원을 위한 QoS(Quality of Service)가 요구되어지기 때문에 end-to-end 전송 지연, 공정성, 그리고 데이터 손실 등 많은 사항을 고려한 프로토콜의 설계가 요구된다. 본 논문에서는 WMN의 이러한 특징을 지원하기 위한 토폴로지의 제안과 TDMA를 활용한 MAC 프로토콜을 설계하였으며, NS-2 시뮬레이션을 통해 성능을 측정하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2011년 춘계학술대회논문집
• /
• pp.294-301
• /
• 2011

A two-dimensional hybrid flaw solver has been developed for the accurate and efficient simulation of steady and unsteady flaw fields. The flow solver was cast to accommodate two different topologies of computational meshes. Triangular meshes are adopted in the near-body region such that complex geometric configurations can be easily modeled, while adaptive Cartesian meshes are, utilized in the off-body region to resolve the flaw more accurately with less numerical dissipation by adopting a spatially high-order accurate scheme and solution-adaptive mesh refinement technique. A chimera mesh technique has been employed to link the two flow regimes adopting each mesh topology. Validations were made for the unsteady inviscid vol1ex convection am the unsteady turbulent flaws over an NACA0012 airfoil, and the results were compared with experimental and other computational results.

• 한국통신학회논문지
• /
• 제35권6B호
• /
• pp.875-887
• /
• 2010

The workgroup of IEEE 802 proposed the IEEE 802.16 standard, also known as WiMAX, to provide broadband wireless access (BWA). The standard specifies two operational modes, one is popular PMP mode, and the other is optional mesh mode. In the mesh mode, the network entry process-NetEntry is the pivotal procedure for mesh network topology formulation and thus, influences the accessibility of whole mesh network. Unfortunately, the NetEntry process suffers from the hidden neighbor problem, in which new neighborship emerges after a new node comes in and results in possible collisions. In this paper, we propose a new SN-protected NetEntry process to address the problem. Simulation results show that the new proposed NetEntry process is more stable compared with the standard-based NetEntry process.

• 인터넷정보학회논문지
• /
• 제2권5호
• /
• pp.93-104
• /
• 2001

본 논문에서는 멀티미디어 환경에서 La치 성능향상을 위하여 ATM-LAN으로 구성하여 토폴로지에 따라 네트워크를 분석한다. 노드 변화에 따라 스타, 링, 메쉬 토폴로지에서 Email, FTP, Http 서버의 작업처리 시간을 분석한다. 토폴로지에 따라 Email 송, 수신율의 변화와 Email, FTP, Http서버의 부하량을 분석한다. 본 논문에서 구성한 네트워크는 단지 어떤 토폴로지에서 서버에 걸리는 부하를 최소로 할 수 있는가를 고찰할 수 있었다.

• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.282-295
• /
• 2007

Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

• 대한기계학회논문집
• /
• 제18권12호
• /
• pp.3159-3174
• /
• 1994

A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

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

• 한국통신학회논문지
• /
• 제32권1B호
• /
• pp.1-10
• /
• 2007

논문에서는 인터넷 트래픽 환경에서 예측하기 어려운 동적 트래픽은 물론 양방향 비대칭적 트래픽을 광 네트워킹 기술을 이용하여, WDM(Wavelength Division Multiplexing) Mesh 네트워크로 수용하는 방안을 제안한다. 제안된 방안에서는 중간 노드(intermediate node)에서 변동하는 인터넷 트래픽에 대한 IP 라우터의 스위칭 통계정보를 기반으로 새로운 광경로를 결정하도록 함으로써, 네트워크의 동적인 그리고 분산적인 트래픽 제어가 이루어지도록 하였다. 이로써 인터넷 트래픽의 실시간적 변동에 따른 RWA(Routing and Wavelength Assignment)의 효율성 열화 효과를 줄이면서 네트워크의 확장성과 유연성이 개선되도록 하였다. 본 논문에서는 노드에서의 트래픽 형상 분석방법과 광경로 설정/절체 과정에 대해 설명하고, 컴퓨터 시뮬레이션을 통해 제안한 개념의 성능을 분석하였다.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.307-310
• /
• 2011

IPTV의 스트리밍 서비스를 위해 P2P를 이용하는 방법이 활발하게 연구되어지고 있다. 이 논문에서는 topology를 최적화하는 방안으로 P2P에서 각 peer 간에 연결 및 전송 정보를 이용하는 방법을 제안한다. 제안하는 방법은 mesh-network에서 각 peer에 연결된 link의 수를 이용하여 업로드 대역폭을 추정하는 알고리즘을 기반으로 한다. 이 방법은 자원의 관리를 위해 업로드 대역폭을 판단하기 위한 메시지 과부하를 효과적으로 줄여주지만 스트리밍에서 주어진 연산만을 수행할 경우 업로드 대역폭과 무관한 형태로 network topology가 잘못 구성될 가능성을 가지고 있다. 본 논문에서는 기존 연구에서 부족했던 부분들을 정리하고 극복할 수 있는 각각의 알고리즘들과 적용했을 시에 예상되는 결과를 제시한다.