Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimizing the system of virtual paths
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The concepts of sparse and dense subnetworks in wireless networks are investigated with the analysis of their algorithmic complexity. The emphasis is on the polynomial-time solvability of the tasks vs. NP-hardness. The results show that with appropriately defined sparsity and density concepts quite a few efficiently solvable cases arise. Several examples are exhibited to show how the graph theoretical concepts are mapped into various types of wireless networks.