Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Capone, Antonio; Gualandi, Stefano; Yuan, Di

doi:10.1016/j.adhoc.2011.02.002

Cited by 13 publications

(4 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the CPT model, a group of nodes can send in parallel or receive the same packet, and each end node can join the transmitting signals from several transmitters [4,11]. Moreover, the nodes will send packets several times after receiving and storing them the first time.…”

Section: Cooperative Packet Transmission Model (Cpt)mentioning

confidence: 99%

Optimization of packet forwarding scheduling in wireless ad-hoc networks: Deployment on a 3D environment

Boukrim

Antari²

2022

E3S Web Conf.

View full text Add to dashboard Cite

The key aim of a multi-hop wireless network is to increase service efficiency in terms of transmission scheduling, packet transfer volume, and other factors. In a practical deployment of Ad- Hoc wireless network in three-dimensional (3D) environments, we study the optimizing transmission scheduling problem by end-to-end latency minimization using the signal-to-interference-and-noise rate (SINR) mechanism. Two strategies are considered. The former directly deals with end-to-end latency and eliminates the constraint of frame periodicity. The latter combines two cooperative transmission and transmission interference suppression models. The properties of both strategies are analyzed, and mixed-integer programming (MIP) models and solution heuristics are developed. Simulation results are presented to clarify the end-to-end latency performance of strategies, especially in 3D environments.

show abstract

Section: Cooperative Packet Transmission Model (Cpt)mentioning

confidence: 99%

Optimization of packet forwarding scheduling in wireless ad-hoc networks: Deployment on a 3D environment

Boukrim

Antari²

2022

E3S Web Conf.

View full text Add to dashboard Cite

show abstract

“…CF and interference cancellation have shown significant benefits for improving resource efficiency. In [23], the authors define the concept of CF, which is modeled via a cooperation graph, and consider minimum-length scheduling with CF for multi-hop wireless networks with multiple sources and destinations. Overview, mechanisms and implementation details of CF can be found in [24,25].…”

Section: Related Workmentioning

confidence: 99%

“…we adopt the CF scheme described in [23], in which the SINR condition for node j ∈ V to correctly receives packet s ∈ S is as follows:…”

Section: Cooperative Forwarding (Cf)mentioning

confidence: 99%

Minimizing end-to-end delay in multi-hop wireless networks with optimized transmission scheduling

Capone

Pióro

et al. 2019

Ad Hoc Networks

Self Cite

View full text Add to dashboard Cite

The problem of transmission scheduling in single hop and multi-hop wireless networks has been extensively studied. The focus has been on optimizing the efficiency of transmission parallelization, through a minimum-length schedule that meets a given set of traffic demands using the smallest possible number of time slots. Each time slot is associated with a set of transmissions that are compatible with each other according to the considered interference model. The minimum-length approach maximizes the resource reuse, but it does not ensure minimum end-to-end packet delay for multiple source-destination pairs, due to its inherent assumption of frame periodicity. In the paper we study the problem of transmission scheduling and routing aiming at minimizing the endto-end delay under the signal-to-interference-and-noise-ratio (SINR) model for multi-hop networks. Two schemes are investigated. The first scheme departs from the conventional scheduling approach, by addressing explicitly end-to-end delay and removing the restriction of frame periodicity. The second scheme extends the first one by featuring cooperative forwarding and forward interference cancellation. We study the properties of the two schemes, and propose novel mixed-integer programming models and solution algorithms. Extensive results are provided to gain insights on how the schemes perform in end-to-end delay.

show abstract

“…The joint problem of routing and scheduling is also studied in [42] and [94], for ad hoc networks and wireless mesh networks with directional antennas, respectively. A comprehensive survey of extensions of the scheduling problem with other resources allocation policies is presented in [16].…”

Section: Extensionsmentioning

confidence: 99%

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

He¹

View full text Add to dashboard Cite

Wireless communications have become an important part of modern life. The ubiquitous wireless networks and connectivities generate exponentially increasing data traffic. In view of this, wireless network optimization, which aims at utilizing the limited resource, especially spectrum and energy, as efficiently as possible from a network perspective, is essential for performance improvement and sustainable development of wireless communications.In the dissertation, we focus on a fundamental problem of wireless network optimization, link scheduling, as well as its subproblem, link activation. The problem type arises because of the nature of wireless media and hence it is of relevance to a wide range of networks with multiple access. We freshen these classic problems up by novel extensions incorporating new technologies of interference management or with new performance metrics. We also revisit the problems in their classic setup to gain new theoretical results and insights for problemsolving. Throughout the study, we consider the problems with a general setup, such that the insights presented in this dissertation are not constrained to a specific technology or network type. Since link activation and scheduling are key elements of access coordination in wireless communications, the study opens up new approaches that significantly i improve network performance, and eventually benefit practical applications.The dissertation consists of five research papers. The first paper addresses maximum link activation with cooperative transmission and interference cancellation. Papers II and III investigate the minimumtime link scheduling problem in general and a particular class of networks, respectively. In Paper IV, we consider the scheduling problem of emptying a network in its broad form and provide a general optimality condition. In Paper V, we study the scheduling problem with respect to age of information.ii Populärvetenskaplig SammanfattningTrådlös kommunikationär av stor betydelse i dagens samhälle. Möjligheten att ansluta kommunikationsenheter till trådlösa nätverk harökat markant på senare tid vilket medfört att nätverken belastas alltmer då mängden datatrafik tilltar. Med hänsyn till dettaär optimering av trådlösa nätverk synnerligen betydelsefullt. Genom att t.ex. effektivisera nyttjandet av tillgängliga frekvenser samt minska energiförbrukningenär det möjligt att erhålla hållbara kommunikationslösningar med hög prestanda.Den här avhandlingen fokuserar på optimering i trådlösa nätverk och viktiga utmaningar som berör resurstilldelning och aktivering av förbindelser mellan kommunikationsenheter, vilket kan hanteras på olika sätt och där vald strategi ofta har påtaglig inverkan på ett nätverks prestanda. I avhandlingen studeras klassiska problemställningar på nya sätt med hänsyn till alternativa prestandamått samt tekniker som berör interferens. Detär avgörande att förbindelser och reglering av resurser hanteras på ett vettigt och välgenomtänkt sätt och i avhandlingen ges nya förslag på hur detta kanåstadkomma...

show abstract

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Cited by 13 publications

References 36 publications

Optimization of packet forwarding scheduling in wireless ad-hoc networks: Deployment on a 3D environment

Optimization of packet forwarding scheduling in wireless ad-hoc networks: Deployment on a 3D environment

Minimizing end-to-end delay in multi-hop wireless networks with optimized transmission scheduling

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

Contact Info

Product

Resources

About