MANETS: High Mobility Can Make Up for Low Transmission Power
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Modelling mobility: a discrete revolution
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Dynamic networks: models and algorithms
ACM SIGACT News
Modelling mobility: A discrete revolution
Ad Hoc Networks
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Parsimonious flooding in geometric random-walks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Spatial node distribution of manhattan path based random waypoint mobility models with applications
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Markovian evolving graphs [2] are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios.