An Efficient Technique for Message Flooding Based on Partial Shortest-Path Trees in Wired Networks.
Kenji OhtsukaTakehiro SatoShigeo ShiodaPublished in: ICC (2007)
Keyphrases
- shortest path
- wired networks
- shortest path problem
- steiner tree
- ad hoc networks
- shortest path algorithm
- wireless networks
- road network
- wireless sensor networks
- routing algorithm
- weighted graph
- path length
- shortest distance
- optimal path
- travel time
- wireless ad hoc networks
- network security
- web services
- transport layer
- anomaly detection
- finding the shortest path