Fuzzy Logic-Based Multicast Routing in Multiradio Multichannel Wireless Mesh Networks

The availability of bandwidth in wireless mesh networks (WMNs) introduces it as a prominent choice for implementing bandwidth sensitive services. Multicast services such as teleconferencing, push-based systems, multiplayer games, etc., can be implemented in an efficient way in such networks. Moreover, the severe performance degradations that can result from the interference generated by concurrent data transmissions and environmental noises call for the development of interference-aware routing mechanisms. This paper investigates the impact of wireless interference on network performance for multicast transmission in WMNs. We show that by taking wireless interference into consideration in the design of routing mechanisms, better resource usage can be achieved. Hence, a fuzzy logic–based approach is proposed to choose optimal routes from source to the multicast group in multichannel case. Three fuzzy variables are considered in route selection phase, which are interference, available bandwidth, and hop count. Extensive simulations are conducted aiming at verifying the high performance of the proposed algorithm. Simulation results demonstrated that our proposed algorithm outperforms Link-Controlled Multi-Rate Multi-Channel (LC-MRMC) and Channel Assignment with Multiple Factor (CAMF) algorithms in terms of throughput, packet delivery ratio, and end-to-end delay.     

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduce the interference effect of close-by transmissions. Unlike the previous studies that often assume a unit disk graph model, we assume that different terminals could have different transmission ranges and interference ranges. In our model, a communication link may not exist due to barriers or is not used by a predetermined routing protocol. Using a mathematical formulation, we develop interference aware joint routing and TDMA link schedulings that optimize the networking throughput subject to various constraints. Our linear programming formulation will find a flow routing whose achieved throughput (or fairness) is at least a constant fraction of the optimum. Then, by assuming known link capacities and link traffic loads, we study link scheduling under the RTS/CTS interference model and the protocol interference model with fixed transmission power. For both models, we present both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum. We also present efficient distributed algorithms whose performances are still comparable with optimum, but with much less communications. Our theoretical results are corroborated by extensive simulation studies.     

基于多蚁群算法的无线传感器网络路由的跨层设计

针对事件驱动型无线传感器网络对数据传输的强实时性和高可靠性的要求,将统计获得的节点接入效率和负载队列长度等MAC层状态信息作为路由度量参数。考虑到蚂蚁网络算法在重负荷网络中存在传输延迟大、聚合速度慢等缺陷,提出了一种基于多蚁群算法的负载感知和高效接入的跨层路由协议,该协议把节点的单跳延迟、负载及带宽接入效率等参数作为路径的启发值进行路由优化。仿真结果表明,基于多蚁群算法的路由协议能够保证数据传输的实时性,能够实现无线传感器网络的拥塞控制及负载平衡。     

Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks

The wireless mesh network is an emerging technology that provides high quality service to end users as the "last mile” of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. This paper proposes two multicast algorithms: the Level Channel Assignment (LCA) algorithm and the Multichannel Multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using partially overlapping channels can further diminish the interference. Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.     

基于功率调节的IWSN实时可靠路由研究

针对工业无线传感器网络对延迟、可靠传输以及成本的特殊要求,研究了一种基于功率调节的实时可靠路由协议,将两跳速度策略引入到路由算法中,提高工业无线传感器网络的实时性;将节点剩余能量以及能耗同时考虑,以平衡网络能量并提高网络寿命;引入功率调节机制以绕开路由空洞,提高节点可靠性.仿真结果显示,与已有方法相比,采用的方法在总可靠度、截止期错失率以及包平均延迟上有着显著改善.     

无线多媒体传感器网络视频流多路径路由算法

无线多媒体传感器网络中的视频流传输,需要提供多样QoS保障.提出一种基于改进蚁群算法多路径路由算法ACMRA(ant colony based multipath routing algorithm),以寻找具有多种优先级路径的路径集,并对重要性不同的视频数据进行相应路径的选择.通过优化网络链路上人工信息素的初始分布,改进后的蚁群算法具有更快的可行路径发现速度及收敛速度.多路径机制的引入提高了网络数据吞吐量与视频传输性能,同时可均衡网络资源,延长网络生命.实验结果表明,算法ACMRA在网络性能、视频传榆性能与网络生命周期方面,较之其他路由算法具有明显优势.     

Fuzzy random multi-objective optimization based routing for wireless sensor networks

Wireless sensor networks are deployed in complex and uncertain environments, and multiple objectives of routing algorithms are expected to be optimal. However, routing algorithms based on deterministic single objective optimization may not flexibly meet the above needs of applications. This paper adopts fuzzy random optimization and multi-objective optimization, introduces fuzzy random variables to describe both fuzziness and randomness of link delay, link reliability and nodes’ residual energy, and proposes a routing model based on fuzzy random expected value and standard deviation model. A hybrid routing algorithm based on fuzzy random multi-objective optimization is designed, which embeds fuzzy random simulation into genetic algorithm with Pareto optimal solution. Simulation results show that the presented algorithm, by adjusting the parameters of fuzzy random variables for depicting both fuzziness and randomness, achieves a longer lifetime and wider performances of delay, latency jitter, reliability, communication interference, energy and balanced energy distribution. Therefore, the presented algorithm can meet different application needs of the cluster head network in the two-tiered wireless sensor networks.     

一种无线多媒体传感器网络分区链路调度算法

链路干扰是无线多媒体传感器网络实现大容量、实时、可靠传输的主要困难。为提高多跳传输模式下无线网络性能,基于MAC层的调度算法得到了广泛关注。调度算法为每条链路分配合理的传输时槽,降低了冲突和重传次数,能显著提高网络传输性能。但随着网络规模的增大,无论是集中式还是分布式调度算法,都存在调度开销增大和性能降低的问题。针对这一问题,根据节点分布密度和承载网络流量大小,将网络划分为密集区域和稀疏区域。稀疏区域的节点传输冲突较小,直接采用CSMA的协议。密集区域的节点传输冲突大,采用基于队列长度的分布式调度。分区调度能够有效降低网络规模扩大导致的调度算法复杂性增大的问题。仿真实验表明,分区调度算法无论是在队列长度,还是在延时性能上,较传统算法有明显改善。     

一种基于链路质量的移动Ad-hoc网络地理路由算法

如何实现简单的路由机制,使节点能够快速、高效地完成分组传递,是移动aa-ho}网络研究的一个基本问题。针对无线链路在高误码率和杭干扰技术方面的不足,提出了将链路质量作为路由选择的度量,设计并实现了基于链路质量的地理路由算法LQPR,解决了在非理想无线链路上采用传统贪婪算法引起数据分组传送率下降的问题。该算法综合了链路质量选择模式和边界选择模式,并利用目标定位技术获取的地理位置信息指导分组的转发,以减少控制开销,优化路径选择,实现数据分组快速有效的传输。在NS-2中完整实现了LQPR协议的仿真,并通过对网络节点发送数据包的端到端时延、吞吐量以及包传送率进行比较、评估和检侧,验证了LQPR路由协议的有效性。     

一个低开销的无线传感器网络多径路由协议

针对多对一的周期性数据收集应用,提出一个低开销的逐跳多径路由协议LOMP,综合利用定期和实时估计器评估链路质量,在此基础上实现高质量的多径路由。与现有的多径路由协议相比,LOMP并不提供端到端的节点独立的多径路由,而只是确保在报文的每一跳转发过程中都有多条路径可用。仿真结果表明LOMP能够提高选路质量,以较小的能量开销提高数据传输的可靠性。     

An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks

In wireless ad hoc networks, end-to-end delivery over network is a critical concern for routing protocols. The capacity of routing protocols is constrained by the intra-flow interference introduced by adjacent nodes on the same path, and inter-flow interference generated by nodes from neighboring paths. In this paper, we develop an on-demand routing protocol M-AODV-R that solves the channel assignment, reuse and routing problem jointly. The proposed channel reuse scheme and channel assignment scheme can enhance channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel ad hoc networks over existing routing protocols. Simulation results show that the proposed routing M-AODV-R can effectively increase throughput and reduce delay, as compared to AODV protocol.     

