14,927 research outputs found
Cooperative wireless networks
In the last few years, there have been a lot of interests in wireless ad-hoc networks as
they have remarkable commercial and military applications. Such wireless networks
have the benefit of avoiding a wired infrastructure. However, signal fading is a severe
problem for wireless communications particularly for the multi-hop transmissions in
the ad-hoc networks. Cooperative communication has been proposed as an effective
way to improve the quality of wireless links. The key idea is to have multiple wireless
devices at different locations cooperatively share their antenna resources and aid
each other’s transmission.
In this thesis, we develop effective algorithms for cooperative wireless ad-hoc
networks, and the performance of cooperative communication is measured based
on various criteria, such as cooperative region, power ratio and end-to-end performance.
For example, the proposed interference subtraction and supplementary cooperation
algorithms can significantly improve network throughput of a multi-hop routing.
Comprehensive simulations are carried out for all the proposed algorithms and
performance analysis, providing quantitative evidence and comparison over other
schemes. In our view, the new cooperative communication algorithms proposed
in this research enable wireless ad-hoc networks to improve radio unreliability and
meet future application requirements of high-speed and high-quality services with
high energy efficiency. The acquired new insights on the network performance of
the proposed algorithms can also provide precise guidelines for efficient designs of
practical and reliable communications systems. Hence these results will potentially
have a broad impact across a range of related areas, including wireless communications,
network protocols, radio transceiver design and information theory
Physical Layer Network Coding: A Cautionary Story with Interference and Spatial Reservation
Physical layer network coding (PLNC) has the potential to improve throughput
of multi-hop networks. However, most of the works are focused on the simple,
three-node model with two-way relaying, not taking into account the fact that
there can be other neighboring nodes that can cause/receive interference. The
way to deal with this problem in distributed wireless networks is usage of
MAC-layer mechanisms that make a spatial reservation of the shared wireless
medium, similar to the well-known RTS/CTS in IEEE 802.11 wireless networks. In
this paper, we investigate two-way relaying in presence of interfering nodes
and usage of spatial reservation mechanisms. Specifically, we introduce a
reserved area in order to protect the nodes involved in two-way relaying from
the interference caused by neighboring nodes. We analytically derive the
end-to-end rate achieved by PLNC considering the impact of interference and
reserved area. A relevant performance measure is data rate per unit area, in
order to reflect the fact that any spatial reservation blocks another data
exchange in the reserved area. The numerical results carry a cautionary message
that the gains brought by PLNC over one-way relaying may be vanishing when the
two-way relaying is considered in a broader context of a larger wireless
network.Comment: 6 pages, 11 figures, Proc. of IEEE CoCoNet Workshop in conjunction
with IEEE ICC 201
Packet level measurement over wireless access
PhDPerformance Measurement of the IP packet networks mainly comprise of monitoring the network performance in terms of packet losses and delays. If used appropriately, these network parameters (i.e. delay, loss and bandwidth etc) can indicate the performance status of the network and they can be used in fault and performance monitoring, network provisioning, and traffic engineering. Globally, there is a growing need for accurate network measurement to support the commercial use of IP networks. In wireless networks, transmission losses and communication delays strongly affect the performance of the network. Compared to wired networks, wireless networks experience higher levels of data dropouts, and corruption due to issues of channel fading, noise, interference and mobility. Performance monitoring is a vital element in the commercial future of broadband packet networking and the ability to guarantee quality of service in such networks is implicit in Service Level Agreements.
Active measurements are performed by injecting probes, and this is widely used to determine the end to end performance. End to end delay in wired networks has been extensively investigated, and in this thesis we report on the accuracy achieved by probing for end to end delay over a wireless scenario. We have compared two probing techniques i.e. Periodic and Poisson probing, and estimated the absolute error for both. The simulations have been performed for single hop and multi- hop wireless networks.
In addition to end to end latency, Active measurements have also been performed for packet loss rate. The simulation based analysis has been tried under different traffic scenarios using Poisson Traffic Models. We have sampled the user traffic using Periodic probing at different rates for single hop and multiple hop wireless scenarios.
5
Active probing becomes critical at higher values of load forcing the network to saturation much earlier. We have evaluated the impact of monitoring overheads on the user traffic, and show that even small amount of probing overhead in a wireless medium can cause large degradation in network performance. Although probing at high rate provides a good estimation of delay distribution of user traffic with large variance yet there is a critical tradeoff between the accuracy of measurement and the packet probing overhead. Our results suggest that active probing is highly affected by probe size, rate, pattern, traffic load, and nature of shared medium, available bandwidth and the burstiness of the traffic
Capacity and interference modeling of CSMA/CA networks using SSI point processes
International audienceThe relative location of simultaneous transmitters, i.e. the set of nodes transmitting a frame at a given time, has a crucial impact on the performance of multi hop wireless networks. Two fundamental aspects of wireless network performances are related to these locations: capacity and interference. Indeed, as interference results from the summation of signals stemmed by concurrent transmitters, it directly depends on the transmitters' location. On the other hand, the network capacity is proportional to the number of simultaneous transmitters. In this paper, we investigate original point processes that can be used to model the location of transmitters that comply with the CSMA/CA policies, i.e. the Medium Access Control protocol used in 802.15.4 and 802.11 families of wireless technologies. We first propose the use of the Simple Sequential Inhibition point process to model CSMA/CA networks where clear channel assessment depends on the strongest emitter only. We then extend this point process to model a busy medium detection based on the strength of all concurrent signals. We finally compare the network capacity obtained through realistic simulations to a theoretical capacity estimated using the intensity of the SSI point process. It turns out that the proposed model is validated by the simulations
How do Wireless Chains Behave? The Impact of MAC Interactions
In a Multi-hop Wireless Networks (MHWN), packets are routed between source
and destination using a chain of intermediate nodes; chains are a fundamental
communication structure in MHWNs whose behavior must be understood to enable
building effective protocols. The behavior of chains is determined by a number
of complex and interdependent processes that arise as the sources of different
chain hops compete to transmit their packets on the shared medium. In this
paper, we show that MAC level interactions play the primary role in determining
the behavior of chains. We evaluate the types of chains that occur based on the
MAC interactions between different links using realistic propagation and packet
forwarding models. We discover that the presence of destructive interactions,
due to different forms of hidden terminals, does not impact the throughput of
an isolated chain significantly. However, due to the increased number of
retransmissions required, the amount of bandwidth consumed is significantly
higher in chains exhibiting destructive interactions, substantially influencing
the overall network performance. These results are validated by testbed
experiments. We finally study how different types of chains interfere with each
other and discover that well behaved chains in terms of self-interference are
more resilient to interference from other chains
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
Embedding of Virtual Network Requests over Static Wireless Multihop Networks
Network virtualization is a technology of running multiple heterogeneous
network architecture on a shared substrate network. One of the crucial
components in network virtualization is virtual network embedding, which
provides a way to allocate physical network resources (CPU and link bandwidth)
to virtual network requests. Despite significant research efforts on virtual
network embedding in wired and cellular networks, little attention has been
paid to that in wireless multi-hop networks, which is becoming more important
due to its rapid growth and the need to share these networks among different
business sectors and users. In this paper, we first study the root causes of
new challenges of virtual network embedding in wireless multi-hop networks, and
propose a new embedding algorithm that efficiently uses the resources of the
physical substrate network. We examine our algorithm's performance through
extensive simulations under various scenarios. Due to lack of competitive
algorithms, we compare the proposed algorithm to five other algorithms, mainly
borrowed from wired embedding or artificially made by us, partially with or
without the key algorithmic ideas to assess their impacts.Comment: 22 page
Reliable Prediction of Channel Assignment Performance in Wireless Mesh Networks
The advancements in wireless mesh networks (WMN), and the surge in
multi-radio multi-channel (MRMC) WMN deployments have spawned a multitude of
network performance issues. These issues are intricately linked to the adverse
impact of endemic interference. Thus, interference mitigation is a primary
design objective in WMNs. Interference alleviation is often effected through
efficient channel allocation (CA) schemes which fully utilize the potential of
MRMC environment and also restrain the detrimental impact of interference.
However, numerous CA schemes have been proposed in research literature and
there is a lack of CA performance prediction techniques which could assist in
choosing a suitable CA for a given WMN. In this work, we propose a reliable
interference estimation and CA performance prediction approach. We demonstrate
its efficacy by substantiating the CA performance predictions for a given WMN
with experimental data obtained through rigorous simulations on an ns-3 802.11g
environment.Comment: Accepted in ICACCI-201
- …