An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Multicluster, mobile, multimedia radio network
Wireless Networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Advanced Lectures on Networking, NETWORKING 2002 [This book presents the revised version of seven tutorials given at the NETWORKING 2002 Conference in Pisa, Italy in May 2002]
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Advanced lectures on networking
A Performance Comparison of Scatternet Formation Protocols for Networks of Bluetooth Devices
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Energy-Efficient Infrastructure Formation in MANETs
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks
Mobile Networks and Applications
Structured proactive and reactive routing for wireless mobile ad hoc networks
The handbook of ad hoc wireless networks
Optimal and approximate approaches for selecting proxy agents in mobile IP based network backbones
Journal of Parallel and Distributed Computing
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
Bandwidth optimization by reliable-path determination in Mobile Ad-Hoc Networks
Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Enhancements for clustering stability in mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
A Macro model of frequently changing mobile networks to perform flow and access control
Mobile Networks and Applications
Efficiently reconfigurable backbones for wireless sensor networks
Computer Communications
On pairwise connectivity of wireless multihop networks
International Journal of Security and Networks
A unified framework for cluster manager election and clustering mechanism in mobile ad hoc networks
Computer Standards & Interfaces
A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks
Journal of Network and Systems Management
Multi-hop scatternet formation and routing for large scale Bluetooth networks
International Journal of Ad Hoc and Ubiquitous Computing
Energy penalties for non-shortest paths in wireless sensor networks with link failures
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
The availability and reliability of wireless multi-hop networks with stochastic link failures
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Mobile ad hoc backbones: formation and maintenance
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Bluetooth scatternet formation performance: simulations vs. testbeds
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Bluetooth scatternet formation and scheduling: an integrated solution
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Minimum power multicasting in wireless networks under probabilistic node failures
Computational Optimization and Applications
Connectivity model of wireless networks via dependency links random graphs
The Journal of Supercomputing
Adaptive clustering with virtual subnets support in ad hoc networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Infrastructure-based routing in wireless mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
This paper introduces a new model and methodological approach for dealing with the probabilistic nature of mobile networks based on the theory of random graphs. Probabilistic dependence between the random links prevents the direct application of the theory of random graphs to communication networks. The new model, termed Random Network Model, generalizes conventional random graph models to allow for the inclusion of link dependencies in a mobile network. The new Random Network Model is obtained through the superposition of Kolmogorov complexity and random graph theory, making in this way random graph theory applicable to mobile networks. To the best of the authors' knowledge, it is the first application of random graphs to the field of mobile networks and a first general modeling framework for dealing with ad-hoc network mobility. The application of this methodology makes it possible to derive results with proven properties. The theory is demonstrated by addressing the issue of the establishment of a connected virtual backbone among mobile clusterheads in a peer-to-peer mobile wireless network. Using the Random Network Model, we show that it is possible to construct a randomized distributed algorithm which provides connectivity with high probability, requiring exponentially fewer connections (peer-to-peer logical links) per clusterhead than the number of connections needed for an algorithm with a worst case deterministic guarantee.