Revisiting the k-Neighbors Connectivity Problem under Practical Indoor Scenarios

Sergio KostinLeonardo Bidese de PinhoMaurício Henrique Costa DiasCláudio Luis Amorim

A important goal for Topology Control Protocols is to determine the least amount of neighbors needed to build a fully connected network, aka the k-neighbors connectivity problem. In this work, we estimated the minimum k- neighbors value for a given Wireless Sensor Network (WSN) under practical office scenarios using parameterized simulations that took into account office’ size and layout, path loss exponent, and multipath fading. Our findings argue that the results of the k-neighbors connectivity problem based solely on flat scenarios or performed analytically can be misleading for the deployment of WSNs in indoor scenarios with obstacles, and suggest that the interplay of office size and layout with path loss exponent and multipath fading should be strongly considered on the development of future WSNs.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: