In our thesis, we investigate the detection of malicious behavior in cooperative networks. Our model contain one source, one destination and two relays where relays adopt Orthogonal Space Time Block Code (OSTBC) to achieve spatial diversity. Cooperative communication takes two phases to forward signal to the destination. During first phase, source broadcasts data symbols to relay and destination, and a few tracing symbols are inserted randomly in data symbols. The values and positions of tracing symbols are known at source and destination. The random placement of tracing symbols is to prevent relays evade the detection of malicious behavior. In second phase, relays adopt orthogonal space time block code to forward the received signals after decoding source message successfully. We consider two scenarios based on the decoding capability at relays. The first scenario assumes perfect source¡Vrelay links. So, relays can always decode symbols correctly. Second scenario considers decoding failures at relays. In both scenarios, relays have a certain probability to perform maliciously. After receiving symbols at destination, the destination extracts and detect the tracing symbols. The malicious behavior of relay is detected depending on the value of the correlation between detected and exact tracing symbols. Moreover, depending on the average received energy, we can distinguish whether relays behaves as in outage. Through computer simulation, we can verify that our proposed tracing algorithm and decoding strategy reduce bit error rate.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0907110-232913 |
| Date | 07 September 2010 |
| Creators | Su, Jui-peng |
| Contributors | Chao-Kai Wen, Tsang-Yi Wang, Wan-Jen Huang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907110-232913 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0019 seconds