Connectivity, coverage and power consumption in large-scale wireless sensor networks

被引:30
|
作者
Wang, Hui [1 ]
Roman, H. Eduardo [2 ]
Yuan, Liyong [1 ,3 ]
Huang, Yongfeng
Wang, Rongli [1 ]
机构
[1] Zhejiang Normal Univ, Coll Math Phys & Informat Engn, Jinhua, Peoples R China
[2] Univ Milano Bicocca, Dipartimento Fis, I-20126 Milan, Italy
[3] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou 310023, Zhejiang, Peoples R China
关键词
Wireless sensor networks; Connectivity; Coverage; Nodes switching off; Power control;
D O I
10.1016/j.comnet.2014.10.008
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor networks (WSNs) are typically constituted by a large number of connected sensors (nodes), generally distributed at random on a given surface area. In such large-scale networks, the desired global system performance is achieved by gathering local information and decisions collected from each individual node. There exist three fundamental global issues on WSNs that we consider here, namely, full network connectivity, high coverage of the sensing area and reduced power consumption, thus improving on the network lifetime. Full connectivity can be obtained either by increasing the transmission range, at the expense of consuming higher transmission power, or by increasing the number of sensors, i.e. by increasing network costs. Both of them are closely related to global network lifetime, in the sense that the higher the power consumption or the more the number of active sensors present, the shorter the network lifetime (Wang et al., 2007) [1]. Here, we are interested in the minimal number of active nodes required for keeping the network functioning, while the problem of redundancy, i.e. having additional nodes kept in a sleeping mode for a certain period of time, can be implemented afterwards based on the present 'minimal' results. So the main question is, how can one design large-scale random networks in order to have both global connectivity and minimum number of active nodes reducing the total energy consumption? Although these questions have been addressed often in the past, a definite, simple predicting algorithm for achieving these goals does not exist so far. In this paper, we aim to discuss such a scheme and confront it with extensive simulations of random networks generated numerically. Specifically, we study the minimum number of nodes required to achieve full network connectivity, and present an analytical formula for estimating it. The results are in very good agreement with the numerical simulations as a function of transmission range. We also discuss results on how to further diminish network energy consumption by switching off some of the active nodes at random by keeping the connectivity of the whole network. The present results are expected to be useful for the design of more efficient WSNs. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:212 / 225
页数:14
相关论文
共 50 条
  • [1] On the coverage and connectivity of a large-scale random wireless sensor network
    Chen, D
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING, 2004, : 488 - 492
  • [2] A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks
    Jerbi, Wassim
    Guermazi, Abderrahmen
    Trabelsi, Hafedh
    INTERNATIONAL JOURNAL OF BUSINESS DATA COMMUNICATIONS AND NETWORKING, 2015, 11 (02) : 1 - 21
  • [3] On the Connectivity of Large-Scale Hybrid Wireless Networks
    Yi, Chi
    Wang, Wenye
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [4] Connectivity properties of large-scale sensor networks
    Pishro-Nik, Hossein
    Chan, Kevin
    Fekri, Faramarz
    WIRELESS NETWORKS, 2009, 15 (07) : 945 - 964
  • [5] Connectivity properties of large-scale sensor networks
    Hossein Pishro-Nik
    Kevin Chan
    Faramarz Fekri
    Wireless Networks, 2009, 15 : 945 - 964
  • [6] On connectivity properties of large-scale sensor networks
    Pishro-Nik, H
    Chan, KS
    Fekri, F
    2004 FIRST ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR AND AD HOC COMMUNICATIONS AND NETWORKS, 2004, : 498 - 507
  • [7] Stochastic sleeping with sink-oriented connectivity and coverage in large-scale sensor networks
    Shi, Gaotao
    Liao, Minghong
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2007, 20 (07) : 809 - 828
  • [8] Effect of Heterogeneity on Coverage, Energy Consumption and Connectivity of Wireless Sensor Networks
    Imani, Amirhosein
    Eslami, Mohsen
    2017 25TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE), 2017, : 1923 - 1928
  • [9] Adaptively Directional Wireless Power Transfer for Large-Scale Sensor Networks
    Wang, Zhe
    Duan, Lingjie
    Zhang, Rui
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2016, 34 (05) : 1785 - 1800
  • [10] Coverage with connectivity in wireless sensor networks
    Liu, Xin
    2006 3RD INTERNATIONAL CONFERENCE ON BROADBAND COMMUNICATIONS, NETWORKS AND SYSTEMS, VOLS 1-3, 2006, : 927 - 934