On the power efficiency of sensory and ad hoc wireless networks

被引:64
作者
Dana, Arnir F. [1 ]
Hassibi, Babak [1 ]
机构
[1] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
基金
美国国家科学基金会;
关键词
capacity; sensor networks; wireless communication systems and networks;
D O I
10.1109/TIT.2006.876245
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the power efficiency of a communications channel, i.e., the maximum bit rate that can be achieved per unit power (energy rate). For additive white Gaussian noise (AWGN) channels, it is well known that power efficiency is attained in the low signal-to-noise ratio (SNR) regime where capacity is proportional to the transmit power. In this paper, we first show that for a random sensory wireless network with n users (nodes) placed in a domain of fixed area, with probability converging to one as n grows, the power efficiency scales at least by a factor of root n. In other words, each user in a wireless channel with n nodes can support the same communication rate as a single-user system, but by expending only times the energy. Then we look at a random ad hoc network with n relay nodes and r simultaneous transmitter/receiver pairs located in a domain of fixed area. We show that as long as r <= root n, we can achieve a power efficiency that scales by a factor of root n. We also give a description of how to achieve these gains.
引用
收藏
页码:2890 / 2914
页数:25
相关论文
共 22 条
[1]   Energy concerns in wireless networks [J].
Ephremides, A .
IEEE WIRELESS COMMUNICATIONS, 2002, 9 (04) :48-59
[2]   On the asymptotic capacity of Gaussian relay networks [J].
Gastpar, M ;
Vetterli, M .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :195-195
[3]  
GASTPAR M, 2002, P IEEE INF 2002 NEW
[4]  
GOMEZ J, 1999, P IEEE INT WORKSH MO, P380
[5]   Mobility increases the capacity of ad hoc wireless networks [J].
Grossglauser, M ;
Tse, DNC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (04) :477-486
[6]   The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404
[7]   Towards an information theory of large networks: An achievable rate region [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (08) :1877-1894
[8]  
HASSIBI B, 2002, P AS C SIGN SYST COM
[9]  
Heinzelman W. R., 2000, P 33 ANN HAW INT C S, P10, DOI DOI 10.1109/HICSS.2000.926982
[10]  
Horn R. A., 1986, Matrix analysis