Energy Efficient Scheme for Large Scale Wireless Sensor Networks with Multiple Sinks
暂无分享,去创建一个
[1] Janka Chlebíková,et al. Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..
[2] Cem Ersoy,et al. Multiple sink network design problem in large scale wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[3] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[4] Takehiro Ito,et al. Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size , 2006, J. Discrete Algorithms.
[5] David A. Maltz,et al. Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.
[6] Wendi Heinzelman,et al. Non-uniform information dissemination for sensor networks , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..
[7] Yanghee Choi,et al. Optimal Multi-sink Positioning and Energy-Efficient Routing in Wireless Sensor Networks , 2005, ICOIN.
[8] Milind Dawande,et al. Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[9] K. Fodor,et al. Electrostatic Modelling of Multiple Mobile Sinks in Wireless Sensor Networks , 2006 .
[10] Joseph Naor,et al. Fast approximate graph partitioning algorithms , 1997, SODA '97.