Abstract

The Vertical Handover and the related Network Selection process play a fundamental role in supporting reliable communications over MANETs. The goal of the Network Selection is to determine the Radio Access Network (RAN) that a Mobile Node (MN) has to use among several available RANs. This decision process finds out the RAN that fits the MN requirements and has to provide the decision as rapidly as possible. A computationally heavy Network Selection algorithm can impact the whole handover process because it waits until the selection is carried out. This waste of time can have negative consequences in the quality of communications. The main contribution of this paper is the definition of a new Network Selection algorithm based on a different formulation of the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method found in the literature, called Dynamic-TOPSIS (D-TOPSIS). It is aimed at performing the same selection of the TOPSIS but with a significant reduction of necessary computational load. Finally, the numerical results highlight the execution time reduction obtained by applying the D-TOPSIS with respect to the standard algorithm, and other Network Selection techniques usually applied within Vertical Handover Processes.

Full Text
Paper version not known

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 call

Disclaimer: 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.