Pi and the AGM: a study in the analytic number theory and computational complexity
Pi and the AGM: a study in the analytic number theory and computational complexity
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient broadcasting with cooperative transmissions in wireless sensor networks
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative multicast for maximum network lifetime
IEEE Journal on Selected Areas in Communications
Low-Latency Broadcast in Multirate Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
Research challenges towards the Future Internet
Computer Communications
Reducing power consumption of mobile access networks with cooperation
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
Hi-index | 0.00 |
Present broadcast approaches for wireless multihop networks distribute packets quickly to all nodes (i.e., with low latency) by constructing small broadcast trees, thereby reducing the number of forwarding transmissions. While these trees are sufficient in non-fading environments, we show that they have a low delivery rate under fading. As a solution, we (1) incorporate the Rayleigh fading model directly into tree construction to re-obtain complete distribution with high probability. To still achieve low latency at the same time, we combine transmissions at individual nodes to exploit cooperation diversity. Since in broadcasts, a packet has to be retransmitted by nodes along the tree anyway, we do not have to pay the multiplexing loss which hampers cooperation diversity in the unicast case. Thus, we (2) additionally exploit cooperation diversity during tree construction to gain improved reliability while still keeping the size of the tree low. This enables us to significantly decrease the time for broadcasts while still distributing packets to all nodes under fading with high probability. To justify our heuristic approach, we (3) show that finding minimum latency cooperative broadcasts is NP-complete.