Multicasting in Large Wireless Networks: Bounds on the Minimum Energy per Bit - Computer Science > Information TheoryReportar como inadecuado




Multicasting in Large Wireless Networks: Bounds on the Minimum Energy per Bit - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We consider scaling laws for maximal energy efficiency of communicating amessage to all the nodes in a wireless network, as the number of nodes in thenetwork becomes large. Two cases of large wireless networks are studied -dense random networks and constant density extended random networks. Inaddition, we also study finite size regular networks in order to understand howregularity in node placement affects energy consumption.We first establish an information-theoretic lower bound on the minimum energyper bit for multicasting in arbitrary wireless networks when the channel stateinformation is not available at the transmitters. Upper bounds are obtained byconstructing a simple flooding scheme that requires no information at thereceivers about the channel states or the locations and identities of thenodes. The gap between the upper and lower bounds is only a constant factor fordense random networks and regular networks, and differs by a poly-logarithmicfactor for extended random networks. Furthermore, we show that the proposedupper and lower bounds for random networks hold almost surely in the nodelocations as the number of nodes approaches infinity.



Autor: Aman Jain, Sanjeev R. Kulkarni, Sergio Verdu

Fuente: https://arxiv.org/







Documentos relacionados