Journal
ENTROPY
Volume 15, Issue 1, Pages 361-371Publisher
MDPI
DOI: 10.3390/e15010361
Keywords
maximum entropy method (MEM); computer network topology; computer network routing; optimization
Categories
Funding
- Ministry of Education and Science of Republic of Serbia [III-44006]
Ask authors/readers for more resources
Maximum entropy method has been successfully used for underdetermined systems. Network design problem, with routing and topology subproblems, is an underdetermined system and a good candidate for maximum entropy method application. Wireless ad-hoc networks with rapidly changing topology and link quality, where the speed of recalculation is of crucial importance, have been recently successfully investigated by maximum entropy method application. In this paper we prove a theorem that establishes asymptotic properties of the maximum entropy routing solution. This result, besides being theoretically interesting, can be used to direct initial approximation for iterative optimization algorithms and to speed up their convergence.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available