Abstract
In this paper, we address the following question: given a specific placement of wireless nodes in physical space and a specific traffic workload, what is the maximum throughput that can be supported by the resulting network? Unlike previous work that has focused on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, we work with any given network and workload specified as inputs.
A key issue impacting performance is wireless interference between neighboring nodes. We model such interference using a conflict graph, and present methods for computing upper and lower bounds on the optimal throughput for the given network and workload. To compute these bounds, we assume that packet transmissions at the individual nodes can be finely controlled and carefully scheduled by an omniscient and omnipotent central entity, which is unrealistic. Nevertheless, using ns-2 simulations, we show that the routes derived from our analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention. This suggests that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Abramson, THE ALOHA SYSTEM — Another Alternative for computer communications, in: Proc. AFIPS Fall Joint Computer Conference (1970) pp. 281–285.
Bay area wireless users group, http://www.bawug.org/.
M. Berkelaar, lp_solve: linear programming code. ftp://ftp.ics.ele.tue.nl/pub/lp-solve/.
V. ChavtaL, Linear Programming (W.H. Freeman and Compnay, 1983).
M. Chudnovsky, N. Robertson, P.D. Seymour and R. Thomas, The Strong Perfect Graph Theorem Submitted for publication (February 2003).
D.S.J.D. Couto, D. Aguayo, B.A. Chambers and R. Morris, Performance of multihop wireless networks: Shortest path is not enough, in: 1st Workshop on Hot Topics in Networks (Oct. 2002).
J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards B69 (1965) 125–130.
D. Estrin, R. Govindan, J. Heidemann and S. Kumar, Next century challenges: Scalable coordination in sensor networks, in: ACM MOBICOM (Aug. 1999).
M.R. Garey and D.S. Johnson, Computers and Intracctability: A guide to the theory of NP completness (W.H. Freeman and Company, 1979).
M. Gastpar and M. Vetterli, On the capacity of wireless networks: The relay case, in: IEEE INFOCOM (Jun. 2002).
M. Grossglauser and D. Tse, Mobility increases the capacity of ad-hoc wireless networks, in: IEEE INFOCOM (Apr. 2001).
M. Grotschel, L. Lovasz and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 169–197.
M. Grotschel, L. Lovasz and A. Schrijver, Geometric Methods in Combinatorial Optimization (Academic Press, 1984).
P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46(2) (Mar. 2000).
P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46(2) (2000) 388–404.
R. Haemmerlé, Lp solve—incremental version. http://contraintes. inria.fr haemmerl/lp_solve_inc/.
Ilog cplex suite, (2003). http://www.ilog.com/products/cplex/.
D.B. Johnson and D.A. Maltz, Dynamic source routing in ad-hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic Publishers, 1996).
L.G. Khachiyan, A polynomial algorithm in linear programming, Soviet Mathematics Doklady 20 (1979) 191–194.
M. Kodialam and T. Nandagopal, Charaterizing achievable rates in multi-hop wireless newtorks: The joint routing and scheduling problem, in: ACM MOBICOM (Sep. 2003).
J. Li, C. Blake, D.S.J.D. Couto, H.I. Lee and R. Morris, Capacity of ad hoc wireless networks, in: ACM MOBICOM (July 2001).
Matlab version 6.1. http://www.matlab.com/.
T. Nandagopal, T. Kim, X. Gao and V. Bharghavan, Achieving mac layer fairness in wireless packet networks, in: ACM MOBICOM (Aug. 2000).
Ns-2 (network simulator) (1995). http://www-mash.cs.berkeley.edu/ns/.
V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proc. of IEEE INFOCOM’97 (Apr. 1997).
C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance vector routing (dsdv) for mobile computeres, in: Proc. of ACM SIGCOMM’94 (Sep. 1994).
C.E. Perkins and E.M. Royer, Ad-hoc on-demand distance vector routing, in: Proc. of IEEE WMCSA’99 (Feb. 1999).
Seattle wireless, http://www.seattlewireless.net/.
X. Yang and N.H. Vaidya, Priority scheduling in wireless ad hoc networks, in: ACM MobiHoc (June 2002).
Author information
Authors and Affiliations
Additional information
Kamal Jain Email: kamalj@microsoft.com
Jitendra Padhye Email: padhye@microsoft.com
Venkata N. Padmanabhan Email: padmanab@microsoft.com
Lili Qiu Email: liliq@microsoft.com
Rights and permissions
About this article
Cite this article
Jain, K., Padhye, J., Padmanabhan, V.N. et al. Impact of Interference on Multi-Hop Wireless Network Performance. Wireless Netw 11, 471–487 (2005). https://doi.org/10.1007/s11276-005-1769-9
Issue Date:
DOI: https://doi.org/10.1007/s11276-005-1769-9