A new local search algorithm for minimum span frequency assignment in mobile communication
Recent years, the use of mobile communication has been steadily increases. An important process in mobile communication is the assignment of frequency spectrum called channel to each of the caller and receiver pair in order to communicate. This headed to some problems faced by mobile communication o...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer Verlag
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029371375&doi=10.1007%2f978-981-10-6502-6_10&partnerID=40&md5=4715c634aa766b3823325184e0862dd5 http://eprints.utp.edu.my/20305/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Recent years, the use of mobile communication has been steadily increases. An important process in mobile communication is the assignment of frequency spectrum called channel to each of the caller and receiver pair in order to communicate. This headed to some problems faced by mobile communication on how to distribute the large number of users efficiently with the limited capital of radio frequency spectrum. Zero interference between channels assigned may contributed to a high quality call service between users. In mobile communication one of the ways to solve the problem is dividing a geographical area into a number of cells in order to reuse the limited frequencies with the aim of supporting more users and also to minimize interference. Hence, a local search method is proposed in this project to solve the channel assignment problem with the minimum span of frequency and zero interference between the channels assigned. © Springer Nature Singapore Pte Ltd. 2017. |
|---|