AUTOMATICALLOCATION OF GLOBAL SYSTEM OF MOBILE COMMUNICATION CHANNELS USING GRAPH COLOURING ALGORITHM

Show simple item record

dc.contributor.author OROGUN, ADEBOLA OKUNOLA
dc.date.accessioned 2020-11-03T10:40:36Z
dc.date.available 2020-11-03T10:40:36Z
dc.date.issued 2017-07
dc.identifier.uri http://196.220.128.81:8080/xmlui/handle/123456789/1104
dc.description M.TECH THESIS en_US
dc.description.abstract The advent of the GSM, which over the years has enjoyed enormous success due to its vast functionality, has also witnessed an exodus of users demanding it. The growing demand of the global system of mobile communication thus makes it inevitable to adequately plan the use of its limited and expensive frequency spectrum. As the demand increases, especially in densely populated areas, the need for a proper frequency allocation (Channel allocation) arises. The channel (frequency) allocation in GSM are majorly influenced by two constraints; the hard and soft constraints. The soft constraints are co-channel and adjacent channel interference. This research work presents a graph colouring approach to the allocation of channels in the GSM network, with major focus on areas that are densely populated, that has many microcells and many users requesting services. A L(3,1) colouring algorithm is proposed and implemented, and a proof of the algorithm was done to see if it caters for the soft constraints in the GSM system. en_US
dc.description.sponsorship FEDERAL UNIVERSITY OF TECHNOLOGY AKURE en_US
dc.language.iso en en_US
dc.publisher FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE en_US
dc.subject Global System for Mobile Communications (GSM) en_US
dc.subject frequency allocation en_US
dc.subject GRAPH COLOURING ALGORITHM en_US
dc.title AUTOMATICALLOCATION OF GLOBAL SYSTEM OF MOBILE COMMUNICATION CHANNELS USING GRAPH COLOURING ALGORITHM en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search FUTAspace


Advanced Search

Browse

My Account