Hierarchical sensor networks: Capacity bounds and cooperative strategies using the multiple-access relay channel model

被引：40

作者：

Sankaranarayanan, L ^{[1
]}

Kramer, G ^{[1
]}

Mandayam, N ^{[1
]}

机构：

[1] Rutgers State Univ, Dept ECE, WINLAB, Piscataway, NJ 08854 USA

来源：

2004 FIRST ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR AND AD HOC COMMUNICATIONS AND NETWORKS | 2004年

关键词：

D O I：

10.1109/SAHCN.2004.1381917

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

A three-tier hierarchical wireless sensor network is considered that consists of a cluster of sensors, an intermediate relay with better computing and communication capabilities than the sensors, and a central server or access point. Such a network can be modeled as a multiple-access relay channel (MARC) with additive white Gaussian noise and fading. Capacity bounds for this network are presented with and without constraints on simultaneous reception and transmission by the relay. The results identify cooperative strategies between the relay and sensors for increasing network capacity. These strategies also preserve limited battery resources by eliminating the need for cooperation between sensors.

引用

页码：191 / 199

页数：9

共 17 条

[1]

CHENG RS, 1993, IEEE T INFORM THEORY, V39, P773, DOI 10.1109/18.256487

[2]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[3]

COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084

[4]

CSISZAR L, 1981, INFORMATION THEORY C

[5] Data-gathering wireless sensor networks: organization and capacity [J].

Duarte-Melo, EJ ;

Liu, MY .

COMPUTER NETWORKS, 2003, 43 (04) :519-537

[6] The capacity of wireless networks [J].

Gupta, P ;

Kumar, PR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404

[7]

Kahn J.M., 1999, ACM IEEE INT C MOB C

[8]

Khojastepour M. A., 2003, 37 ANN C INF SCI SYS

[9] On the white Gaussian multiple-access relay channel [J].

Kramer, G ;

van Wijngaarden, AJ .

2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, :40-40

[10]

Kramer G., 2003, P 41 ANN ALL C COMM

← 1 2 →