• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2013

In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.31-34
• /
• 2012

In MANET, frequent movement of nodes causes the dynamic network topology changes. Therefore the routing protocol, which is very stable to effectively respond the changes of the network changes, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. When they route nodes in the paired cluster internally, PCBRP reduces the delay by requesting a route. Therefore PCBRP shows improved total delay of the network and improved performance of packet transmitting rate.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.241-242
• /
• 2011

SRC 프로토콜은 BCDCP 클러스터 라우팅 기법과 페어와이즈 키와 디지털서명을 이용한 키 분배 프로토콜을 결합한 클러스터링 기반 보안 프로토콜이며, 초기 키 생성 및 분배, 주기적인 키 재 생성, 센서 추가 및 센서 단계로 구성되어 있다. 본 논문에서는 SRC 프로토콜의 한계점인 페어와이즈 키의 선분배를 이용한 보안방법의 개선과 에너지 사용량을 개선하기 위한 초기 키 생성 및 분배단계를 분리하여 초기 키 생성 단계와 분배단계를 제시한다.