Interference-aware Routing Protocol Research Articles

Coefficient of Restitution based Cross Layer Interference Aware Routing Protocol in Wireless Mesh Networks

In Multi-Radio Multi-Channel (MRMC) Wireless Mesh Networks (WMN), Partially Overlapped Channels (POC) has been used to increase the parallel transmission. But adjacent channel interference is very severe in MRMC environment; it decreases the network throughput very badly. In this paper, we propose a Coefficient of Restitution based cross layer interference aware routing protocol (CoRCiaR) to improve TCP performance in Wireless Mesh Networks. This approach comprises of two-steps: Initially, the interference detection algorithm is developed at MAC layer by enhancing the RTS/CTS method. Based on the channel interference, congestion is identified by Round Trip Time (RTT) measurements, and subsequently the route discovery module selects the alternative path to send the data packet. The packets are transmitted to the congestion free path seamlessly by the source. The performance of the proposed CoRCiaR protocol is measured by Coefficient of Restitution (COR) parameter. The impact of the rerouting is experienced on the network throughput performance. The simulation results show that the proposed cross layer interference aware dynamic routing enhances the TCP performance on WMN.

Avoiding Void Holes and Collisions with Reliable and Interference-Aware Routing in Underwater WSNs.

Sparse node deployment and dynamic network topology in underwater wireless sensor networks (UWSNs) result in void hole problem. In this paper, we present two interference-aware routing protocols for UWSNs (Intar: interference-aware routing; and Re-Intar: reliable and interference-aware routing). In proposed protocols, we use sender based approach to avoid the void hole. The beauty of the proposed schemes is that they not only avoid void hole but also reduce the probability of collision. The proposed Re-Intar also uses one-hop backward transmission at the source node to further improve the packet delivery ratio of the network. Simulation results verify the effectiveness of the proposed schemes in terms of end-to-end delay, packet delivery ratio and energy consumption.

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR) technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources.
 
 We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT) routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV) and the weighted cumulative expected transmission time (WCETT) routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

An Energy Efficient Interference-aware Routing Protocol for Underwater WSNs

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

Outage probability analysis of optimal and suboptimal interference aware routing protocols for multihop underlay cognitive radio networks

ABSTRACTIn this paper, optimal and suboptimal routing protocols are proposed for cognitive radio networks. We first investigate optimal routing protocol that consists in searching among all available paths, the one that minimises the end‐to‐end outage while verifying interference constraint to primary receiver. A suboptimal one‐hop routing protocol is proposed where the best relay is selected in each hop. The last routing protocol consists in decomposing the network in many subnetworks composed of K hops. Then, the best route is determined in each of these subnetworks so that the K‐hops outage probability is minimised. The proposed K‐hops routing protocol allows a good compromise between complexity and performance. The outage probability of the different routing protocols is evaluated theoretically and through simulation results.Copyright © 2014 John Wiley & Sons, Ltd.

Coding- and interference-aware routing protocol in wireless networks

Network coding is considered as a promising technique to increase the bandwidth available in a wireless network. Many studies show that network coding can improve flow throughput only if an appropriate routing algorithm is used to identify paths with coding opportunities. Nevertheless, a good routing mechanism is very difficult to develop. Existing solutions either do not estimate the path bandwidth precisely enough or cannot identify the best path in some situations. In this paper, we describe our coding-aware routing protocol that provides a better path bandwidth estimate and is able to identify high throughput paths. Extensive NS2 simulations show that our protocol outperforms existing mechanisms.

Interference aware routing for mobile ad hoc networks based on node's sending and receiving capabilities

How to efficiently build routes among nodes is increasing important for mobile ad hoc networks (MANETs). This paper puts forward an interference aware routing protocol called Interference aware cross layer routing protocol (IA-CLR) for MANETs based on the IEEE 802.11 medium access layer (MAC). By defining the node's sending and receiving capabilities, IA-CLR can indicate the interference strength of the link in a real and comprehensive way. Further more, in order to choose the route with minimum bottleneck link interference, a new routing metric is proposed by combining the MAC layer and the network layer for cross layer design. Simulation results show that IA-CLR can significantly improve the performances of network such as the average end-to-end delay, the packets loss ratio and the throughput.

A new coding- and interference-aware routing protocol in wireless mesh networks

Wireless Mesh Networks (WMNs) have the advantages of low up-front costs, ease of deployment, enhanced capacity and expanded service coverage. However, critical problems such as limited frequency resources, interference, noise and channel fading, make it difficult to improve the throughput of WMNs. Current routing schemes based on network coding either passively wait for potential coding opportunities or fail to reflect the essence of wireless interference. Therefore, a novel Coding and Interference Aware Routing (CIAR) protocol is proposed in this paper, which not only actively detects potential coding opportunities in establishing paths but also takes into account the interference cost in path selection. The CIAR protocol can well make the tradeoffs for routing choices between facilitating more coding gains and mitigating interference. The simulation results demonstrate that our proposed CIAR protocol performs better than traditional schemes in terms of average end-to-end throughput, average end-to-end delay and buffer overflow probability.

