Font Size: a A A

Research On Scheduling Algorithms For The Wireless Personal Area Network

Posted on:2011-10-08Degree:MasterType:Thesis
Country:ChinaCandidate:Z J TangFull Text:PDF
GTID:2178330332964518Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
Wireless Personal Area Network (WPAN) is an Ad hoc network composed of several mobile nodes, and a multi-hop network. Recently there has been a growing interest in the use of WPAN for low rate and low energy consumption, driven by its large application range such as in military, in mineral, in home automation, in health-care monitoring, and so on. Due to the nodes of WPAN are simple radio frequency, the scheduling algorithm is very important. The thesis delves into wireless personal area network, analyzes the main scheduling algorithm, and put scheduling algorithm in different conditions. It includes the following content.(1) Introducing the concept, the node structure and the network architecture of WPAN, elaborating the MAC level of the IEEE802.15, and describing the related work of the scheduling algorithm nowadays.(2) Proposing an on-demand scheduling algorithm. The algorithm is mainly composed of two important parts. On one hand, four final factors referred in the scheduling will be defined including data arrival rate, link load factor, data model factor and time factor. On the other hand, in order to meet the strict requirement of time delay, generally, the cluster identifier (CID) is a right item to be utilized to reduce the negative effect of time delay. However, different kinds of CID may have different priorities. The biggest advantage of this algorithm includes low time delay and high band utilization. The feasibility of the algorithm can be demonstrated through the simulation.(3) This thesis designs a scheduling algorithm of WPAN based on the time sensitive transaction taking the optimal bandwidth utilization into consideration. Firstly, GTS is effectively given to every node considering the deadline Di and the delay of a transaction transmitting ED(i) among different nodes. Secondly, at the moment of allocating the GTS to satisfy the time constraint, effective reallocation of the unallocated GTS (UGTS) is considered so as to improve the utilization of bandwidth. Algorithm is designed based on the frame structure which is provided by IEEE802.15. This Algorithm reserves the contents of the protocol so as to be available in many circumstances. Meanwhile, the algorithm can strictly control activation time to be less than delay time, and can significantly improve bandwidth utilization.Finally, a summary of the full paper is given as well as the research direction on this issue in the future.
Keywords/Search Tags:wireless personal area network, WPAN, scheduling algorithm, GTS, time Sensitive
PDF Full Text Request
Related items