| URN |
etd-0622113-141224 |
|---|
| Author |
Yun-Jhu Cai |
|---|
| Author's Email Address |
No Public. |
|---|
| Statistics |
This thesis had been viewed 5578 times. Download 149 times. |
|---|
| Department |
Electrical Engineering |
|---|
| Year |
2012 |
|---|
| Semester |
2 |
|---|
| Degree |
Master |
|---|
| Type of Document |
|
|---|
| Language |
zh-TW.Big5 Chinese |
|---|
| Title |
OC-MAC: An Opportunistic Cooperative MAC Protocol for Cognitive Vehicular Networks |
|---|
| Date of Defense |
2013-06-20 |
|---|
| Page Count |
70 |
|---|
| Keyword |
medium access control
cooperative communications
opportunistic spectrum access
cognitive radio network
vehicular network
|
|---|
| Abstract |
In this thesis, we can consider an application scenario in cognitive vehicular networks: Under the condition that different vehicles in different locations may have different set of available licensed channels, how do the vehicles (called potential relays) that correctly received data from the gateway choose the proper channel to concurrently relay the data to the vehicles (called potential destinations) that did not receive data from the gateway such that the network throughput can be maximized. We call this problem the IMP (interference-free multi-channel poly-matching) problem. To the best of our knowledge, our thesis is the first one that seriously addresses and studies this issue.
The contributions of this thesis are mainly three-fold: (1) We use semi-bipartite graph and mathematical programming to formally model the IMP problem. (2) We design a centralized greedy algorithm to efficiently and effectively solve this problem. (3) On the basis of centralized greedy algorithm , we design a novel distributed medium access control protocol, named opportunistic cooperative MAC (OC-MAC for short), such that only via local information exchange between vehicles, the number of potential destinations that finally receive data from potential relays can be maximized.
Simulation results demonstrated that the throughput of OC-MAC is approximately equal to that of centralized greedy algorithm and is far superior to that of Random MAC. |
|---|
| Advisory Committee |
Tsang-Ling Sheu - chair
Kuo-Feng Chen - co-chair
Kao-Shing Huang - co-chair
Tsung-Chuan Huang - co-chair
Zi-Tsan Chou - advisor
|
|---|
| Files |
Indicate in-campus at 5 year and off-campus access at 5 year. |
|---|
| Date of Submission |
2013-07-23 |
|---|
