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. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-15392-6_11 | Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering |
Keywords | Field | DocType |
Base Station Location,Wireless Sensor Network,Routing,Non-Linear Programming | Sensor node,Base station,Key distribution in wireless sensor networks,Data transmission,Computer science,Nonlinear programming,Greedy algorithm,Real-time computing,Wireless sensor network,Base transceiver station | Conference |
Volume | ISSN | Citations |
144 | 1867-8211 | 2 |
PageRank | References | Authors |
0.43 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Thanh Tung Nguyen | 1 | 54 | 9.63 |
Dinh Ha Ly | 2 | 2 | 0.43 |
Huynh Thi Thanh Binh | 3 | 3 | 3.83 |