In this thesis, we propose a power saving strategy based on tree splitting algorithm in wireless sensor network with multiple packet reception. We concentrate on the case that maximum queue size is 1. We derive both analytical results and simulation results. We use theory of Markov chain to analyze the evolution of the system state. In addition, we propose to use Renewal theory to calculate the throughput. Furthermore, we obtain the average system size, the packet blocking probability, and the average packet delay. Because the network model is distributed, we can¡¦t understand the state of network all the time. So we use the length of last collision resolution cycle to predict the length of next cycle, and determine the sleeping time by the predicted length of next cycle to implement power saving. At last we will use the simulation result to show the performance of our power saving strategy.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0725107-144124 |
| Date | 25 July 2007 |
| Creators | Shiau, You-cheng |
| Contributors | Wei Kuang Lai, Chun-Hung Lin, Rung-Hung Gau, Tsang-Ling Sheu |
| 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-0725107-144124 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0034 seconds