• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.839-845
• /
• 2009

The Vehicular Ad-hoc Network (VANET) has two main problems to be overcome due to high mobility and frequently changing density: one is short link duration time and the other is high packet loss ratio. To solve the problems, there have been many studies to predict vehicular mobility. Most of the studies try to enhance link expire time and link reliability, however the distance between two relay nodes becomes too short to have high network throughput. In this paper, we propose a new routing algorithm that considers both link expire time and network throughput in the VANET. The proposed algorithm aims to find path with long link expire time and high throughput. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.131-137
• /
• 2007

Recently, Ant Colony Optimization (ACO) is emerged as a simple yet powerful optimization algorithm for routing and load-balancing of both wired and wireless networks. However, there are few researches trying to adopt ACO to enhance routing performance in WSN owing to difficulties in applying ACO to WSN because of stagnation effect. In this paper, we propose an energy-efficient path selection algorithm based on ACO for WSN. The algorithm is not by simply applying ACO to routing algorithm but by introducing a mechanism to alleviate the influence of stagnation. By the simulation result, the proposed algorithm shows better performance in data propagation delay and energy efficiency over Directed Diffusion which is one of the outstanding schemes in multi-hop flat routing protocols for WSN. Moreover, we checked that the proposed algorithm is able to mitigate stagnation effect than simple ACO adoption to WSN.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.29-34
• /
• 2011

We present a network coding scheme which is designed for improving throughput in multi-hop wireless network with multi-radio multi-channel. The co-channel interference and unreliability of wireless transmissions cause the wireless network to reduce throughput. In wireless network, multi-radio multi-channel technology shows benefit to cut down channel interferences and contentions. And network coding can reduce the complexity of scheduling and improve throughput by increasing usage of links in wireless network. In this paper, we propose a method of channel assignment and transmission scheduling in intra-session network coding that efficiently improve throughput for multi-hop wireless network by using mathematical modeling and linear programming. Moreover, we evaluate the performance of the intra-session network coding scheme by using AMPL with CPLEX. The simulation results show that intra-session network coding can achieve better throughput than traditional routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.950-958
• /
• 2011

This paper focuses in the implementation of mesh router supporting multi-path routing based on IEEE 802.11s. In HWMP of IEEE 802.11s, the single path routing just was defined. So, in this work, we implemented not only the single path routing defined in IEEE 802.11s, but also a multipath routing based on AOMDV which extended the standard. A multi-channel multi-interface technology that can transmit and receive simultaneously and lower bandwidth reduction caused by interferences than a single-channel single-interface was implemented in our mesh router. We also developed an outdoor test bed with the mesh routers. The bandwidth of the mesh router and a real-time video streaming service were verified using the test bed. And, the single path and multipath routing algorithms are also compared. In this test bed, The average TCP bandwidth was 23.77 Mbps and the latency was 2.4 ms in five hops. The test bed could service real-time streaming with an average jitter of 0.547 ms in five hops. The mesh router that used the multipath routing path reduced the path recovery time by 12.73% on average.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.244-246
• /
• 2003

모바일 애드 흑 네트웍(Mobile Ad Hoc Network)에서는 지금까지 라우팅 오버헤드를 줄이기 위한 많을 프로토콜이 제안되었다. 않은 애드 흑 라우팅 프로토콜은 멀티-홉(Multi-Hop) 거리에 있는 목적지 노드까지의 경로 탐색을 위해서 플러딩(Flooding)을 사용한다. 본 논문에서는 애드 혹 네트웍의 라우팅을 위한 존 플러딩(Zone Flooding)을 제안한다. 제안된 프로토콜은 존을 이용하여 경로 설정 과정에 참여하는 노드의 수를 줄이고, 또한 각 노드간의 플러딩 패킷 수를 줄설 라우팅 오버헤드를 줄일 수 있다 경로 탐색 과정에서는 계층적 노드 구조를 이용하여 라우팅에 참여하는 노드 수를 줄인다. 또한 각 노드간에는 존 플러딩 방법을 이용하여 발생되는 라우팅 패킷 수를 줄였다. 시뮬레이션은 NS2 [3]를 이용하여 기존의 라우팅 프로토콜과 제안된 프로토콜의 성능을 비교하였다.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1121-1128
• /
• 2008

Ad-Hoc network is consisted with the device of wireless communication. Therefore, the organization of network is dynamic and the changing communication channel is essential. According this, the study of secure routing route and certification technique has to be needed. In we research, we suggest not only the secure routing scheme in Ad-Hoc circumstance but also the method that user can be serviced the type of network which is connected Ad-Hoc network and wireless lam. In case of the routing form of Ad-Hoc Network, although in preexist study, when the device of organization withdraws, routing is needed, in we research, we suggest the detour route that is used hop frequency. We can offer the service of ubiquitous that the certification of secure user and the creation of routing route in Ad-Hoc network.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.355-356
• /
• 2014

기존의 MANET 환경에서 동작하는 계층화된 데이터 전송 프로토콜은 각 계층이 독립적인 기능을 수행하기 때문에 노드의 이동 상황에 따라 변하는 네트워크 환경을 잘 반영하지 못하고 있다. 본 논문에서는 라우팅 계층과 MAC 계층 간의 상호 작용을 통하여 MANET의 2-홉 거리에 있는 노드 수를 반영하여 더 우수한 성능을 나타내는 Cross-Layer 모델 기반의 브로트캐스트 기법을 제안한다. 본 논문에서 제안하는 Cross-Layer 모델은 IEEE 802.11 MAC 프로토콜을 수정하여 이동 노드 주위의 상태에 따라 브로드캐스트 패킷을 적응적으로 전송하도록 동작한다.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.663-673
• /
• 2014

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.3
• /
• pp.166-171
• /
• 2023

Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.