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 this paper, we consider the existence of at least three positive solutions for the 2nth order differential equations with integral boundary conditions { x ( 2 n ) ( t ) = f ( t , x ( t ) , x ″ ( t ) , … , x ( 2 ( n − 1 ) ) ( t ) ) , 0 ≤ t ≤ 1 , x ( 2 i ) ( 0 ) = ∫ 0 1 k i ( s ) x ( 2 i ) ( s ) d s , x ( 2 i ) ( 1 ) = 0 , 0 ≤ i ≤ n − 1 , $$ \left...
In the existing wireless network coding mechanism, the packets used to coded are always with equal length, which is always called symmetric network coding. This coding method can effectively improve the network performance. But it also limits the further improvement of network performance in the multimedia application environment, where data packets length is usually unequal. Here we propose an asymmetric...
Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epidemic routing algorithm(Reliable and Efficient routing algorithm assisted with Buffer Management, REBM) is proposed. Firstly, through the exchange of SV (Summary Vector) control packets,...
As a typical multi-hop clustering routing algorithm for wireless sensor networks (WSNs), RBMC (ring-based multi-hop clustering routing algorithm) needs to select cluster heads in every round and the nodes with little energy still have chance to become cluster heads. This leads to extra and uneven consumption of nodes' energy. to address the problem, we propose in this paper an energy-efficient ring-based...
This paper proposes a high energy-efficient clustering algorithm for WSNs (HEEC). In HEEC, an improved threshold of cluster head election based on optimal probability is presented. The threshold doesn't only consider the remaining energy of nodes, but also take the cluster heads number into account even when nodes have little energy. When the ordinary nodes join the clusters, the ordinary nodes adopt...
In ZigBee wireless networks that use DAAM (Distributed Address Assignment Mechanism), the scheme may prohibit a node from accepting a child by network parameters. To address the problem, we propose BAIR (Borrowed Address Assignment based on Inheritance Relation) algorithm. Firstly the orphan is divided into the orphan router and the orphan end device, then BAIR assigns the borrowed address from parents...
In wireless sensor networks, it has been shown that collecting data using a mobile sink can drastically reduce energy consumption at the cost of increasing delivery delay of data. In order to decrease the delay, we propose an approach of sink mobility, in which the sink moves along a ring-like route instead of a reciprocal one. Thus, a part of data packets can be transferred more quickly. Performance...
Designing an energy efficient algorithm is one of the most important challenges in wireless sensor networks (WSNs). In this paper, we present a node sleeping algorithm based on the minimum hop routing protocol to minimize energy consumption. The proposed scheme divides all the nodes except the sink node into terminal nodes and intermediate nodes according to their different functions. Terminal nodes...
In opportunistic networks, the Epidemic Routing (ER) protocol can offer a reliable way to transmit data. However, it has some extra latency in neighbor discovery. To address the problem, we propose a cross-layer approach to sense encountered nodes more quickly, which utilizes HELLO packets instead of the IMEP protocol to sense neighboring nodes, speeds sensing encountered nodes through cross-layer...
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.