Stability Analysis of Random Access Systems with Imperfect Sensing Topology

碩士 === 國立臺灣大學 === 電信工程學研究所 === 102 === Traditional analysis and design on random access systems do not take sensing topology into consideration, which implicitly assumes that one user can sense all other users. The corresponding hidden terminal problem is only mitigated by some engineering technique...

Full description

Bibliographic Details
Main Authors: Tsang-Kai Chang, 張倉愷
Other Authors: Kwang-Cheng Chen
Format: Others
Language:en_US
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/29042668221065417101
id ndltd-TW-102NTU05435067
record_format oai_dc
spelling ndltd-TW-102NTU054350672016-03-09T04:24:20Z http://ndltd.ncl.edu.tw/handle/29042668221065417101 Stability Analysis of Random Access Systems with Imperfect Sensing Topology 不完全連接感測拓譜的隨機接取系統之穩定性分析 Tsang-Kai Chang 張倉愷 碩士 國立臺灣大學 電信工程學研究所 102 Traditional analysis and design on random access systems do not take sensing topology into consideration, which implicitly assumes that one user can sense all other users. The corresponding hidden terminal problem is only mitigated by some engineering techniques but never completely understood from a network view. This work applies random graph on imperfect sensing topology to study three random access systems: ALOHA, cognitive radio networks and CSMA. To avoiding misleading conclusion from equilibrium analysis, we take a dynamic approach by modeling the systems as Markov chains, and investigate the system stabiliby from the recurrence of Markov chains with the aid of Foster-Lyapunov criteria. Elegant stability conditions are derived in this work, together with the verification from simulation result. Kwang-Cheng Chen 陳光禎 2014 學位論文 ; thesis 44 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立臺灣大學 === 電信工程學研究所 === 102 === Traditional analysis and design on random access systems do not take sensing topology into consideration, which implicitly assumes that one user can sense all other users. The corresponding hidden terminal problem is only mitigated by some engineering techniques but never completely understood from a network view. This work applies random graph on imperfect sensing topology to study three random access systems: ALOHA, cognitive radio networks and CSMA. To avoiding misleading conclusion from equilibrium analysis, we take a dynamic approach by modeling the systems as Markov chains, and investigate the system stabiliby from the recurrence of Markov chains with the aid of Foster-Lyapunov criteria. Elegant stability conditions are derived in this work, together with the verification from simulation result.
author2 Kwang-Cheng Chen
author_facet Kwang-Cheng Chen
Tsang-Kai Chang
張倉愷
author Tsang-Kai Chang
張倉愷
spellingShingle Tsang-Kai Chang
張倉愷
Stability Analysis of Random Access Systems with Imperfect Sensing Topology
author_sort Tsang-Kai Chang
title Stability Analysis of Random Access Systems with Imperfect Sensing Topology
title_short Stability Analysis of Random Access Systems with Imperfect Sensing Topology
title_full Stability Analysis of Random Access Systems with Imperfect Sensing Topology
title_fullStr Stability Analysis of Random Access Systems with Imperfect Sensing Topology
title_full_unstemmed Stability Analysis of Random Access Systems with Imperfect Sensing Topology
title_sort stability analysis of random access systems with imperfect sensing topology
publishDate 2014
url http://ndltd.ncl.edu.tw/handle/29042668221065417101
work_keys_str_mv AT tsangkaichang stabilityanalysisofrandomaccesssystemswithimperfectsensingtopology
AT zhāngcāngkǎi stabilityanalysisofrandomaccesssystemswithimperfectsensingtopology
AT tsangkaichang bùwánquánliánjiēgǎncètàpǔdesuíjījiēqǔxìtǒngzhīwěndìngxìngfēnxī
AT zhāngcāngkǎi bùwánquánliánjiēgǎncètàpǔdesuíjījiēqǔxìtǒngzhīwěndìngxìngfēnxī
_version_ 1718201048236032000