Theoretical Aspects of Graph Models for MANETs

DOI10.1007/978-3-642-14849-1_6MaRDI QIDQ5391114zbMATH OpenOpenAlexFDO

Authors D. Mitsche, Paolo Santi, J. Díaz

Publication date 5 April 2011

Published in Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/9758

zbMATH Keywords

connectivity of mobile networksdynamic graph models of MANETsmodels for mobile ad hoc networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Recommendations

• A Random Graph Model of Mobile Wireless Networks
• Graph theory and opportunistic link scheduling in wireless ad hoc networks
• Graph models for communication of mobile users in access areas
• Graph Theory and Mobile Communications
• A tale of two graph models: a case study in wireless sensor networks
• Hypergraph theory in wireless communication networks
• Graph theoretical issues in computer networks

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 193944 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 1340281 (Why is no real title available?)
• scientific article; zbMATH DE number 1978164 (Why is no real title available?)
• Ad-hoc networks: fundamental properties and network technologies. With CD-ROM.
• Coverage by randomly deployed wireless sensor networks
• Information Propagation Speed in Mobile and Delay Tolerant Networks
• Kinetic connectivity for unit disks
• MANETS: High Mobility Can Make Up for Low Transmission Power
• On the cover time and mixing time of random geometric graphs
• On the probability of the existence of fixed-size components in random geometric graphs
• Power consumption in packet radio networks
• Probability and random processes.
• Random Geometric Graphs
• Random Plane Networks
• The capacity of wireless networks
• The longest edge of the random minimal spanning tree
• Unit disk graph recognition is NP-hard
• Unit disk graphs
• Walkers on the Cycle and the Grid

Cited in

(10)

• Description and simulation of dynamic mobility networks
• Graph models for communication of mobile users in access areas
• A Random Graph Model of Mobile Wireless Networks
• Graph-Theoretic Concepts in Computer Science
• Handbook of mobile ad hoc networks for mobility models.
• Continuous monitoring in the dynamic sensor field model
• Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks
• Distributed Computing – IWDC 2005
• A percolation model of mobile ad-hoc networks
• Graph-based mobility models: asymptotic and stationary node distribution

This page was built for publication: Theoretical Aspects of Graph Models for MANETs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391114)