10,867 research outputs found
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
MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops
When deploying resource-intensive signal processing applications in wireless
sensor or mesh networks, distributing processing blocks over multiple nodes
becomes promising. Such distributed applications need to solve the placement
problem (which block to run on which node), the routing problem (which link
between blocks to map on which path between nodes), and the scheduling problem
(which transmission is active when). We investigate a variant where the
application graph may contain feedback loops and we exploit wireless networks?
inherent multicast advantage. Thus, we propose Multicast-Aware Routing for
Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient
solutions for scheduling and routing under a detailed interference model. We
cast this as a mixed integer quadratically constrained optimisation problem and
provide an efficient heuristic. Simulations show that our approach handles
complex scenarios quickly.Comment: 6 page
Interference-Aware Routing in Wireless Mesh Networks
User demand for seamless connectivity has encouraged the development of alternatives to traditional communications infrastructure
networks. Potential solutions have to be low-cost, easily deployable and adaptive to the environment. One approach that has gained
tremendous attention over the past few years is the deployment of a backbone of access points wirelessly interconnected, allowing users to access the wired infrastructure via wireless multi-hop communication. Wireless Mesh Networks (WMN) fall into this category
and constitute a technology that could revolutionize the way wireless network access is provided. However, limited transfer
capacity and interference resulting from the shared nature of the transmission medium will prevent widespread deployment if the
network performance does not meet users' expectations. It is therefore imperative to provide efficient mechanisms for such networks.
Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms have been proposed for other wireless technologies, the unique characteristics of WMNs (i.e. fixed wireless backbone, with the
possibility to embed multiple interfaces) prevent their straight forward adoption in WMNs. Moreover, the severe performance degradations that can result from the interference generated by concurrent data transmissions and environmental noise call for the development of interference-aware routing mechanisms.
In this thesis, we investigated the impact of interference on the
network performance of wireless mesh networks.
We designed algorithms to associate routers to gateways that minimize the interference level in single-channel and multi-channel
networks.
We then studied the performance of existing routing metrics and their suitability for mesh networks.
As a result of this analysis, we designed a novel routing metric and showed its benefits over existing ones.
Finally, we provided an analytical evaluation of the probability of finding two non interfering paths given a network topology
Radio Co-location Aware Channel Assignments for Interference Mitigation in Wireless Mesh Networks
Designing high performance channel assignment schemes to harness the
potential of multi-radio multi-channel deployments in wireless mesh networks
(WMNs) is an active research domain. A pragmatic channel assignment approach
strives to maximize network capacity by restraining the endemic interference
and mitigating its adverse impact on network performance. Interference
prevalent in WMNs is multi-faceted, radio co-location interference (RCI) being
a crucial aspect that is seldom addressed in research endeavors. In this
effort, we propose a set of intelligent channel assignment algorithms, which
focus primarily on alleviating the RCI. These graph theoretic schemes are
structurally inspired by the spatio-statistical characteristics of
interference. We present the theoretical design foundations for each of the
proposed algorithms, and demonstrate their potential to significantly enhance
network capacity in comparison to some well-known existing schemes. We also
demonstrate the adverse impact of radio co- location interference on the
network, and the efficacy of the proposed schemes in successfully mitigating
it. The experimental results to validate the proposed theoretical notions were
obtained by running an exhaustive set of ns-3 simulations in IEEE 802.11g/n
environments.Comment: Accepted @ ICACCI-201
Interference mitigation in wireless mesh networks through radio co-location aware conflict graphs
Wireless Mesh Networks (WMNs) have evolved into a wireless communication technology of immense interest. But technological advancements in WMNs have inadvertently spawned a plethora of network performance bottlenecks, caused primarily by the rise in prevalent interference. Conflict Graphs are indispensable tools used to theoretically represent and estimate the interference in wireless networks. We propose a generic algorithm to generate conflict graphs which is independent of the underlying interference model. Further, we propose the notion of radio co-location interference, which is caused and experienced by spatially co-located radios in multi-radio multi-channel WMNs. We experimentally validate the concept, and propose a new all-encompassing algorithm to create a radio co-location aware conflict graph. Our novel conflict graph generation algorithm is demonstrated to be significantly superior and more efficient than the conventional approach, through theoretical interference estimates and comprehensive experiments. The results of an extensive set of ns-3 simulations run on the IEEE 802.11g platform strongly indicate that the radio co-location aware conflict graphs are a marked improvement over their conventional counterparts. We also question the use of total interference degree as a reliable metric to predict the performance of a Channel Assignment scheme in a given WMN deployment
- …