Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/4246
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Trương, Phong Tuyên | - |
dc.contributor.author | Huỳnh, Xuân Hiệp | - |
dc.contributor.author | Lương, Hoàng Hướng | - |
dc.contributor.author | Phan, Công Vinh | - |
dc.contributor.author | Pottier, Bernard | - |
dc.date.accessioned | 2018-09-14T07:55:45Z | - |
dc.date.available | 2018-09-14T07:55:45Z | - |
dc.date.issued | 2016 | - |
dc.identifier.uri | http://dspace.ctu.edu.vn/jspui/handle/123456789/4246 | - |
dc.description.abstract | In this article, we propose a new approach to model and optimize the dynamic sensor field for both internal network connections and LEO satellite connection based on BT-Graph. Due to the shift of LEO satellite's orbit at each revolution, a dynamic sensor field (DSF), which is able to redetermine its gateways, is suitable to improve successful data communications. It is convenient to present a DSF as a BT-Graph that aims to utilize optimization algorithms. Parallel search algorithms are also deployed for more efficient execution time when DSFs consist of a significant large number of nodes. The simulation experiments are performed on an abstract forest fire surveillance network to validate our proposed approach. | vi_VN |
dc.language.iso | en | vi_VN |
dc.relation.ispartofseries | EAI Endorsed Transactions on Context-aware Systems and Applications;3 .- p.1-9 | - |
dc.subject | Associateanalysis | vi_VN |
dc.subject | BT-Graph | vi_VN |
dc.subject | Parallelprocessing | vi_VN |
dc.subject | Sensorfield | vi_VN |
dc.subject | LEOsatellite | vi_VN |
dc.title | Modeling the Connections of Dynamic Sensor Based on BT-Graph | vi_VN |
dc.type | Article | vi_VN |
Appears in Collections: | Tạp chí quốc tế |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ | 3.75 MB | Adobe PDF | View/Open | |
Your IP: 18.221.157.203 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.