A Novel Downlink Handover Priority Scheduling Algorithm for Providing Seamless Mobility and QoS in IEEE802.16e BWA System

Author(s):  
Hamed Fehri ◽  
Jalil Chitizadeh ◽  
Mohammad H. Yaghmaee
Author(s):  
Adnan Hajar

The use of traditional approaches to teach Operating Systems usually lacks the visual aspect. The following research investigates the novel use of DEVS (Discrete Even Visualization and Simulation) in simulating the operation of an operating system. Cd boost++ was the framework of choice for this project. The simulation successfully mimicked the work of an operating system by simulating multiple cycles of program requests. This simulation is capable of further enhance the explanation of how an operating system works. The cases studied in this work include: 1- two processes running concurrently doing multiple IO’s, 2-four processes running concurrently based on a first come first serve scheduling algorithm, and 3- 20 processes running concurrently using highest priority scheduling algorithm. Output observation of the last case show promising results of successful use of DEVS and cd boost++ as a framework to build an operating system.


Author(s):  
Hema C ◽  
Sharmila Sankar ◽  
Sandhya M

<p><span>RFID (Radio Frequency IDentification) is a developing technology that employs electromagnetic signals to send the data among reader and tags to identify categorize and track the moveable items. The objective of this paper is to mitigate the reader collision problem by scheduling the readers in RFID system.  Mobile readers in the RFID network send the same frequency signal to the air to read the data from the tags. While these two signals interfere each other and Tags are unable to backscatter signal to the reader. This causes a reader collision problem. The Reader collision problem reduces the lifetime of the RFID network and generates redundant data in the RFID Network. Tag Count based Priority Scheduling algorithm is proposed, that enhances the throughput of the readers and mitigates the reader collision problem. In the cluster based RFID network, The Dragonfly algorithm performed the Cluster Head reader election and cluster construction process and then allotting the mobile readers in the cluster. This algorithm improves the energy efficiency and diminishes the reader collision problem, thereby alleviating the tag information loss and expanding the mobile RFID network life time, while compared with Priority Clustering Protocol and the Graph Coloring based TDMA algorithm.</span></p>


2017 ◽  
Vol 67 (5) ◽  
pp. 581
Author(s):  
Sidharth Shukla ◽  
Vimal Bhatia

<p>Wireless mesh networks (WMN) are the networks of future and can operate on multiple protocols ranging from WiFi, WiMax to long term evolution (LTE). As a recent trend defence networks are incorporating off-the-shelf, state of the art commercial protocols to enhance the capability of their networks. LTE is one such commercially available protocol which is easy to deploy and provide high data rate which can be ideally implemented in WMN for defence networks. To enable these high data rate services LTE-based defence mesh networks (DMN) are the requirement of the day and future. However, LTE-based DMN are prone to congestion at times of active operations or full-fledged war. The congestion scenarios may lead to LTE packet loss. Hence, it is pertinent that these networks amalgamate information grooming algorithms to alleviate the throughput of the network in peak hour conditions. An efficient priority scheduling algorithm based on class of service prioritisation, data rate consumption and location of origin of traffic in the DMN is proposed. The simulations demonstrate that by incorporating the proposed priority scheduling algorithm, the overall packet loss of priority packets in the DMN reduces substantially.</p>


Sign in / Sign up

Export Citation Format

Share Document