Achieving maximum flow in interference-aware wireless sensor networks with smart antennas

被引：20

作者：

Huang, Xiaoxia ^{[1
]}

Wang, Jianfeng ^{[2
]}

Fang, Yuguang ^{[1
]}

机构：

[1] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA

[2] Philips Res, Briarcliff Manor, NY 10510 USA

来源：

AD HOC NETWORKS | 2007年 / 5卷 / 06期

基金：

美国国家科学基金会;

关键词：

Routing; Maximum flow; Interference; Wireless sensor networks; Smart antenna;

D O I：

10.1016/j.adhoc.2007.02.003

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Directional antenna offers various benefits for wireless sensor networks, such as increased spatial reuse ratio and reduced energy consumption. In this paper, we formulate the maximum flow problem as an optimization problem in interference-limited wireless sensor networks with switched beam directional antennas. The optimization problem is solvable in the presence of an omniscient controller, but it is NP-hard. Therefore, we seek a distributed algorithm to achieve the maximum flow through jointly routing and scheduling. The maximum flow between given source destination pair is determined forwardly hop by hop and is verified by the proposed feasible condition at downstream nodes. This method works for both single-beam antenna and multi-beam antenna with some variation in the feasibility condition. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：885 / 896

页数：12

共 23 条

[1]

Ahuja RK, 1993, NETWORK FLOWS THEORY

[2]

[Anonymous], P ACM MOBIHOC 2006 M

[3]

[Anonymous], P ACM INT S MOB AD H

[4]

Burkhart M, 2004, P 5 ACM INT S MOB AD, P9, DOI DOI 10.1145/989459.989462

[5]

Florens C, 2002, GLOB TELECOMM CONF, P6

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

Gupta, P ;

Kumar, PR .

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

[7]

Hou YT, 2005, GLOB TELECOMM CONF, P3263

[8]

Hou YT, 2005, IEEE INFOCOM SER, P761

[9]

Jain K., 2003, P 9 ANN INT C MOB CO, P66

[10] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE [J].

JOHNSON, DS .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1985, 6 (03) :434-451

← 1 2 3 →