Link quality based path delay analysis in wireless sensor networks
The upper bound of the probability of a path meeting the deadline was given based on link quality, of which the time complexity was proved to be exponential. Moreover, the greedy algorithm (RROP) was proposed to maximize the end-to-end packet deliver ratio under a given deadline, considering the qua...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Chinês |
| 出版事項: |
Editorial Department of Journal on Communications
2014-06-01
|
| シリーズ: | Tongxin xuebao |
| 主題: | |
| オンライン･アクセス: | http://www.joconline.com.cn/thesisDetails#10.3969/j.issn.1000-436x.2014.06.013 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|