Abstract
To improve efficiency, we allow a carrier in a TDMA (Time Division Multiple Access) network to be shared by adjacent cells. This sharing of time slots is seriously hampered by the lack of synchronization in distinct cells. We study packing algorithms that overcome this obstacle by clustering calls. The results suggest that even simple greedy algorithms are nearly optimal, and that little extra performance can be gained either by allowing the rejection of calls or by repacking.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
