Abstract
Multihop spread spectrum packet radio networks with a large number of stations would require a large number of spreading codes, even with code reuse beyond the interference range. In the Letter, the code assignment problem is related to the graph colouring problem and a very efficient algorithm is proposed for assigning codes to the stations. A very tight lower bound on the number of codes needed is also derived.
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.
