The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
碩士 === 長庚大學 === 資訊工程研究所 === 94 === This article discuss an issue that how to make a good decision of allocation of optimal time period. According to the mean data arrival rate and the number of nodes which limited in the finite buffer, the produced and consumed packets of all nodes are considered. H...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78010748906485312509 |
| Summary: | 碩士 === 長庚大學 === 資訊工程研究所 === 94 === This article discuss an issue that how to make a good decision of allocation of optimal time
period. According to the mean data arrival rate and the number of nodes which limited in the
finite buffer, the produced and consumed packets of all nodes are considered. However, the slots
could be reused by the nodes without three hops from the transmitter. By these consideration, the
suitable time period for nodes within three hops can be calculated. Finally, the analysis and the
simulation could show that the time period suits the nodes within three hops and reach the better
performance.
|
|---|