Discrete Mathematics - Topics on domination
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Principles of Wireless Networks: A Unified Approach
Principles of Wireless Networks: A Unified Approach
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Handbook of Graphs and Networks: From the Genome to the Internet
Handbook of Graphs and Networks: From the Genome to the Internet
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random evolution in massive graphs
Handbook of massive data sets
Proceedings of the 9th annual international conference on Mobile computing and networking
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
MERIT: a scalable approach for protocol assessment
Mobile Networks and Applications
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Reconsidering wireless systems with multiple radios
ACM SIGCOMM Computer Communication Review
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Improving loss resilience with multi-radio diversity in wireless networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Understanding internet topology: principles, models, and validation
IEEE/ACM Transactions on Networking (TON)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
Theoretical Computer Science
Efficient blocking probability computation of complex traffic flows for network dimensioning
Computers and Operations Research
Ad hoc networks beyond unit disk graphs
Wireless Networks
Algorithms and Models for the Web-Graph
ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES
Applied Artificial Intelligence
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalability of node degrees in random wireless network topologies
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Spectrum management in cognitive radio ad hoc networks
IEEE Network: The Magazine of Global Internetworking - Special issue title on networking over multi-hop cognitive networks
RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Models for the Compressible Web
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A geometric preferential attachment model of networks II
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A Course on the Web Graph
Analysis of fundamental limits for partial connectivity in wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Increased connectivity at lower cost: The case for multi-radio nodes in multi-hop wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Structural properties of random graph models
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Asymptotically optimal trade-off between local and global connectivity in wireless networks
Performance Evaluation
Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies
HPCC '11 Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Connectivity properties of a packet radio network model
IEEE Transactions on Information Theory
The capacity of wireless networks
IEEE Transactions on Information Theory
On the throughput scaling of wireless relay networks
IEEE Transactions on Information Theory
Communication over a wireless network with random connections
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
A typical feature of huge, random network topologies is that they are too large to allow a fully detailed description. Such enormous, complex network topologies are encountered in numerous settings and have generated many research investigations. Well-known examples are the Internet and its logical overlay networks, such as the World Wide Web as well as online social networks. At the same time, extensive and rapidly growing wireless ad hoc and sensor networks also lead to hard topology modeling questions. In the current paper, we primarily focus on large, random wireless networks but also consider Web and Internet models. We survey a number of existing models that aim at describing the network topology. We also exhibit common generalizations of various sets of models that cover a number of known constructions as special cases. We demonstrate that higher levels of abstraction, despite their very general nature, can still be meaningfully analyzed and offers quite useful and unique help in solving certain hard networking problems. We believe that this research area can and will generate further significant contributions to the analysis of very large networks.