3,329 research outputs found
PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks
IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC.
PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned
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
Hybrid Satellite-Terrestrial Communication Networks for the Maritime Internet of Things: Key Technologies, Opportunities, and Challenges
With the rapid development of marine activities, there has been an increasing
number of maritime mobile terminals, as well as a growing demand for high-speed
and ultra-reliable maritime communications to keep them connected.
Traditionally, the maritime Internet of Things (IoT) is enabled by maritime
satellites. However, satellites are seriously restricted by their high latency
and relatively low data rate. As an alternative, shore & island-based base
stations (BSs) can be built to extend the coverage of terrestrial networks
using fourth-generation (4G), fifth-generation (5G), and beyond 5G services.
Unmanned aerial vehicles can also be exploited to serve as aerial maritime BSs.
Despite of all these approaches, there are still open issues for an efficient
maritime communication network (MCN). For example, due to the complicated
electromagnetic propagation environment, the limited geometrically available BS
sites, and rigorous service demands from mission-critical applications,
conventional communication and networking theories and methods should be
tailored for maritime scenarios. Towards this end, we provide a survey on the
demand for maritime communications, the state-of-the-art MCNs, and key
technologies for enhancing transmission efficiency, extending network coverage,
and provisioning maritime-specific services. Future challenges in developing an
environment-aware, service-driven, and integrated satellite-air-ground MCN to
be smart enough to utilize external auxiliary information, e.g., sea state and
atmosphere conditions, are also discussed
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks
Millimeter wave (mmW) bands between 30 and 300 GHz have attracted
considerable attention for next-generation cellular networks due to vast
quantities of available spectrum and the possibility of very high-dimensional
antenna ar-rays. However, a key issue in these systems is range: mmW signals
are extremely vulnerable to shadowing and poor high-frequency propagation.
Multi-hop relaying is therefore a natural technology for such systems to
improve cell range and cell edge rates without the addition of wired access
points. This paper studies the problem of scheduling for a simple
infrastructure cellular relay system where communication between wired base
stations and User Equipment follow a hierarchical tree structure through fixed
relay nodes. Such a systems builds naturally on existing cellular mmW backhaul
by adding mmW in the access links. A key feature of the proposed system is that
TDD duplexing selections can be made on a link-by-link basis due to directional
isolation from other links. We devise an efficient, greedy algorithm for
centralized scheduling that maximizes network utility by jointly optimizing the
duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD
mmW networks. The proposed algorithm can dynamically adapt to loading, channel
conditions and traffic demands. Significant throughput gains and improved
resource utilization offered by our algorithm over the static,
globally-synchronized TDD patterns are demonstrated through simulations based
on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks -
BackNets 201
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
- …