An effective scheduling scheme for multi-hop multicast in wireless mesh networks

With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation method. Based on the graph transformation, the multicast scheduling problem is converted to the graph coloring problem, and then a capacity greedy algorithm is designed to provide concurrent transmission scheduling so that the demanded multicast transmission rate can be achieved. Moreover, the necessary and sufficient conditions of multicast schedulable feasibility are derived. Through corresponding simulations, it is shown that the proposed strategy can enhance the throughput of wireless multi-hop multicast systems significantly.     

An interference-aware fair scheduling for multicast in wireless mesh networks

Multicast is a fundamental routing service in wireless mesh networks (WMNs) due to its many potential applications such as video conferencing, online games, and webcast. Recently, researchers proposed using link-quality-based routing metrics for finding high-throughput paths for multicast routing. However, the performance of such link-quality-based multicast routing is still limited by severe unfairness. Two major artifacts that exist in WMNs are fading which leads to low quality links, and interference which leads to unfair channel allocation in the 802.11 MAC protocol. These artifacts cause the multicast application to behave unfairly with respect to the performance achieved by the multicast receivers.     

GLBM: A new QoS aware multicast scheme for wireless mesh networks

Wireless mesh networks (WMNs) have been attracting significant attention due to their promising technology. The WMN technology is becoming a major avenue for the fourth generation of wireless mobility. Communication in large-scale wireless networks can create bottlenecks for scalable implementations of computationally intensive applications. A class of crucially important communication patterns that have already received considerable attention in this regard are group communication operations, since these inevitably place a high demand on network bandwidth and have a consequent impact on algorithm execution times. Multicast communication has been among the most primitive group capabilities of any message passing in networks. It is central to many important distributed applications in science and engineering and fundamental to the implementation of higher-level communication operations such as gossip, gather, and barrier synchronisation. Existing solutions offered for providing multicast communications in WMN have severe restriction in terms of almost all performance characteristics. Consequently, there is a need for the design and analysis of new efficient multicast communication schemes for this promising network technology. Hence, the aim of this study is to tackle the challenges posed by the continuously growing need for delivering efficient multicast communication over WMN. In particular, this study presents a new load balancing aware multicast algorithm with the aim of enhancing the QoS in the multicast communication over WMNs. Our simulations experiments show that our proposed multicast algorithm exhibits superior performance in terms of delay, jitter and throughput, compared to the most well known multicast algorithms.     

Load-balanced AP association in multi-hop wireless mesh networks

Wireless mesh networks (WMNs) provide high-bandwidth wireless access, which makes it capable for multimedia services. A user in a WMN may be covered by multiple APs, while it should be associated with only one to access the Internet. Conventional IEEE 802.11 user-AP association mechanism for WLANs employs signal strength as the sole metric. However, this may lead to network congestion and performance degradation in multi-hop networks such as WMNs, especially for multimedia services that require a large bandwidth and a low latency. Thus AP association in WMNs becomes an important research issue. In this paper we propose a novel AP association approach LBAA, taking AP’s load-balancing, WMN’s multi-hop characteristic, and user’s RSSI into consideration. We first propose a centralized algorithm and then extend it to a distributed one, with the latter one more practical and convenient for deployment. Network throughput and max–min user fairness are improved by LBAA. Performance evaluation demonstrating the benefits of our approach is given through a series of experiments in terms of collision probability, access bandwidth, end-to-end throughput, and average RSSI.     

无线Mesh网络中基于业务价值的组播带宽分配方案

高延迟及低效益是无线Mesh网络中开展流媒体业务面临的主要问题。为解决该问题,首先赋予组播业务价值,该值反映了业务的网络优先级及效益优先级,并提出一个基于组播价值优先级的组播带宽分配方案。该方案第一阶段实施基于价值优先级的不区分业务类型的静态分配,通过对高价值业务的优先调度,实现了组播价值最大化及带宽效益最大化。在拥塞时,实施第二阶段的基于业务带宽需求调整及抢占的动态分配,保证了低时延约束业务的服务质量。仿真与常见算法的比较表明,所提出的方案在保证业务网络服务质量的同时,能实现带宽效益最大化。     

基于遗传算法的无线网状网QoS多播路由算法

探讨了基于遗传算法的无线网状网QoS多播路由算法,选用边集表示方式对多播树进行编码,其空间复杂度为O(N),给出了该编码方式下的初始种群生成算法RandWalkMT,同时对传统的遗传操作进行改进使子代个体中不会产生非法多播树,从而避免了复杂的惩罚机制或多播树修复算法。实验表明该算法收敛快且性能较好。     

