Efficient and Resilient Backbones for Multihop Wireless Networks
暂无分享,去创建一个
Samir Khuller | Aravind Srinivasan | Seungjoon Lee | Bobby Bhattacharjee | S. Khuller | A. Srinivasan | Seungjoon Lee | Bobby Bhattacharjee
[1] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.
[2] Thomas R. Gross,et al. Simulation of large ad hoc networks , 2003, MSWIM '03.
[3] David A. Maltz,et al. Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.
[4] Peng-Jun Wan,et al. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[5] Mingyan Liu,et al. Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[6] Voon Chin Phua,et al. Wireless lan medium access control (mac) and physical layer (phy) specifications , 1999 .
[7] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[8] Jennifer C. Hou,et al. FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.
[9] Deborah Estrin,et al. An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[10] 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).
[11] Jie Wu,et al. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.
[12] Deborah Estrin,et al. Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.
[13] Aravind Srinivasan,et al. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..
[14] Martin Nilsson,et al. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[15] Philippe Jacquet,et al. Optimized Link State Routing Protocol (OLSR) , 2003, RFC.
[16] Robert Tappan Morris,et al. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.
[17] Aravind Srinivasan,et al. Finding Large Independent Sets in Graphs and Hypergraphs , 2005, SIAM J. Discret. Math..
[18] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[19] Paramvir Bahl,et al. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.
[20] Ossama Younis,et al. Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.
[21] Alessandro Panconesi,et al. Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.
[22] Mario Gerla,et al. Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.
[23] Robert Tappan Morris,et al. a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.
[24] Deborah Estrin,et al. ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.
[25] Philippe Flajolet,et al. Analysis of algorithms , 2000, Random Struct. Algorithms.
[26] C. Fortuin,et al. Correlation inequalities on some partially ordered sets , 1971 .
[27] Leonidas J. Guibas,et al. Discrete mobile centers , 2001, SCG '01.
[28] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.
[29] Lujun Jia,et al. An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.
[30] Rong Zheng,et al. On-demand power management for ad hoc networks , 2005, Ad Hoc Networks.
[31] Jie Wu,et al. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2001, Journal of Communications and Networks.
[32] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[33] Roger Wattenhofer,et al. Initializing newly deployed ad hoc and sensor networks , 2004, MobiCom '04.
[34] Vaduvur Bharghavan,et al. Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.
[35] Suresh Singh,et al. PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.
[36] Seungjoon Lee,et al. Backbone construction in selfish wireless networks , 2007, SIGMETRICS '07.
[37] Sartaj Sahni,et al. Analysis of Algorithms , 2004, Handbook of Data Structures and Applications.
[38] Paolo Santi,et al. Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks , 2002, MobiCom '02.
[39] Robert Tappan Morris,et al. Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.