• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.299-302
• /
• 2010

보안 시스템에 사용되는 많은 감시 카메라들이 RS-485 통신 방식을 통해 제어된다. 이러한 상황에서 RS-485 연결을 센서 네트워크 기술을 이용한 무선 연결로 대체할 수 있다면 선으로 연결할 필요가 없어 설치가 쉬워지고 카메라의 배치 또한 자유로워 질 것이다. 본 논문은 RS-485 연결을 대체할 수 있는 무선 센서 네트워크 기반의 감시 카메라 제어 시스템에 대한 개발로 홈게이트웨이와 무선 센서 노드, 스마트폰 감시 카메라 제어 어플리케이션의 개발 및 구현에 대해 설명한다. 홈 게이트웨이는 유 무선 인터넷 뿐만 아니라 무선 센서 네트워크를 지원하도록 설계되었으며 MicaZ 기반의 센서 노드는 RS-485 인터페이스로 카메라와 연결된다. 넓은 지역에 분산된 보안 카메라들을 제어하기 위해 멀티-홉 또한 지원하도록 구현되었다. 보안 시스템의 감시 카메라들은 스마트폰 기반의 어플리케이션에 의해 제어 된다. 실제 환경에 배치하여 실험한 결과, 스마트폰에서의 카메라 제어에 대해 실제 카메라가 매우 빠르게 반응하는 것을 확인할 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.755-758
• /
• 2012

국경 지역을 실시간 모니터링하고, 효율적인 데이터 전달을 위해서는 센서 노드의 에너지 소모를 줄임으로써 전체 네트워크의 수명을 연장시킬 필요가 있다. 그에 따라, 본 논문에서는 네트워크를 클러스터링 기반으로 한 다수의 영역으로 분할하고 각각의 영역 내 특정 노드에 헤드의 역할을 부여하여 라우팅을 수행하는 계층적 클러스터 센서 네트워크를 제안한다. 제안하는 기법에서는 클러스터 헤드에서의 데이터 모음을 통한 통신 메시지 수를 줄임으로써 센서 노드들의 에너지 소모를 최소화시키고, 긴 국경 라인을 커버할 수 있는 충분한 클러스터 확장이 가능하다. 또한 링크의 상태 및 노드의 밀집도를 고려하여 적응적으로 링크의 품질을 측정하는 알고리즘을 제시하여 링크 변화에 대한 빠른 탐색을 통해 네트워크를 관리하는 방안을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1189-1192
• /
• 2004

Ad hoc network는 중앙 집중화된 관리나 표준화된 지원 서비스의 도움 없이 임시 망을 구성하는 무선 이동 호스트들의 집합으로서 제한된 무선 채널을 통해 이동 노드간의 통신을 수행하는 멀티 홉(multi-hop) 무선 네트워크이다. 따라서 중앙 집중화된 보안 기반구조가 아니기 때문에 보안 공격을 받기가 쉽게 된다. 기존의 보안 방법중의 하나인 threshold cryptography는 키의 유지와 분배를 위한 효율적인 구조를 제공하였으나 라우팅의 오버헤드가 증가하였고, 네트워크 전역의 트래픽이 증가되었다. 본 논문에서는 threshold cryptography에 의해 야기되는 오버헤드를 줄이고 인증된 패킷 전달을 돕기 위한 새로운 접근 방법을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.141-150
• /
• 2013

Simulation is an important technique to test and verify routing protocol correctness. However, simulation does not guarantee that the protocol works expectedly on a real world environment because it needs to rely on assumptions and simplified properties such as radio characteristics and effects of geographical constraints that may not reflect the real world networking environments. Therefore, a real world experiments are necessary to gain a practical insight into the actual performance of ad hoc networks. In this paper, we build a test-bed to evaluate multi-hop ad hoc networks for high speed video streaming inside a building using AODV-UU routing protocol. Our observation indicates that the considered ad hoc network can provide a sufficient performance for a low rate streaming data in terms of throughput, PDR (Packet delivery ratio) and the average delay.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.105-111
• /
• 2009

The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.257-264
• /
• 2012

In this paper, we propose a Route Stability-based Direction Guided Routing protocol(RSDGR) in mobile ad-hoc wireless networks. The main features and contributions of the proposed routing protocol are as follows. First, it can calculate link stability between two nodes as well as route stability of multi hop quantitatively by using nodes' mobility. And this protocol can establish the most stable path between a source node and a destination node. Second, according to the route stability between a source node and a destination node, it can control and optimize the direction guided region dynamically for route setup. Third, we suggest theoretical model for quantitative calculation of link stability between two nodes and route stability of multi hop path. The performance evaluation of the proposed routing protocol is performed by simulation using OPNET(Optimized Network Engineering Tool) and theoretical analysis. The results of performance evaluation show that the patterns of PDR are similar in simulation and analysis according to route stability. The faster mobile nodes' velocity and the smaller source node's direct guided reigion, the lower route stability and PDR and the higher delay and control overhead related to this.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1215-1223
• /
• 2014

In multi-hop wireless networks, a message transmission path is set up on demand by a route discovery step, where a shortest path is used in general. The shortest path, however, normally uses the nodes near the center area, which causes a high traffic load in that area and reduces the message transmission reliability. We propose a stable routing protocol considering the remaining energy of nodes. Our protocol uses ETX as a link performance estimator and tries to avoid the nodes with smaller energy. By doing this, we can reduce the route failure probability and packet loss. We have evaluated the performance of the proposed protocol using QualNet and compared with AODV and MRFR protocols. The simulation result shows that our protocol has a similar performance as MRFR in terms of end-to-end message reception ratio, average message delay and delay jitter, but outperforms MRFR in terms of traffic load distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.534-543
• /
• 2006

As the topology frequently varies, more cluster reconstructing is needed and also management overheads increase in the wireless ad hoc/sensor networks. In this paper, we propose a multi-hop clustering algorithm for wireless sensor network topology management using dynamic pre-clusterhead scheme to solve cluster reconstruction and load balancing problems. The proposed scheme uses weight map that is composed with power level and mobility, to choose pre-clusterhead and construct multi-hop cluster. A clusterhead has a weight map and threshold to hand over functions of clusterhead to pre-clusterhead. As a result of simulation, our algorithm can reduce overheads and provide more load balancing well. Moreover, our scheme can maintain the proper number of clusters and cluster members regardless of topology changes.