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.
We consider a mobile content delivery network (mCDN) in which a special form of mobile devices designated as caching servers (caching-server device: CSD) can provide the near-by devices with some popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSDs are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated...
Location privacy is an important issue in location-based services. A large number of location cloaking algorithms have been proposed for protecting location privacy of users. However, these algorithms cannot be used in vehicular networks due to constrained vehicular mobility. In this paper, we propose a new method named Protecting Location Privacy with Clustering Anonymization (PLPCA) for location-based...
Detecting the collaborative cheating in an online shopping system is an important but challenging issue. In this paper, we propose a novel approach to detect the collusive manipulation on ratings in Amazon, an online shopping system. Rather than focusing on rating values, we believe the online shopping and rating activities have nontrivial attributes in terms of social network connections. Our major...
The service quality of a station in IEEE 802.11 wLAN (wireless Local Area Networks) is strongly influenced by which access point it associates with. Therefore, a key challenge is how to select an appropriate access point from multiple available ones. Conventional association protocols have been proved to be not effective. In this paper a strategy for differentiated access service selection based on...
Future dynamic wireless and online social networks will require more agile and efficient infrastructures to support the anticipated user traffic and service requirements. In response, in this work, we propose a novel spectrum-agile resource allocation approach that combines Markov Random Field (MRF) cross-layer decisions for the allocation of resources at the lower protocol layers with Back-pressure...
We study the important problem of source localization in the context of information spreads in large social networks. Specifically, we design a Maximum-Likelihood source localization algorithm that is especially suited to large social networks. Our proposed algorithm requires about 3% fewer sensor nodes than other single stage algorithms for the same level of accuracy in detection. For practical social...
We propose a model for native online advertising, a recent technique able to safeguard user's online experience and yet greatly accelerate the virality of a content. As of now, the cost of native advertisement represents a high entrance barrier for potential customers of advertisement hosts. In this paper, we argue that cooperative schemes can lower this entrance barrier. In fact, when different content...
Massively Multi-player Online Games (MMOG) are characterized by intensive interactions between many simultaneous users and real-time demands on Quality of Service (QoS). Other examples of similar, real-time online interactive applications include various virtual environments, as well as multi-pupil e-learning and simulation-based training courses. A highly desirable enhancement for MMOG is the use...
Edge services become increasingly important as the Internet transforms into an Internet of Things (IoT). Edge services require bounded latency, bandwidth reduction between the edge and the core, service resiliency with graceful degradation, and access to resources visible only inside the NATed and secured edge networks. While the data center based cloud excels at providing general purpose computation/storage...
Mobile applications are becoming increasingly computation-intensive, while the computing capacity of mobile devices is limited. A powerful way to reduce completion time of an application is to offload tasks to the cloud for execution. However, online offloading an application with general taskgraph is a difficult task. In this paper we present an online task offloading algorithm that minimizes the...
As the advance of mobile devices, crowdsourcing has been successfully applied in many scenarios by employing distributed mobile devices to collectively monitor a diverse range of human activities and surrounding environment. Unfortunately, treating mobile devices as simple sensors that generate raw sensing data may lead to low efficiency because of excessive bandwidth occupation and additional computation...
This paper proposes a framework for Wireless Resource Virtualization (WRV) in Long Term Evolution (LTE) systems. An shared radio access network connects Multiple Mobile Network Operators (MNOs) and allocates radio resources to their users. We formulate the WRV problem as a Binary Integer Programming (BIP) problem. Subsequently, a low complexity iterative algorithm is presented to solve the BIP problem...
Cloud computing will have profound impacts on wireless networks. On one hand, the integration of cloud computing into the mobile environment enables mobile cloud computing (MCC) systems; on the other hand, the powerful computing platforms in the cloud for radio access networks lead to a novel concept of cloud radio access networks (C-RAN). In this paper, we study the topology configuration and rate...
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes...
In order to meet the security requirement, most data are stored in cloud as cipher-texts. Hence, a cipher-text based access control mechanism is needed for data sharing in cloud. A popular solution is to use the attribute-based encryption. However, it is not suitable for mobile cloud due to the heavy computation overhead caused by bilinear pairing, which also makes it difficult to change the access...
We propose a resource management framework that reduces energy consumption in cloud data centers. The proposed framework predicts the number of virtual machine requests along with their amounts of CPU and memory resources, provides accurate estimations of the number of needed physical machines, and reduces energy consumption by putting to sleep unneeded physical machines. Our framework is based on...
We consider the scenario where a mobile device requires assistance from nearby devices to forward its computational tasks to a cloud server. We incentivize cooperation by allowing helper devices to conserve computational energy by offloading their own tasks to the source device's cloud, as compensation for the communication energy lost during task forwarding. We formulate an optimization problem with...
To save energy, physical machines (servers) in cloud data centers are partitioned in different pools, depending on whether they are kept on at all times and/or whether they have virtual machines instantiated. Partitioning (pooling) of servers affects the power consumption of the data center but also the performance and responsiveness to user requests. In this paper we examine the behavior of pool...
In mobile cloud computing, mobile devices seek to minimize computation time and/or energy consumption based on task related or user defined constraints. In earlier work [1], we proposed to minimize the total energy consumption across all the mobile devices in a cyber foraging system using a scheduler that runs in a centralized broker node, in situations where a large number of mobile devices could...
In this paper we apply the Named Data Networking [1], a newly proposed Internet architecture, to networking vehicles on the run. Our initial design, dubbed V-NDN, illustrates NDN's promising potential in providing a unifying architecture that enables networking among all computing devices independent from whether they are connected through wired infrastructure, ad hoc, or intermittent DTN. This paper...
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.