원문정보
보안공학연구지원센터(IJMUE)
International Journal of Multimedia and Ubiquitous Engineering
Vol.8 No5
2013.09
pp.283-296
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The cluster-based routing protocol (CBRP) is a grouping mechanism that supports unicast and multicast path discovery for low congestion and packet loss in routing mechanisms for multi-hop wireless mesh networks. No simulation analyses or comparisons with other routing protocols have been reported. In this paper, we have evaluated the performance of the CBRP and compared it to AODV and OLSR through software simulations. The scheme indicates several better performance levels in terms of the channel capacity, path discovery, packet delivery ratio, and end-to-end delay, at the sacrifice of routing overhead degradation.
목차
Abstract
1. Introduction
2. Existing routing protocol and the CBRP for WMNs
2.1 The existing routing protocol
2.2 The cluster-based routing protocol
3. Pseudo-code for the CBRP
3.1 The Basic Process of CBRP
4. Performance analysis of the CBRP
4.1 Channel capacity of the CBRP
4.2 Number of Paths discovered
4.3 Packet delivery ratio
4.4 End-to-end (ETE) delay
4.5 Routing Overhead
5. Conclusions
Acknowledgement
References
1. Introduction
2. Existing routing protocol and the CBRP for WMNs
2.1 The existing routing protocol
2.2 The cluster-based routing protocol
3. Pseudo-code for the CBRP
3.1 The Basic Process of CBRP
4. Performance analysis of the CBRP
4.1 Channel capacity of the CBRP
4.2 Number of Paths discovered
4.3 Packet delivery ratio
4.4 End-to-end (ETE) delay
4.5 Routing Overhead
5. Conclusions
Acknowledgement
References
저자정보
참고문헌
자료제공 : 네이버학술정보