Results 1 - 10
of
21
Internet on the Move: Challenges and Solutions
"... This article is an editorial note submitted to CCR. It has NOT been peer reviewed. The authors take full responsibility for this article’s technical content. Comments can be posted through CCR Online. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
This article is an editorial note submitted to CCR. It has NOT been peer reviewed. The authors take full responsibility for this article’s technical content. Comments can be posted through CCR Online.
Cooperative Caching based on File Popularity Ranking in Delay Tolerant Networks
"... Increasing storage sizes and WiFi/Bluetooth capabilities of mobile devices have made them a good platform for oppor-tunistic content sharing. In this work we propose a network model to study this in a setting with two characteristics: 1. delay tolerant; 2. lack of infrastructure. Mobile users gen-er ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Increasing storage sizes and WiFi/Bluetooth capabilities of mobile devices have made them a good platform for oppor-tunistic content sharing. In this work we propose a network model to study this in a setting with two characteristics: 1. delay tolerant; 2. lack of infrastructure. Mobile users gen-erate requests and opportunistically download from other users they meet, via Bluetooth or WiFi. The difference in popularity of different web content induces a non-uniform re-quest distribution, which is usually a Zipf’s law distribution. We evaluate the performance of different caching schemes and derive the optimal scheme using convex optimization techniques. The optimal solution is found efficiently using a binary search method. It is shown that as the network mobility increases, the performance of the optimal scheme far exceeds the traditional caching scheme. To the best of our knowledge, our work is the first to consider popularity ranking in performance evaluation.
Coding or Not: Optimal Mobile Data Offloading in Opportunistic Vehicular Networks
"... Abstract—To cope with explosive vehicular traffic and ever-increasing application demands in the vehicular cellular network, opportunistic vehicular networks are used to disseminate mobile data by high-capacity device-to-device communication, which off-loads significant traffic from the cellular net ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—To cope with explosive vehicular traffic and ever-increasing application demands in the vehicular cellular network, opportunistic vehicular networks are used to disseminate mobile data by high-capacity device-to-device communication, which off-loads significant traffic from the cellular network. In the current opportunistic vehicular data transmission, coding-based schemes are proposed to address the challenge of opportunistic contact. However, whether coding techniques can be beneficial in the con-text of vehicular mobile data offloading is still an open question. In this paper, we establish a mathematical framework to study the problem of coding-based mobile data offloading under realistic network assumptions, where 1) mobile data items are heteroge-neous in terms of size; 2) mobile users have different interests to different data; and 3) the storage of offloading participants is limited. We formulate the problem as a users ’ interest satisfaction maximization problem with multiple linear constraints of limited storage. Then, we propose an efficient scheme to solve the problem, by providing a solution that decides when the coding should be used and how to allocate the network resources in terms of contact rate and offloading helpers ’ storage. Finally, we show the effectiveness of our algorithm through extensive simulations using two real vehicular traces. Index Terms—Erasure coding, mobile data offloading, oppor-tunistic vehicular networks. I.
DROiD: Adapting to Individual Mobility Pays Off in Mobile Data Offloading
"... IFIP, (2014). This is the author’s version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in IFIP Networking 2014. Abstract—Cellular operators count on the potentials of offload-ing techniques to relieve their ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
IFIP, (2014). This is the author’s version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in IFIP Networking 2014. Abstract—Cellular operators count on the potentials of offload-ing techniques to relieve their overloaded data channels. Beyond standard access point-based offloading strategies, a promising alternative is to exploit opportunistic direct communication links between mobile devices. Nevertheless, achieving efficient device-to-device offloading is challenging, as communication opportuni-ties are, by nature, dependent on individual mobility patterns. We propose, design, and evaluate DROiD (Derivative Re-injection to Offload Data), an original method to finely control the distribu-tion of popular contents throughout a mobile network. The idea is to use the infrastructure resources as seldom as possible. To this end, DROiD injects copies through the infrastructure only when needed: (i) at the beginning, in order to trigger the dissemination, (ii) if the evolution of the opportunistic dissemination is below some expected pace, and (iii) when the delivery delay is about to expire, in order to guarantee 100 % diffusion. Our strategy is particularly effective in highly dynamic scenarios, where sudden creation and dissolution of clusters of mobile nodes prevent contents to diffuse properly. We assess the performance of DROiD by simulating a traffic information service on a realistic large-scale vehicular dataset composed of more than 10,000 nodes. DROiD substantially outperforms other offloading strategies, saving more than 50 % of the infrastructure traffic even in the case of tight delivery delay constraints. DROiD allows terminal-to-terminal offloading of data with very short maximum reception delay, in the order of minutes, which is a realistic bound for cellular user acceptance. Index Terms—Mobile data offloading; hybrid networks; delay-tolerant networks. I.
Performance Analysis of Multi-Channel Multi-Source Message Delivery in ICMN
"... Abstract-In the paper, the feature of Intermittently Connected Mobile Networks (ICMN), that information can be propagated through the near-distance contact of nodes, is utilized as a supplement to the common Internet subscriber/publisher services. Specifically, the nodes with Internet connectivity ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-In the paper, the feature of Intermittently Connected Mobile Networks (ICMN), that information can be propagated through the near-distance contact of nodes, is utilized as a supplement to the common Internet subscriber/publisher services. Specifically, the nodes with Internet connectivity can help those without in retrieving the messages once stored and carried by the former. With the modeling of such a system, especially the consideration of the time-critical messages and limited bandwidth, the message delivery ratio and delay under the 1-hop and 2-hop relaying modes are analyzed respectively with the validation through extensive simulations.
Pervasive Content-centric Wireless Networking
"... Abstract-Current communication approaches assume network associations as a prerequisite to both content discovery and access. This network-centric paradigm incurs substantial communication and time overhead, as devices build knowledge of content availability only after blindly associating to a netw ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Current communication approaches assume network associations as a prerequisite to both content discovery and access. This network-centric paradigm incurs substantial communication and time overhead, as devices build knowledge of content availability only after blindly associating to a network. In pervasive mobile networking, this prerequisite and associated overhead prevents devices to efficiently identify desired communication partners, i.e., devices running an application or providing content of interest, within the broad mass of devices in communication range as found in everyday scenarios. SO-Fi, instead, realizes content-centric wireless networking by enabling pervasive content discovery before establishing a network infrastructure. SO-Fi builds on the IEEE 802.11 wireless broadcast medium to instantly achieve a discovery scope covering all devices in communication range. Realizing content discovery outside of secure network associations, SO-Fi supports usecase-specific communication security, i.e., confidentiality, WPA2 network security, DoS robustness, and user authentication. We show SO-Fi's feasibility and performance through real-world experimentation. Indeed, SO-Fi makes instant, content-centric wireless networking readily accessible to application designers.
Adaptive Backbone-based Routing in Delay Tolerant Networks
"... Abstract—In this paper, we develop a localized algorithm for the routing problem in delay tolerant networks (DTNs). We first design a modeling approach to derive a weighted graph from the DTN, taking into consideration the obtained history contact information of the nodes. This modeling provides ada ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, we develop a localized algorithm for the routing problem in delay tolerant networks (DTNs). We first design a modeling approach to derive a weighted graph from the DTN, taking into consideration the obtained history contact information of the nodes. This modeling provides adaptiveness by accommodating diverse network predication characteristics. Based on the derived weighted graph, we then put forward the concept of a delay tolerant network backbone for the DTN. When only the nodes in the backbone forward data, the routing in the DTN is achieved with the optimal performance in terms of the expected end-to-end delivery latency. This work is inspired by the widely used virtual backbone-based routing for mobile ad hoc and sensor networks. In DTNs with intermittent connectivity, we explore the meeting frequency between nodes for the construction of the backbone. Accordingly, we develop the delay tolerant connected dominating set (DTCDS) as an approximation to the delay tolerant network backbone, and further formalize the problem of minimum equally effective DTCDS. A localized heuristic algorithm for constructing an efficient DTCDS is proposed. Performance studies include a theoretical analysis and a comprehensive simulation on the proposed algorithm. Index Terms—Broadcast, connected dominating set (CDS), delay tolerant networks (DTNs), wireless communication. I.
The Design and Evaluation of An Information Sharing System for Human Networks
"... Abstract—With fast-growing consumer demands and rapidly-developing mobile technologies, portable mobile devices are becoming a necessity of our daily lives. However, existing mobile devices rely on the wireless infrastructure to access Internet services provided by central application providers. Thi ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—With fast-growing consumer demands and rapidly-developing mobile technologies, portable mobile devices are becoming a necessity of our daily lives. However, existing mobile devices rely on the wireless infrastructure to access Internet services provided by central application providers. This architecture is inefficient in many situations and also does not utilize abundant inter-device communication opportunities in many scenarios. This paper proposes the human network (HUNET), a network architecture that enables information sharing between mobile devices through direct inter-device communication. We design B-SUB, an interest-driven information sharing system for HUNETs. In B-SUB, content and user interests are described by tags, which are human-readable strings that are designated by users. An experiment is performed to demonstrate the effectiveness of this tag-based content description method. To facilitate efficient data dissemination, we invent the Temporal Counting Bloom filter (TCBF) to encode tags, which also reduces the overhead of content routing. Comprehensive theoretical analyses on the parameter tuning of B-SUB are presented and verify B-SUB’s ability to work efficiently under various network conditions. We then extend B-SUB’s routing scheme to provide a stronger privacy guarantee. Extensive real-world trace-driven simulations are performed to evaluate the performance of B-SUB, and the results demonstrate its efficiency and usefulness. Index Terms—Content based publish/subscribe, interest-driven information sharing, human network, Bloom filter. 1
Content Dissemination by Pushing and Sharing in Mobile Cellular Networks: An Analytical Study
"... Abstract—The ever increasing traffic demand is a serious concern of mobile network operators, and the conventional pull-based (or request-based) communication model may not be able to handle this data explosion problem. To reduce the traffic load on cellular links for disseminating content, we propo ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—The ever increasing traffic demand is a serious concern of mobile network operators, and the conventional pull-based (or request-based) communication model may not be able to handle this data explosion problem. To reduce the traffic load on cellular links for disseminating content, we propose to push the content to a subset of subscribers via cellular links, and to allow the subscribers to share the content via opportunistic local connectivity (i.e. Wi-Fi ad-hoc mode). We theoretically model and analyze how the content can be disseminated by both pushing via cellular links and sharing via Wi-Fi links, where handovers are modeled based on the multi-compartment model. We also formulate a mathematical framework to optimize the content dissemination, by which the trade-off between the dissemination delay and the energy cost is explored. I.
Mobile Data Delivery through Opportunistic Communications among Cellular Users: A Case
"... The appearance of smartphones and increasing popularity of various mobile applications and services have caused the ex-plosion of mobile data traffic. To avoid overloading the cellu-lar networks, different offloading solutions (such as WiFi net-works or femtocells) have been proposed and adopted. Re ..."
Abstract
- Add to MetaCart
(Show Context)
The appearance of smartphones and increasing popularity of various mobile applications and services have caused the ex-plosion of mobile data traffic. To avoid overloading the cellu-lar networks, different offloading solutions (such as WiFi net-works or femtocells) have been proposed and adopted. Re-cently, offloading cellular traffic through opportunistic com-munications among mobile phones becomes a new and promis-ing option, due to free cost. In this paper, by using real trace data from the Orange “Data for Development ” (D4D) challenge, we investigate the feasibility of delivering data packets among mobile cellular users through opportunistic communications in a large scale network. Our experimental results show that by using social or location properties of mobile users opportunistic routing can indeed complement the traditional cellular network to deliver delay-tolerant data packets among certain portion of cellular users. Such solu-tion is especially cost efficient and beneficial for developing countries, as Ivory Coast. 1.
