完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Sheu, Pi-Rong | |
| dc.contributor.author | Chien, Chia-Hung | |
| dc.date.accessioned | 2009-06-02T06:37:56Z | |
| dc.date.accessioned | 2020-05-25T06:42:52Z | - |
| dc.date.available | 2009-06-02T06:37:56Z | |
| dc.date.available | 2020-05-25T06:42:52Z | - |
| dc.date.issued | 2006-10-18T07:52:55Z | |
| dc.date.submitted | 2004-12-15 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1894 | - |
| dc.description.abstract | Most of the existing routing protocols for mobile ad hoc networks are designed primarily to carry best-effort traffic and only concerned with shortest-path routing. Little attention is paid to the issues related to the quality-of-service (QoS) requirement of a route. In this paper, we will consider the problem of searching for multiple paths between multiple pairs of sources and destinations satisfying the power requirement in a mobile ad hoc network. We will show that the problem is NP-complete. | |
| dc.description.sponsorship | 大同大學,台北市 | |
| dc.format.extent | 5p. | |
| dc.format.extent | 351093 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2004 ICS會議 | |
| dc.subject | Ad Hoc Network | |
| dc.subject | Multiple Routing | |
| dc.subject | NP-completeness | |
| dc.subject | Power-Aware | |
| dc.subject | Quality-of-Service | |
| dc.subject | Wireless Mobile Network | |
| dc.subject.other | Mobile Computing | |
| dc.title | On the Complexity of Power-Aware Multiple Routing for Mobile Ad Hoc Networks | |
| 分類: | 2004年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002004000167.pdf | 342.86 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。