Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In some environment, randomly deployed sensor nodes could not satisfy the requirements of wireless sensor network. Therefore, it is necessary to use mobile sensor nodes in some special conditions. And after moving nodes are deployed randomly, they could be relocated according to the real-time situation of network coverage degree. This paper proposes a hexagonal grid-based sensor deployment algorithm,...
Finding the minimum MPR set is a NP-complete problem in OLSR protocol, and intelligent computing methods can be used to solve it. Based on analyzing the defects of the strategy of the greedy heuristic algorithm, ant colony algorithm is imported to solve the minimum set of MPR problem. Firstly, defining the out-degree and the in-degree of a node, and in accordance with the out-degree and in-degree...
Quality of service support for MANETs is a challenging task due to dynamic topology and limited resources. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. In this paper a novel QoS routing algorithm based on ant colony optimization is proposed. The proposed algorithm uses Ant-like agents to discover and maintain paths, that satisfy...
Because of restricted resources, wireless sensor networks need to consider synthetically the price of networks, and costs of communication and computing and so on. Aiming at the localization problem for mobile beacon node in wireless sensor network, this paper uses the ant colony algorithmpsilas characteristics which is self-organized, adaptive, dynamic optimization, integrating the hop number into...
Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military...
Coverage control is a basic research problem in wireless sensor networks (WSNs). This paper proposes a distance optimization based coverage control algorithm, which utilizes ant colony algorithm to place sensor nodes to an appropriate position and optimize the moving path of mobile sensor nodes. The proposed algorithm not only guarantees the biggest coverage of wireless sensor networks, but also reduces...
The problem of computing a route for a mobile agent to local regions or specified nodes in a distributed sensor network is considered, both in a single region or multi-region cases. With all specified nodes visited, this paper formulates the route computation problem in terms of minimizing an objective function, which is directly proportional to the energy consumption and path loss. Further, we propose...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.