• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.62-65
• /
• 2006

센서 네트워크는 라디오 통신으로 인해 생기는 예상치 못한 문제점을 비롯하여 제한적인 리소스 때문에 응용 개발에 어려움이 많다. 센서 네트워크가 구성된 후의 내부적인 데이터 흐름이나 네트워크에 참여하는 각 노드의 상태는 네트워크의 정보 수집을 통해 알 수 있다. 본 논문은 네트워크의 상태를 모니터링하고 실시간으로 네트워크 파라미터들을 효율적으로 설정할 수 있는 센서 네트워크 관리 시스템을 제안한다. Sensor Network Manager는 Multi-thread와 동적으로 할당 가능한 Kernel Module 기법을 지원하는 RETOS 운영체제를 기반으로 개발 되었다. 간단한 플러딩 기법을 적용하여 센서 네트워크의 상태를 모니터링 한 결과 Sensor Network Manager가 개발자에게 전반적인 네트워크에 대한 통제와 모니터링이 가능하다는 것을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.75-78
• /
• 2021

경로 탐색을 위해 RREQ 패킷을 절대적으로 플러딩하는 방식에 따라 높은 채널 경합 및 과도한 패킷 충돌이 발생하는 AODV 의 문제점을 해결하기 위해 제어 패킷을 감소시키려는 여러 방법들이 제안되었다. 이러한 기법들은 주 경로에 포함되는 노드 수를 제한함으로써 전반적인 제어 패킷의 발생을 감소시켰으나 경로가 유사한 경우 전송되는 중복된 제어 패킷에 의한 오버헤드 상승 문제는 고려하지 않았다. 이러한 문제를 해결하기 위해 본 논문에서는 목적지와의 거리에 따라 RREQ 의 전송 순서를 동적으로 조정하는 기법을 제안한다. 제안된 방법은 시뮬레이션을 통하여 성능을 평가하였다.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.163-170
• /
• 2003

In this paper we propose a robust clustered croup Multicast in Ad-hoc network. The proposed scheme applies to weighted clustered Algorithm. Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network routing protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by scoped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.35-41
• /
• 2010

Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.92-97
• /
• 2012

This paper suggests a data gathering scheme using dynamic branch tree in wireless sensor networks. A mobile sink gathers data from each sensor node using a dynamic data gathering tree rooted at the mobile sink node. As the sink moves, a tree that has multiple branch is formed and changed dynamically as with the position of the sink node. A hop-based scope filter and a restricted flooding scheme of the tree are also suggested. Simulation results show that the proposed data gathering scheme has better results in data arrival rate, the end-to-end delay and energy saving characteristics compared with the previous scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.742-745
• /
• 2006

센서 네트워크를 구성하는 각 노드는 크기가 작고, 배터리 용량도 제한되어 있기 때문에 오랜 시간 노드가 활동하기 위해서는 노드의 에너지 소모를 줄이는 것이 중요하다. 센서 노드들의 에너지 소비 감소를 위해서 센서 네트워크에서는 에너지 효율적인 라우팅을 통해 에너지를 소비를 줄이는 방법이 연구되었다. 그 중에서 클러스터링 기법은 센서 노드가 클러스터를 형성하고, 그 주체가 되는 클러스터 헤드와 통신함으로써 전체적인 센서 노드의 에너지 소비를 줄이고, 센서 노드의 에너지 소모를 분산하는 기법이다. 그러나 클러스터 생성 후 클러스터 내에서 센서 노드들이 직접 클러스터 헤드와 통신한다거나, 플러딩을 하는 방식으로 통신했을 때, 각각의 센서 노드들은 에너지 소비를 낭비한다. 이때 중요시 생각해야 할 것은 클러스터를 형성한 후, 클러스터 내에서 라우팅을 어떻게 하느냐가 클러스터 내에 있는 센서 노드들의 에너지 소비 분배를 효율적으로 할 수 있게 하는 가이다. 이에 본 논문은 초기 랜덤하게 뿌려진 센서 노들이 클러스터 헤드를 선정한 후, 클러스터 헤드로부터 클러스터를 형성하면서 생기는 정보를 바탕으로 클러스터 헤드로의 효율적인 라우팅 프로토콜을 하는 방법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.931-937
• /
• 2015

Distributed relay scheme for wireless ad hoc multi-hop multicast network composed of low-power and low-complexity wireless devices with high density is proposed. The proposed relay scheme is shown to be better than flooding, which is the distributed relay scheme applied to ZigBee, in the outage probability and the multicast transmission rate by simulations.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.445-450
• /
• 2011

In the vehicular ad hoc network environment, the clustering mechanism is one of the efficient mechanisms to deliver broadcast messages. Most clustering mechanisms require message exchanges between vehicles to build stable clusters, which causes overhead. In order to reduce this overhead, CF-IVC [1] proposes the mechanism to construct clusters based on the vehicle speed. However, since CF-IVC does not consider the road traffic condition and the driver's behavior, it may result in inefficient clusters. Therefore, in this paper, we propose a mechanism to establish efficient clusters based on the vehicle local information with considering the road maximum speed limit and the road traffic condition. The performance of the proposed mechanism is validated by comparing with those of the simple flooding and CF-IVC through NS-2 simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.486-490
• /
• 2007

Recently, there have been active research efforts on devising efficient routing algorithms utilizing location information in ad-hoc mobile networks. In this paper, we propose a new method to improve the performance of the widely recognized Location Aided Routing (LAR) algorithm. To this end, we suggest the concept of accessible zone combined with the basic two schemes associated with LAR algorithm. Through the proposed algorithm, we can confine the flooding area within accessible zone, thereby reducing the routing delay.