Resource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks

被引:13
作者
Ali, Amjad [1 ]
Ahmed, Muhammad Ejaz [1 ]
Piran, Md Jalil [1 ]
Suh, Doug Young [1 ]
机构
[1] Kyung Hee Univ, Dept Elect & Radio Engn, Yongin 446701, South Korea
关键词
ILP; wireless mesh networks; random topology; QoS provisioning routing; heuristic algorithm; QOS TOPOLOGY CONTROL; AD-HOC; CONGESTION CONTROL; MANAGEMENT; ALGORITHMS; PROTOCOLS; CAPACITY; DESIGN; COST;
D O I
10.3390/s140814500
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment.
引用
收藏
页码:14500 / 14525
页数:26
相关论文
共 53 条
[1]  
Adamou M, 2002, IEEE INFOCOM SER, P1783, DOI 10.1109/INFCOM.2002.1019432
[2]  
[Anonymous], P NATO ARW CONC INF
[3]  
[Anonymous], P 4 ANN ACM IEEE INT
[4]  
[Anonymous], APPL MAN SERV FOR
[5]  
[Anonymous], P IEEE INT C CYB EN
[6]  
[Anonymous], P NETWORKING 2002 NE
[7]  
[Anonymous], P 2 IEEE WORKSH WIR
[8]  
[Anonymous], TEKHNE
[9]  
[Anonymous], P IEEE INT C COMP CO
[10]  
[Anonymous], P ACM INT C MOB COMP