Abstract
The efficient heuristic algorithm for sizing of N satellite capacitytypes (on LES side of/ink) in mobile networks during exploitationis being developed, minimizing the total expansioncost. Using the network flow approach and the extreme flowthe01y many expansion solutions (sub-problems) are eliminatedfrom further calculation because they consist at least ofone flow that cannot be a part of optimal expansion sequence.At first, the heuristic algorithm is compared with algorithmbased on exact approach. In all numerical test-examples thebest possible result is achieved. After that we developed andtested some algorithm options, using various limitations for capacitystate values. It is obvious that all heuristic options areve1y effective and for some cases they are capable to find thebest possible result but with significant savings. It means thatour heuristic approach can be successfully applied to short-term or medium-term satellite network planning with finitenumber of discrete time periods. Only if we apply adequate heuristicsolution can we ensure both significant improvement ofQoS (Quality of Setvice) and minimal capacity expansion cost.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
