Theoretical Aspects of Graph Models for MANETs

DOI10.1007/978-3-642-14849-1_6zbMath1218.68046MaRDI QIDQ5391114

Dieter Mitsche, Josep Diaz, Paolo Santi

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 networks; dynamic graph models of MANETs; models for mobile ad hoc networks

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M14: Distributed systems

Related Items

Continuous monitoring in the dynamic sensor field model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit disk graphs
• The longest edge of the random minimal spanning tree
• Unit disk graph recognition is NP-hard
• Power consumption in packet radio networks
• On the cover time and mixing time of random geometric graphs
• Coverage by randomly deployed wireless sensor networks
• Walkers on the Cycle and the Grid
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Random Plane Networks
• Random Geometric Graphs
• The capacity of wireless networks
• Information Propagation Speed in Mobile and Delay Tolerant Networks
• On the probability of the existence of fixed-size components in random geometric graphs
• Kinetic connectivity for unit disks