Completely independent spanning trees for enhancing the robustness in ad-hoc Networks.
Axel MoinetBenoît DartiesNicolas GastineauJean-Luc BarilOlivier TogniPublished in: WiMob (2017)
Keyphrases
- ad hoc networks
- spanning tree
- completely independent
- network topology
- routing protocol
- routing algorithm
- wireless ad hoc networks
- minimum spanning tree
- edge disjoint
- wireless networks
- minimum cost
- end to end
- minimum spanning trees
- peer to peer
- mac protocol
- base station
- mobile wireless
- key management
- mobile ad hoc networks
- quality of service
- multi hop
- mobile nodes
- neighboring nodes
- wired networks
- wireless mesh networks
- end to end delay
- computational complexity
- finite state
- qos routing
- multipath routing
- network infrastructure
- multipath
- markov chain
- service differentiation
- mobile networks