Achievable multicast throughput for homogeneous wireless ad hoc networks

Abstract

We mainly study the achievable multicast throughput (AMT) for homogeneous wireless ad hoc networks under Gaussian channel model. We focus on two typical random networks, i.e., random extended networks (REN) and random dense networks (RDN). In REN and RDN, n nodes are randomly distributed in the square region with side-length n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1/2</sup> and 1, respectively. We randomly choose n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> nodes as the sources of multicast sessions, and for each source v, we pick uniformly at random n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sub> nodes as the destinations. We propose multicast schemes without using percolation theory, and analyze the achievable multicast throughput by taking account of all possible values of n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> and n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sub> . As a special case of our results, we show that for n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> =Θ(n), under specified conditions.