Random networks for communication

When is a random network (almost) connected? How much information can it carry? How can you find a particular destination within the network? And how do you approach these questions - and others - when the network is random? The analysis of communication networks requires a fascinating synthesis of random graph theory, stochastic geometry and percolation theory to provide models for both structure and information flow. This book is the first comprehensive introduction for graduate students and scientists to techniques and problems in the field of spatial random networks. The selection of material is driven by applications arising in engineering, and the treatment is both readable and mathematically rigorous. Though mainly concerned with information-flow-related questions motivated by wireless data networks, the models developed are also of interest in a broader context, ranging from engineering to social networks, biology, and physics.

שנה

2007

שפה

English

סדרה

Cambridge series in statistical and probabilistic mathematics -- no. 24

הוצאה

Cambridge University Press

מהדורות

10

עמודים

196

ISBN

9780521854429

מקור הנתונים: Wikidata