The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a coordinate-free distributed boundary detection algorithm (CDBD). It adopts general sensing and communication models and exploits two centrality measures, i.e., betweenness and closeness. For CDBD, each node only needs to communicate with its $k$-hop neighbors twice and makes decision whether it itself is a boundary node independently. CDBD has advantages of fast convergence...
In this paper, we propose a novel trust management scheme for improving routing reliability in wireless ad hoc networks. It is grounded on two classic autoregression models, namely Autoregressive (AR) model and Autoregressive with exogenous inputs (ARX) model. According to this scheme, a node periodically measures the packet forwarding ratio of its every neighbor as the trust observation about that...
Wireless sensor and actor networks (WSANs) are service-oriented environments, where sensors request actors to service their detected events and actors move to deliver the desired services. Because of their openness and unattended nature, these networks are vulnerable to various security attacks. In this paper we address service fraud attacks for the first time, whose objective is to stop the normal...
Wireless ad hoc networks have great potentials in a broad range of applications. Their inherent vulnerability to various network attacks however limits their wide adaptation and deployment in practice. In this paper we address one of the most dangerous attacks, packet drop attack, in wireless ad hoc networks by post-routing detection. We introduce a simple, effective detection technique Side Channel...
Sink mobility has attracted much research interests in Wireless Sensor Networks (WSNs), because it could provide energy saving and reduce latency during data collection. However, the mobile sink node is still a single point of failure in many WSNs applications, thus needs to be particularly protected against adversaries. We propose in this paper a moving strategy for the mobile sink which prevents...
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact that the demand of any delivery customer can be met by a relatively large number of pickup customers. While all delivery spots are to be visited, only profitable pickup locations will be included in the tour so as to minimize...
We propose a novel localized carrier-based sensor placement algorithm, named Back-Tracking Deployment (BTD). Mobile robots (carriers) carry static sensors and drop them at visited empty vertices of a virtual square, triangular or hexagonal grid in a bounded 2D environment. A single robot will move forward along the virtual grid in open directions with respect to a pre-defined order of preference until...
In this paper, we present our study of extracting a mobility model for vehicular ad hoc networks (VANETs) from a large amount of real taxi GPS trace data. In order to capture characteristics of the urban vehicle network from microscopic to macroscopic aspects, we design three parameters and extract their values from the GPS trace data. Using this mobility model, we can generate the synthetic trace...
For a wireless ad hoc network, a crucial performance requirement is its connectivity. Considering the power constraint and the dynamic environment, designers usually would like to keep the network being fully connected as long as possible, so as to ensure a largest possible coverage. On the other hand, the number of nodes and their battery power consumption are also expected to be minimized. These...
Focused coverage is defined as the coverage of a wireless sensor network surrounding a point of interest (POI), and is measured by coverage radius, i.e., minimum distance from POI to uncovered areas. Sensor self-deployment algorithm GRG is designed for autonomous focused coverage formation. It however does not always produce optimal (i.e., maximized) coverage radius. In this paper, we propose optimized...
Currently, vehicles are equipped with forward facing cameras to assist the forensic investigations of events by proactive image capturing from streets and roads. With content redundancy and storage imbalance in this in-network distributed storage system, how to maximize its storage capacity is a challenge. In other words, how to maximize the average lifetime of sensory data (i.e. images generated...
Currently, vehicular sensor network (VSN) has been paid much attention for monitoring the physical world of urban areas. We have studied VSNs by utilizing about 4000 taxies and 1000 buses equipped with GPS-based mobile sensors in Shanghai to constitute a virtual vehicular sensor network. The communication-connection intermittence makes the routing issue nontrivial when delay-tolerant applications...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.