On secrecy capacity scaling in wireless networks
OO Koyluoglu, CE Koksal… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
This paper studies the achievable secure rate per source-destination pair in wireless
networks. First, a path loss model is considered, where the legitimate and eavesdropper …
networks. First, a path loss model is considered, where the legitimate and eavesdropper …
Scaling laws for throughput capacity and delay in wireless networks—A survey
The capacity scaling law of wireless networks has been considered as one of the most
fundamental issues. In this survey, we aim at providing a comprehensive overview of the …
fundamental issues. In this survey, we aim at providing a comprehensive overview of the …
Strategies for Scaleable Communication and Coordination in Multi-Agent (UAV) Systems
J Ponniah, OD Dantsker - Aerospace, 2022 - mdpi.com
A system is considered in which agents (UAVs) must cooperatively discover interest-points
(ie, burning trees, geographical features) evolving over a grid. The objective is to locate as …
(ie, burning trees, geographical features) evolving over a grid. The objective is to locate as …
[图书][B] Wave theory of information
M Franceschetti - 2017 - books.google.com
Understand the relationship between information theory and the physics of wave
propagation with this expert guide. Balancing fundamental theory with engineering …
propagation with this expert guide. Balancing fundamental theory with engineering …
A loose-virtual-clustering-based routing for power heterogeneous MANETs
Power heterogeneity is common in mobile ad hoc networks (MANETs). With high-power
nodes, MANETs can improve network scalability, connectivity, and broadcasting robustness …
nodes, MANETs can improve network scalability, connectivity, and broadcasting robustness …
Cache-induced hierarchical cooperation in wireless device-to-device caching networks
We consider a wireless device-to-device caching network where n nodes are placed on a
regular grid of area A (n). Each node caches LCF (coded) bits from a library of size LF bits …
regular grid of area A (n). Each node caches LCF (coded) bits from a library of size LF bits …
EMIT: An efficient MAC paradigm for the Internet of Things
The future Internet of Things (IoT) networks are expected to be composed of a large
population of low-cost devices communicating dynamically with access points or …
population of low-cost devices communicating dynamically with access points or …
Clustering algorithms for MANETs: a review on design and development
The self-motivated environment of mobile nodes confronts the connectivity and the stability
in mobile MANETs. In MANETs, nodes are usually defined as a network which is created …
in mobile MANETs. In MANETs, nodes are usually defined as a network which is created …
The approximate capacity of the Gaussian N-relay diamond network
U Niesen, SN Diggavi - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
We consider the Gaussian “diamond” or parallel relay network, in which a source node
transmits a message to a destination node with the help of N relays. Even for the symmetric …
transmits a message to a destination node with the help of N relays. Even for the symmetric …
Bounds of asymptotic performance limits of social-proximity vehicular networks
In this paper, we investigate the asymptotic performance limits (throughput capacity and
average packet delay) of social-proximity vehicular networks. The considered network …
average packet delay) of social-proximity vehicular networks. The considered network …