메뉴 건너뛰기




Volumn , Issue , 2008, Pages

A game theoretical data replication technique for mobile ad hoc networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER RESOURCE MANAGEMENT; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; DISTRIBUTED PARAMETER NETWORKS; FREQUENCY ALLOCATION; GAME THEORY; MACHINE DESIGN; MATHEMATICAL MODELS; MECHANISMS; MOBILE TELECOMMUNICATION SYSTEMS; NUCLEAR PROPULSION; PLANNING; RESOURCE ALLOCATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 51049090400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536303     Document Type: Conference Paper
Times cited : (10)

References (37)
  • 1
    • 0036162986 scopus 로고    scopus 로고
    • Evolutionary algorithms for allocating data in distributed database systems
    • January
    • I. Ahmad, K. Karlapalem, Y.-K. Kwok, and S.-K. So. Evolutionary algorithms for allocating data in distributed database systems. Distributed and Parallel Databases, 11(1):5-32, January 2000.
    • (2000) Distributed and Parallel Databases , vol.11 , Issue.1 , pp. 5-32
    • Ahmad, I.1    Karlapalem, K.2    Kwok, Y.-K.3    So, S.-K.4
  • 5
    • 0000871962 scopus 로고
    • A difficulty in the concept of social welfare
    • April
    • K. Arrow. A difficulty in the concept of social welfare. Journal of Political Economy, 58(4):328-346, April 1950.
    • (1950) Journal of Political Economy , vol.58 , Issue.4 , pp. 328-346
    • Arrow, K.1
  • 6
    • 0014583032 scopus 로고
    • Optimal file allocation in a multiple computer system
    • October
    • W. W. Chu. Optimal file allocation in a multiple computer system. IEEE Transactions on Computers, 18(10):885-889, October 1969.
    • (1969) IEEE Transactions on Computers , vol.18 , Issue.10 , pp. 885-889
    • Chu, W.W.1
  • 8
    • 0001195563 scopus 로고
    • Manipulation of voting schemes: A general result
    • September
    • A. Gibbard. Manipulation of voting schemes: A general result. Econometrica, 41(4):587-601, September 1972.
    • (1972) Econometrica , vol.41 , Issue.4 , pp. 587-601
    • Gibbard, A.1
  • 13
    • 0043198523 scopus 로고    scopus 로고
    • Replica allocation methods in ad hoc networks with data update
    • August
    • T. Hara. Replica allocation methods in ad hoc networks with data update. Mobile Networks and Applications, 8(4):343-354, August 2003.
    • (2003) Mobile Networks and Applications , vol.8 , Issue.4 , pp. 343-354
    • Hara, T.1
  • 15
    • 85008556094 scopus 로고    scopus 로고
    • Data replication for improving data accessibility in ad hoc networks
    • November
    • T. Hara and S. K. Madria. Data replication for improving data accessibility in ad hoc networks. IEEE Transactions on Mobile Computing, 5(11):1515-1532, November 2006.
    • (2006) IEEE Transactions on Mobile Computing , vol.5 , Issue.11 , pp. 1515-1532
    • Hara, T.1    Madria, S.K.2
  • 18
    • 0031250875 scopus 로고    scopus 로고
    • Bit-sequences: An adaptive cache invalidation method in mobile client/server environments
    • April
    • J. Jing, A. K. Elmagarmid, A. Helal, and R. Alonso. Bit-sequences: An adaptive cache invalidation method in mobile client/server environments. Mobile Networks and Applications, 2(2):115-127, April 1997.
    • (1997) Mobile Networks and Applications , vol.2 , Issue.2 , pp. 115-127
    • Jing, J.1    Elmagarmid, A.K.2    Helal, A.3    Alonso, R.4
  • 22
    • 51049086768 scopus 로고    scopus 로고
    • Replicating data objects in large-scale distributed computing systems using extended vickrey auction
    • January
    • S. U. Khan and I. Ahmad. Replicating data objects in large-scale distributed computing systems using extended vickrey auction. International Journal of Computational Intelligence, 3(1):14-22, January 2006.
    • (2006) International Journal of Computational Intelligence , vol.3 , Issue.1 , pp. 14-22
    • Khan, S.U.1    Ahmad, I.2
  • 23
    • 34247615128 scopus 로고    scopus 로고
    • Discriminatory algorithmic mechanism design based www content replication
    • January
    • S. U. Khan and I. Ahmad. Discriminatory algorithmic mechanism design based www content replication. Informatica, 31(1):105-119, January 2007.
    • (2007) Informatica , vol.31 , Issue.1 , pp. 105-119
    • Khan, S.U.1    Ahmad, I.2
  • 25
    • 0030244802 scopus 로고    scopus 로고
    • Design and evaluation of data allocation algorithms for distributed multimedia database systems
    • July
    • Y. Kwok, K. Karlapalem, I. Ahmad, and N. M. Pun. Design and evaluation of data allocation algorithms for distributed multimedia database systems. IEEE Journal on Selected Areas in Communications, 14(7):1332-1348, July 1996.
    • (1996) IEEE Journal on Selected Areas in Communications , vol.14 , Issue.7 , pp. 1332-1348
    • Kwok, Y.1    Karlapalem, K.2    Ahmad, I.3    Pun, N.M.4
  • 27
    • 17244377418 scopus 로고    scopus 로고
    • Optimizing download time of embedded multimedia objects for web browsing
    • October
    • T. Loukopoulos and I. Ahmad. Optimizing download time of embedded multimedia objects for web browsing. IEEE Transactions on Parallel and Distributed Systems, 15(10):934-945, October 2004.
    • (2004) IEEE Transactions on Parallel and Distributed Systems , vol.15 , Issue.10 , pp. 934-945
    • Loukopoulos, T.1    Ahmad, I.2
  • 32
    • 0038183237 scopus 로고    scopus 로고
    • How bad is selfish routing?
    • February
    • T. Roughgarden and É. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, February 2004.
    • (2004) Journal of the ACM , vol.49 , Issue.2 , pp. 236-259
    • Roughgarden, T.1    Tardos, E.2
  • 33
    • 33845193715 scopus 로고    scopus 로고
    • Hard to manipulate combinatorial auctions
    • Technical report, Division of Engineering and Applied Sciences, Harvard University
    • S. Sanghvi and D. C. Parkes. Hard to manipulate combinatorial auctions. Technical report, Division of Engineering and Applied Sciences, Harvard University, 2004.
    • (2004)
    • Sanghvi, S.1    Parkes, D.C.2
  • 34
    • 0038309442 scopus 로고
    • An approximate algorithm for the generalized assignment problem
    • February
    • D. B. Shmoys and É. Tardos. An approximate algorithm for the generalized assignment problem. Mathematical Programming, Part A, 62:461-474, February 1993.
    • (1993) Mathematical Programming, Part A , vol.62 , pp. 461-474
    • Shmoys, D.B.1    Tardos, E.2
  • 35
    • 51049090934 scopus 로고    scopus 로고
    • An analysis of procedures and objective functions for heuristics to perform data staging in distributed systems
    • June
    • M. D. Theys, N. Beck, H. J. Siegel, and M. Jurczyk. An analysis of procedures and objective functions for heuristics to perform data staging in distributed systems. Journal of Interconnection Networks, 7(2):257-293, June 2006.
    • (2006) Journal of Interconnection Networks , vol.7 , Issue.2 , pp. 257-293
    • Theys, M.D.1    Beck, N.2    Siegel, H.J.3    Jurczyk, M.4
  • 36
    • 0035185924 scopus 로고    scopus 로고
    • Heuristics for scheduling data requests using collective communications in a distributed communication network
    • September
    • M. D. Theys, H. J. Siegel, and E. K. P. Chong. Heuristics for scheduling data requests using collective communications in a distributed communication network. Journal of Parallel Distributed Computing, 61(9):1337-1366, September 2001.
    • (2001) Journal of Parallel Distributed Computing , vol.61 , Issue.9 , pp. 1337-1366
    • Theys, M.D.1    Siegel, H.J.2    Chong, E.K.P.3


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