Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
 

Summary: A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop
Wireless Networks
Vinay Kolar and Nael B. Abu-Ghazaleh
CS. Department, Binghamton University
{vinkolar,nael}@cs.binghamton.edu
Abstract
Routing in multi-hop wireless networks is typically
greedy, with every connection attempting to establish a path
that minimizes its number of hops. However, interference
plays a major role in limiting the capacity of such net-
works; this effect is ignored by most existing protocols. It
is likely that approaches that coordinate routing to account
for mutual interference will be able to achieve better per-
formance than traditional approaches. Modeling routing
with interference constraints is a complex non-linear opti-
mization problem. We approach the problem using a Multi
Commodity flow (MCF) formulation. We analyze the in-
teraction of multiple routes and propose effective objective
functions which attempt to maximize interference separa-
tion while limiting path inflation. Initial experimental re-

  

Source: Abu-Ghazaleh, Nael B. - Department of Computer Science, State University of New York at Binghamton

 

Collections: Computer Technologies and Information Sciences