Strong minimum energy $$2$$2-hop rooted topology for hierarchical wireless sensor networks
暂无分享,去创建一个
[1] Bernhard Fuchs. On the Hardness of Range Assignment Problems , 2006, CIAC.
[2] Xiuzhen Cheng,et al. Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics , 2003, IEEE Trans. Mob. Comput..
[3] Andrea E. F. Clementi,et al. Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.
[4] Peng-Jun Wan,et al. Range Assignment for High Connectivity in Wireless Ad Hoc Networks , 2003, ADHOC-NOW.
[5] Gregory J. Pottie,et al. Wireless integrated network sensors , 2000, Commun. ACM.
[6] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[7] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[8] Xiaohua Jia,et al. Power Assignment for k-Connectivity in Wireless Ad Hoc Networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[9] Zeev Nutov. Approximating Minimum-Power k-Connectivity , 2010, Ad Hoc Sens. Wirel. Networks.
[10] Madhav V. Marathe,et al. Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..
[11] Laurent Alfandari,et al. Approximating minimum spanning tree of depth 2 , 1999 .
[12] Andrea E. F. Clementi,et al. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks , 2001 .
[13] Ernst Althaus,et al. Approximating k-hop minimum-spanning trees , 2005, Oper. Res. Lett..
[14] Viggo Kann,et al. Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.
[15] Guido Proietti,et al. On the complexity of minimizing interference in ad-hoc and sensor networks , 2008, Theor. Comput. Sci..
[16] Satish Kumar,et al. Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.