Graph-Based Mobility Models: Asymptotic and Stationary Node Distribution

DOI10.1007/978-3-030-43024-5_10zbMath1484.68019OpenAlexW3012537735MaRDI QIDQ5014506

Hans Daduna

Publication date: 8 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43024-5_10

zbMATH Keywords

separabilitystationary stateMANETmobility models

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

On a queueing inventory problem with necessary and optional inventories ⋮ A customer service model in an adaptive-modulation mobile communication cell with allowance for random environment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theoretical aspects of distributed computing in sensor networks.
• Impact of Routeing on Correlation Strength in Stationary Queueing Network Processes
• Handbook of Mobile Ad Hoc Networks for Mobility Models
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Networks of queues
• Networks of queues and the method of stages
• Queueing Networks and Markov Chains

This page was built for publication: Graph-Based Mobility Models: Asymptotic and Stationary Node Distribution