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

V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G Enabled Vehicular Networks

Benefited from the widely deployed infrastructure, the LTE network has recently been considered as a promising candidate to support the vehicle-to-everything (V2X) services. However, with a massive number of devices accessing the V2X network in the future, the conventional OFDM-based LTE network faces the congestion issues due to its low efficiency of orthogonal access, resulting in significant access delay and posing a great challenge especially to safety-critical applications. The non-orthogonal multiple access (NOMA) technique has been well recognized as an effective solution for the future 5G cellular networks to provide broadband communications and massive connectivity. In this article, we investigate the applicability of NOMA in supporting cellular V2X services to achieve low latency and high reliability. Starting with a basic V2X unicast system, a novel NOMA-based scheme is proposed to tackle the technical hurdles in designing high spectral efficient scheduling and resource allocation schemes in the ultra dense topology. We then extend it to a more general V2X broadcasting system. Other NOMA-based extended V2X applications and some open issues are also discussed.Comment: Accepted by IEEE Wireless Communications Magazin

Wireless communication, identification and sensing technologies enabling integrated logistics: a study in the harbor environment

In the last decade, integrated logistics has become an important challenge in the development of wireless communication, identification and sensing technology, due to the growing complexity of logistics processes and the increasing demand for adapting systems to new requirements. The advancement of wireless technology provides a wide range of options for the maritime container terminals. Electronic devices employed in container terminals reduce the manual effort, facilitating timely information flow and enhancing control and quality of service and decision made. In this paper, we examine the technology that can be used to support integration in harbor's logistics. In the literature, most systems have been developed to address specific needs of particular harbors, but a systematic study is missing. The purpose is to provide an overview to the reader about which technology of integrated logistics can be implemented and what remains to be addressed in the future

Deterministic Digital Clustering of Wireless Ad Hoc Networks

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or capabilities, e.g., randomization, access to geographic coordinates, power control, carrier sensing with various precision of measurements, and/or interference cancellation. We study a pure scenario, when no such properties are available. As a general tool, we develop a deterministic distributed clustering algorithm. Our solution relies on a new type of combinatorial structures (selectors), which might be of independent interest. Using the clustering, we develop a deterministic distributed local broadcast algorithm accomplishing this task in $O(\Delta \log^*N \log N)$ rounds, where $\Delta$ is the density of the network. To the best of our knowledge, this is the first solution in pure scenario which is only polylog$(n)$ away from the universal lower bound $\Omega(\Delta)$, valid also for scenarios with randomization and other features. Therefore, none of these features substantially helps in performing the local broadcast task. Using clustering, we also build a deterministic global broadcast algorithm that terminates within $O(D(\Delta + \log^* N) \log N)$ rounds, where $D$ is the diameter of the network. This result is complemented by a lower bound $\Omega(D \Delta^{1-1/\alpha})$, where $\alpha > 2$ is the path-loss parameter of the environment. This lower bound shows that randomization or knowledge of own location substantially help (by a factor polynomial in $\Delta$) in the global broadcast. Therefore, unlike in the case of local broadcast, some additional model features may help in global broadcast

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673