Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Adaptive Wireless Transceivers: Turbo-Coded, Turbo-Equalised and Space-Time Coded TDMA, CDMA, MC-CDMA and Ofdm Systems
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Unreliable sensor grids: coverage, connectivity and diameter
Ad Hoc Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Short Communication: Improving connectivity in vehicular ad hoc networks: An analytical study
Computer Communications
Semi-linear Stochastic Difference Equations
Discrete Event Dynamic Systems
WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
On the coverage process of a moving point target in a non-uniform dynamic sensor field
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Energy savings achievable in connection preserving energy saving algorithms
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Connectivity dynamics in vehicular freeway scenarios
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Connectivity of finite wireless networks with random communication range nodes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Probability of node to base station connectivity in one-dimensional ad hoc networks
IEEE Communications Letters
A probabilistic model for message propagation in two-dimensional vehicular ad-hoc networks
Proceedings of the seventh ACM international workshop on VehiculAr InterNETworking
Connectivity analysis of one-dimensional ad-hoc networks
Wireless Networks
Linear wireless sensor networks: Classification and applications
Journal of Network and Computer Applications
Connectivity Analysis of Vehicular Ad Hoc Networks from a Physical Layer Perspective
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In this paper we analyze connectivity issues in one-dimensional ad hoc networks. Starting with a deterministic channel model, we show how an equivalent GI|D|∞ queueing model may be used to address network connectivity. In this way, we obtain exact results for the coverage probability, the node isolation probability and the connectivity distance for various node placement statistics. We then show how a GI|G|∞ model may be used to study broadcast percolation problems in ad hoc networks with general node placement in the presence of fading channels. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading/ shadowing environment. In the latter case, heavy traffic theorems are applied to derive the critical transmission power for connectivity and broadcast percolation distance in highly dense networks. The impact of signal processing schemes able to exploit the diversity provided by small-scale fading by means of multiple antennas is considered. The analysis is then extended to the case of unreliable ad hoc networks, with an in-depth discussion of asymptotic results.