Nature of Computation and Communication. International Conference, ICTCC 2014, Ho Chi Minh City, Vietnam, November 24-25, 2014, Revised Selected Papers

Research Article

Maximizing the Lifetime of Wireless Sensor Networks with the Base Station Location

Download
250 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-15392-6_11,
        author={Nguyen Tung and Dinh Ly and Huynh Binh},
        title={Maximizing the Lifetime of Wireless Sensor Networks with the Base Station Location},
        proceedings={Nature of Computation and Communication. International Conference, ICTCC 2014, Ho Chi Minh City, Vietnam, November 24-25, 2014, Revised Selected Papers},
        proceedings_a={ICTCC},
        year={2015},
        month={2},
        keywords={Base Station Location Wireless Sensor Network Routing Non-Linear Programming},
        doi={10.1007/978-3-319-15392-6_11}
    }
    
  • Nguyen Tung
    Dinh Ly
    Huynh Binh
    Year: 2015
    Maximizing the Lifetime of Wireless Sensor Networks with the Base Station Location
    ICTCC
    ICST
    DOI: 10.1007/978-3-319-15392-6_11
Nguyen Tung1,*, Dinh Ly2,*, Huynh Binh2,*
  • 1: Vietnam National University
  • 2: Hanoi University of Science and Technology
*Contact email: tungnt@isvnu.vn, greeny255@gmail.com, binhht@soict.hust.edu.vn

Abstract

Nowadays, wireless sensor networks (WSNs) have been increasingly applied in many different areas and fields. However, one major defect of WSNs is limited energy resources, which affects the network lifetime strongly. A wireless sensor network includes a sensor node set and a base station. The initial energy of each sensor node will be depleted gradually during data transmission to the base station either directly or through other sensor nodes, depending on the distance between the sending node and the receiving node. This paper considers specifying a location for the base station such that it can minimize the consumed energy of each sensor node in transmitting data to that base station, in other words, maximizing the network lifetime. We propose a nonlinear programming model for this optimal problem. Four methods, respectively named as the centroid, the smallest total distances, the smallest total squared distances and greedy method, for finding the base station location are also presented, experimented and compared to each other over 30 data sets that are created randomly. The experimental results show that a relevant location for the base station is essential.