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.
Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that supports the distribution of data to a group of users, a service needed for many potential DTNs applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, efficient multicasting in...
We present a new scheme to reduce the end-to-end routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. While greedy routing in the synchronized MAC model has been studied extensively, efficient routing in an asynchronous MAC model is considerably different because the wake-up time and availability of a node along the pre-decided path...
In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is different every time when the relative location of relay node to the destination changes. The configuration in the entire network when all the succeeding paths from a relay node are blocked by local minima is irregular and its...
Delay tolerant networks (DTNs) are envisioned to provide promising applications and services. One critical issue in DTNs is efficiently forwarding the messages within the delay requirements while avoiding the cost associated with blind flooding. To guide the forwarding process, nodes can evaluate their relationships with each other, in terms of ``closeness'', which summarizes both temporal and spacial...
We propose a new tracking framework by organizing nodes into a polygonal spatial neighborhood in order to detect and track unauthorized traversals in surveillance wireless sensor networks. During a tracking, the neighborhood is further constructed ahead of the target traversal, and this features a timely forwarding with guaranteed delivery property. Instead of estimating future movement and position...
Recently, erasure coding has become widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Most existing works assume that the number of redundant erasure-coded packets is unlimited for a message. In this paper, we relax this assumption and integrate the packet quantity into a routing problem in order to achieve a good balance between energy cost and reliability...
We propose target tracking with monitor and backup sensors in wireless sensor networks (TTMB) to increase the energy efficiency of the network and decrease the target capturing time while considering the effect of a target's variable velocity and direction. The approach is based on a face routing and prediction method. We use a state transition strategy, a dynamic energy consumption model, and a moving...
Delay tolerant networks are a type of wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time. In such a network, one of the critical issues is to reliably deliver data with a low latency. Naive forwarding approaches, such as flooding and its derivatives, make the routing cost (here defined as the number of copies duplicated for a message)...
Building a ldquostraightforwardrdquo path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper, we extend our early work on...
Efficient geometric routing algorithms have been studied extensively in two-dimensional ad hoc networks, or simply 2D networks. These algorithms are efficient and they have been proven to be the worst-case optimal, localized routing algorithms. However, few prior works have focused on efficient geometric routing in 3D networks due to the lack of an efficient method to limit the search once the greedy...
Nodes in disruption-tolerant networks (DTNs) usually exhibit repetitive motions. Several recently proposed DTN routing algorithms have utilized the DTNs' cyclic properties for predicting future forwarding. The prediction is based on metrics abstracted from nodes' contact history. However, the robustness of the encounter prediction becomes vital for DTN routing since malicious nodes can provide forged...
Packet-switched interconnect fabric is a promising on-chip communication solution for many-core architectures. It offers high throughput and excellent scalability for on-chip data and protocol transactions. The main problem posed by this communication fabric is the potentially-high and nondeterministic network latency caused by router data buffering and resource arbitration. This paper describes a...
The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime...
Research on delay tolerant networks (DTNs) has brought about a plethora of routing algorithms targeted at networks with different mobility patterns. However, few research works have been done towards developing methods to understand certain characteristics of DTNs, especially those with predictable characteristics (e.g., predictable mobility). As a step towards closing this gap, we devise an efficient...
Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a data packet...
In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the "local minimum phenomenon" which is caused by deployment holes and blocks the forwarding process. In this paper, we provide a new information model for the geographic greedy forwarding routing that only forwards the packet within the so-called request zone. Under this new information...
In wireless sensor and actor networks (WSANs), a group of sensors and actors are connected by a wireless medium to perform distributed sensing and acting tasks. Sensors usually gather information in an event area and pass it on to actors, which are resource-rich devices that make decisions and perform necessary actions. Therefore, it is vital to maintain connections between sensors and actors for...
Link and node reliability are important metrics in wireless ad hoc networks. Therefore, evaluating and quantifying reliability has become the cornerstone of research in this field. Many existing wireless ad hoc network routing algorithms assume the availability of precise reliability information. This, however, is an unrealistic assumption given the dynamics of wireless ad hoc networks. Also, due...
Geometric routing in mobile ad-hoc networks (MANETs) is comprised of two forwarding modes: greedy forwarding and face forwarding. It is known that face forwarding is inefficient and fails frequently in practical situations. A previous work, NEAR [2], avoids switching to face forwarding by predicting local minima and not forwarding messages to them. However, NEAR predicts excessive local minima, which...
Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-based routing model that can provide different optimal routes for different routing requirements captured by the benefit value of the successful delivery of a data packet in a network with unstable links. The challenges lie in the identification...
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.