United nodes: cluster-based routing protocol for mobile cognitive radio networks

Advancement of cognitive radio (CR) technology can overcome the problems encountered from bandwidth and spectrum access limitations because of tremendous potential to improve the utilisation of the radio spectrum by efficiently reusing and sharing the licensed spectrum bands, as long as the interference power inflicted on the primary users of the band remains below a predefined threshold level. In mobile CR ad hoc networks, routing is one of the most important issues to be addressed and desires deep investigation. In this study, a distributed and efficient cluster-based spectrum and interference aware routing protocol is proposed. The protocol incorporates the spectrum availability cost and interference metrics into the routing algorithm to find better routes. A route preservation method is also implemented to repair the route when it is defective because of primary user activity. Extensive experimental evaluations are performed in the ns2 simulator. Results of the simulations illustrate that, the proposed algorithm can well fit into the mobile CR ad hoc networks and improve the network performance. The results indicate that the proposed protocol provides better adaptability to the environment than the existing ones. It also increases throughput and reduces data delivery latency in a number of realistic scenarios and outperforms recently proposed routing protocols for CR networks.

Interference-Aware Routing in Wireless Multihop Networks

Interference is an inherent characteristic of wireless (multihop) communications. Adding interference-awareness to important control functions, e.g., routing, could significantly enhance the overall network performance. Despite some initial efforts, it is not yet clearly understood how to best capture the effects of interference in routing protocol design. Most existing proposals aim at inferring its effect by actively probing the link. However, active probe measurements impose an overhead and may often misrepresent the link quality due to their interaction with other networking functions. Therefore, in this paper we follow a different approach and: 1) propose a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node; 2) use this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements. To validate our proposal, we have performed experiments in a real testbed, setup in our indoor office environment. We show that the analytical predictions of our interference model exhibit good match with both experimental results as well as more complicated analytical models proposed in related literature. Furthermore, we demonstrate that a simple probeless routing protocol based on our model performs at least as good as well-known probe-based routing protocols in a large set of experiments including both intraflow and interflow interference.

Traffic Load-Based Interference-Aware Routing Protocol for Mobile Ad Hoc Networks

PDF HTML阅读 XML下载 导出引用 引用提醒 移动Ad Hoc网络通信量相关干扰感知路由协议 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant No.60673171 (国家自然科学基金); the National Basic Research Program of China under Grant No.2006CB303006 (国家重点基础研究发展计划(973)) Traffic Load-Based Interference-Aware Routing Protocol for Mobile Ad Hoc Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:干扰严重影响移动Ad hoc网络的网络吞吐量、能量消耗、网络寿命等性能.在已有基于邻居数目和分布位置的干扰模型基础上,进一步考虑各邻居上的通信量情况,提出通信量干扰模型.并在该干扰模型的基础上,提出一个通信量相关干扰感知路由TIR(traffic load-based interference-aware routing)协议.TIR通过在源节点和目的节点之间选择干扰最小的路径来降低数据包在转发过程中可能受到的干扰.模拟实验结果表明,所提出的通信量干扰模型符合移动Ad hoc网络的特性,通信量相关干扰感知路由协议对网络寿命、通信延迟及吞吐量等网络性能有明显改善. Abstract:The interference will greatly influence the performances of networks on its throughput, energy consumption, and lifetime in mobile ad hoc networks (MANET). On the basis of the existing interference models founded on the number and distribution position of the neighbor nodes, the traffic load of neighbors is further considered and an interference model based on traffic load is proposed. Based on the new interference model, a traffic load-based interference-aware routing (TIR) protocol is proposed, which chooses the routing path with the minimal interference between the source node and the destination node to reduce the possible interference generated when a packet is being forwarded. The results of the simulations show that the proposed interference model based on traffic load suits the characteristic of the MANET, and the TIR protocol obviously improves the network’s lifetime, communication delay and throughput. 参考文献 相似文献 引证文献

A power controlled interference aware routing protocol for dense multi-hop wireless networks

A key issue impacting the performance of multi-hop wireless networks is the interference among neighboring nodes. In this paper, we propose a novel and practical interference aware metric, termed as Network Allocation Vector Count (NAVC), to estimate the effects of the interference on the average delay and the available bandwidth. This metric can be easily applied to routing protocols designed for 802.11 based multi-hop networks with no modification to the current 802.11 protocol. The design of NAVC as a metric for the AODV [32] routing protocol, as well as a metric for transmit power control, are described in detail. Our simulation results reveal that the NAVC-driven AODV can greatly improve its performance compared to those protocols based on hop-count. For scenarios of densely deployed nodes, the throughput improvement is often a factor near two, indicating that NAVC is more useful as networks grow denser. Moreover, the network lifetime can be notably prolonged when the NAVC is employed to conduct transmit power control. Our approach is essential for emerging applications such as wireless sensor networks where the interference is heavy and the energy is severely constrained.