• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.674-683
• /
• 2014

Multi-hop wireless networks has become common phenomenon according to a development of wireless communications and an increase of usage of wireless link. ARQ is one of the common protocols in link layer and can improve a link performance recovering packet loss in wireless link. However, ARQ cannot sufficient to assure a end-to-end performance because ARQ only manages the ARQ's own link. In this paper, we propose a new retransmission persistence for ARQ in multi-hop wireless network to satisfy the end-to-end performance. The proposed scheme can aware a bottleneck link according to the exchange of link information between ARQs and can support the end-to-end performance by managing a retransmission persistence. OPNET simulator is used to evaluate the performance of the proposed scheme and results show that proposed scheme can improve the end-to-end performance with satisfying a requirement of entire wireless section.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.237-239
• /
• 2011

본 논문에서는 클러스터 기반 다중 홉 무선 네트워크에서 중계기 협력 ARQ 를 이용한 기회적 중계 기법을 제안한다. 클러스터 간 통신 시 성능을 열악하게 만들 수 있는 채널 페이딩 효과를 줄이기 위하여 각 클러스터 간 통신에 중계기를 이용한 협력 통신을 적용한다. 또한 다중 홉 통신에서는 중간 홉에서 오류가 발생할 경우 전송 도중 정보를 잃게 되는 전송 실패의 가능성이 존재한다. 따라서 전송 실패의 가능성을 줄이기 위하여 중계기로부터 재전송을 받을 수 있는 중계기 협력 ARQ 기법을 적용한다. 본 논문에서는 제안한 기법에 대한 전송 실패 확률을 분석한다. 그리고 모의 실험에서는 제안한 기법이 ARQ 를 사용하지 않은 기법과 성능 비교하여 신뢰도 측면에서 더 좋은 성능을 보임을 확인한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.176-179
• /
• 2011

본 논문은 IEEE 802.11기반 무선 멀티홉 환경에서 은닉 노드가 존재할 때 전체 시스템의 효율 저하를 최소화 하면서도 평균 시간 지연 요구를 만족할 수 있는 경쟁 윈도우 제어 알고리즘을 제안한다. 이에 적용되는 최소 경쟁 윈도우 기준값을 주어진 topology에 따라 도출하고 각 트래픽 플로어의 QoS 요구조건 만족과 은닉노드가 존재할 경우에 성능개선을 위한 경쟁 윈도우 제어 패턴을 조절한다. 제안하는 경쟁 윈도우 제어 기법을 ns-2 시뮬레이션을 통해 검증하고, 모든 QoS 요구를 수용하면서 전체 성능 개선을 보이는 결과를 구하였다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.57-57
• /
• 2004

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.725-728
• /
• 2011

멀티홉 네트워크에서 플러딩(Flooding) 기법은 토폴로지 내의 모든 노드에게 패킷을 전달하는 것이다. 대표적인 플러딩 기법인 Blind 플러딩은 패킷을 받은 모든 노드가 플러딩을 하기 때문에, 무선 네트워크의 전체적인 성능이 감소한다. 기존 연구에서는 성능 향상을 위해 중복 수신되는 패킷을 줄이는 데에만 초점이 맞춰져 있다. 하지만 실제 무선 네트워크 환경에서는 간섭에 따른 패킷 손실이 발생하고, 플러딩은 Broadcast 로 전송하기 때문에 재전송하여 손실 패킷을 복구할 수 없다. 본 논문에서는 Blind, Self-Pruning, Dominant-pruning 플러딩 기법에 재전송이 필요 없는 오류정정 기법(FEC)를 적용하여, 추가적인 잉여 데이터에 따른 전체 전송 패킷의 수와 플러딩 기법의 신뢰성을 분석 하였다.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 2010

Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.231-241
• /
• 2013

Improvements in wireless sensor network (WSN) technology have resulted in a large number of applications. WSNs have been mainly used for monitoring applications, but they are also applicable to target tracking, health care, and monitoring with multimedia data. Nodes are generally deployed in environments where the exhausted batteries of sensor nodes are difficult to charge or replace. The primary goal of communication protocols in WSNs is to maximize energy efficiency in order to prolong network lifetime. In this paper, various medium access control (MAC) protocols for synchronous/asynchronous and single/multi-channel WSNs are investigated. Single-channel MAC protocols are categorized into synchronous and asynchronous approaches, and the advantages and disadvantages of each protocol are presented. The different features required in multi-channel WSNs compared to single-channel WSNs are also investigated, and surveys on multi-channel MAC protocols proposed for WSNs are provided. Then, existing broadcast schemes in such MAC protocols and efficient multi-hop broadcast protocols proposed for WSNs are provided. The limitations and challenges in many communication protocols according to this survey are pointed out, which will help future researches on the design of communication protocols for WSNs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2004-2010
• /
• 2009

The characteristic of the backbond for distribution service in WMNs(Wireless Mesh Networks) is that WMNs has multiple links connected to mesh points and dynamic routing protocol such as AODV to establish routing paths. When the terminal is communicating with the service through new AP, mobile nodes can resume communication by setting only the link between new AP and mobile node in the case of existing WLANs, but WMNs needs path establishment process in multihop networks. Our goal in this paper is to support the seamless communication service by eliminating path establishment delay in WMNs. We present the method that eliminates the handover latency by predicting the location of handover using GPS information and making the paths to their destination in advance. We implement mesh nodes using embedded board that contains proposed handover method and evaluate performance of handover latency. Our experiment shows that handover delay time is decreased from 2.47 to 0.05 seconds and data loss rate is decreased from 20~35% in the existing method to 0~10% level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.876-884
• /
• 2012

This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.611-625
• /
• 2018

With innovative advances in wireless communication technology, many researches for extending network lifetime in maximum by using energy harvesting have been actively performed on the area of network resource optimization, QoS-guaranteed transmission, energy-intelligent routing and etc. As known well, it is very hard to guarantee end-to-end network delay due to uncertainty of the amount of harvested energy in multi-hop RF(radio frequency) energy harvesting wireless networks. To minimize end-to-end delay in multi-hop RF energy harvesting networks, this paper proposes an energy efficient routing metric based on interference aware and protocol which takes account of various delays caused by co-channel interference, energy harvesting time and queuing in a relay node. The proposed method maximizes end-to-end throughput by performing avoidance of packet congestion causing load unbalance, reduction of waiting time due to exhaustion of energy and restraint of delay time from co-channel interference. Finally simulation results using ns-3 simulator show that the proposed method outperforms existing methods in respect of throughput, end-to-end delay and energy consumption.