Topology control and routing in ad hoc networks: a survey
暂无分享,去创建一个
[1] Brad Karp,et al. GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.
[2] Cynthia Dwork,et al. Distributed computing column , 1989, SIGA.
[3] Cyril Leung,et al. Capture models for mobile packet radio networks , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.
[4] Allan Borodin,et al. Adversarial queueing theory , 1996, STOC '96.
[5] James A. Freebersyser,et al. A DoD perspective on mobile Ad hoc networks , 2001 .
[6] Shay Kutten,et al. Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.
[7] Friedhelm Meyer auf der Heide,et al. Energy, congestion and dilation in radio networks , 2002, SPAA '02.
[8] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[9] Uriel Feige. A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.
[10] Charles E. Perkins,et al. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.
[11] Srikanth V. Krishnamurthy,et al. Distributed power control in ad-hoc wireless networks , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).
[12] Cyril Gavoille,et al. Routing in distributed networks: overview and open problems , 2001, SIGA.
[13] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[14] Zygmunt J. Haas,et al. The performance of query control schemes for the zone routing protocol , 2001, TNET.
[15] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[16] Christian Scheideler. Models and Techniques for Communication in Dynamic Networks , 2002, STACS.
[17] M. S. Corson,et al. A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.
[18] Jeffrey S. Salowe. Euclidean Spanner Graphs with Degree Four , 1994, Discret. Appl. Math..
[19] Bruce M. Maggs,et al. Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.
[20] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[21] Theodore S. Rappaport,et al. Wireless communications - principles and practice , 1996 .
[22] David Eppstein,et al. Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.
[23] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[24] Vijay V. Vazirani,et al. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..
[25] Teresa H. Meng,et al. Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[26] Martha Steenstrup,et al. Cluster-based networks , 2001 .
[27] Jean C. Walrand,et al. High-performance communication networks , 1999 .
[28] Xiang-Yang Li,et al. Distributed spanner with bounded degree for wireless ad hoc networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[29] Zygmunt J. Haas,et al. Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[30] David Peleg,et al. Sparse communication networks and efficient routing in the plane (extended abstract) , 2000, PODC '00.
[31] Baruch Awerbuch,et al. Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[32] Baruch Awerbuch,et al. Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..
[33] David A. Maltz,et al. Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.
[34] Charles E. Perkins,et al. Ad hoc networking: an introduction , 2001 .
[35] Shay Kutten,et al. Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.
[36] Li Li,et al. Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[37] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[38] John M. Mcquillan,et al. Adaptive routing algorithms for distributed computer networks , 1974 .
[39] David Tse,et al. Mobility increases the capacity of wireless adhoc networks , 2002 .
[40] Xiang-Yang Li,et al. Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[41] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[42] Bonnie Berger,et al. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..
[43] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..
[44] J. Broch,et al. Dynamic source routing in ad hoc wireless networks , 1998 .
[45] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[46] David A. Maltz,et al. A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.
[47] Paramvir Bahl,et al. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.
[48] Farouk Kamoun,et al. Stochastic Performance Evaluation of Hierarchical Routing for Large Networks , 1979, Comput. Networks.
[49] David Peleg,et al. Sparse communication networks and efficient routing in the plane , 2001, Distributed Computing.
[50] Christian Scheideler,et al. Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[51] Michiel H. M. Smid,et al. Efficient Construction of a Bounded Degree Spanner with Low Weight , 1994, ESA.
[52] YU WANG,et al. Distributed Spanners with Bounded Degree for Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..
[53] Rajmohan Rajaraman,et al. Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.
[54] Mario Gerla,et al. Clustering with power control , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).
[55] Xiang-Yang Li,et al. Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[56] R. Rajaraman,et al. An efficient distributed algorithm for constructing small dominating sets , 2002 .
[57] Christian Scheideler,et al. Efficient communication strategies for ad-hoc wireless networks (extended abstract) , 1998, SPAA '98.
[58] Charles E. Perkins,et al. Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.
[59] Anthony Ephremides,et al. On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).