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 $p\in [0,1],$ any sender has a probability of $p$ of transmitting noise or any receiver of a single transmission in its neighborhood has a probability $p$ 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 $D+O(\log^2 n)$ time units/rounds in any WMN of size $n,$ and diameter $D$. 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 $\Theta(\log\log n)$ factor. In this paper, we also further extend our robust single-message broadcasting algorithm to $k$ multi-message broadcasting scenario and show it can broadcast $k$ messages in $O(D+k\log n+\log^2 n)$ 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 $k$ messages in $O(D+k\log n + polylog(n))$ time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author

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

Intelligent spectrum management techniques for wireless cognitive radio networks

PhD ThesisThis thesis addresses many of the unique spectrum management chal- lenges in CR networks for the rst time. These challenges have a vital e ect on the network performance and are particularly di cult to solve due to the unique characteristics of CR networks. Speci cally, this thesis proposes and investigates three intelligent spectrum management tech- niques for CR networks. The issues investigated in this thesis have a fundamental impact on the establishment, functionality and security of CR networks. First, an intelligent primary receiver-aware message exchange protocol for CR ad hoc networks is proposed. It considers the problem of alleviat- ing the interference collision risk to primary user communication, explic- itly to protect primary receivers that are not detected during spectrum sensing. The proposed protocol achieves a higher measure of safeguard- ing. A practical scenario is considered where no global network topology is known and no common control channel is assumed to exist. Second, a novel CR broadcast protocol (CRBP) to reliably disseminate the broadcast messages to all or most of the possible CR nodes in the network is proposed. The CRBP formulates the broadcast problem as a bipartite-graph problem. Thus, CRBP achieves a signi cant successful delivery ratio by connecting di erent local topologies, which is a unique feature in CR ad hoc networks. Finally, a new defence strategy to defend against spectrum sensing data falsi cation attacks in CR networks is proposed. In order to identify malicious users, the proposed scheme performs multiple veri cations of sensory data with the assistance of trusted nodes.Higher Committee For Education Devel- opment in Iraq (HCED-Iraq