优化情境感知路由法提升无线网格骨干网性能

51 浏览量更新于2024-08-28 收藏 227KB PDF 举报

本文档标题为《ISAR：改进的情境感知无线网格主干路由方法》(ISAR: Improved Situation-Aware Routing Method for Wireless Mesh Backbones)，发表于2012年9月的IEEE Communications Letters第16卷第9期。随着无线接入服务性能需求的提升，适应性干扰抵抗路由在确保无线网格网络(Wireless Mesh Networks, WMNs)提供可靠且高带宽服务方面变得至关重要。作者Qiang Liu、Jianping Yin、Victor C. M. Leung（IEEE Fellow）和Zhiping Cai（IEEE Member）针对这一问题提出了一个新的改进方案。文章的核心研究是针对无线网格主干网络的路由策略，旨在提高网络效率、降低延迟并保证公平性。传统路由协议面临的主要挑战包括如何有效管理干扰、负载均衡以及满足移动终端的低延迟需求。ISAR方法通过引入一种精细化的情境感知路由度量和一个贪婪的负载平衡路由算法来解决这些问题。情境感知路由是指路由决策过程不仅考虑当前的网络拓扑结构，还考虑到网络状态、流量动态以及终端移动性等因素。在ISAR方法中，作者提出了一种新的路由度量，这可能结合了信号强度、信道质量指标、节点拥塞情况以及邻接关系等多维度信息，以实现更智能的路径选择。此外，文中提到的贪婪负载平衡路由算法意味着在选择路由时，除了追求最优路径外，还会考虑将流量均匀分配到不同的链路或节点上，以防止某些部分过度拥挤，从而提高整体的网络吞吐量和效率。通过仿真结果，研究者展示了ISAR方法相较于传统路由方案，在提供更高数据传输速率的同时，能够显著减少传输延迟。关键词包括：干扰、负载平衡、路由、无线网格主干网络。这项工作对于设计和优化未来的无线网络架构具有重要意义，特别是在无线通信领域，随着物联网(IoT)的发展，对高效、灵活和可扩展的路由解决方案的需求将会进一步增强。ISAR方法为解决这些挑战提供了新的思路和技术支持。

1404 IEEE COMMUNICATIONS LETTERS, VOL. 16, NO. 9, SEPTEMBER 2012

ISAR: Improved Situation-Aware Routing Method for

Wireless Mesh Backbones

Qiang Liu, Jianping Yin, Victor C. M. Leung, Fellow, IEEE, and Zhiping Cai, Member, IEEE

Abstract—Due to the increasing performance requirements of

wireless access services, adaptive interference resistant routing

is crucial for providing reliable access and high bandwidth

services via wireless mesh networks. In this letter, we propose an

improved method for situation-aware routing, which extends the

existing routing protocols via a reﬁned situation-aware routing

metric and a greedy load-balancing routing scheme. Simulation

results demonstrate that the proposed method can achieve a

higher throughput with lower transmission delay compared to

previous routing schemes.

Index Terms—Interference, load balance, routing, wireless

mesh backbones.

I. INTRODUCTION

IGHLY efﬁcient routing is crucial for backbone wireless

mesh networks (WMNs) to reliably provide services

for ubiquitous mobile terminals with low delay and good

fairness. Although routing protocols in wireless networks have

been studied extensively, most of them are not suitable for

WMNs. For example, the Ad hoc On-Demand Distance Vector

(AODV) [1] aims to minimize the number of hops in logical

topologies. However, the hop count metric does not work well

in WMNs because the aggregated trafﬁc from a large set of

sources to a few gateways introduces interference amongst

different ﬂows and decreases th e quality of service (QoS).

Many routing protocols and metrics have been proposed for

WMNs [2] [3] to overcome the deﬁciency of classical proto-

cols. While legacy routing protocols ty pically predeterm ine

one or more paths before delivering the packets, the two

approaches proposed in [2], i.e., opportunistic routing and

network coding, are shown to be promising in exploiting

the intrinsic char acteristics of multi-hop wireless networks.

On the other hand, many routing metrics are found in the

literature, such as the expected transmission count metric

(ETX) [4], the weighted cumulative expected transmission

time (WCETT) [5], the Airtime metric [6], the interference-

aware routing metric (IAR) [7], and the adaptive situation-

Manuscript recei ved March 8, 2012. The associate editor coordinating the

