On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks

2012 ◽  
Vol 18 (8) ◽  
pp. 967-983 ◽  
Author(s):  
Kai Zeng ◽  
Jie Yang ◽  
Wenjing Lou
2019 ◽  
Vol 25 (7) ◽  
pp. 3983-3998
Author(s):  
Cédric Gueguen ◽  
Philippe Fabian ◽  
Xavier Lagrange

Webology ◽  
2021 ◽  
Vol 18 (Special Issue 04) ◽  
pp. 752-764
Author(s):  
R. Deeptha

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.


2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877820
Author(s):  
Seunggyu Byeon ◽  
Sejin Park ◽  
Hyung-Yoon Seo ◽  
Jong-Deok Kim

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.


2020 ◽  
Vol 7 (1) ◽  
pp. 576-588
Author(s):  
Kechen Zheng ◽  
Xiao-Yang Liu ◽  
Luoyi Fu ◽  
Xinbing Wang ◽  
Yihua Zhu

Sign in / Sign up

Export Citation Format

Share Document