## Impact of interference on multi-hop wireless network performance (2003)

### Cached

### Download Links

- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.research.microsoft.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 403 - 9 self |

### BibTeX

@INPROCEEDINGS{Jain03impactof,

author = {Kamal Jain and Jitendra Padhye and Venkata N. Padmanabhan and Lili Qiu},

title = {Impact of interference on multi-hop wireless network performance},

booktitle = {},

year = {2003},

pages = {66--80}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

2552 | Dynamic Source Routing in Ad Hoc Wireless Networks
- Johnson, Maltz
- 1996
(Show Context)
Citation Context ...till, the bound is not guaranteed to converge to the optimal even if we include all such sets. 3.4 Single-path Routing So far we have considered multipath routing. As many existing routing algorithms =-=[18, 24, 23, 22-=-] are conned to single-path routing, it is useful to derive a throughput bound for single-path so that we can compare how much the current protocols deviate from the theoretical achievable throughput ... |

2487 | Ad hoc OnDemand Distance Vector Routing
- Perkins, Royer
(Show Context)
Citation Context ...till, the bound is not guaranteed to converge to the optimal even if we include all such sets. 3.4 Single-path Routing So far we have considered multipath routing. As many existing routing algorithms =-=[18, 24, 23, 22-=-] are conned to single-path routing, it is useful to derive a throughput bound for single-path so that we can compare how much the current protocols deviate from the theoretical achievable throughput ... |

2420 | The capacity of wireless networks
- Gupta, Kumar
- 2000
(Show Context)
Citation Context ...of the networking stack. In recent years, there has also been a focus on the fundamental question of what the optimal capacity of a multi-hop wireless network is. The seminal paper by Gupta and Kumar =-=[16-=-] showed that in a network comprising of n identical nodes, each of which is communicating with another node, the throughput capacity per node is ( 1 p n log n ) assuming random node placement and com... |

1670 | Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers
- Perkins, Bhagwat
- 1994
(Show Context)
Citation Context ...till, the bound is not guaranteed to converge to the optimal even if we include all such sets. 3.4 Single-path Routing So far we have considered multipath routing. As many existing routing algorithms =-=[18, 24, 23, 22-=-] are conned to single-path routing, it is useful to derive a throughput bound for single-path so that we can compare how much the current protocols deviate from the theoretical achievable throughput ... |

978 | Next century challenges: Scalable coordination in sensor networks
- Estrin, Govindan, et al.
- 1999
(Show Context)
Citation Context ...networks [1, 3] are multi-hop wireless networks that provide \last-mile" access to peoples' homes. This approach is an alternative to to cable modem and DSL technologies. In large networks of sen=-=sors [10]-=- the scale and the environment are such that a multi-hop wireless network is the only feasible means of communication. A fundamental issue in multi-hop wireless networks is that performance degrades s... |

950 | A highly adaptive distributed routing algorithm for mobile wireless networks
- Park, Corson
- 1997
(Show Context)
Citation Context |

914 | Mobility increases the capacity of ad hoc wireless networks
- Grossglauser, Tse
(Show Context)
Citation Context ... Subsequent work has considered alternative models and settings, such as the presence of relay nodes and mobile nodes, and locality in inter-node communication, and their results are less pessimistic =-=[13, 20, 12]-=-. This paper also deals with the problem of computing the optimal throughput of a wireless network. However, a key distinction of our work from previous work such as [16] is that we work with any give... |

513 | Capacity of ad hoc wireless networks
- Li, Blake, et al.
- 2001
(Show Context)
Citation Context ... Subsequent work has considered alternative models and settings, such as the presence of relay nodes and mobile nodes, and locality in inter-node communication, and their results are less pessimistic =-=[13, 20, 12]-=-. This paper also deals with the problem of computing the optimal throughput of a wireless network. However, a key distinction of our work from previous work such as [16] is that we work with any give... |

418 |
The ALOHA system | another alternative for computer communications
- Abramson
- 1970
(Show Context)
Citation Context ... a fee. MobiCom'03, September 14--19, 2003, San Diego, California, USA. Copyright 2003 ACM 1-58113-753-2/03/0009 ...$5.00. 1. INTRODUCTION Multi-hop wireless networks have been studied since the 70's =-=[6]. Sev-=-eral new applications of such networks have recently emerged. Community wireless networks [1, 3] are multi-hop wireless networks that provide \last-mile" access to peoples' homes. This approach i... |

398 | A Polynomial Algorithm in Linear Programming - Khachiyan - 1979 |

389 | The Ellipsoid Method and Its Consequences in Combinatorial Optimization - Grotschel, Lovasz, et al. - 1981 |

334 | Maximum matchings and a polyhedron with 0, 1 vertices - Edmonds - 1965 |

195 | On The Capacity Of Wireless Networks: The Relay Case
- Gastpar, Vetterli
- 2002
(Show Context)
Citation Context ... Subsequent work has considered alternative models and settings, such as the presence of relay nodes and mobile nodes, and locality in inter-node communication, and their results are less pessimistic =-=[13, 20, 12]-=-. This paper also deals with the problem of computing the optimal throughput of a wireless network. However, a key distinction of our work from previous work such as [16] is that we work with any give... |

190 | Acheiving mac layer fairness in wireless packet networks
- Nandagopal, Kim, et al.
- 2000
(Show Context)
Citation Context ...eason — because wireless interference limits throughput, a circuitous but less interference-prone route, say along the periphery of a network, may perform better than the shortest hop count route. In =-=[23]-=-, Nandagopal et. al. use a construct similar to conflict graphs, called flow contention graph to capture interference in wireless networks. However, as the name implies, the construct is defined on fl... |

140 | Performance of multihop wireless networks: shortest path is not enough
- Couto, Aguayo, et al.
(Show Context)
Citation Context ...network coding in this context is a promising line of research, we note that the point-to-point coding model corresponds to current radio technology such as 802.11. The recent work of De Couto et al. =-=[9]-=-, based on two experiments in a 802.11b-based multi-hop wireless testbeds shows that minimizing the hop count of an end-to-end path is not sucient for achieving good performance. The reason they point... |

43 | Priority Scheduling in Wireless Ad-hoc Networks
- Yang, Vaidya
- 2009
(Show Context)
Citation Context ...less interference limits capacity, a circuitous but less interference-prone route, say along the periphery of a network, may perform better than the shortest hop count route. Finally, Yang and Vaidya =-=[25] int-=-roduce the notion of a \con ict graph" in the context of their work on priority scheduling in wireless ad hoc networks. However, the con ict graph is dened onsows rather than links, and is used o... |

20 |
area wireless users group. http://www.bawug.org
- Bay
(Show Context)
Citation Context ...-753-2/03/0009 ...$5.00. 1. INTRODUCTION Multi-hop wireless networks have been studied since the 70's [6]. Several new applications of such networks have recently emerged. Community wireless networks =-=[1, 3] are -=-multi-hop wireless networks that provide \last-mile" access to peoples' homes. This approach is an alternative to to cable modem and DSL technologies. In large networks of sensors [10] the scale ... |

11 | Geometric methods in combinatorial optimization - Grotschel, Lovász, et al. - 1984 |

9 |
Charaterizing achievable rates in multi-hop wireless networks: The joint routing and scheduling problem
- Kodialam, Nandagopal
- 2003
(Show Context)
Citation Context ...es flows with a high degree of conflict to suffer disproportionately compared to flows with a low degree of conflict. There is no attempt to analyze the conflict graph to derive throughput bounds. In =-=[19]-=-, Kodialam and Nandagopal consider the problem of computing optimal throughput for a given wireless network with a given traffic pattern. They assume a limited model of interference in which the only ... |

6 | R.Thomas. The strong perfect graph theorem - Chudnovsky, Robertson, et al. |

5 |
lp solve: linear programming code. ftp://ftp.ics. ele.tue.nl/pub/lp solve
- Berkelaar
(Show Context)
Citation Context ...hesrst and the third condition ensure that at node n i at most one z ij will have a value of 1. In theory, solving integer linear program is a NP-hard [11], but in practice, programs such as lp solve =-=[7]-=- and CPLEX [5] can solve mixed-integer problems. 3.5 Other Generalization The basic con ict graph model is quitesexible, and can be generalized in many ways. Multiple Source-Destination Pairs: We can ... |

4 |
Computers and Intracctability: A guide to the theory of NP completness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...the maximum value of D that is feasible. To help tighten the lower bound more quickly, we should consider using maximal independence sets. Whilesnding all maximal independent sets is also NP-complete =-=[11]-=-, the lower bound obtained by considering a subset of the (maximal) independent sets has the nice property that as we add more constraints, the bound becomes tighter, eventually converging to the opti... |

2 |
Lp solve - incremental version. http://contraintes.inria.fr/˜haemmerl/lp solve inc
- Haemmerlé
(Show Context)
Citation Context ...e changes to the objective function (i.e., links between sources and their neighbors remain the same or links between sinks and their neighbors remain the same), then LP solvers, such as lp solve inc =-=[16]-=-, can take advantage of incremental changes in the linear constraints, and more efficiently derive solution to the new LP than solving it starting from scratch. Similarly, to derive a new upper bound,... |