Efficient link scheduling with joint power control and successive interference cancellation in wireless networks无线网络中联合功率控制和串行干扰消除的高效链路调度算法

Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation (SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC (PCSIC) problem as a mixed-integer non-linear programming (MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.     

Optimizing the radio resource utilization of multiaccess systems with a traffic-transmission quality adaptive packet scheduling

In this paper we state a general framework for radio resource allocation based on a matrix which highlights the trade-offs of complexity and efficiency. This framework is outlined for the systematic definition of scheduling algorithms that are jointly adaptive to traffic and to transmission quality in order to improve the radio resource utilization and the achievable throughput of cellular networks for the support of best-effort traffic. We consider the application of the matrix concept to both time division and code division multiple access, the latter scheme also bringing about mutual interference among competing users. Then we propose a scheduling algorithm for wireless systems, called channel adaptive open scheduling (CHAOS). The CHAOS performance in terms of throughput and delay is extensively compared with those resulting from a load adaptive channel independent scheduling (CIS). A major result of this work is the quantitative assessment of the performance advantage allowed by jointly accounting for traffic congestion and transmission quality. Moreover the main implementation issues related to the proposed algorithms are investigated.     

REUSE: A combined routing and link scheduling mechanism for wireless mesh networks

Increasing the capacity of wireless mesh networks has motivated numerous studies. In this context, the cross-layer optimization techniques involving joint use of routing and link scheduling are able to provide better capacity improvements. Most works in the literature propose linear programming models to combine both mechanisms. However, this approach has high computational complexity and cannot be extended to large-scale networks. Alternatively, algorithmic solutions are less complex and can obtain capacity values close to the optimal. Thus, we propose the REUSE algorithm, which combines routing and link scheduling and aims to increase throughput capacity in wireless mesh networks. Through simulations, the performance of the proposal is compared to a developed linear programming model, which provides optimal results, and to other proposed mechanisms in the literature that also deal with the problem algorithmically. We observed higher values of capacity in favor of our proposal when compared to the benchmark algorithms.     

Ant-based routing for wireless multimedia sensor networks using multiple QoS metrics

In wireless sensor networks, most routing protocols consider energy savings as the main objective and assume data traffic with unconstrained delivery requirements to be a given. However, the introduction of video and imaging sensors unveils additional challenges. The transmission of video and imaging data requires both energy efficiency and QoS assurance (end-to-end delay and packet loss requirements), in order to ensure the efficient use of sensor resources as well as the integrity of the information collected. This paper presents a QoS routing model for Wireless Multimedia Sensor Networks (WMSN). Moreover, based on the traditional ant-based algorithm, an ant-based multi-QoS routing metric (AntSensNet) is proposed. The AntSensNet protocol builds a hierarchical structure on the network before choosing suitable paths to meet various QoS requirements from different kinds of traffic, thus maximizing network utilization, while improving its performance. In addition, AntSensNet is able to use a efficient multi-path video packet scheduling in order to get minimum video distortion transmission. Finally, extensive simulations are conducted to assess the effectiveness of this novel solution and a detailed discussion regarding the effects of different system parameters is provided. Compared to typical routing algorithms in sensor networks and the traditional ant-based algorithm, this new algorithm has better convergence and provides significantly better QoS for multiple types of services in wireless multimedia sensor networks.     

Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

In highly dynamic and heterogeneous wireless mesh networks (WMN), link quality will seriously affect network performance. Two challenges hinder us from achieving a highly efficient WMN. One is the channel dynamics. As in real network deployment, channel qualities are changing over time, which would seriously affect network bandwidth and reliability. Existing works are limited to the assumption that link quality values are fixed, and optimal scheduling algorithms are working on the fixed values, which would inevitably suffer from the link quality dynamics. Another challenge is the channel diversity. In single channel wireless networks, channel assignment and scheduling are NP\mathcal{NP} -hard. And in multichannel wireless networks, it could be even harder for higher throughput and efficient scheduling. In this study, we firstly characterize the stochastic behavior on wireless communications in a Markov process, which is based on statistical methodology. Secondly, on exploiting the stochastic behavior on wireless channels, we propose a stochastic programming model in achieving maximized network utilization. Considering the NP\mathcal{NP} -hardness, we propose a heuristic solution for it. The key idea in the proposed algorithm is a two-stage matching process named “Rematch.” Indeed, our solution to the stochastic network scheduling is a cross-layer approach. Also, we have proved that it is 2-approximate to the optimal result. Moreover, extensive simulations have been done, showing the efficiency of “Rematch” in highly dynamic and distributed wireless mesh networks.     

A novel optimization-based bandwidth-aware minimum power multicast routing algorithm in green wireless networks

Multicast routing in wireless networks that possess the wireless multicast advantage could significantly reduce the power and energy consumption. However, this kind of multicast routing that only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. As a result, additional transmissions are required to incur more energy consumption and carbon dioxide emissions that make existing algorithms not applicable to bandwidth constrained applications. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks where the objective function is to minimize the total power consumption subject to the users?? bandwidth requirements. This problem is a challenging cross-layer design problem that requires seamless and sophisticated integrated design in the network layer (multicast routing) and physical layer (bandwidth-aware wireless transmission and power control). We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangian relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach is a sound green networking algorithm that outperforms the existing power efficient multicast routing approaches under all tested cases, especially in large bandwidth request, fine radius granularity, large group size and sparse network.     

能量捕获无线传感器网络中速率自适应路由算法

能量捕获无线传感器网络是无源感知技术中非常重要的一类,它能够有效解决节点能量受限的问题,保持网络运行的持续性.现有的路由方法并未充分利用节点的能量捕获特性,也没有考虑到链路的成功收包率和节点的传输速率.为进一步提高网络的性能,提出了一种结合链路成功收包率的速率自适应路由算法.通过对节点的剩余能量和链路的成功收包率进行建模,给出了一个节点可作为路由中继节点所需要满足的两个条件;基于优化方程,为传输路径上的每一跳节点自适应配置时延最小化的传输速率;提出路由发现步骤来找出端到端传输时延最小的传输路径.实验结果表明,相比于固定传输速率的路由算法,所提算法所得到的传输路径具有较低的端到端传输时延和较高的吞吐率.     

适用于WSNs的拥塞自适应多径路由算法

针对无线传感器网络(WSNs)数据汇聚特性易导致网络拥塞的问题,结合改进AOMDV协议的多径建立、选择机制的缺陷,提出一种拥塞自适应的多径路由算法。新协议首先引入相关因子模型建立相互干扰度最小的路径集;其次建立路径拥塞信息采集、更新机制,并利用HELLO消息传递。最终源节点通过实时感知路径拥塞信息,自适应选择低拥塞路径来避免拥塞。仿真结果表明:改进的协议显著提高了分组投递速率,降低了端对端时延。