An Upper Bound on the Performance of Non-Repetitive Flooding over CSMA in Wireless Ad-Hoc Networks.
Hamed Shah-MansouriMohammad Reza PakravanPublished in: ICC (2009)
Keyphrases
- upper bound
- lower bound
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- error probability
- worst case
- branch and bound
- generalization error
- multiple access
- sample complexity
- real time
- ad hoc networks
- search space
- single item
- constant factor
- repetitive patterns
- optimal solution
- neighboring nodes
- data sets