liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding
Politecn Milan.
Politecn Milan.
Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology, Communications and Transport Systems.
2011 (English)In: Ad hoc networks, ISSN 1570-8705, Vol. 9, no 7, 1256-1269 p.Article in journal (Refereed) Published
Abstract [en]

Cooperation schemes form a key aspect of infrastructure-less wireless networks that allow nodes that cannot directly communicate to exchange information through the help of intermediate nodes. The most widely adopted approach is based on hop-by-hop forwarding at the network layer along a path to destination. Cooperative relaying brings cooperation to the physical layer in order to fully exploit wireless resources. The concept exploits channel diversity by using multiple radio units to transmit the same message. The underlying fundamentals of cooperative relaying have been quite well-studied from a transmission efficiency point of view, in particular with a single pair of source and destination. Results of its performance gain in a multi-hop networking context with multiple sources and destinations are, however, less available. In this paper, we provide an optimization approach to assess the performance gain of cooperative relaying vis-a-vis conventional multi-hop forwarding under arbitrary network topology. The approach joint optimizes packet routing and transmission scheduling, and generalizes classical optimization schemes for non-cooperative networks. We provide numerical results demonstrating that the gain of cooperative relaying in networking scenarios is in general rather small and decreases when network connectivity and the number of traffic flows increase, due to interference and resource reuse limitations. In addition to quantifying the performance gain, our approach leads to a new framework for optimizing routing and scheduling in cooperative networks under a generalized Spacial Time Division Multiple Access (STDMA) scheme.

Place, publisher, year, edition, pages
Elsevier Science B. V., Amsterdam , 2011. Vol. 9, no 7, 1256-1269 p.
Keyword [en]
Cooperative networking; Routing and scheduling; Column generation; Cooperative relaying; Optimization
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-69767DOI: 10.1016/j.adhoc.2011.02.002ISI: 000292622200012OAI: diva2:433626
Original Publication: Antonio Capone, Stefano Gualandi and Di Yuan, Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding, 2011, Ad hoc networks, (9), 7, 1256-1269. Copyright: Elsevier Science B. V., Amsterdam from: 2011-08-10 Created: 2011-08-08 Last updated: 2012-06-25

Open Access in DiVA

fulltext(654 kB)283 downloads
File information
File name FULLTEXT01.pdfFile size 654 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Yuan, Di
By organisation
The Institute of TechnologyCommunications and Transport Systems
In the same journal
Ad hoc networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 283 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 98 hits
ReferencesLink to record
Permanent link

Direct link