English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27287/39131
Visitors : 2443581      Online Users : 36
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43983

Title: Load-Aware Channel Hopping Protocol Design for Mobile Ad Hoc Networks
Authors: Chih-Min Chao
Hsien-Chen Tsai
Chao-Ying Huang
Contributors: 國立臺灣海洋大學:資訊工程學系
NTOU:Department of Computer Science and Engineering
Keywords: Ad Hoc Networks
Multichannel MAC Protocols
Quorum Systems
Date: 2012-07
Issue Date: 2017-11-09T01:26:49Z
Publisher: The 7th International Symposium on Wireless Pervasive Computing (ISWPC)
Abstract: Abstract:Utilizing multiple channels improves spatial reuse and reduces collision probability, which enhances network throughput. There exist many multi-channel MAC protocols; however, most of them suffer from either higher hardware cost (requiring more than one transceiver for each node) or control channel bottleneck. Some channel hopping multi-channel protocols achieve pretty good performance in some situations. Unfortunately, they fail to adjust their channel hopping mechanisms based on varied loads. This may lead to performance reduction. There are many challenges for designing a multi-channel MAC protocol. How to solve the multi-channel-specific problems, such as channel assignment problem, the multi-channel hidden terminal problem, and the missing receiver problem, is essential. In this paper, we propose a Load-Aware Channel Hopping MAC protocol (LACH) that solves all the problems mentioned above and enables nodes to dynamically adjust their schedules based on their traffic loads. Besides the load awareness feature, several other attractive characteristics can also be found in the LACH protocol: (1) Each node is equipped with one half-duplex transceiver. (2) Each node's initial hopping sequence is generated through its ID. Knowing neighbor nodes' IDs, a node can conduct their initial channel hopping sequences without control packet exchanges. (3) Nodes are evenly distributed among available channels. Through simulations, we verify the superiority of the proposed LACH.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43983
Appears in Collections:[資訊工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat
index.html0KbHTML36View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback