Multi-Constrained Anypath Routing in Wireless Mesh Networks

Fang, Xi; Yang, Dejun; Gundecha, Pritam; Xue, Guoliang

doi:10.1109/secon.2010.5508266

Cited by 23 publications

(17 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar assumptions are also adopted in some recent optimization-based opportunistic routing protocols, like LCAR [41], MABF [77], PLASMA [42], LOR [60] and MAP [78]. These works rather focus on the optimization of other building blocks like CRS construction optimization and coordination method design.…”

Section: Dynamic Network Handling By Opportunistic Routingmentioning

confidence: 99%

“…This class of opportunistic routing protocols tackle the problem of optimizing opportunistic routing's building blocks, especially the candidate relays selection and prioritization blocks using optimization programming [53], [58], [59], game theory [46], [88], [91], machine learning [62], [94] and some approaches inspired from graph theory [41], [42], [44], [60], [77], [78]. In the following, we review these opportunistic routing proposals.…”

Section: Optimization-based Opportunistic Routingmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on Opportunistic Routing in Wireless Communication Networks

Chakchouk

2015

IEEE Commun. Surv. Tutorials

230

170

View full text Add to dashboard Cite

The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments like volcanoes, hurricaneaffected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient, and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization and deployment.

show abstract

Section: Dynamic Network Handling By Opportunistic Routingmentioning

confidence: 99%

Section: Optimization-based Opportunistic Routingmentioning

confidence: 99%

A Survey on Opportunistic Routing in Wireless Communication Networks

Chakchouk

2015

IEEE Commun. Surv. Tutorials

230

170

View full text Add to dashboard Cite

show abstract

“…In order to identify the essential properties of OR using mathematical language, Lu and Wu [39] designed a new OR algebra, based on the routing algebra. Dubois-Ferrière [13] introduced the concept of anypath routing, which has been extensively studied in [14,16,25,34]. Radunović et al [52] presented an optimization framework for computing optimal flow control, routing, scheduling, and rate adaptation schemes, and designed a distributed heuristic algorithm.…”

Section: Opportunistic Multipath Routingmentioning

confidence: 99%

“…Therefore, to solve UPOP and NPCOP for mixedduplex networks, Constraint (16) in System 1 and System 2 should be replaced by Constraint (39). We can use distributed algorithms that are similar to Pathbook-I and Pathbook-II to solve these two optimization systems for mixed-duplex networks, respectively.…”

Section: Mixed-duplex Networkmentioning

confidence: 99%