Title :
The Complexity of Optimal Addressing in Radio Networks
Author :
Toueg, Sam ; Steiglitz, Kenneth
Author_Institution :
Cornell Univ., Ithaca, NY, USA
fDate :
11/1/1982 12:00:00 AM
Abstract :
We consider the complexity of finding optimal fixed- or variable-length unambiguous address codes for the nodes of a packet radio network. For fixed-length codes this problem is proved to be NP-complete, and its complexity for variable-length codes is still unknown. Some suboptimal heuristic algorithms are proposed.
Keywords :
Coding/decoding; Packet switching; Radio repeaters; Variable-length coding (VLC); Communications Society; Computer science; Heuristic algorithms; Packet radio networks; Radio network; Receivers; Relays; Repeaters; Routing;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOM.1982.1095431
