CLOF: Contribution-level-based opportunistic flooding for multihop wireless networks
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q2Scopus Q1
- 저널
- INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS14(5) · 2018
- 피인용
- Web of Science 0Scopus 1
- FWCI (Scopus)
- 0
- JCR IF
- JCR 2017 1.787
- ISSN
- 1550-1329
저자
- 변승규제1저자School of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
- 박세진School of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
- 서형윤School of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
- 김종덕교신저자School of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
초록
In this study, we propose a contribution-level-based opportunistic flooding for multihop wireless networks. Traditional flooding techniques typically use fixed routing and predetermined relay nodes based on the assumption of fixed and reliable links. However, because of the inherent instability of wireless links, these approaches typically lead to fragile and unreliable broadcasting. To overcome this problem, we adopt an opportunistic routing where the relay node is determined by the transmission result. In addition, we introduce a new criterion: a contribution level defined as packet infectiousness, and it represents the transmission priority. Namely, contribution level implies the degree of contagiosity determined by the distribution of uninfected entities. It also falls with an increase in the number of infected entities. Thus, the contribution level of a node is initially determined by the number of neighbors and distances to the neighbors. Once a node receives a packet, it waits a certain amount of time according to the initial priority. The node changes its own contribution level when it overhears a packet while waiting. If the contribution level reaches near zero, it discards the received packet such that unnecessary duplicates are removed. Consequently, higher reliability and efficiency can be achieved.
키워드
Multihop wireless networksbroadcastfloodingAD HOC NETWORKSSENSOR NETWORKS
식별자
- Scopus EID
- 2-s2.0-85048019421
- WoS UID
- 000433607000001



로그인
연구물 목록으로