메뉴 건너뛰기




Volumn , Issue , 2007, Pages 373-381

A graph-based model for disconnected ad hoc networks

Author keywords

Connectivity graph; Delaytolerant networking; Erd s renyi graphs; Message latency; Wireless networks

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; MESSAGE PASSING; NETWORK ROUTING;

EID: 34447332128     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.51     Document Type: Conference Paper
Times cited : (43)

References (36)
  • 1
    • 13944266651 scopus 로고    scopus 로고
    • A delay-tolerant network architecture for challenged internets
    • Karlsruhe, Germany, March 25-29
    • K. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. of ACM SIGCOMM, Karlsruhe, Germany, March 25-29, 2003.
    • (2003) Proc. of ACM SIGCOMM
    • Fall, K.1
  • 2
    • 21844451437 scopus 로고    scopus 로고
    • Routing in a delay tolerant network
    • Oct
    • S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant network," SIGCOMM Comp. Comm. Rev., vol. 34, no. 4, pp. 145-158, Oct. 2004.
    • (2004) SIGCOMM Comp. Comm. Rev , vol.34 , Issue.4 , pp. 145-158
    • Jain, S.1    Fall, K.2    Patra, R.3
  • 3
    • 34548368186 scopus 로고    scopus 로고
    • U. Lee, E. Magistretti, B. Zhou, M. Gerla, P. Bellavista, and A. Corradi, MobEyes: smart mobs for urban monitoring with vehicular sensor networks, UCLA CSD, Tech. Rep. 060015, 2006. [Online], Available: http://netlab.cs.ucla.edu/wiki/files/mobeyestr06.pdf
    • U. Lee, E. Magistretti, B. Zhou, M. Gerla, P. Bellavista, and A. Corradi, "MobEyes: smart mobs for urban monitoring with vehicular sensor networks," UCLA CSD, Tech. Rep. 060015, 2006. [Online], Available: http://netlab.cs.ucla.edu/wiki/files/mobeyestr06.pdf
  • 4
    • 0037600404 scopus 로고    scopus 로고
    • Delay-tolerant networking: An approach to interplanetary Internet
    • June
    • S. Burleigh, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss, "Delay-tolerant networking: an approach to interplanetary Internet," IEEE Comm. Mag., vol. 41, no. 6, pp. 128-136, June 2003.
    • (2003) IEEE Comm. Mag , vol.41 , Issue.6 , pp. 128-136
    • Burleigh, S.1    Torgerson, L.2    Fall, K.3    Cerf, V.4    Durst, B.5    Scott, K.6    Weiss, H.7
  • 5
    • 39049118503 scopus 로고    scopus 로고
    • Maxprop: Routing for vehicle-based disruption-tolerant networking
    • Barcelona, Spain, April 23-29
    • J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "Maxprop: Routing for vehicle-based disruption-tolerant networking," in Proc. of IEEE INFOCOM, Barcelona, Spain, April 23-29, 2006.
    • (2006) Proc. of IEEE INFOCOM
    • Burgess, J.1    Gallagher, B.2    Jensen, D.3    Levine, B.N.4
  • 6
    • 33748036059 scopus 로고    scopus 로고
    • Message ferry route design for sparse ad hoc networks with mobile nodes
    • Florence, Italy, May 22-25
    • M. M. B. Tariq, M. Ammar, and E. Zegura, "Message ferry route design for sparse ad hoc networks with mobile nodes," in Proc. of ACM MobiHoc, Florence, Italy, May 22-25, 2006, pp. 37-48.
    • (2006) Proc. of ACM MobiHoc , pp. 37-48
    • Tariq, M.M.B.1    Ammar, M.2    Zegura, E.3
  • 8
    • 0032136892 scopus 로고    scopus 로고
    • A deterministic approach to the end-to-end analysis of packet flows in connectionoriented networks
    • August
    • I. Chlamtac, A. Faragó, H. Zhang, and A. Fumagalli, "A deterministic approach to the end-to-end analysis of packet flows in connectionoriented networks," IEEE Trans. on Networking, vol. 6, no. 4, pp. 422-431, August 1998.
    • (1998) IEEE Trans. on Networking , vol.6 , Issue.4 , pp. 422-431
    • Chlamtac, I.1    Faragó, A.2    Zhang, H.3    Fumagalli, A.4
  • 9
    • 0036670170 scopus 로고    scopus 로고
    • Mobility increases the capacity of ad hoc wireless networks
    • Aug
    • M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. on Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002.
    • (2002) IEEE/ACM Trans. on Networking , vol.10 , Issue.4 , pp. 477-486
    • Grossglauser, M.1    Tse, D.2
  • 10
    • 33747142749 scopus 로고    scopus 로고
    • The capacity of wireless networks
    • March
    • P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. on Information Theory, vol. 46, no. 2, pp. 388-404, March 2000.
    • (2000) IEEE Trans. on Information Theory , vol.46 , Issue.2 , pp. 388-404
    • Gupta, P.1    Kumar, P.R.2
  • 11
    • 4143112460 scopus 로고    scopus 로고
    • Throughputdelay trade-off in wireless networks
    • Hong Kong, China, March 7-11
    • A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughputdelay trade-off in wireless networks," in Proc. of IEEE INFOCOM, Hong Kong, China, March 7-11, 2004.
    • (2004) Proc. of IEEE INFOCOM
    • Gamal, A.E.1    Mammen, J.2    Prabhakar, B.3    Shah, D.4
  • 12
    • 20544449224 scopus 로고    scopus 로고
    • Capacity and delay tradeoffs for ad hoc mobile networks
    • M. Neely and E. Modiano, "Capacity and delay tradeoffs for ad hoc mobile networks," IEEE Trans. on Information Theory, vol. 51, no. 6, pp. 1917-1937, 2006.
    • (2006) IEEE Trans. on Information Theory , vol.51 , Issue.6 , pp. 1917-1937
    • Neely, M.1    Modiano, E.2
  • 13
    • 25844432341 scopus 로고    scopus 로고
    • Controlling the mobility of multiple data transport ferries in a delay-tolerant network
    • Miami USA, March 13-17
    • W. Zhao, M. Ammar, and E. Zegura, "Controlling the mobility of multiple data transport ferries in a delay-tolerant network," in Proc. of IEEE INFOCOM, Miami USA, March 13-17, 2005.
    • (2005) Proc. of IEEE INFOCOM
    • Zhao, W.1    Ammar, M.2    Zegura, E.3
  • 14
    • 0036983264 scopus 로고    scopus 로고
    • An epidemic model for information diffusion in MANETs
    • Atlanta, Georgia, Sept. 28
    • A. Khelil, C. Becker, J. Tian, and K. Rothermel, "An epidemic model for information diffusion in MANETs," in Proc. of ACM MSWiM, Atlanta, Georgia, Sept. 28, 2002, pp. 54-60.
    • (2002) Proc. of ACM MSWiM , pp. 54-60
    • Khelil, A.1    Becker, C.2    Tian, J.3    Rothermel, K.4
  • 15
    • 34548327866 scopus 로고    scopus 로고
    • Delay tolerant mobile networks (DTMNs): Controlled flooding schemes in sparse mobile networks
    • Waterloo, Canada, May
    • K. Harras, K. Almeroth, and E. Belding-Royer, "Delay tolerant mobile networks (DTMNs): Controlled flooding schemes in sparse mobile networks," in Proc. of IFIP Netwoking, Waterloo, Canada, May, 2005.
    • (2005) Proc. of IFIP Netwoking
    • Harras, K.1    Almeroth, K.2    Belding-Royer, E.3
  • 16
    • 39049095674 scopus 로고    scopus 로고
    • Impact of human mobility on the design of opportunistic forwarding algorithms
    • Barcelona, Spain, April 23-29
    • A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of human mobility on the design of opportunistic forwarding algorithms," in Proc. of INFOCOM, Barcelona, Spain, April 23-29, 2006.
    • (2006) Proc. of INFOCOM
    • Chaintreau, A.1    Hui, P.2    Crowcroft, J.3    Diot, C.4    Gass, R.5    Scott, J.6
  • 17
    • 33244486793 scopus 로고    scopus 로고
    • R. Groenevelt and P. Nain, Message delay in MANETs, in Proc. of ACMSIGMETRICS, Banff, Canada, June 6, 2005, pp. 412-413, see also R. Groenevelt, Stochastic Models for Mobile Ad Hoc Networks. PhD thesis, University of Nice-Sophia Antipolis, April 2005.
    • R. Groenevelt and P. Nain, "Message delay in MANETs," in Proc. of ACMSIGMETRICS, Banff, Canada, June 6, 2005, pp. 412-413, see also R. Groenevelt, Stochastic Models for Mobile Ad Hoc Networks. PhD thesis, University of Nice-Sophia Antipolis, April 2005.
  • 19
    • 34548367124 scopus 로고    scopus 로고
    • S. Merugu, M. Ammar, and E. Zegura, Routing in space and time in networks with predictable mobility, Georgia Tech., College of Computing, Tech. Rep. GIT-CC-04-07, 2004. [Online]. Available: http://citeseer.ist.psu.edu/ merugu04routing.html
    • S. Merugu, M. Ammar, and E. Zegura, "Routing in space and time in networks with predictable mobility," Georgia Tech., College of Computing, Tech. Rep. GIT-CC-04-07, 2004. [Online]. Available: http://citeseer.ist.psu.edu/ merugu04routing.html
  • 20
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • May-June
    • L. R. Ford and D. R. Fulkerson, "Constructing maximal dynamic flows from static flows," Operations Research, vol. 6, no. 3, pp. 419-433, May-June 1958.
    • (1958) Operations Research , vol.6 , Issue.3 , pp. 419-433
    • Ford, L.R.1    Fulkerson, D.R.2
  • 21
    • 6444221582 scopus 로고    scopus 로고
    • Building a reference combinatorial model for MANETs
    • Sept./October
    • A. Ferreira, "Building a reference combinatorial model for MANETs," IEEE Network, vol. 8, no. 5, pp. 24-29, Sept./October 2005.
    • (2005) IEEE Network , vol.8 , Issue.5 , pp. 24-29
    • Ferreira, A.1
  • 22
    • 6444233472 scopus 로고    scopus 로고
    • Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem
    • Cambridge, UK, March 24-26
    • A. Ferreira and A. Jarry, "Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem," in Proc. of WiOpt'04, Cambridge, UK, March 24-26, 2004.
    • (2004) Proc. of WiOpt'04
    • Ferreira, A.1    Jarry, A.2
  • 25
    • 50249129597 scopus 로고    scopus 로고
    • A framework for opportunistic forwarding in disconnected networks
    • Palo Alto, USA, July 17-21
    • I. Carreras, D. Miorandi, and I. Chlamtac, "A framework for opportunistic forwarding in disconnected networks," in Proc. of Mobiquitous, Palo Alto, USA, July 17-21, 2006.
    • (2006) Proc. of Mobiquitous
    • Carreras, I.1    Miorandi, D.2    Chlamtac, I.3
  • 28
    • 33644868794 scopus 로고    scopus 로고
    • Scalable percolation search on complex networks
    • April
    • N. Sarshar, P. O. Boykin, and V. P. Roychowdhury, "Scalable percolation search on complex networks." Theor. Comput. Sci., vol. 355, no. 1, pp. 48-64, April 2006.
    • (2006) Theor. Comput. Sci , vol.355 , Issue.1 , pp. 48-64
    • Sarshar, N.1    Boykin, P.O.2    Roychowdhury, V.P.3
  • 29
    • 11944253901 scopus 로고    scopus 로고
    • Cambridge: Cambridge Univ. Press
    • B. Bollobas, Random Graphs. Cambridge: Cambridge Univ. Press, 2001.
    • (2001) Random Graphs
    • Bollobas, B.1
  • 30
    • 0346408951 scopus 로고    scopus 로고
    • The diameter of sparse random graphs
    • F. Chung and L. Lu, "The diameter of sparse random graphs," Advances in Applied Mathematics, vol. 26, no. 4, pp. 257-279, 2001.
    • (2001) Advances in Applied Mathematics , vol.26 , Issue.4 , pp. 257-279
    • Chung, F.1    Lu, L.2
  • 31
    • 0036013593 scopus 로고    scopus 로고
    • Statistical mechanics of complex networks
    • Jan
    • R. Albert and A. L. Barabasi, "Statistical mechanics of complex networks," Review of Modern Physics, vol. 74, no. 1, pp. 47-95, Jan. 2002.
    • (2002) Review of Modern Physics , vol.74 , Issue.1 , pp. 47-95
    • Albert, R.1    Barabasi, A.L.2
  • 32
    • 33745179499 scopus 로고    scopus 로고
    • On the throughput scaling of wireless relay networks
    • June
    • O. Dousse, M. Franceschetti, and P. Thiran, "On the throughput scaling of wireless relay networks," IEEE Trans. on Information Theory, vol. 52, no. 6, pp. 2756-2761, June 2006.
    • (2006) IEEE Trans. on Information Theory , vol.52 , Issue.6 , pp. 2756-2761
    • Dousse, O.1    Franceschetti, M.2    Thiran, P.3
  • 33
    • 25644450392 scopus 로고    scopus 로고
    • Perfect simulation and stationarity of a class of mobility models
    • Miami, USA, March 13-17
    • J.-Y. L. Boudec and M. Vojnovic, "Perfect simulation and stationarity of a class of mobility models," in Proc. of IEEE INFOCOM, Miami, USA, March 13-17, 2005.
    • (2005) Proc. of IEEE INFOCOM
    • Boudec, J.-Y.L.1    Vojnovic, M.2
  • 34
    • 34548347759 scopus 로고    scopus 로고
    • AA.VV, Omnet++. [Online]. Available: www.omnetpp.org
    • AA.VV, "Omnet++." [Online]. Available: www.omnetpp.org


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