التفاصيل البيبلوغرافية
| العنوان: |
An efficient self‐healing network through quadratic probing optimization mechanism. |
| المؤلفون: |
A.D.C., Navin Dhinnesh, T, Sabapathi, N, Sundareswaran |
| المصدر: |
International Journal of Communication Systems; 5/10/2022, Vol. 35 Issue 7, p1-13, 13p |
| مصطلحات موضوعية: |
MATHEMATICAL optimization, SPANNING trees, TIME management |
| مستخلص: |
Summary: In recent years, mobile networks have been widely used in wide range of applications. Complexity is one of the major issues in mobile networks. The best way to administer the complexity of recent mobile networks is self‐organizing networks. Whenever a fault occurs in the network or in a node, it must be identified and at the same time, healed from within for smooth operation. In this paper, self‐healing is achieved by using a quadratic probing optimization algorithm. This algorithm has a time complexity using O (log n). A self‐healing algorithm is proposed here that uses self‐healing mechanisms to detect, identify, and respond to node breaks. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Communication Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder