Download Now Free registration required
The authors consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a random wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied - dense random networks and constant density (extended) random networks. They first establish an information-theoretic lower bound on the minimum energy per bit for multicasting that holds for arbitrary wireless networks when the channel state information is not available at the transmitters. These lower bounds are then evaluated for two cases of random networks. Upper bounds are also obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes.
- Format: PDF
- Size: 612.46 KB