Minimum-cost gateway placement in wireless mesh networks with QoS constraints

ZENG Feng; CHEN Zhi-gang; DENG Xiao-heng

您当前的位置：

首页 >

文章列表页 >

Minimum-cost gateway placement in wireless mesh networks with QoS constraints

更新时间：2024-10-14

- Minimum-cost gateway placement in wireless mesh networks with QoS constraints
- Vol. 30, Issue 6, Pages: 80-88(2009)
- 作者机构：
  
  中南大学信息科学与工程学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN925
- Published：2009
- 稿件说明：
移动端阅览
ZENG Feng, CHEN Zhi-gang, DENG Xiao-heng. Minimum-cost gateway placement in wireless mesh networks with QoS constraints[J]. 2009, 30(6): 80-88.
DOI：

ZENG Feng, CHEN Zhi-gang, DENG Xiao-heng. Minimum-cost gateway placement in wireless mesh networks with QoS constraints[J]. 2009, 30(6): 80-88. DOI：

摘要

基于图的支配集理论

提出图的有限支配集的概念应用于满足QoS约束的无线mesh网网关优化部署

以获取费用最小网关部署方案

进而把QoS约束的费用最小网关部署问题归结为图的最小权有限支配集的问题。为求解图的最小权有限支配集

提出了贪婪算法GREEDY

该算法以网关的部署性价比作为启发信息

依次挑选部署性价比高的节点加入有限支配集

最后得到权值较小的有限支配集;为得到更加优化的解

利用粒子群优化算法的全局寻优优势

提出粒子群优化算法PSO

该算法通过阻止粒子在狭小区域运动来防止算法陷入早熟收敛。模拟实验表明

GREEDY

DS算法执行速度快

当网关候选节点数超过总节点数的17%时

能得到比其他算法更好的结果;PSO

DS算法以增加执行时间为代价

与GREEDY

DS和OPEN/CLOSE算法相比

得到的网关部署方案的费用分别减少约15%和9%。

Abstract

Focusing on gateway optimal placement with QoS constraints in WMNs and aiming to minimize the cost of gateway placement

firstly

a new concept of limited dominating set（LDS） in graph was presented to addresses the gate-way placement problem

and to find the solution of minimum placement cost is to find the LDS of minimum weight in the graph.Then

in order to find the minimum weighted LDS in graph

a greedy algorithm GREEDY

DS was proposed

in which the ratio of LOAD/COST was used as heuristic information to find minimum cost placement of gateway.To get further optimal solution

a particle swarm optimization algorithm PSO

DS was propo

sed

in which two premature avoidance methods were presented to improve the algorithm’s ability of searching for global optimal solution.At last

simulation has been done

and experiment result shows that GREEDY

DS has lower computing complexity

and when the number of gateway candidate is more than 17% of the total number of node

the result from GREEDY

DS is better than the others.Simulation also shows that PSO

DS can get the more optimal solution at the price of increasing of executing time.Compared with GREEDY

DS and OPEN/CLOSE

the average cost of gateway placement is decreased by about 15% and 9% respectively.

关键词

Keywords

references

Views

890

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Distributed fair cooperative routing in multi-gates wireless mesh network

Mechanism for green unicast routing protection in multi-granularity transport networks

TC²-MAC: an adaptive MAC protocol for wireless sensor network

Modeling and analyzing for network coded TCP

Quality of service guarantee mechanism for enterprise video conference

Related Author

Ji ZHANG

Shi-ming HE

Kun XIE

Da-fang ZHANG

Hong QIAO

Min HUANG

Xing-wei WANG

Jun-ling SHI

Related Institution

School of Information Science and Engineering,Hunan University

College of Information Science and Engineering,Northeastern University

Research Institute of Communication Technology, Beijing Institute of Technology

Research Institute of China Electronic Equipment System Engineering Corporation

VSENS

AI问答

⁰