review of this letter and approving it for publication was J. Holliday.

This work was supported by the National Natural Science Foundation

of China (Grant No. 61170287, No. 60970034, No. 61070198, and No.

60903040).

Q. Liu is with the School of Computer, National University of Defense

Technology, Changsha, Hunan, China. He is now a Visiting Scholar in the

Department of Electrical and Computer Engineering, Univ ersity of British

Columbia, Vancouver, BC, Canada (e-mail: libra6032009@gmail.com).

J. Y in and Z. Cai are with the School of Computer, National Uni-

versity of Defense Technology, Changsha, Hunan, China (e-mail: {jpyin,

zpcai}@nudt.edu.cn).

V. C. M. Leung is with the Department of Electrical and Computer

Engineering, University of British Columbia, Vancouver , BC, Canada (e-mail:

vleung@ece.ubc.ca).

Digital Object Identiﬁer 10.1109/LCOMM.2012.072012.120502

aware routing metric (ASA) [8]. However, these measurement-

based methods generally ignore the inﬂuence of route length.

While the link states are important metrics for routing in

WMNs, the number of routing hops should also be considered

because long routes will potentially increase transmission

delay and packet loss rate due to inter-ﬂow and intra-ﬂow

interference rooted from the shared nature of the transmission

medium [7].

In this letter, we propose an Improved Situation-Aware

Routing (ISAR) method for WMNs, which extends the Hybrid

Wireless Mesh Protocol (HWMP) that is the default path

selection protocol of IEEE 802.11s [9]. To enhance the over-

all p erformance and fairness of the network, ISAR consists

of two parts: the ISAR metric design and load-balancing

routing. The ISAR metric is designed with the objective

of maximizing routing efﬁciency. The metric takes several

factors into account, including path length, interference and

transmission delay. Then, a greedy load-balancing routing

scheme is presented to update the optimal path based the

ISAR metric computed with up -to-date network information.

The routing scheme improves previous schemes by selecting

the optimal measuring time to tradeoff between precision

of measurement and node throughput. Our contributions in

this work include: (1) We introduce a novel routing m etric

for improving on the ASA metric [8], an adaptive situation-

aware routing metric. When serving as the basis of path

selection, the proposed metric can achieve a considerable

improvement in routing efﬁciency; (2) We further propose a

new load-balancing routing scheme to improve existing active

probing based routing schemes by reducing the overhead of the

probing mechanism. Results show that the proposed routing

method outperforms previous routing schemes in terms of total

throughput and average delay.

II. ISAR M

ETRIC DESIGN

Since HWMP in the IEEE 802.11s standard [9] uses some

routing metric in the assessment of a mesh path to the

destination, the ﬁrst step in our design is to deﬁne a suitable

metric. We denote P as the set of candidate paths and deﬁne

the cost of a path p ∈ P by

C(p)=



l∈p

ISAR

(p)

(l), (1)

where l is a link of the path p. Furthermore, due to potential

impacts of long paths as mentioned before, a monotone

increasing penalty func tion f

(l) is integrated to deﬁne link l’s

cost. This penalty function is chosen to be a convex downward

function that is greater than 1, and is applied when link

l’s hop number, denoted by HC

(p)

(l), exceeds a predeﬁned

threshold η. The motivation of such a function is to discourage

1089-7798/12$31.00

 2012 IEEE

下载后可阅读完整内容，剩余3页未读，立即下载

weixin_38702417

粉丝: 3
资源: 943

优化情境感知路由法提升无线网格骨干网性能

ISAR舰船成像：马根诺-希尔谱图与乔伊-威廉斯分布的应用

船舶目标ISAR成像的新时间-频率表示方法

短孔径ISAR高分辨成像：PH-SL0算法

RSF-ISAR：Entropy method，熵值法 in Matlab 代码等

ISAR_Simple-target-imaging.rar_ISAR 回波_ISAR-Imaging_isar imaging

High-resolution ISAR imaging with sparse-spectrum OFDM-LFM waveforms

Photonics-based real-time and high-resolution ISAR imaging of non-cooperative target

Harmonic Wavelet based ISAR Imaging:ISAR Imaging using Harmonic Wavelets-matlab开发

ISAR imaging of stepped-frequency based on image contrast optimization (2014年)

isar：适用于Flutter和Web应用程序的超快速跨平台数据库

最新资源