| dc.contributor | 資科系 | |
| dc.creator (作者) | Lien, Yao-Nan;Kao, Tsai I.;Huang, Jyh-Shyan | |
| dc.creator (作者) | 連耀南;高采衣;黃智賢 | zh_TW |
| dc.date (日期) | 2014-04 | |
| dc.date.accessioned | 16-Jun-2015 15:25:07 (UTC+8) | - |
| dc.date.available | 16-Jun-2015 15:25:07 (UTC+8) | - |
| dc.date.issued (上傳時間) | 16-Jun-2015 15:25:07 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75829 | - |
| dc.description.abstract (摘要) | When a catastrophic natural disaster occurs, the efficiency of disaster response is crucial to life saving. However, mobile communication systems usually crashed due to various causes, making the coordination among a large number of disorganized disaster response workers extremely difficult. We propose a Contingency Cellular Network (CCN) by connecting disconnected base stations together with wireless links and portable power generators. Since the transportation capacity may be very limited, scheduling of CCN deployment order according to the demand of disaster response becomes an important issue. Two models aiming to maximize disaster response efficiency are proposed in this research. Emergency levels of disaster areas, time decreasing profit functions, traveling time of delivery path, and antecessor precedence constraint are taken into consideration in the CCNDS-AC model. The second model, CCNDS-UC is the same but with antecessor precedence constraint relaxed. Both problems are proven NP complete. Two heuristic but efficient algorithms are designed to solve the problems. Both algorithms can outperform our previous algorithm by a significant margin in our simulation experiments. This shows that the traveling time is a significant factor in designing an effective CCN deployment scheduling problem. © 2014 IEEE. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 2014 IEEE International Conference on Pervasive Computing and Communication Workshops, PERCOM WORKSHOPS 2014, 2014, 論文編號 6815223, Pages 308-313, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops, PERCOM WORKSHOPS 2014; Budapest; Hungary; 24 March 2014 到 28 March 2014; 類別編號CFP14344-ART; 代碼 105241 | |
| dc.subject (關鍵詞) | Ad hoc networks; Algorithms; Communication; Disaster prevention; Disasters; Emergency services; Human resource management; Problem solving; Radio broadcasting; Ubiquitous computing; Disaster management; Disaster response; Emergency communication; Mobile communications; Natural disasters; Precedence constraints; Scheduling problem; Transportation capacity; Scheduling | |
| dc.title (題名) | Resource delivery path dependent deployment scheduling for contingency cellular network | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/PerComW.2014.6815223 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/PerComW.2014.6815223 | |
