Discrete Mathematics - Topics on domination
Power consumption in packet radio networks
Theoretical Computer Science
Congestion, Dilation, and Energy in Radio Networks
Theory of Computing Systems
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Unit disk graph and physical interference model: Putting pieces together
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Information-theoretic operating regimes of large wireless networks
IEEE Transactions on Information Theory
The capacity of wireless networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
SINR Diagrams: Convexity and Its Applications in Wireless Networks
Journal of the ACM (JACM)
Analyzing randomly placed multiple antennas for MIMO wireless communication
WIMOB '12 Proceedings of the 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
| Hi-index | 0.00 |
We consider n wireless ad hoc network nodes with one antenna each and equidistantly placed on a line. The transmission power of each node is just large enough to reach its next neighbor. For this setting we show that a message can be broadcasted to all nodes in time O(log n) without increasing each node's transmission power. Our algorithm needs O(log n) messages and consumes a total energy which is only a constant factor larger than the standard approach where nodes sequentially transmit the broadcast message to their next neighbors. We obtain this by synchronizing the nodes on the fly and using MIMO (multiple input multiple output) techniques. To achieve this goal we analyze the communication capacity of multiple antennas positioned on a line and use a communication model which is based on electromagnetic fields in free space. We extend existing communication models which either reflect only the sender power or neglect the locations by concentrating only on the channel matrix. Here, we compute the scalar channel matrix from the locations of the antennas and thereby only consider line-of-sight-communication without obstacles, reflections, diffractions or scattering. First, we show that this communication model reduces to the SINR power model if the antennas are uncoordinated. We show that n coordinated antennas can send a signal which is n times more powerful than the sum of their transmission powers. Alternatively, the power can be reduced to an arbitrarily small polynomial with respect to the distance. For coordinated antennas we show how the well-known power gain for MISO (multiple input single output) and SIMO (single input multiple output) can be described in this model. Furthermore, we analyze the channel matrix and prove that in the free space model no diversity gain can be expected for MIMO. Finally, we present the logarithmic time broadcast algorithm which takes advantage of the MISO power gain by self-coordinating wireless nodes.