Impact of Interference on Multi-Hop Wireless Network Performance
暂无分享,去创建一个
Lili Qiu | Jitendra Padhye | Venkata N. Padmanabhan | Kamal Jain | K. Jain | V. Padmanabhan | J. Padhye | L. Qiu
[1] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[2] Norman M. Abramson,et al. THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[5] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[7] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[8] Martin Grötschel,et al. Geometric Methods in Combinatorial Optimization , 1984 .
[9] David A. Maltz,et al. Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.
[10] Charles E. Perkins,et al. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.
[11] Charles E. Perkins,et al. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.
[12] M. S. Corson,et al. A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.
[13] J. Broch,et al. Dynamic source routing in ad hoc wireless networks , 1998 .
[14] Charles E. Perkins,et al. Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.
[15] Satish Kumar,et al. Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.
[16] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[17] Vaduvur Bharghavan,et al. Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.
[18] Robert Tappan Morris,et al. Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.
[19] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[20] Nitin H. Vaidya,et al. Priority Scheduling in Wireless Ad Hoc Networks , 2002, MobiHoc '02.
[21] Michael Gastpar,et al. On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[22] P. Kumar,et al. Capacity of Ad Hoc Wireless Networks , 2002 .
[23] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.
[24] Murali S. Kodialam,et al. Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.
[25] Robert Tappan Morris,et al. Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.