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.
Maximizing the lifetime of wireless sensor networks under constrained resources is an interesting problem that has gained increasing attention. Most methods assume an ideal link layer model when increasing the lifetime of wireless sensor networks and energy saving techniques using geographic routing remains largely unexplored. Based on a realistic link layer model, we propose a novel geographic routing...
Geographical opportunistic dissemination scheme in an urban setting has a lot of potential applications range from daily services like advertising and local weather forecast to safety-related services such as fire/accident warning. These applications share several unique characteristics such as location-based address of nodes and maintaining in an area for a specific time. However, all existing solutions...
Geographical opportunistic dissemination scheme in an urban setting has a lot of potential applications range from daily services like advertising and local weather forecast to safety-related services such as fire/accident warning. These applications share several unique characteristics such as location-based address of nodes and maintaining in an area for a specific time. However, all existing solutions...
Geographic routing has been proven to be efficient to provide scalable unicast routing in resource-constrained sensor networks. However, its applications in multicast routing remain largely unexplored. Recently GMR (Geographic Multicast Routing) and DCGM (Destination Clustering Geographic Multicast) have been proposed, which preserve the distributed computation of geographic routing while delivering...
Geographical routing is powerful for its ability to discover a path to the destination without the help of global states. However, stateless geographical routing usually involves a large number of hops when detouring around voids of the network. In this paper, we propose an efficient path pruning (PP) strategy to reduce the excessive number of hops caused by the detouring mode of geographical routing...
Geographic routing has been proven to provide efficient and scalable unicast routing in resource-constrained sensor networks. However, its applications in multicast routing remain largely unexplored. In this paper, we propose the DCGM (destination clustering geographic multicast) routing protocol for wireless sensor networks. By clustering destinations that can share the same next hop, we iteratively...
Geographical routing protocols are promising in wireless sensor networks because of their ability to discover a sub-optimal route without the help of a global state. Existing geographical routing protocols can guarantee packet delivery if the network topology after planarization remains connected. However, face routing used in non-flooding geographical routing algorithms usually results in a large...
Geographical routing is powerful for its ability to discover route to the destination without the help of global state. However, detours usually occur when the packet reaches a local minimum. In this case, the network topology has to be reduced to a planar graph and recovery schemes such as face routing are needed. However, face routing may create a large number of hops on a planar graph. When multiple...
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.