The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions

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...

Full description

Bibliographic Details
Main Authors: Shuhua Jiang, 姜淑華
Other Authors: 陳仁暉
Format: Others
Language:zh-TW
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/78010748906485312509
id ndltd-TW-094CGU00392008
record_format oai_dc
spelling ndltd-TW-094CGU003920082016-06-01T04:14:44Z http://ndltd.ncl.edu.tw/handle/78010748906485312509 The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions 在多重跳躍無線網路點對點傳輸模式下最佳時槽週期分配問題之研究 Shuhua Jiang 姜淑華 碩士 長庚大學 資訊工程研究所 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. 陳仁暉 2006 學位論文 ; thesis 42 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 長庚大學 === 資訊工程研究所 === 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.
author2 陳仁暉
author_facet 陳仁暉
Shuhua Jiang
姜淑華
author Shuhua Jiang
姜淑華
spellingShingle Shuhua Jiang
姜淑華
The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
author_sort Shuhua Jiang
title The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
title_short The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
title_full The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
title_fullStr The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
title_full_unstemmed The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions
title_sort problem of optimal time period assignment in tdma multihop ad hoc networks and its solutions
publishDate 2006
url http://ndltd.ncl.edu.tw/handle/78010748906485312509
work_keys_str_mv AT shuhuajiang theproblemofoptimaltimeperiodassignmentintdmamultihopadhocnetworksanditssolutions
AT jiāngshūhuá theproblemofoptimaltimeperiodassignmentintdmamultihopadhocnetworksanditssolutions
AT shuhuajiang zàiduōzhòngtiàoyuèwúxiànwǎnglùdiǎnduìdiǎnchuánshūmóshìxiàzuìjiāshícáozhōuqīfēnpèiwèntízhīyánjiū
AT jiāngshūhuá zàiduōzhòngtiàoyuèwúxiànwǎnglùdiǎnduìdiǎnchuánshūmóshìxiàzuìjiāshícáozhōuqīfēnpèiwèntízhīyánjiū
AT shuhuajiang problemofoptimaltimeperiodassignmentintdmamultihopadhocnetworksanditssolutions
AT jiāngshūhuá problemofoptimaltimeperiodassignmentintdmamultihopadhocnetworksanditssolutions
_version_ 1718286895270592512

Similar Items