基于TDMA方式WMN中一种链路调度机制研究

基于TDMA方式的无线网状网中,链路调度对网络性能起着重要作用.针对固定顺序的待调度链路集,提出求解最优调度周期的启发式算法;基于链路顺序对算法性能的影响,从全局优化的角度对全网链路进行排序,提出基于遗传算法的最优链路调度机制.仿真结果表明,该算法能快速收敛于全网链路的最小调度周期,具有比现有算法更高的传输效率和更低的实施复杂度.     

多速率无线Mesh网络环境下功率控制与调度机制——PSMR

传输功率控制（TPC）技术是提高无线网络性能的关键技术之一。针对无线Mesh网络（WMN）的特点,提出了一种在多速率WMN环境下功率控制与调度机制（PSMR）,该机制以系统的吞吐率和公平性为目标,利用冲突图思想对网络进行分析,建立了多目标规划的数学模型,并采用微分进化算法对其进行求解。模拟测试表明,PSMR能有效提高系统吞吐率,改善系统的公平性。     

Slot allocation algorithms in centralized scheduling scheme for IEEE 802.16 based wireless mesh networks

In IEEE 802.16 based wireless mesh networks (WMNs), TDMA (Time Division Multiple Access) is employed as the channel access method and only TDD (Time Division Duplex) is supported and there are no clearly separate downlink and uplink subframes in the physical frame structure. As the uplink and downlink traffic has different characteristics in that the uplink traffic decentralizes in each MSS (Mesh Subscriber Station) and the downlink traffic centralizes in the MBS (Mesh Base Station), different scheduling methods should be taken in the uplink and downlink. This paper presents a uniform slot allocation algorithm which is suitable for both uplinks and downlinks. To achieve higher spatial reuse and greater throughput and to avoid switching frequently between receiving and transmitting within two adjacent time slots when a relay node forwards traffic, different link selection criteria are taken into account when allocating slots for uplinks and downlinks. A combined uplink and downlink slot allocation algorithm is proposed for further improving the spatial reuse and network throughput. The proposed algorithms are evaluated by extensive simulations and the results show that it has good performance in terms of spatial reuse and network throughput. To the best of the authors’ knowledge, this work is the first one that considers combined uplink and downlink slot allocation on the centralized scheduling scheme in IEEE 802.16 based WMNs.     

一种传感器追踪网多目标监测组播方案

Mobicast是一种非常适合无线传感器追踪网（Wireless Sensor Tracing Networks,WSTNs）的新型组播路由协议,但对于多目标监测时还需相应改善。在Mobicast的基础上提出了一种自感知分簇机制,根据网络实时拓扑和目标状态的改变动态调整分簇策略,以防止组播簇重叠和干扰,最大限度地提高监控精度和网络性能。方案主要贡献在于：通过自感知分簇算法,判断监测目标个数和运动状态,确定分簇策略;动态评估节点拓扑结构和性能状况,以便及时更新分簇策略。仿真结果表明,方案能够较准确地对多目标实施追踪监控。     

Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels

In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization (NUM) problem subject to link rate constraints. By jointly taking into account of the link scheduling and the statistical variations of signal and interference power, the convex sets for the NUM are derived. Two types of non-deterministic fading channels (i.e., Rayleigh fading channel and Ricean fading channel) are characterized into our NUM models as examples. To solve the convex optimization problem, the subgradient projection method based on dual decomposition is employed. Then, a heuristic algorithm is designed for the TDM mode wireless multi-hop networks by minimizing the discrepancy between the expected network cost and the optimal one in each timeslot. At last, the source–destination session rate and network utility are evaluated in a dedicated wireless multi-hop network scenario. The numerical results demonstrate that the session rates convergence and the network utility is improved by our proposed scheme.     

An efficient routing scheme with optimal power control in wireless multi-hop sensor networks

Power consumption is a critical problem in providing multimedia communications among wireless sensor nodes (WSNs). To reduce power consumption and satisfying QoS requirements, in this paper, we propose an efficient routing scheme with optimal power management and on-demand quality control for WSNs. Two cost functions are developed to minimize the transmitting power and maximize the link quality under the constraint that an end-to-end frame error probability should be met. The heuristic problem of minimizing power consumption under frame error constraints is formulated and resolved with a closed-form expression. With this closed-form expression, we can determine an optimal route rapidly by calculating the power requirement for each sensor node. Finally, our analytical results indicate that the proposed scheme is superior to a previous work with the same constraint and is also comparable to the results obtained from a heuristic simulation.     

