$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"
쳇봇 이모티콘
안녕하세요!
ScienceON 챗봇입니다.
궁금한 것은 저에게 물어봐주세요.

논문 상세정보

Towards Achieving the Maximum Capacity in Large Mobile Wireless Networks under Delay Constraints

Journal of communications and networks v.6 no.4 , 2004년, pp.352 - 361  
Abstract

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

참고문헌 (12)

  1. M. Grossglauser and D. Tse, 'Mobility increases the capacity of ad hocwireless networks,' IEEE/ACM Trans. Networking, vol. 10, Aug. 2002 
  2. G. Sharma and R. R. Mazumdar, 'Delay and capacity tradeoffs for wireless ad hoc networks with random mobility,' preprint, available at http://www.ece.purdue.edu/-mazum/, Oct. 2003 
  3. R. Durrett, Probability: Theory and Examples, 2nd ed., Belmont, CA: Duxbury Press, 1996 
  4. G. Sharma and R. R. Mazumdar, 'On achievable delay/capacity trade-offs in mobile ad hoc networks,' in Proc. Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WIOPT), Cambridge, UK, Mar. 2004 
  5. N. Bansal and Z. Liu, 'Capacity, delay, and mobility in wireless ad hoc networks,' in Proc. IEEE INFOCOM 2003, San Francisco, CA, Apr. 2003 
  6. S. Diggavi, M. Grossglauser, and D. Tse, 'Even one-dimensional mobility increases ad hoc wireless capacity,' in Proc. ISIT 2002, Lausanne, Switzerland, June 2002 
  7. P. Gupta and P. R. Kumar, 'The capacity of wireless networks,' IEEE Trans. Inform. Theory, vol. 46, pp. 388-404, Mar. 2000 
  8. X. Lin and N. B. Shroff, 'The fundamental capacity delay tradeoff in large mobile ad hoc networks,' Technical Report, Purdue University, available at http://min.ecn.purdue.edu/-linx/papers.html, 2004 
  9. A. E. Gamal et al., 'Throughput delay trade off in wireless networks,' in Proc. IEEE INFOCOM 2004, Hong Kong, China, Mar. 2004 
  10. S. Toumpis and A. J. Goldsmith, 'Large wireless networks under fading, mobility, and delay constraints,' in Proc. IEEE INFOCOM 2004, Hong Kong, China, Mar. 2004 
  11. M. J. Neely and E. Modiano, 'Capacity and delay tradeoffs for ad hoc mobile networks,' submitted to IEEE Trans. Inform. Theory, available at http://www-rcf.usc.edu/-mjneely/, 2003 
  12. X. Lin and N. B. Shroff, 'The fundamental capacity delay tradeoff in large mobile ad hoc networks,' in Proc. Third Annual Mediterranean AdHoc Networking Workshop, Bodrum, Turkey, June 2004 

이 논문을 인용한 문헌 (0)

  1. 이 논문을 인용한 문헌 없음

원문보기

원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다. (원문복사서비스 안내 바로 가기)

상세조회 0건 원문조회 0건

DOI 인용 스타일