Link state opportunistic routing for multihop wireless networks

Routing is portrayed as one of the most important prevailing challenges in research with reference to multi-hop networks in a wireless environment. Opportunistic routing (OR) protocol is an emerging area related to research, due to the improvement in communication reliability, compared to the traditional routing models. The major perception related to OR is to determine a group of neighboring node candidates, named as a candidate set using the advantages of broadcast capability of the wireless medium thereby to collaboratively transmit data packets towards the destination using the coordination of the forwarded candidate set. The design and performance of OR protocols over multi-hop wireless networks mainly depend on the processes of forwarding selection of candidates and assignment of priorities. Therefore, the researchers have designed and developed several different algorithms for those OR processes. In this paper, following a short outline on traditional routing and OR protocols, metrics involved in the design of existing OR protocols, classification of OR based protocols, and hurdles in the design of OR protocols over multi-hop wireless networks are examined. More precisely, the OR protocols are divided into two categories, based on the forwarding candidate set selection and forwarding candidate coordination methods. Furthermore, the most significant challenges of OR protocol design, such as prioritization of forwarding candidates, utilizing the cross-layer approach for candidate coordination, and achieving the quality of service also investigated.

Download Full-text

On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications ◽

10.1109/infocom.2007.133 ◽

2008 ◽

Cited By ~ 7

Author(s):

K. Zeng ◽

W. Lou ◽

H. Zhai

Keyword(s):

Wireless Networks ◽

Multihop Wireless Networks ◽

Opportunistic Routing ◽

Multihop Wireless ◽

End To End

Download Full-text

CLOF: Contribution-level-based opportunistic flooding for multihop wireless networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147718778200 ◽

2018 ◽

Vol 14 (5) ◽

pp. 155014771877820

Author(s):

Seunggyu Byeon ◽

Sejin Park ◽

Hyung-Yoon Seo ◽

Jong-Deok Kim

Keyword(s):

Wireless Networks ◽

Relay Node ◽

Multihop Wireless Networks ◽

Opportunistic Routing ◽

Relay Nodes ◽

Multihop Wireless ◽

Criterion A ◽

Wireless Links ◽

New Criterion ◽

Contribution Level

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.

Download Full-text