메뉴 건너뛰기




Volumn 70, Issue 4, 2013, Pages 1711-1734

RIS: A reciprocal incentive scheme in selfish opportunistic networks

Author keywords

Channel; Incentive scheme; Opportunistic networks; Selfish

Indexed keywords

BETTER PERFORMANCE; CHANNEL; COMMUNICATION BANDWIDTH; INCENTIVE SCHEMES; NETWORK INFORMATION; OPPORTUNISTIC NETWORKS; SELFISH; TRACE DRIVEN SIMULATION;

EID: 84878595335     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-012-0776-2     Document Type: Article
Times cited : (7)

References (32)
  • 1
    • 33947176178 scopus 로고    scopus 로고
    • Opportunistic net-working: Data forwarding in disconnected mobile ad hoc networks
    • 10.1109/MCOM.2006.248176
    • Pelusi L., Passarella A., Conti M. (2006) Opportunistic net-working: Data forwarding in disconnected mobile ad hoc networks. IEEE Communication Magazine. 44(11): 134-141
    • (2006) IEEE Communication Magazine. , vol.44 , Issue.11 , pp. 134-141
    • Pelusi, L.1    Passarella, A.2    Conti, M.3
  • 3
    • 33750307841 scopus 로고    scopus 로고
    • Probabilistic routing in intermittently connected networks
    • Lindgren, A., Doria, A., et al. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of SAPIR.
    • (2004) Proceedings of SAPIR
    • Lindgren, A.1    Doria, A.2
  • 4
    • 40749113163 scopus 로고    scopus 로고
    • Efficient routing in intermittently connected mobile networks: The multiple-copy case
    • 10.1109/TNET.2007.897964
    • Spyropoulos T., Psounis K., Raghavendra C.S. (2008) Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Network 16(1): 77-90
    • (2008) IEEE/ACM Transactions on Network , vol.16 , Issue.1 , pp. 77-90
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3
  • 5
    • 37849017498 scopus 로고    scopus 로고
    • Social network analysis for routing in disconnected delay-tolerant MANETs
    • Montreal: ACM Press
    • Daly, E., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the MobiHoc 2007 (pp. 32-40). Montreal: ACM Press.
    • (2007) Proceedings of the MobiHoc 2007 , pp. 32-40
    • Daly, E.1    Haahr, M.2
  • 7
    • 32144441510 scopus 로고    scopus 로고
    • PeopleNet: Engineering a wireless virtual social network
    • Motani, M., Srinivasan, V., & Nuggehalli, P. (2005). PeopleNet: Engineering a wireless virtual social network. In Proceedings of MobiCom (pp. 243-257).
    • (2005) Proceedings of MobiCom , pp. 243-257
    • Motani, M.1    Srinivasan, V.2    Nuggehalli, P.3
  • 9
    • 63449110577 scopus 로고    scopus 로고
    • ContentPlace: Social-aware data dissemination in opportunistic networks
    • Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of MSWiM (pp. 203-210).
    • (2008) Proceedings of MSWiM , pp. 203-210
    • Boldrini, C.1    Conti, M.2    Passarella, A.3
  • 11
    • 52049111873 scopus 로고    scopus 로고
    • Context and resource awareness in opportunistic network data dissemination
    • Boldrini, C., Conti, M., & Passarella, A. (2008). Context and resource awareness in opportunistic network data dissemination. In Proceedings of IEEE AOC.
    • (2008) Proceedings of IEEE AOC
    • Boldrini, C.1    Conti, M.2    Passarella, A.3
  • 16
    • 77953319755 scopus 로고    scopus 로고
    • Routing in socially selfish delay tolerant networks
    • Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. In Proceedings of IEEE INFOCOM (pp. 1-9).
    • (2010) Proceedings of IEEE INFOCOM , pp. 1-9
    • Li, Q.1    Zhu, S.2    Cao, G.3
  • 17
    • 70449578903 scopus 로고    scopus 로고
    • The effects of node cooperation level on routing performance in delay tolerant networks
    • Resta, G., & Santi, P. (2009). The effects of node cooperation level on routing performance in delay tolerant networks. In Proceedings of IEEE SECON (pp. 1-9).
    • (2009) Proceedings of IEEE SECON , pp. 1-9
    • Resta, G.1    Santi, P.2
  • 19
    • 77953298005 scopus 로고    scopus 로고
    • MobiCent: A credit-based incentive system for disruption tolerant network
    • Chen B., & Chan, M. C. (2010). MobiCent: A credit-based incentive system for disruption tolerant network. In Proceedings of INFOCOM (pp. 1-9).
    • (2010) Proceedings of INFOCOM , pp. 1-9
    • Chen, B.1    Chan, M.C.2
  • 20
    • 1242310099 scopus 로고    scopus 로고
    • A delay-tolerant network architecture for challenged internets
    • Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of SIGCOMM (pp. 27-34).
    • (2003) Proceedings of SIGCOMM , pp. 27-34
    • Fall, K.1
  • 21
    • 0035789239 scopus 로고    scopus 로고
    • Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
    • Papadopouli, M., & Schulzrinne, H. (2001). Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. In Proceedings of ACM MobiHoc.
    • (2001) Proceedings of ACM MobiHoc
    • Papadopouli, M.1    Schulzrinne, H.2
  • 22
    • 44649091279 scopus 로고    scopus 로고
    • Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoe networks
    • 10.1109/JSAC.2008.080602
    • Costa P., Mascolo C., Musolesi M., Picco G. P. (2008) Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoe networks. IEEE Journal of Selected Areas in Communication. 26(5): 748-760
    • (2008) IEEE Journal of Selected Areas in Communication. , vol.26 , Issue.5 , pp. 748-760
    • Costa, P.1    Mascolo, C.2    Musolesi, M.3    Picco, G.P.4
  • 25
    • 69249223002 scopus 로고    scopus 로고
    • Barter trade improves message delivery in opportunistic networks
    • 10.1016/j.adhoc.2009.02.005
    • Buttyán L., Dóra L., Félegyházi M., Vajda I. (2010) Barter trade improves message delivery in opportunistic networks. Ad Hoc Networks 8(1): 1-14
    • (2010) Ad Hoc Networks , vol.8 , Issue.1 , pp. 1-14
    • Buttyán, L.1    Dóra, L.2    Félegyházi, M.3    Vajda, I.4
  • 26
    • 0012790087 scopus 로고    scopus 로고
    • Approximation algorithms for the multiple knapsack problem with assignment restrictions
    • 1772824 0970.90106 10.1023/A:1009894503716
    • Dawande M., Kalagnanam J., Keskinocak P., Ravi R., Salman F. (2000) Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization 4: 171-186
    • (2000) Journal of Combinatorial Optimization , vol.4 , pp. 171-186
    • Dawande, M.1    Kalagnanam, J.2    Keskinocak, P.3    Ravi, R.4    Salman, F.5
  • 27
    • 70349678474 scopus 로고    scopus 로고
    • Optimal and scalable distribution of content updates over a mobile social network
    • Ioannidis, S., Chaintreau, A., & Massoulie, L. (2009). Optimal and scalable distribution of content updates over a mobile social network. Proceedings of INFOCOM.
    • (2009) Proceedings of INFOCOM
    • Ioannidis, S.1    Chaintreau, A.2    Massoulie, L.3
  • 29
  • 31
    • 0002687371 scopus 로고
    • The small world problem
    • Milgram S. (1967) The small world problem. Psychology Today. 1: 60-67
    • (1967) Psychology Today. , vol.1 , pp. 60-67
    • Milgram, S.1
  • 32
    • 70349313631 scopus 로고    scopus 로고
    • Inferring social network structure using mobile phone data
    • 10.1073/pnas.0900282106
    • Eagle N., Pentland A., Lazer D. (2009) Inferring social network structure using mobile phone data. Proceedings of the National Academy of Sciences 106(36): 15274-15278
    • (2009) Proceedings of the National Academy of Sciences , vol.106 , Issue.36 , pp. 15274-15278
    • Eagle, N.1    Pentland, A.2    Lazer, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.