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...

Full description

Bibliographic Details

Main Author:	Franceschetti, Massimo (Author)
Format:	Electronic eBook
Language:	English
Published:	Cambridge Cambridge University Press 2007
Series:	Cambridge series on statistical and probabilistic mathematics 24
Subjects:	Telecommunication systems Information networks Stochastic processes Statistical communication theory Spatial analysis (Statistics) Kommunikationssystem Informationstheorie Stochastischer Prozess
Online Access:	DE-12 DE-92 Volltext
Summary:	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
Item Description:	Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Physical Description:	1 online resource (xiii, 196 pages)
ISBN:	9780511619632
DOI:	10.1017/CBO9780511619632