A Novel Theoretical Probabilistic Model for Opportunistic Routing with Applications in Energy Consumption for WSNs

This paper proposes a new theoretical stochastic model based on an abstraction of the opportunistic model for opportunistic networks. The model is capable of systematically computing the network parameters, such as the number of possible routes, the probability of successful transmission, the expected number of broadcast transmissions, and the expected number of receptions. The usual theoretical stochastic model explored in the methodologies available in the literature is based on Markov chains, and the main novelty of this paper is the employment of a percolation stochastic model, whose main benefit is to obtain the network parameters directly. Additionally, the proposed approach is capable to deal with values of probability specified by bounded intervals or by a density function. The model is validated via Monte Carlo simulations, and a computational toolbox (R-packet) is provided to make the reproduction of the results presented in the paper easier. The technique is illustrated through a numerical example where the proposed model is applied to compute the energy consumption when transmitting a packet via an opportunistic network.

Survey on Opportunistic Routing Protocols in 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.