Abstract | ||
---|---|---|
In [5, 7, 8] an analytical model of the lifetime problem of wireless sensor networks is developed. The solution given by the model is not practical for WSNs. Each time, there is a change in a sensor network, the solution needs to be recalculated. Also, it is difficult to build ILP solvers inside the small sensors. Furthermore, when the number of sensor nodes and CHs increases, it quickly becomes infeasible to calculate an optimum solution. As the analytical model is not able to be used to solve complicated networks, heuristic solutions are then examined that can compute the solutions for large sensor networks. Finally, the simulation results of the heuristic solutions are presented and discussed. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-46909-6_20 | Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering |
Keywords | DocType | Volume |
Base station location,Wireless sensor network,Routing,Non-linear programming | Conference | 168 |
ISSN | Citations | PageRank |
1867-8211 | 0 | 0.34 |
References | Authors | |
5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Thanh Tung Nguyen | 1 | 54 | 9.63 |
Phan Cong Vinh | 2 | 57 | 25.03 |