Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 7 von 2105
International journal of communication systems, 2022-05, Vol.35 (7), p.n/a
2022
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
An efficient self‐healing network through quadratic probing optimization mechanism
Ist Teil von
  • International journal of communication systems, 2022-05, Vol.35 (7), p.n/a
Ort / Verlag
Chichester: Wiley Subscription Services, Inc
Erscheinungsjahr
2022
Quelle
Wiley Online Library - AutoHoldings Journals
Beschreibungen/Notizen
  • 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. 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
Sprache
Englisch
Identifikatoren
ISSN: 1074-5351
eISSN: 1099-1131
DOI: 10.1002/dac.5098
Titel-ID: cdi_proquest_journals_2646640810

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX