|
CityU Institutional Repository >
CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Engineering and Information Technology >
IT - Master of Philosophy >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2031/4761
|
| Title: | Reliable multicast over wireless ad-hoc network |
| Other Titles: | Zai wu xian sui yi wang lu xia de ke kao qun bo 在無線隨意網路下的可靠群播 |
| Authors: | Lau, Kwan Shek (劉鈞碩) |
| Department: | Department of Computer Engineering and Information Technology |
| Degree: | Master of Philosophy |
| Issue Date: | 2005 |
| Publisher: | City University of Hong Kong |
| Subjects: | Multicasting (Computer networks) Wireless communication systems |
| Notes: | ii, 56 leaves : ill. ; 30 cm. Thesis (M.Phil.)--City University of Hong Kong, 2005 Includes bibliographical references (leaves 54-56) CityU Call Number: TK5105.887.L38 2005 |
| Type: | Thesis |
| Abstract: | IEEE 802.11 is the de facto standard for wireless communications.
According to the 802.1 1 medium access control protocol, multicast frames are
transmitted over ad hoc networks without virtual channel reservation. Hence,
multicast communications in ad hoc networks suffer from the hidden terminal
problem, and may have low delivery ratio. Feedback implosion is another
issue that need to be addressed. If each multicast group member sends feedback
messages to the sender directly, the sender will be congested/overloaded.
In this research, a tree-based reliable multicast communication protocol
is proposed. Firstly, the virtual channel reservation technique for unicast
communication is extended to multicast communications such that the packet
loss probability can be reduced significantly. Secondly, a tree-based packet
recovery protocol is developed. Feedbacks from the multicast group members
are consolidated at the branch points of the multicast tree, and the workload of
the packet recovery process can be distributed among the multicast group
members. The performance of the proposed reliable multicast protocol is
studied via simulation. It was found that the tree-based method performs better
than gossip-based methods when node mobility is not high. |
| Online Catalog Link: | http://lib.cityu.edu.hk/record=b1988627 |
| Appears in Collections: | IT - Master of Philosophy
|
Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.
|