RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • SCISCIESCOPUS

        Delay and Energy Constrained Random Access Transport Capacity

        Ilmu Byun,Byung Hoon Ko,Ki Jun Jeon,Kwang Soon Kim IEEE 2014 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.13 No.8

        <P>In this paper, we consider a delay and energy constrained wireless ad hoc network with node density of λ<SUB>n</SUB>, where a packet should be delivered to the destination within D(λ<SUB>n</SUB>) seconds using at most E(λ<SUB>n</SUB>) energy in joules while satisfying the target outage probability. The performance metric for analyzing the network is the delay and energy constrained random access transport capacity (DE-RATC), i.e., $C<SUB>ϵ</SUB>(D(λ<SUB>n</SUB>), E(λ<SUB>n</SUB>), which quantifies the maximum end-to-end distance weighted rate per unit area of a delay and energy constrained network using a random access protocol. It is shown that a slotted ALOHA protocol is order-optimal under any delay and energy constraints if equipped with additional features such as power control, multi-hop control, interference control, and rate control, and the delay and energy constraints can be divided into three regions according to the relation between the physical quantities due to the constraints and those due to the node density and network size. The three regions are the non-constrained (NC) region, where the DE-RATC is given by Θ(√λ<SUB>n</SUB>/logλ<SUB>n</SUB>); the delay-constrained (DC) region, where the DE-RATC depends only on the delay constraint as Θ(D(λ<SUB>n</SUB>); and the non-achievable (NA) region where a packet delivery under the given constraints is impossible. Also, it is shown that an arbitrary tradeoff between the rate of each source node and the number of source nodes can be achieved while keeping the optimal capacity scaling as long as λ<SUB>s</SUB>=Ω√λ<SUB>n</SUB>/logλ<SUB>n</SUB>, Dλ<SUB>n</SUB>))).</P>

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