http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
무선 센서 네트워크에서 노드 밀도에 따른 클러스터 기반 라우팅 프로토콜
정경택(Kyungtaek Chung),김시관(Si-Gwan Kim) 한국정보기술학회 2011 한국정보기술학회논문지 Vol.9 No.12
Recent advances in micro-electromechanical technology have led to the development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities. To achieve the energy efficiency in the wireless sensor networks, LEACH has been proposed as a routing protocol, composing of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node. Our algorithms reduce the number of transmissions for cluster head nodes depending on the density of nodes in each cluster. This results in lesser transmission energy and longer life time of the network. Simulation results show that our proposed algorithm provides more robust than LEACH when wireless link error persists.
무선 센서망에서의 링크 에러를 감내하는 라우팅 알고리즘의 설계
정경택(Kyungtaek Chung),김시관(Si-Gwan Kim),조대제(Dae-jea Cho) 한국정보기술학회 2011 한국정보기술학회논문지 Vol.9 No.2
Recent advances in micro-electromechanical technology have led to the development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities. To achieve the energy efficiency in the wireless sensor networks, LEACH has been proposed as a routing protocol, composing of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node. When wireless link error occurs, LEACH may miss some messages because of only one cluster head. But our proposed scheme manages two cluster heads for each cluster, there should be higher probabilities for messages to reach the sink node. Simulation results show that our proposed algorithm provides more robust than LEACH when wireless link error persists.
메모리 자원 제약이 있는 애드혹 네트워크에서의 라우팅 프로토콜 제안 및 구현
홍상렬(Sangryeol Hong),정경택(Kyungtaek Chung),오득환(Duck-Hwan Oh),김시관(Si-Gwan Kim) 한국정보기술학회 2007 한국정보기술학회논문지 Vol.5 No.2
In this paper, we propose an efficient routing protocol for the memory-constrained ad-hoc networks. Most of the effort on the ad-hoc routing algorithms are to reduce the energy. Our proposed algorithm is based on memory capacity. Some ad-hoc network node has memory-constraint terminals. Our algorithm attempts to reduce the memory usage by maintaining the most frequently used entries when there is no sufficient table entries. In order to evaluate the performance of our protocols, we carry out simulations based on ns-2 simulator. In addition, we implemented our algorithm for AT mega128 microcontroller with CC1010 RF module for wireless communication, and we prove that our protocol is suitable for memory-constrained ad-hoc networks.
센서 네트워크에서의 효율적인 라우팅 알고리즘에 대한 연구
박형순(Hyungsoon Park),정경택(Kyungtaek Chung),김시관(Si-Gwan Kim) 한국정보기술학회 2007 한국정보기술학회논문지 Vol.5 No.4
In this paper, we propose an efficient routing protocol called energy-efficient dynamic routing tree(EDRT) algorithm for the sensor networks. The idea of EDRT is to maximize in-network processing opportunities using the parent nodes and friend nodes. In-network processing reduces the number of message transmission by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. Our experimental results based on simulations prove that our proposed method can reduce message transmissions more than query specific routing tree(QSRT) and flooding-based routing tree(FRT).