A fuzzy-based interleaved multi-hop authentication scheme in wireless sensor networks

In sensor networks, a compromised node can either generate fabricated reports with false votes or inject false votes into real reports, which causes severe damage such as false alarms, energy drain and information loss. An interleaved hop-by-hop authentication (IHA) scheme addresses the former attack by detecting and filtering false reports in a deterministic and hop-by-hop fashion. Unfortunately, in IHA, all en-route nodes must join to verify reports while only a few are necessary to the authentication procedure. In this paper, we propose a fuzzy-based interleaved multi-hop authentication scheme based on IHA. In our scheme, the fuzzy logic system only selects some nodes for verification based on the network characteristics. Moreover, we apply a voting method and a hash-based key assignment mechanism to improve network security. Through performance evaluation, the proposed scheme is found to save up to 13% of the energy consumption and to provide more network protection compared to IHA.     

OLSR-aware channel access scheduling in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a key technology having various advantages, especially in providing cost-effective coverage and connectivity solutions in both rural and urban areas. WMNs are typically deployed as backbone networks, usually employing spatial TDMA (STDMA)-based access schemes which are suitable for the high traffic demands of WMNs. This paper aims to achieve higher utilization of the network capacity and thereby aims to increase the application layer throughput of STDMA-based WMNs. The central idea is to use optimized link state routing (OLSR)-specific routing layer information in link layer channel access schedule formation. This paper proposes two STDMA-based channel access scheduling schemes (one distributed, one centralized) that exploit OLSR-specific information to improve the application layer throughput without introducing any additional messaging overhead. To justify the contribution of using OLSR-specific information to the throughput, the proposed schemes are compared against one another and against their non-OLSR-aware versions via extensive ns-2 simulations. Our simulation results verify that utilizing OLSR-specific information significantly improves the overall network performance both in distributed and in centralized schemes. The simulation results further show that OLSR-aware scheduling algorithms attain higher end-to-end throughput although their non-OLSR-aware counterparts achieve higher concurrency in slot allocations.     

Hierarchical agent-based secure and reliable multicast in wireless mesh networks

We propose and analyze a hierarchical agent-based secure and reliable multicast (HASRM) algorithm for efficiently supporting secure and reliable mobile multicast in wireless mesh networks, with design considerations given to minimize the overall network cost incurred by reliable multicast packet delivery, mobility management, security key management, and group membership maintenance. HASRM dynamically maintains a group of multicast agents running on mesh routers for integrated mobility and multicast service management and leverages a hierarchical multicast structure for secure and reliable multicast data delivery. The regional service size of each multicast agent is a key design parameter. We show via model-based performance analysis and simulation validation that there exists an optimal regional service size that minimizes the overall communication cost and the optimal regional service size can be dynamically determined. We demonstrate that HASRM under optimal settings significantly outperforms traditional algorithms based on shortest-path multicast trees extended with user mobility, security, and reliability support. We also show that a variant of HASRM is superior to a recently proposed multicast algorithm for secure group communication in wireless mesh networks.     

无线网状网络的多路径路由与调度算法

提出了一种保障服务质量的多路径路由算法,数据分组可通过多条不同的路径进行传输,以提升网络总吞吐量性能.进一步提出了一种多路径调度策略.通过使用调度策略,基于当前可用带宽信息和路径所引入的时延信息,数据分组在传输前可被分成多段并通过不同的路径发送,根据路径时延调整优化调度策略,从而使得数据可通过在不同的路径上进行更高效地传输.仿真实验进一步验证了本文提出的路由机制和调度策略在不同网络负载下的优越性.     

Approximate dynamic programming for link scheduling in wireless mesh networks

In this paper a novel interference-based formulation and solution methodology for the problem of link scheduling in wireless mesh networks is proposed. Traditionally, this problem has been formulated as a deterministic integer program, which has been shown to be -hard. The proposed formulation is based on dynamic programming and allows greater flexibility since dynamic and stochastic components of the problem can be embedded into the optimization framework. By temporal decomposition we reduce the size of the integer program and using approximate dynamic programming (ADP) methods we tackle the curse of dimensionality. The numerical results reveal that the proposed algorithm outperforms well-known heuristics under different network topologies. Finally, the proposed ADP methodology can be used not only as an upper bound but also as a generic framework where different heuristics can be integrated.