中文
相关论文

相关论文: Interference and SINR coverage in spatial non-slot…

200 篇论文

In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…

信息论 · 计算机科学 2016-11-18 Enrico Paolini , Gianluigi Liva , Marco Chiani

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…

信息论 · 计算机科学 2015-12-11 Ashwin Ganesan

We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit…

信息论 · 计算机科学 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

信息论 · 计算机科学 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution…

信息论 · 计算机科学 2020-12-25 Yu-Chih Huang , Shin-Lin Shieh , Yu-Pin Hsu , Hao-Ping Cheng

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths…

数据结构与算法 · 计算机科学 2011-03-25 Erez Kantor , Zvi Lotker , Merav Parter , David Peleg

This paper studies spatial capacity in a stochastic wireless ad hoc network, where multi-stage probing and data transmission are sequentially performed. We propose a novel signal-to-interference-ratio (SIR) threshold based scheduling…

信息论 · 计算机科学 2014-09-10 Yue Ling Che , Rui Zhang , Yi Gong , Lingjie Duan

Characterizing and comparing the optimal energy efficiency in energy-aware machine-to-machine (M2M) random access networks remains a challenge due to the distributed nature of the access behavior of nodes. To address this issue, this letter…

网络与互联网体系结构 · 计算机科学 2024-06-24 Anshan Yuan , Fangming Zhao , Xinghua Sun

In this work, we design and analyse a Slotted ALOHA (SA) solution for Optical Wireless Communication (OWC)-based Internet of Underwater Things (IoUT). In the proposed system, user devices exchange data with an access point (AP) which…

This paper provides an analytically tractable framework of investigating the statistical properties of the signal-to-interference power ratio (SIR) with a general distribution in a heterogeneous wireless ad hoc network in which there are K…

信息论 · 计算机科学 2016-08-18 Chun-Hung Liu , Zhu-Kuan Yang , Di-Chun Liang

With the rapid expansion of the Internet of Things, the efficient sharing of the wireless medium by a large amount of simple transmitters is becoming essential. Scheduling-based solutions are inefficient for this setting, where small data…

信息论 · 计算机科学 2022-02-18 Federico Clazzer , Alexandre Graell i Amat

In this paper, we study wireless powered communication networks that employ the slotted ALOHA protocol, which is the preferred protocol for simple and uncoordinated networks. In the energy harvesting (EH) phase, the base station broadcasts…

信息论 · 计算机科学 2018-09-11 Zoran Hadzi-Velkov , Slavche Pejoski , Nikola Zlatanov , Robert Schober

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…

信息论 · 计算机科学 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing…

网络与互联网体系结构 · 计算机科学 2012-03-07 Thomas Kesselheim

LoRaWAN is one of the most promising standards for long-range sensing applications. However, the high number of end devices expected in at-scale deployment, combined with the absence of an effective synchronization scheme, challenge the…

网络与互联网体系结构 · 计算机科学 2019-02-26 Tommaso Polonelli , Davide Brunelli , Achille Marzocchi , Luca Benini

In wireless networks, interferences between trans- missions are modelled either in time or frequency domain. In this article, we jointly analyze interferences in the time- frequency domain using a stochastic geometry model assuming the…

网络与互联网体系结构 · 计算机科学 2016-11-15 Zhuocheng Li , Steeve Zozor , Jean-Marc Brossier , Nadège Varsier , Quentin Lampin

LoRaWAN is one of the most promising standards for IoT applications. Nevertheless, the high density of end-devices expected for each gateway, the absence of an effective synchronization scheme between gateway and end-devices, challenge the…

网络与互联网体系结构 · 计算机科学 2018-09-17 Tommaso Polonelli , Davide Brunelli , Luca Benini

In this paper, we consider the stochastic network with dynamic traffic. The spatial distribution of access points (APs) and users are first modeled as mutually independent Poisson point processes (PPPs). Different from most previous…

网络与互联网体系结构 · 计算机科学 2016-12-13 Bin Xia , Yingbin Liu , Chenchen Yang , Zhiyong Chen , Weiliang Xie , Yong Zhao

We consider a wireless ad hoc network in the presence of eavesdroppers (EDs), where the nodes are distributed according to independent Poisson point processes (PPPs). The legitimate nodes follow the half-duplex mode of operation employing…

信息论 · 计算机科学 2019-05-07 B. N. Bharath , K. G. Nagananda

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

信息论 · 计算机科学 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai