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.
This paper presents a novel address assignment algorithm (Adaptive Dynamic Address Redistribution ADAR) and tree-based routing protocol for large-scale uneven Wireless sensor networks (WSNs). The ADAR algorithm can make 16-bit address space used effectively and it also can solve the problem that nodes which want to access the WSNs can not be assigned addresses because of the father node running out...
In wireless sensor network, we have 2 type of routing; one of them send data from the sensor nodes to the sink and another send some data from sink to the sensor nodes such as programming/retaking binaries, queries and commands. In this paper we present a new routing algorithm base on ID that is named ID-Leach. This protocol assigns an unique ID with binary number to each sensor nodes. This protocol...
A wireless sensor network (WSN) is composed of a large number of sensor nodes which are resource constraints, e.g., limited power. This drives research on how to design routing protocols to gather data efficiently so that the life of the network can be prolonged. A usual concept to collect data by a sink node is to transfer data from sensor nodes to the sink node by multi-hop. However, it gives rise...
One particular challenging environment for multicast is a mobile ad-hoc network (MANET). Existing studies show that tree-based and mesh based on-demand protocols are not necessarily the best choice, since associated overhead will be more. Several algorithms based on the ant colony optimization (ACO) approach minimizes the cost of the tree under multiple constraints. These algorithms treat the traffic...
ZigBee is a well accepted industrial standard for wireless sensor networks based on IEEE 802.15.4. Since aiming for the application of low data rate, low price and low power consumption, ZigBee networks have the limited resources such as computation complexity and storage space. So it is especially important to design an efficient and effective routing protocol to save the consuming energy and extend...
In this paper we analyze intra-domain routing protocols improvements to support new features required by realtime services. In particular we introduce OSPF fast convergence and highlight the advantage of using a dynamic algorithm instead of the Dijkstra one to compute the shortest paths. Then we propose a new multi-path dynamic algorithm which uses multipath information to make a fast determination...
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.