Abstract

In the paper, we develop an efficient proactive spectrum handover mechanism by using packet scheduling algorithm, called PSHO-HF-PM, to reduce unusable channel. It effectively integrates several mechanisms (hole filling and packet migration) to reduce the bandwidth fragment and support QoS. Its basic idea is in that a new packet is scheduled by migrating some packets to other channels if none of holes in any channels can accommodate it; otherwise repeating the above processes after random waiting time. Meanwhile under an effective data structure, such as the balanced binary search tree, its computational complexity will be $$O(2n\log n)$$ O ( 2 n log n ) at most. In the proposed packet scheduling algorithm, packet migration plays a key role in the improvement of bandwidth efficiency and QoS. We also evaluate the performance of total service time for proactive spectrum handover mechanism based on a Preemptive Resume Priority M/G/1 queuing network model. The performance analysis and simulation results show that it performs much better than other proactive and reactive handover mechanism in collision rate, total service time, packet loss probability and bandwidth fragment ratio.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.