8,169 research outputs found
Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks
This paper introduces a new channel selection strategy for reliable
contentionaware data dissemination in multi-hop cognitive radio network. The
key challenge here is to select channels providing a good tradeoff between
connectivity and contention. In other words, channels with good opportunities
for communication due to (1) low primary radio nodes (PRs) activities, and (2)
limited contention of cognitive ratio nodes (CRs) acceding that channel, have
to be selected. Thus, by dynamically exploring residual resources on channels
and by monitoring the number of CRs on a particular channel, SURF allows
building a connected network with limited contention where reliable
communication can take place. Through simulations, we study the performance of
SURF when compared with three other related approaches. Simulation results
confirm that our approach is effective in selecting the best channels for
efficient and reliable multi-hop data dissemination
Hybrid-Vehfog: A Robust Approach for Reliable Dissemination of Critical Messages in Connected Vehicles
Vehicular Ad-hoc Networks (VANET) enable efficient communication between
vehicles with the aim of improving road safety. However, the growing number of
vehicles in dense regions and obstacle shadowing regions like Manhattan and
other downtown areas leads to frequent disconnection problems resulting in
disrupted radio wave propagation between vehicles. To address this issue and to
transmit critical messages between vehicles and drones deployed from service
vehicles to overcome road incidents and obstacles, we proposed a hybrid
technique based on fog computing called Hybrid-Vehfog to disseminate messages
in obstacle shadowing regions, and multi-hop technique to disseminate messages
in non-obstacle shadowing regions. Our proposed algorithm dynamically adapts to
changes in an environment and benefits in efficiency with robust drone
deployment capability as needed. Performance of Hybrid-Vehfog is carried out in
Network Simulator (NS-2) and Simulation of Urban Mobility (SUMO) simulators.
The results showed that Hybrid-Vehfog outperformed Cloud-assisted Message
Downlink Dissemination Scheme (CMDS), Cross-Layer Broadcast Protocol (CLBP),
PEer-to-Peer protocol for Allocated REsource (PrEPARE), Fog-Named Data
Networking (NDN) with mobility, and flooding schemes at all vehicle densities
and simulation times
Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks
Multi-channel multi-interface Wireless Mesh Networks permit to spread the
load across orthogonal channels to improve network capacity. Although broadcast
is vital for many layer-3 protocols, proposals for taking advantage of multiple
channels mostly focus on unicast transmissions. In this paper, we propose
broadcast algorithms that fit any channel and interface assignment strategy.
They guarantee that a broadcast packet is delivered with a minimum probability
to all neighbors. Our simulations show that the proposed algorithms efficiently
limit the overhead
Latency Optimal Broadcasting in Noisy Wireless Mesh Networks
In this paper, we adopt a new noisy wireless network model introduced very
recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically,
for a given noise parameter any sender has a probability of
of transmitting noise or any receiver of a single transmission in its
neighborhood has a probability of receiving noise.
In this paper, we first propose a new asymptotically latency-optimal
approximation algorithm (under faultless model) that can complete
single-message broadcasting task in time units/rounds in any
WMN of size and diameter . We then show this diameter-linear
broadcasting algorithm remains robust under the noisy wireless network model
and also improves the currently best known result in CHHZ17 by a
factor.
In this paper, we also further extend our robust single-message broadcasting
algorithm to multi-message broadcasting scenario and show it can broadcast
messages in time rounds. This new robust
multi-message broadcasting scheme is not only asymptotically optimal but also
answers affirmatively the problem left open in CHHZ17 on the existence of an
algorithm that is robust to sender and receiver faults and can broadcast
messages in time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author
- …