Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks

Lee, Kyunghan; Ye, Yi; Jeong, Jaeseong; Won, Hyungsuk; Rhee, Injong; Chong, Song

doi:10.1109/infcom.2010.5461932

Cited by 99 publications

(69 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By analyzing large amounts of the trace data given in [35], [23] and [24] found that the distribution of the ICT between taxis followed the exponential distribution on a large time scale. Moreover, Zhu et al [24] performed a least-squares fitting to identify the exponential parameter and found that the ICT was well approximated by the exponential distribution of P {X > t} = e −3.71×10 −6 t .…”

Section: B Evaluation Settings and Resultsmentioning

confidence: 99%

“…Moreover, [22] models the ICTs of each individual human in mobile social networks by the Poisson process and experimentally validates this model by using the χ 2 tests on real trace data. In [23] and [24], on the other hand, the ICTs between vehicles in vehicular ad hoc networks are modeled and reveal the exponential distribution of ICT between nodes by analyzing a large number of real car/taxi mobility traces. We further point out that the exponential model is widely used in many other recent works [25]- [29].…”

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks

Hanzo

Jin

et al. 2012

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-Owing to the uncertainty of transmission opportunities between mobile nodes, the routing in delay-tolerant networks (DTNs) exploits the mechanism of opportunistic forwarding. Energy-efficient algorithms and policies for DTN are crucial to maximizing the message delivery probability while reducing the delivery cost. In this contribution, we investigate the problem of energy-efficient optimal beaconing control in a DTN. We model the message dissemination under variable beaconing rate with a continuous-time Markov model. Based on this model, we then formulate the optimization problem of the optimal beaconing control for epidemic routing and obtain the optimal threshold policy from the solution of this optimization problem. Furthermore, through extensive numerical results, we demonstrate that the proposed optimal threshold policy significantly outperforms the static policy with constant beaconing rate in terms of system energy consumption savings.

show abstract

Section: B Evaluation Settings and Resultsmentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks

Hanzo

Jin

et al. 2012

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…In this paper, we assume that communication contact between vehicles i and j obeys the Poisson process with contact rate γ i,j . Poisson-distributed contact rate has been validated to fit well to real vehicular traces and is widely used to model opportunistic vehicular systems [23], [24]. The mobility of a helper has much more significant influence on the mobile data offloading system considered than the mobility of a subscriber, and different helpers have different mobility patterns.…”

Section: B Data Offloading and Networking Modelingmentioning

confidence: 99%

Coding or Not: Optimal Mobile Data Offloading in Opportunistic Vehicular Networks

Jin

Hanzo

et al. 2014

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

Abstract-To cope with explosive vehicular traffic and everincreasing application demands in the vehicular cellular network, opportunistic vehicular networks are used to disseminate mobile data by high-capacity device-to-device communication, which offloads 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 context 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 heterogeneous 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, opportunistic vehicular networks.

show abstract

“…Other related work focuses on the security and privacy aspect, including providing user incentive [5], trust of rating protocol and privacy [7]. DTN Content Dissemination: There are many unicast DTN routing schemes designed to improve point-to-point delivery probability and/or minimize delay [15]. These protocols, however, do not address the issue of information dissemination.…”

Section: Related Workmentioning

confidence: 99%

Mobile-to-Mobile Video Recommendation

Seshadri

Chan

Ooi

2013

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. Mobile device users can now easily capture and socially share video clips in a timely manner by uploading them wirelessly to a server. When attending crowded events, however, timely sharing of videos becomes difficult due to choking bandwidth in the network infrastructure, preventing like-minded attendees from easily sharing videos with each other through a server. One solution to alleviate this problem is to use direct device-to-device communication to share videos among nearby attendees. Contact capacity between two devices, however, is limited, and thus a recommendation algorithm is needed to select and transmit only videos of potential interest to an attendee. In this paper, we address the question: which video clip should be transmitted to which user. We proposed an video transmission scheduling algorithm, called CoFiGel, that runs in a distributed manner and aims to improve both the prediction coverage and precision of the recommendation algorithm. At each device, CoFiGel transmits the video that would increase the estimated number of positive user-video ratings the most if this video is transferred to the destination device. We evaluated CoFiGel using real-world traces and show that substantial improvement can be achieved compared to baseline schemes that do not consider rating or contact history.

show abstract

Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks

Cited by 99 publications

References 15 publications

Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks

Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks

Coding or Not: Optimal Mobile Data Offloading in Opportunistic Vehicular Networks

Mobile-to-Mobile Video Recommendation

Contact Info

Product

Resources

About