WIRELESS NETWORKS - Journal - Bridge of Knowledge

Search

WIRELESS NETWORKS

ISSN:

1022-0038

eISSN:

1572-8196

Disciplines
(Field of Science):

  • information and communication technology (Engineering and Technology)
  • biomedical engineering (Engineering and Technology)
  • computer and information sciences (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 70 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 70 Ministry scored journals list 2024
2023 70 Ministry Scored Journals List
2022 70 Ministry Scored Journals List 2019-2022
2021 70 Ministry Scored Journals List 2019-2022
2020 70 Ministry Scored Journals List 2019-2022
2019 70 Ministry Scored Journals List 2019-2022
2018 25 A
2017 25 A
2016 25 A
2015 25 A
2014 25 A
2013 25 A
2012 30 A
2011 30 A
2010 27 A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 6.7
Points CiteScore - previous years
Year Points
2022 6.7
2021 4.7
2020 4.3
2019 4.1
2018 3.8
2017 3.4
2016 2.8
2015 2.2
2014 2.5
2013 2.7
2012 2.7
2011 2.4

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 5

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2023
Year 2022
Year 2015
  • Measures of region failure survivability for wireless mesh networks
    Publication

    - WIRELESS NETWORKS - Year 2015

    Wireless mesh networks (WMNs) are considered as a promising alternative to wired local, or metropolitan area networks. However, owing to their exposure to various disruptive events, including natural disasters, or human threats, many WMN network elements located close to the failure epicentre are frequently in danger of a simultaneous failure, referred to as a region failure. Therefore, network survivability, being the ability...

    Full text available to download

Year 2010
  • Exploiting multi-interface networks: Connectivity and Cheapest Paths
    Publication

    - WIRELESS NETWORKS - Year 2010

    Let G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...

    Full text to download in external service

Year 2009
  • Exploiting Multi-Interface Networks: Connectivity and Cheapest Paths
    Publication

    - WIRELESS NETWORKS - Year 2009

    Rozważano zagadnienie minimalizacji energii w sieciach bezprzewodowych bez infrastruktury, w których niektóre węzły są wyposażone w więcej, niż jeden interfejs. W przyjętym modelu sieci podano nowe algorytmy przybliżone oraz wyniki dotyczące złożoności obliczeniowej dla dwóch problemów: aktywacji najtańszej spójnej podsieci spinającej oraz aktywacji ścieżki pomiędzy ustaloną parą węzłów.

    Full text to download in external service

seen 351 times