원문정보
The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming
초록
영어
The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.
목차
1. 서론
2. 관련 연구
3. 문제의 정의
3.1 패킷 전송 네트워크와 문제의 상황
3.2 패킷 충돌과 회피
4. 제약식 프로그래밍을 이용한 모델링
4.1 실현가능 스케쥴 조건
4.2 제약식 프로그래밍 모형의 설정
4.3 두 가지 제약식 프로그래밍 솔버에 대한 모형 언어의 고려
5. 계산 실험과 논의
6. 결론 및 한계와 향후 연구 방향
References