Minimum makespan workload dissemination in DTNs: Making full utilization of computational surplus around

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2013, Pages 293-296

  Zhang, Sheng ^a   Wu, Jie ^b   Lu, Sanglu ^a  

^a NANJING UNIVERSITY   (China)

^b Temple University   (United States)

Author keywords

Crowd computing; Delay Tolerant Networks; Makespan; Workload dissemination

Indexed keywords

AMOUNT OF INFORMATION; COMPUTATIONAL CAPACITY; CROWD COMPUTING; DISSEMINATION PROTOCOLS; MAKESPAN; NEIGHBORHOOD INFORMATION; TRACE DRIVEN SIMULATION; WORKLOAD DISSEMINATION;

MOBILE AD HOC NETWORKS; OPTIMIZATION; ROUTERS; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

DELAY TOLERANT NETWORKS;

EID: 84883014980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491288.2491327     Document Type: Conference Paper

References (8)

1. SETI@home. http://setiathome.berkeley.edu/.
2. A. Balasubramanian, B. Levine, and A. Venkataramani. DTN routing as a resource allocation problem. In ACM SIGCOMM 2007.
3. A. Chaintreau, P. Hui, J. Scott, R. Gass, J. Crowcroft, and C. Diot. Impact of human mobility on opportunistic forwarding algorithms. IEEE TMC 2007.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2nd revised edition edition.
5. K. Fall. A delay-tolerant network architecture for challenged internets. In ACM SIGCOMM 2003.
6. W. Gao and G. Cao. User-centric data dissemination in disruption tolerant networks. In IEEE INFOCOM 2011.
7. V. Vazirani. Approximation algorithms. Springer, 2004.
8. X. Zhuo, W. Gao, G. Cao, and Y. Dai. Win-Coupon: An incentive framework for 3G traffic offloading. In IEEE ICNP 2011.