2840942
The security and privacy of smart vehicles
Road safety, traffic management, and driver convenience continue to improve, in large part thanks to appropriate usage of information technology. But this evolution has deep implications for security and privacy, which the research community has overlooked so far.
2254034
Probabilistic reliable multicast in ad hoc networks
Abstract When striving for reliability, multicast protocols are most commonly designed as deterministic solutions. Such an approach seems to make the reasoning about reliability guarantees (traditionally, binary, “all-or-nothing”-like) in the face of packet losses and/or node crashes. It is however precisely this determinism that tends to become a limiting factor when aiming at both reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks. Gossip-based multicast protocols appear to be a viable path towards providing multicast reliability guarantees. Such protocols embrace the non-deterministic nature of ad hoc networks, providing analytically predictable probabilistic reliability guarantees at a reasonable overhead. This paper presents the Route Driven Gossip (RDG) protocol, a gossip-based multicast protocol designed precisely to meet a more practical specification of probabilistic reliability in ad hoc networks. Our RDG protocol can be deployed on any basic on-demand routing protocol, achieving a high level of reliability without relying on any inherent multicast primitive. We illustrate our RDG protocol by layering it on top of the “bare” Dynamic Source Routing protocol, and convey our claims of reliability and scalability through both analysis and simulation.
6684602
Non-Interactive Location Surveying for Sensor Networks with Mobility-Differentiated ToA
Location-awareness is crucial to many applications of sensor networks. Existing location surveying approaches either rely on an inflexible infrastructure or suffer from high computation and communication load. In this paper, we present Non-intEractive lOcation Surveying (NEOS) to address certain deficiencies in the existing approaches. The key contribution of NEOS is twofold: (i) it employs a mobile beacon to introduce mobilitydifferentiated time-of-arrival (MDToA) observations, a special form of time difference of arrival (TDoA), at the node side and (ii) it involves simple computations and entails no node-to-node communication. MDToA enables us to devise flexible and robust positioning algorithms; the resulting computational load fully obeys the processing constraints of sensor nodes. Furthermore, the non-interactive feature of NEOS allows of a substantial reduction on the nodes’energy consumption. We have implemented a preliminary prototype of NEOS using CricketMotes. Our experiments with this prototype demonstrate a location accuracy within 2cm in a 16m2 area.
10063931
Route driven gossip: probabilistic reliable multicast in ad hoc networks
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks. As probabilistic protocols, gossip-based multicast protocols, recently (re-)discovered in wired networks, appear to be a viable means to "fight fire with fire" by exploiting the nondeterministic nature of ad hoc networks. We present a protocol that is designed to meet a more practical specification of probabilistic reliability; this gossip-based multicast protocol, called route driven gossip (RDG), can be deployed on any basic on-demand routing protocol. RDG is custom-tailored to ad hoc networks, achieving a high level of reliability without relying on any inherent multicast primitive. We illustrate our RDG protocol by layering it on top of the "bare" DSR protocol. We prove the reliability and scalability of RDG through both analysis and simulation.
14483682
Joint mobility and routing for lifetime elongation in wireless sensor networks
Although many energy efficient/conserving routing protocols have been proposed for wireless sensor networks, the concentration of data traffic towards a small number of base stations remains a major threat to the network lifetime. The main reason is that the sensor nodes located near a base station have to relay data for a large part of the network and thus deplete their batteries very quickly. The solution we propose in this paper suggests that the base station be mobile; in this way, the nodes located close to it change over time. Data collection protocols can then be optimized by taking both base station mobility and multi-hop routing into account. We first study the former, and conclude that the best mobility strategy consists in following the periphery of the network (we assume that the sensors are deployed within a circle). We then consider jointly mobility and routing algorithms in this case, and show that a better routing strategy uses a combination of round routes and short paths. We provide a detailed analytical model for each of our statements, and corroborate it with simulation results. We show that the obtained improvement in terms of network lifetime is in the order of 500%.
1270012
KOBAS server: a web-based platform for automated annotation and pathway identification
There is an increasing need to automatically annotate a set of genes or proteins (from genome sequencing, DNA microarray analysis or protein 2D gel experiments) using controlled vocabularies and identify the pathways involved, especially the statistically enriched pathways. We have previously demonstrated the KEGG Orthology (KO) as an effective alternative controlled vocabulary and developed a standalone KO-Based Annotation System (KOBAS). Here we report a KOBAS server with a friendly web-based user interface and enhanced functionalities. The server can support input by nucleotide or amino acid sequences or by sequence identifiers in popular databases and can annotate the input with KO terms and KEGG pathways by BLAST sequence similarity or directly ID mapping to genes with known annotations. The server can then identify both frequent and statistically enriched pathways, offering the choices of four statistical tests and the option of multiple testing correction. The server also has a ‘User Space’ in which frequent users may store and manage their data and results online. We demonstrate the usability of the server by finding statistically enriched pathways in a set of upregulated genes in Alzheimer's Disease (AD) hippocampal cornu ammonis 1 (CA1). KOBAS server can be accessed at .
2796294
Gender Recognition Using a Min-Max Modular Support Vector Machine with Equal Clustering
Through task decomposition and module combination, min-max modular support vector machines (M3-SVMs) can be successfully used for different pattern classification tasks. Based on an equal clustering algorithm, M3-SVMs can divide the training data set of the original problem into several subsets with nearly equal number of samples, and combine them to a series of balanced subproblems which can be trained more efficiently and effectively. In this paper, we explore the use of M3-SVMs with equal clustering method in gender recognition. The experimental results show that M3-SVMs with equal clustering method can be successfully used for gender recognition and make the classification more efficient and accurate.