Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/14753
Title: | RELAXED MUTUAL EXCLUSION ALGORITHM IN MOBILE CELLULAR NETWORK |
Authors: | VATS, PREETI |
Keywords: | Relaxed Mutual Exclusion channel allocation borrowing scheme deadlock minimization Two-Step Dynamic-Priority broken cell serving |
Issue Date: | May-2016 |
Series/Report no.: | TD 2136; |
Abstract: | ABSTRACT Now a days, Mobile computing networks revolutionize the way computers are used. Mobile hosts have small memory, a relatively slow processor and low power batteries, and communicate over low bandwidth wireless communication links. Distributed dynamic channel allocation in mobile cellular networks and other similar structures is a fundamental resource management problem. It has aroma of distributed mutual exclusion but is not exactly mutual exclusion problem because a channel must be reused in different cells. Existing mutual exclusion algorithms for cellular systems are not suitable to mobile systems due to above limitations. Here, the exact relation being established between the both algorithms. Specifically, we describe the procedure of relaxed mutual exclusion to modularize the problem of distributed channel allocation. A geographical area is divided into hexagonal cells, every cell uses the same bandwidth, which is divided into channels. Cell phone must use one channel to make a call. Cells have different traffic usage of channels such that every cell could need different quantity of channels. Allocation algorithm should dynamically allocate channels (resources) to cells, to get the most efficient usage of available bandwidth using relaxed mutual exclusion. We propose a general algorithm that guarantees relaxed mutual exclusion for a single resource, prove a necessary and sufficient condition for the information structure, and address the issues that arise in relaxed mutual exclusion, including deadlock resolution, dealing with multiple resources, and design of efficient information structure. Here, improvement based on mutual exclusion solution, such as deadlock minimization and broken cells serving extended to multiple channel case is described to an extent to use the bandwidth efficiently. Keywords : Relaxed Mutual Exclusion, channel allocation, deadlock minimization, broken cell serving, TSDP(Two-Step Dynamic-Priority), borrowing scheme |
URI: | http://dspace.dtu.ac.in:8080/jspui/handle/repository/14753 |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Final thesis report-Preeti.pdf | 1.04 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.