The Complexity of Optimal Addressing in Radio Networks
暂无分享,去创建一个
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.
[1] S.A. Gronemeyer,et al. Advances in packet radio technology , 1978, Proceedings of the IEEE.