pith. sign in

arxiv: 1702.05197 · v1 · pith:NAB4T5QXnew · submitted 2017-02-17 · 💻 cs.NI · cs.IT· math.IT· math.OC

Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions

classification 💻 cs.NI cs.ITmath.ITmath.OC
keywords broadcastnetworkpolicywirelessproblemcapacitychannelsnetworks
0
0 comments X
read the original abstract

We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcast problem, which is in contrast with the polynomial time solvability of the problem with point-to-point channels. Illustrative simulation results demonstrate the efficacy of the proposed broadcast policy in achieving the full broadcast capacity with low delay.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.