Impact Of Interference On Multi-hop Wireless Network Performance

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2003, Pages 66-80

  Jain, Kamal ^a   Padhye, Jitendra ^a   Padmanabhan, Venkata N ^a   Qiu, Lili ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Interference; Multi hop; Performance; Wireless

Indexed keywords

COMPUTER SIMULATION; MATRIX ALGEBRA; PACKET NETWORKS; SIGNAL INTERFERENCE; TELECOMMUNICATION TRAFFIC; THROUGHPUT; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

MULTI-HOP; WIRELESS NODES;

TELECOMMUNICATION NETWORKS;

EID: 1542299160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/938985.938993     Document Type: Conference Paper

References (27)

1. ABRAMSON, N. THE ALOHA SYSTEM - Another Alternative for Computer Communications". Proc. AFIPS Fall Joint Computer Conference (1970), 281-285.
2. Bay area wireless users group. http://www.bawug.org/.
3. BERKELAAR, M. lp_solve: linear programming code. ftp://ftp.ics.ele.tue.nl/pub/lp_solve/.
4. CHAVTAL, V. Linear Programming. W. H. Freeman and Compnay, 1983.
5. COUTO, D. S. J. D., AGUAYO, D., CHAMBERS, B. A., AND MORRIS, R. Performance of multihop wireless networks: Shortest path is not enough. In 1st Workshop on Hot Topics in Networks (Oct. 2002).
6. Ilog cplex suite, 2003. http://www.ilog.com/products/cplex/.
7. ESTRIN, D., GOVINDAN, R., HEIDEMANN, J., AND KUMAR, S. Next century challenges: Scalable coordination in sensor networks. In ACM MOBICOM (Aug. 1999).
8. GAREY, M. R., AND JOHNSON, D. S. Computers and Intracctability: A guide to the theory of NP completness. W. H. Freeman and Company, 1979.
9. GASTPAR, M., AND VETTERLI, M. On the capacity of wireless networks: the relay case. In IEEE INFOCOM (Jun. 2002).
10. GROSSGLAUSER, M., AND TSE, D. Mobility increases the capacity of ad-hoc wireless networks. In IEEE INFOCOM (Apr. 2001).
11. GROTSCHEL, M., LOVASZ, L., AND SCHRIJVER, A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981), 169-197.
12. GROTSCHEL, M., LOVASZ, L., AND SCHRIJVER, A. Geometric Methods in Combinatorial Optimization. Academic Press, 1984.
13. GUPTA, P., AND KUMAR, P. R. The capacity of wireless networks. IEEE Transactions on Information Theory 46, 2 (Mar. 2000).
14. GUPTA,P., AND KUMAR,P.R. The capacity of wireless networks. IEEE Transactions on Information Theory 46,2 (Mar. 2000), 388-404.
15. JOHNSON,D.B., AND MALTZ,D.A. Dynamic source routing in ad-hoc wireless networks. In Mobile Computing (1996),T. Imielinski andH. Korth, Eds., Kluwer Academic Publishers.
16. KHACHIYAN,L.G. A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20 (1979), 191-194.
17. KODIALAM,M., AND NANDAGOPAL,T. Charaterizing achievable rates in multi-hop wireless newtorks: The joint routing and scheduling problem. In ACM MOBICOM (Sep. 2003).
18. LI, J., BLAKE, C., COUTO, D. S. J. D., LEE, H. I., AND MORRIS, R. Capacity of ad hoc wireless networks. In ACM MOBICOM (Jul. 2001).
19. Matlab version 6.1. http://www.matlab.com/.
20. M. CHUDNOVSKY, ROBERTSON, N., P.D.SEYMOUR, AND R.THOMAS. The Strong Perfect Graph Theorem. Submitted for publication., February 2003.
21. NANDAGOPAL, T., KIM, T., GAO, X., AND BHARGHAVAN, V. Achieving mac layer fairness in wireless packet networks. In ACM MOBICOM (Aug. 2000).
22. Ns-2 (network simulator), 1995. http://www-mash.cs.berkeley.edu/ns/.
23. PARK, V. D., AND CORSON, M. S. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. of IEEE INFOCOM'97 (Apr. 1997).
24. PERKINS, C. E., AND BHAGWAT, P. Highly dynamic destination-sequenced distance vector routing (dsdv) for mobile computeres. In Proc. of ACM SIGCOMM'94 (Sep. 1994).
25. PERKINS, C. E., AND ROYER, E. M. Ad-hoc on-demand distance vector routing. In Proc. of IEEE WMCSA'99 (Feb. 1999).
26. Seattle wireless, http://www.seattlewireless.net/.
27. YANG, X., AND VAIDYA, N. H. Priority scheduling in wireless ad hoc networks. In ACM MobiHoc (June 2002).