On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
Computers and Operations Research
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Wireless multihop ad hoc communication networks represent an infrastructure-less generalization of todays cellular networks. Since a central control authority is missing, the complex network has to self-⋆ itself for various operating tasks. Key to a self-⋆ realization is the design of simple, yet robust distributive control rules, which allow the overall network to perform well. Two examples from topology control are given. The first one addresses the connectivity issue, where a self-⋆ rule is presented and shown to lead to strong network connectivity almost surely. A generic system analysis is used in the second example to first develop a phenomenological description of the network's end-to-end throughput capacity and then to sketch further steps towards a self-⋆ rule for obtaining a large throughput performance.