Energy efficient scheme for large scale wireless sensor networks with multiple sinks

IEEE Wireless Communications and Networking Conference, WCNC

Volumn , Issue , 2008, Pages 2367-2372

  Slama, Ines ^a   Jouaber, Badii ^a   Zeghlache, Djamal ^a  

^a INSTITUT NATIONAL DES TÉLÉCOMMUNICATIONS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY EFFICIENCY; ENERGY UTILIZATION; SENSOR NODES;

BALANCED GRAPH PARTITIONING; ENERGY EFFICIENT; LARGE-SCALE WIRELESS SENSOR NETWORKS; MULTIPLE SINKS; NETWORK LIFETIME; PLACEMENT PROBLEMS; REDUCING ENERGY CONSUMPTION; SUBNETWORKS;

LARGE SCALE SYSTEMS;

EID: 51649107350     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/wcnc.2008.417     Document Type: Conference Paper

References (10)

1. S. Tilak, A. Murphy and W. Heinzelman, "Non-Uniform Information Dissemination for Sensor Networks," Proceedings of the International Conference on Network Protocols (ICNP '03), Nov. 2003.
2. M Grossglauser, D. Tse, "Mobility increases the capacity of ad hoc wireless networks." ACM\IEEE Transactions on Networking 2001; 10(4):477-486.
3. S. R. Gandham et al., "Energy Efficient Schemes for Wireless Sensor Networks With Multiple Mobile Base Stations," Proc. IEEE GLOBECOM, 2003.
4. Haeyong Kim, Yongho Seok, Nakjung Choi, Yanghee Choi and Taekyoung Kwon, "Optimal Multi-sink Positioning and Energy-efficient Routing in Wireless Sensor Networks", Lecture Notes in Computer Science (LNCS), Vol. 3391, pp. 264-274
5. E. I. Oyman, C. Ersoy, "Multiple Sink Network Design Problem in Large Scale Wireless Sensor Networks" In Proc. of ICC 2004, Paris, June 2004.
6. Vincze, K. Fodor, R. Vida, and Attila Vidacs, "Electrostatic Modelling of Multiple Mobile Sinks in Wireless Sensor Networks", Proc. of IFIP Networking Workshop on Performance Control in Wireless Sensor Networks, pp. 30-37, Coimbra, Portugal, 15-19 May 2006.
7. G. Even, J. Naor, S. Rao, and B. Schieber. "Fast approximate graph partitioning algorithms." Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, pages 639-648, 1997.
8. T. Ito, X. Zhou and T. Nishizeki," Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size", Journal of discrete algorithms, Volume 4, Issue 1, March 2006, Pages 142-154.
9. J. Chlebikova. "Approximability of the Maximally balanced connected partition problem in graphs." Inform. Process. Lett., 60:225-230, 1996.
10. D. B. Johnson, D. A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, Vol. 353, pp. 153-181, Chapter 5.