Algorithmic models for sensor networks
暂无分享,去创建一个
[1] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[2] Andrea E. F. Clementi,et al. On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.
[3] Roger Wattenhofer,et al. Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.
[4] Lali Barrière,et al. Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.
[5] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[6] Ashwin Sampath,et al. Signal‐to‐interference‐plus‐noise ratio estimation for wireless communication systems: Methods and analysis , 2004 .
[7] Roger Wattenhofer,et al. Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.
[8] Roger Wattenhofer,et al. Constant-time distributed dominating set approximation , 2003, PODC '03.
[9] Mani Srivastava,et al. Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..
[10] Theodore S. Rappaport,et al. Wireless communications - principles and practice , 1996 .
[11] Roger Wattenhofer,et al. Coloring unstructured radio networks , 2005, SPAA '05.
[12] Xiang-Yang Li,et al. Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[13] Roger Wattenhofer,et al. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.
[14] Madhav V. Marathe,et al. Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .
[15] Roger Wattenhofer,et al. On the locality of bounded growth , 2005, PODC '05.
[16] Roger Wattenhofer,et al. Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[17] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[18] Jing Deng,et al. Wireless ad hoc networks , 2003 .
[19] Leandros Tassiulas,et al. Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[20] Deborah Estrin,et al. Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .
[21] Roger Wattenhofer,et al. The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[22] 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.
[23] Friedhelm Meyer auf der Heide,et al. Energy, congestion and dilation in radio networks , 2002, SPAA '02.
[24] Ivan Stojmenovic,et al. Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer , 2005, IEEE Communications Magazine.
[25] Fabian Kuhn,et al. Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.
[26] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[27] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[28] Jörg Widmer,et al. Trade-off analysis of PHY-Aware MAC in low-rate low-power UWB networks , 2005, IEEE Communications Magazine.
[29] Patrick Thiran,et al. Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.