Spatial Reuse and Exposed Terminal Problems in Wireless Networks
- 주제(키워드) Exposed ternimal problem
- 발행기관 고려대학교 대학원
- 지도교수 이원준
- 발행년도 2011
- 학위수여년월 2011. 2
- 학위구분 석사
- 학과 일반대학원 컴퓨터·전파통신공학과
- 원문페이지 49 p
- 실제URI http://www.dcollection.net/handler/korea/000000025899
- 본문언어 영어
- 제출원본 000045640789
초록/요약
Due to its decentralized nature, carrier sensing based medium access in wireless networks has to make an access decision based on limited local information. The subsequent hidden and exposed terminal problems are the results of incorrect sensing by senders. A commonly adopted pattern of solutions for exposed terminal problems in previous papers usually consist of two steps: identifying exposed terminals and handling concurrent transmissions. In this paper, a simple distributed dynamic set scheme is proposed in which exposed terminals are designed to notify their existence by self-consciously construction and join a dynamic set. Within each dynamic set, the concurrent transmissions are handled by sharing a common timing relation to avoid collisions. The proposed algorithm is designed to be lightweight and decentralized. Our analytical model and the supporting simulation outcomes show that the proposed scheme significantly outperforms other legacy algorithms that have appeared in the literature.
more목차
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi
1 Introduction 1
2 Model and Problem Statement 5
3 Distributed Dynamic Set Algorithm 8
3.1 Main Loop . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.2 Set Construction Algorithm 1 . . . . . . . . . . . . . . . . . . . . . . . . 10
4 Revised distributed set construction algorithm 13
4.1 Revision 1: Adaptive estimation of N . . . . . . . . . . . . . . . . . . . . 13
4.2 Revision 2: Adaptive transmit point si for sub optimal discovery time . 15
5 Handling Concurrent Transmissions 22
6 Simulation results 27
6.1 Complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.2 Throughput . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
7 Related Work 33
8 Conclusion 36
References 37
