Return to search

Energy-Efficient Tree Splitting Algorithm in Wireless Sensor Networks

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0725107-144124
Date25 July 2007
CreatorsShiau, You-cheng
ContributorsWei Kuang Lai, Chun-Hung Lin, Rung-Hung Gau, Tsang-Ling Sheu
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageCholon
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725107-144124
Rightsnot_available, Copyright information available at source archive

Page generated in 0.002 seconds