Improving energy consumption in large scale Wireless Sensor Networks with multiple mobile sinks deployment

被引:0
作者
Slama, Ines [1 ]
Jouaber, Badii [1 ]
Zeghlache, Djamal [1 ]
机构
[1] Inst Natl Telecommun, Wireless Networks & Multimedia Serv Dept, F-91011 Evry, France
来源
WINSYS 2008: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON WIRELESS INFORMATION NETWORKS AND SYSTEMS | 2008年
关键词
large-scale Wireless Sensor Networks; multiple sinks; design parameters; energy efficiency; graph partitioning;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider the multiple sinks placement problem in energy constrained large-scale Wireless Sensor Networks (WSN). First, some fundamental design parameters in WSNs such as nodes deployment, the network architecture, sink velocity and transmission range, are investigated. Each of these parameters is analysed and discussed according to its influence on the energy consumption in a WSN. Second, a simple and efficient approach for the placement of multiple sinks within large-scale WSNs is proposed. The objective is to determine optimal sinks' positions that maximize the network lifetime by reducing energy consumption related to data transmissions from sensor nodes to different sinks. Balanced graph partitioning techniques are used to split the entire WSN into connected sub-networks. Smaller sub-networks are created, having similar characteristics and where energy consumption can be optimized independently but in the same way. Therefore, different approaches and mechanisms that enhance the network lifetime in small-size WSN can be deployed inside each sub-network. Performance results show that the proposed technique significantly enhances the network lifetime.
引用
收藏
页码:29 / 37
页数:9
相关论文
共 23 条
  • [1] Bhardwaj M, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P785, DOI 10.1109/ICC.2001.937346
  • [2] GPS-less low-cost outdoor localization for very small devices
    Bulusu, N
    Heidemann, J
    Estrin, D
    [J]. IEEE PERSONAL COMMUNICATIONS, 2000, 7 (05): : 28 - 34
  • [3] CHAKRABARTI, 2003, IPSN 03
  • [4] Chen C., 2006, WSW'06 at Sensys'06
  • [5] Approximating the maximally balanced connected partition problem in graphs
    Chlebikova, J
    [J]. INFORMATION PROCESSING LETTERS, 1996, 60 (05) : 225 - 230
  • [6] Doherty L, 2001, IEEE INFOCOM SER, P1655, DOI 10.1109/INFCOM.2001.916662
  • [7] Even G, 1997, PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P639
  • [8] GANDHAM SR, 2003, GLOBECOM 03
  • [9] GROSSGLAUSER M, 2001, ACM IEEE T NETWORKIN, V10, P477
  • [10] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
    Ito, Takehiro
    Zhou, Xiao
    Nishizeki, Takao
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2006, 4 (01) : 142 - 154