By Topic

Optimization of routing, network coding and scheduling in wireless multicast ad-hoc networks with topology compression

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

2 Author(s)
Karami, E. ; Centre for Wireless Commun. (CWC), Univ. of Oulu, Oulu, Finland ; Glisic, S.

In this paper, we present new methodology and results for joint routing and link scheduling optimization in multicast wireless ad-hoc networks. The impact of multicast diversity on scheduling is controlled by using topology compression concept quantified through compressed multicast topology matrix. To define topology matrix, first a set of all possible multicast paths, including network coded paths, is identified. A subset of these paths with appropriate rates is chosen to maximize achievable throughput or throughput per sum of transmitting powers on the route, in a conflict free environment created by proper scheduling. Therefore this optimization provides two improvement gains, throughput gain from scheduling on a compressed network topology and the gain from mixed path selection optimizations with a careful compromise between the multicast diversity and network coding. Numerical results, as illustration, are presented for a simple wireless butterfly network. If just throughput regardless of power consumption is maximized, then depending on the system parameters both a network coded structure or a plain routing can be optimum. On the other hand if throughput per power is maximized, a mixed set of plain routing paths is the optimum solution.

Published in:

Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on

Date of Conference:

13-16 Sept. 2009