Lower bounds on the success probability for ad hoc networks with local FDMA scheduling.
Ralph TanbourgiJens P. ElsnerHolger JäkelFriedrich K. JondralPublished in: WiOpt (2011)
Keyphrases
- ad hoc networks
- success probability
- lower bound
- network topology
- wireless networks
- upper bound
- end to end
- routing protocol
- wireless ad hoc networks
- routing algorithm
- key management
- quality of service
- scheduling problem
- expected cost
- scheduling algorithm
- multi hop
- mobile ad hoc networks
- objective function
- mobile wireless
- resource constraints
- peer to peer
- mobile networks
- base station
- np hard
- end to end delay
- mac protocol
- mobile nodes
- admission control
- qos routing
- optimal solution
- wireless mesh networks
- neighboring nodes
- packet forwarding
- decision trees
- propagation model
- network nodes
- network infrastructure
- wireless sensor networks