earticle

논문검색

무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구

원문정보

An Efficient Code Assignment Algorithm in Wireless Mesh Networks

여재현

피인용수 : 0(자료제공 : 네이버학술정보)

초록

영어

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

목차

Abstract
 1. Introduction
 2. Problem Description and Modeling
 3. Centralized Algorithm
  3.1 Basic Algorithm
  3.2 A New Algorithm
 4. Simulation results
 5. Conclusion
 References

저자정보

  • 여재현 Jaehyun Yeo. 정보통신정책연구원, 책임연구원

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.

      • 4,000원

      0개의 논문이 장바구니에 담겼습니다.