Skip to main content Accessibility help
×
×
Home
Random Networks for Communication
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 41
  • Cited by
    This book has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Manjrekar, Mayank 2019. A hard-core stochastic process with simultaneous births and deaths. Stochastic Models, p. 1.

    Pal, Harinder Seligman, Thomas H. and Escobar, Juan V. 2018. Correlation networks from random walk time series. Physical Review E, Vol. 98, Issue. 3,

    Miao, Qing Huang, Baoqi and Jia, Bing 2018. Estimating distances via received signal strength and connectivity in wireless sensor networks. Wireless Networks,

    2018. Deterministic Network Calculus. p. 303.

    Reddy, Tulasi Ram Vadlamani, Sreekar and Yogeshwaran, D. 2018. Central Limit Theorem for Exponentially Quasi-local Statistics of Spin Models on Cayley Graphs. Journal of Statistical Physics, Vol. 173, Issue. 3-4, p. 941.

    Gyongyosi, Laszlo and Imre, Sandor 2018. Decentralized base-graph routing for the quantum internet. Physical Review A, Vol. 98, Issue. 2,

    Gyongyosi, Laszlo and Imre, Sandor 2018. Topology adaption for the quantum Internet. Quantum Information Processing, Vol. 17, Issue. 11,

    Gyongyosi, Laszlo Imre, Sandor Hasan, Zameer U. Hemmer, Philip R. Migdall, Alan L. and Craig, Alan E. 2018. Dynamic topology resilience for quantum networks. p. 34.

    Arifler, Dogu and Arifler, Dizem 2018. Encyclopedia of Wireless Networks. p. 1.

    Yang, Yaoqing Bai, Bo and Chen, Wei 2017. Spectrum Reuse Ratio in 5G Cellular Networks: A Matrix Graph Approach. IEEE Transactions on Mobile Computing, Vol. 16, Issue. 12, p. 3541.

    Kitsak, Maksim Papadopoulos, Fragkiskos and Krioukov, Dmitri 2017. Latent geometry of bipartite networks. Physical Review E, Vol. 95, Issue. 3,

    Blanchini, Franco Casagrande, Daniele Giordano, Giulia and Montessoro, Pier Luca 2017. A Robust Decentralized Control for Channel Sharing Communication. IEEE Transactions on Control of Network Systems, Vol. 4, Issue. 2, p. 336.

    Yao, Jiyun Venkitasubramaniam, Parv Kishore, Shalinee Snyder, Lawrence V. and Blum, Rick S. 2017. Network topology risk assessment of stealthy cyber attacks on advanced metering infrastructure networks. p. 1.

    Chen, Hui Tao, Xiaofeng Li, Na and Han, Zhu 2017. Ergodic Secrecy Rate of Randomly Deployed Cellular Networks Enhanced by Artificial Noise. p. 1.

    Schulte, Matthias and Thäle, Christoph 2017. Central limit theorems for the radial spanning tree. Random Structures & Algorithms, Vol. 50, Issue. 2, p. 262.

    Arifler, Dogu 2017. Connectivity Properties of Free Diffusion-Based Molecular Nanoscale Communication Networks. IEEE Transactions on Communications, Vol. 65, Issue. 4, p. 1686.

    de Lima, Carlos H. M. Nardelli, Pedro H. J. Alves, Hirley and Latva-aho, Matti 2016. Contention-Based Geographic Forwarding Strategies for Wireless Sensors Networks. IEEE Sensors Journal, Vol. 16, Issue. 7, p. 2186.

    Chen, Wei Ma, Liangping and Shen, Chien-Chung 2016. Congestion-Aware MAC Layer Adaptation to Improve Video Telephony over Wi-Fi. ACM Transactions on Multimedia Computing, Communications, and Applications, Vol. 12, Issue. 5s, p. 1.

    Bof, Nicoletta Carli, Ruggero and Schenato, Luca 2016. On the performance of consensus based versus Lagrangian based algorithms for quadratic cost functions. p. 160.

    Eslami, Ali Huang, Chuan Zhang, Junshan and Cui, Shuguang 2016. Cascading Failures in Load-Dependent Finite-Size Random Geometric Networks. IEEE Transactions on Network Science and Engineering, Vol. 3, Issue. 4, p. 183.

    ×

Book description

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.

Reviews

'The balance between intuition and rigor is ideal, in my opinion, and reading the book is an enjoyable and highly rewarding endeavor … this book will be useful to physicists, mathematicians, and computer scientists who look at random graph models in which point locations affect the shape and properties of the resulting network: physicists will acquaint themselves with complex networks having rich modeling capabilities (e.g. models for random interaction particle systems such as spin glasses), mathematicians may discover connections of the networks with formal systems (much like the connection of the classical Erdős–Rényi random graph properties with first- and second-order logic), and computer scientists will greatly appreciate the applicability of the theory given in the book to the study of realistic, ad hoc mobile networks in which network node connections change rapidly and unpredictably as a function of the geometry of the current node positions.'

Yannis Stamatiou Source: Mathematical Reviews

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
  • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send
    ×

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed