Cart (Loading....) | Create Account
Close category search window

Online policies for opportunistic virtual MISO routing in wireless ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tapparello, C. ; Dept. of Inf. Eng., Univ. of Padova, Padova, Italy ; Tomasin, S. ; Rossi, M.

Cooperative routing has been shown to be an effective technique to improve the throughput/delay performance of multi-hop wireless ad hoc networks. In addition, suitable cooperation selection policies also allow for a reduction of the overall energy expenditure. In a previous study, we proposed a centralized algorithm to obtain optimal cooperation selection policies in multi-hop networks with the aim of minimizing a linear combination of energy and delay costs. In this paper, we look at this problem from a different angle, devising three online and fully distributed algorithms which only exploit local interactions for the selection of the cooperators. The first technique selects at each hop a fixed number of nodes having the minimum distance with respect to the destination. The second one adopts a look-ahead strategy, which selects a fixed number of nodes at each hop, according to their expected advancement toward the destination. The third technique utilizes a more refined look-ahead strategy, which dynamically adjusts the number of nodes that cooperate at each hop. Numerical results are thus presented for the proposed techniques, comparing them against the optimal centralized strategy and competing algorithms from the literature. These results indicate that our techniques improve upon existing distributed approaches and achieve close-to-optimal performance.

Published in:

Wireless Communications and Networking Conference (WCNC), 2012 IEEE

Date of Conference:

1-4 April 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.