Results 11 - 20
of
34
A Structure of Adaptive Portable Video Streaming and Efficient Common Video Cassette Sharing In the Clouds
"... ABSTRACT: Utilizing the reasoning processing technology, a new cellular movie loading structure, known as AMESCloud, which has two main parts: AMoV (adaptive cellular movie streaming) and ESoV (efficient public movie sharing). AMoV and ESoV build a personal broker to offer movie loading services ef ..."
Abstract
- Add to MetaCart
ABSTRACT: Utilizing the reasoning processing technology, a new cellular movie loading structure, known as AMESCloud, which has two main parts: AMoV (adaptive cellular movie streaming) and ESoV (efficient public movie sharing). AMoV and ESoV build a personal broker to offer movie loading services efficiently for each cellular customer. For a given customer, AMoV lets her undercover broker adaptively adjust her stream flow with a scalable movie programming technique in accordance with the reviews of link quality. Likewise, ESoV watches the online community communications among cellular users, and their personal providers try to prefetch movie content in advance. We apply a model of the AMES-Cloud structure to show its performance. It is shown that the personal providers in the atmosphere can effectively offer the flexible loading, and perform movie discussing (i.e., prefetching) in accordance with the online community analysis.. We first recommend an precise Comparison-based Profile Related method (eCPM) which runs between two parties, an initiator and a -responder. The eCPM enable the initiator to acquire the comparison-based matching outcome about a specified feature in their profiles, while stop their feature values from exposure. We then recommend an implied Comparison-based Profile Related method (iCPM) which allows the initiator to straight acquire some information instead of the evaluation outcome from the -responder. The information unique to customer profile can be separated into multiple groups by the -responder. The initiator unquestioningly selects the involved category which is unknown to the -responder.
Attack-Resilient Mix-zones over Road Networks: Architecture and Algorithms
"... Abstract-Continuous exposure of location information, even with spatially cloaked resolution, may lead to breaches of location privacy due to statistics-based inference attacks. An alternative and complementary approach to spatial cloaking based location anonymization is to break the continuity of ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Continuous exposure of location information, even with spatially cloaked resolution, may lead to breaches of location privacy due to statistics-based inference attacks. An alternative and complementary approach to spatial cloaking based location anonymization is to break the continuity of location exposure by introducing techniques, such as mix-zones, where no application can trace user movements. Several factors impact on the effectiveness of mix-zone approach, such as user population, mix-zone geometry, location sensing rate and spatial resolution, as well as spatial and temporal constraints on user movement patterns. However, most of the existing mix-zone proposals fail to provide effective mix-zone construction and placement algorithms that are resilient to timing and transition attacks. This paper presents MobiMix, a road network based mix-zone framework to protect location privacy of mobile users traveling on road networks. It makes three original contributions. First, we provide the formal analysis on the vulnerabilities of directly applying theoretical rectangle mix-zones to road networks in terms of anonymization effectiveness and resilience to timing and transition attacks. Second, we develop a suite of road network mix-zone construction methods that effectively consider the above mentioned factors to provide higher level of resilience to timing and transition attacks, and yield a specified lowerbound on the level of anonymity. Third, we present a set of mix-zone placement algorithms that identify the best set of road intersections for mix-zone placement considering the road network topology, user mobility patterns and road characteristics. We evaluate the MobiMix approach through extensive experiments conducted on traces produced by GTMobiSim on different scales of geographic maps. Our experiments show that MobiMix offers high level of anonymity and high level of resilience to timing and transition attacks, compared to existing mix-zone approaches.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 A Distributed TDMA Scheduling Algorithm for Target Tracking in Ultrasonic Sensor Networks
"... Abstract—Ultrasonic sensors are able to provide highly accurate measurements, however, they have to be carefully scheduled otherwise the inter-sensor interference (ISI) would greatly deteriorate the performance. It is also preferred that the scheduling scheme can be performed in a distributed and en ..."
Abstract
- Add to MetaCart
Abstract—Ultrasonic sensors are able to provide highly accurate measurements, however, they have to be carefully scheduled otherwise the inter-sensor interference (ISI) would greatly deteriorate the performance. It is also preferred that the scheduling scheme can be performed in a distributed and energy-efficient way so that it can be conveniently implemented for largescale network. In this paper, for target tracking with multiple ultrasonic sensors, we convert the ISI avoidance problem to the problem of multiple access in a shared channel, and adopt the TDMA strategy which has the properties of collision-free and energy efficient. Then by graph theory, the scheduling problem is transformed into a coloring problem which aims at minimizing the number of used colors. Since the original problem has been proved to be NP-hard, we propose a distributed saturation degree based algorithm (DSDA) which can be implemented locally by each node with information collected from its neighbors. Furthermore, we verify that an interference-free schedule is guaranteed to be obtained by DSDA. We derive analytical results for the complexity of this algorithm. Specifically, for different sensor network topologies, we prove that the expected converging time and the expected message transmissions per node are both upper bounded by O(δ), where δ is the maximum neighborhood size in the network. Extensive simulations demonstrate the effectiveness of our algorithm.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 Morality-driven Data Forwarding with Privacy Preservation in Mobile Social Networks
"... Abstract—Effective data forwarding is critical for most mobile social network applications, such as content distribution and information searching. However, it could be severely interrupted or even disabled when privacy preservation of users is applied, because that users become unrecognizable to ea ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Effective data forwarding is critical for most mobile social network applications, such as content distribution and information searching. However, it could be severely interrupted or even disabled when privacy preservation of users is applied, because that users become unrecognizable to each other and the social ties and interactions are no longer traceable to facilitate cooperative data forwarding. Therefore, how to enable efficient user cooperation in mobile social networks (MSNs) without intruding user privacy is a challenging issue. In this paper, we address this issue by introducing the social morality – a fundamental social feature of human society – to MSNs, and accordingly design a threestep protocol suite to achieve both privacy preservation and cooperative data forwarding. Firstly, the developed protocol adopts a novel privacy-preserving route-based authentication
Covert Communication based Privacy Preservation in Mobile Vehicular Networks
"... Abstract—Due to the dire consequences of privacy abuse in vehicular ad hoc network (VANET), a number of mechanisms have been put forth to conditionally preserve the user and location privacy. To date, multiple pseudonymous approach is regarded as one of the best effective solutions where every node ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Due to the dire consequences of privacy abuse in vehicular ad hoc network (VANET), a number of mechanisms have been put forth to conditionally preserve the user and location privacy. To date, multiple pseudonymous approach is regarded as one of the best effective solutions where every node uses multiple temporary pseudonyms. However, recently it has been found out that even multiple pseudonyms could be linked to each other and to a single node thereby jeopardizing the privacy. Therefore in this paper, we propose a novel identity exchange-based approach to preserve user privacy in VANET where a node exchanges its pseudonyms with the neighbors and uses both its own and neighbors ’ pseudonym randomly to preserve privacy. Additionally the revocation of the immediate user of the pseudonym is made possible through an efficient revocation mechanism. Moreover the pseudonym exchange is realized through covert communication where a side channel is used to establish a covert communication path between the exchanging nodes, based on the scheduled beacons. Our proposed scheme is secure, robust, and it preserves privacy through the existing beacon infrastructure.
1Vehicles Meet Infrastructure: Towards Capacity-Cost Tradeoffs for Vehicular Access Networks
"... Abstract—Wireless access infrastructure, such as Wi-Fi access points and cellular base stations, plays a vital role in providing pervasive Internet services to vehicles. However, the deployment costs of different access infrastructure are highly variable. In this paper, we make an effort to investig ..."
Abstract
- Add to MetaCart
Abstract—Wireless access infrastructure, such as Wi-Fi access points and cellular base stations, plays a vital role in providing pervasive Internet services to vehicles. However, the deployment costs of different access infrastructure are highly variable. In this paper, we make an effort to investigate the capacity-cost tradeoffs for vehicular access networks in which access infrastructure is deployed to provide a downlink data pipe to all vehicles in the network. Three alternatives of wireless access infrastructure are considered, i.e., cellular base stations (BSs), wireless mesh backbones (WMBs), and roadside access points (RAPs). We first derive a lower bound of downlink capacity for each type of access infrastructure. We then present a case study based on a perfect city grid of 400 km2 with 0.4 million vehicles, in which we examine the capacity-cost tradeoffs of different deployment solutions in terms of both capital expenditures (CAPEX) and operational expenditures (OPEX). Rich implications from our re-sults provide fundamental guidance on the choice of cost-effective access infrastructure for the emerging vehicular networking. I.
Capacity and Delay Analysis for Social-Proximity Urban Vehicular Networks
"... Abstract—In this paper, the asymptotic capacity and delay performance of social-proximity urban vehicular networks with inhomogeneous vehicle density are analyzed. Specifically, we investigate the case of N vehicles in a grid-like street layout while the number of road segments increases linearly wi ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, the asymptotic capacity and delay performance of social-proximity urban vehicular networks with inhomogeneous vehicle density are analyzed. Specifically, we investigate the case of N vehicles in a grid-like street layout while the number of road segments increases linearly with the population of vehicles N. Each vehicle moves in a localized mobility region centered at a fixed social spot and communicates to a destination vehicle in the same mobility region via a unicast flow. With a variant of the two-hop relay scheme applied, we show that social-proximity urban networks are scalable: a constant average per-vehicle throughput can be achieved with high probability. Furthermore, although the throughput and delay of a unicast flow may degrade in a high density area, almost constant per-vehicle throughput Ω ( 1 log (N)) and almost constant delay O(log2 (N)) (except for the polylogarithmic factor) are still achievable with high probability. By identifying the key impact factors of performance mathematically, our results might provide insight on the design and deployment of future vehicular networks. I.
VSLP: Voronoi-Socialspot-Aided Packet Forwarding Protocol with Receiver Location Privacy in MSNs
"... Abstract—With the pervasive use of smart phones in the daily life, location privacy has become one of cruxes for the success of mobile social networks (MSNs). In this paper, we propose a Voronoi-social-spot-aided Location Privacy-preserving (VSLP) packet forwarding protocol to improve the packet for ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—With the pervasive use of smart phones in the daily life, location privacy has become one of cruxes for the success of mobile social networks (MSNs). In this paper, we propose a Voronoi-social-spot-aided Location Privacy-preserving (VSLP) packet forwarding protocol to improve the packet forwarding efficiency and at the same time protect receiver’s location privacy. In VSLP, we first identify the social spot locations according to the user mobility information, and then build a Voronoi diagram based on the defined social spots. On the edge of Delaunay triangulation over the Voronoi diagram, we deploy multiple storage devices to help receivers to temporarily store the packets. With the security analysis, we show that the location privacy can be achieved. Using extensive simulations, we show that VSLP can enhance the packet forwarding efficiency with improved packet delivery ratio and reduced average packet delay. Index Terms—Mobile social network, Voronoi diagram, social spot, packet forwarding, location privacy-preserving. I.
1Bounds of Asymptotic Performance Limits of Social-Proximity Vehicular Networks
"... Abstract—In this paper, we investigate the asymptotic perfor-mance limits (throughput capacity and average packet delay) of social-proximity vehicular networks. The considered network involves N vehicles moving and communicating on a scalable grid-like street layout following the social-proximity mo ..."
Abstract
- Add to MetaCart
Abstract—In this paper, we investigate the asymptotic perfor-mance limits (throughput capacity and average packet delay) of social-proximity vehicular networks. The considered network involves N vehicles moving and communicating on a scalable grid-like street layout following the social-proximity model: each vehicle has a restricted mobility region around a specific social spot, and transmits via a unicast flow to a destination vehicle which is associated with the same social spot. Moreover, the spatial distribution of the vehicle decays following a power-law distribution from the central social spot towards the border of the mobility region. With vehicles communicating using a variant of the two-hop relay scheme, the asymptotic bounds of throughput capacity and average packet delay are derived in terms of the number of social spots, the size of the mobility region, and the decay factor of the power-law distribution. By identifying these key impact factors of performance mathematically, we find three possible regimes for the performance limits. Our results can be applied to predict the network performance of real-world scenarios and provide insight on the design and deployment of future vehicular networks. Index Terms—Capacity scaling laws, network delay, social-proximity, vehicular networks. I.
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1 A Multi-hop Authenticated Proxy Mobile IP Scheme for Asymmetric VANET
"... Abstract—Vehicular communications networks are envisioned for the access to drive-thru Internet and IP-based infotainment applications. These services are supported by road-side Access Routers (ARs) that connect the Vehicular Ad hoc Network (VANET) to external IP networks. However, VANETs suffer fro ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Vehicular communications networks are envisioned for the access to drive-thru Internet and IP-based infotainment applications. These services are supported by road-side Access Routers (ARs) that connect the Vehicular Ad hoc Network (VANET) to external IP networks. However, VANETs suffer from asymmetric links due to variable transmission ranges caused by mobility, obstacles, and dissimilar transmission powers, which make them difficult to maintain the bidirectional connections, and to provide the IP mobility required by most IP applications. Moreover, vehicular mobility results in short-lived connections to the AR, affecting the availability of IP services in the VANET. In this paper, we study the secure and timely handover of IP services in the asymmetric VANET, and propose a Multi-hop Authenticated Proxy Mobile IP (MA-PMIP) scheme. MA-PMIP provides an enhanced IP mobility scheme over infrastructure-to-vehicle-to-vehicle (I2V2V) communications that uses location and road traffic information. MA-PMIP also reacts depending on the bidirectionality of links to improve availability of IP services. Moreover, our scheme ensures the handover signaling is authenticated when V2V paths are employed to reach the infrastructure, so that possible attacks are mitigated without affecting the performance of the ongoing sessions. Both analysis and extensive simulations in OMNeT++ are conducted, and the results demonstrate that MA-PMIP improves service availability and provides secure seamless access to IP applications in the asymmetric VANET.
