Skip navigation
Run Run Shaw Library City University of Hong KongRun Run Shaw Library

Please use this identifier to cite or link to this item: http://dspace.cityu.edu.hk/handle/2031/5951
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Qinen_US
dc.date.accessioned2011-01-19T04:11:58Z
dc.date.accessioned2017-09-19T09:11:38Z
dc.date.accessioned2019-02-12T07:28:59Z-
dc.date.available2011-01-19T04:11:58Z
dc.date.available2017-09-19T09:11:38Z
dc.date.available2019-02-12T07:28:59Z-
dc.date.issued2010en_US
dc.identifier.other2010eeyq635en_US
dc.identifier.urihttp://144.214.8.231/handle/2031/5951-
dc.description.abstractThe aim of the project is to simulate a multi-channel Pure ALOHA system constructed in C programming language. In addition, different traffic models including M/D/K, M/M/K and M/G/K are simulated in Pure ALOHA System. Comparisons among the three traffic models are made in terms of the performance in collision probability, throughput and channel utilization. Moreover, minimum number of channels required to limit collision probability under a low level are investigated in different traffic models. Finally, simulation results will be compared with mathematical analysis to find out whether they coincide with each other or not.en_US
dc.rightsThis work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.en_US
dc.rightsAccess is restricted to CityU users.en_US
dc.titleSimulation of Multi-Channel Pure Aloha Schemeen_US
dc.contributor.departmentDepartment of Electronic Engineeringen_US
dc.description.supervisorSupervisor: Dr. Ko, K T; Assessor: Dr. Chan, Sammy C Hen_US
Appears in Collections:Electrical Engineering - Undergraduate Final Year Projects 

Files in This Item:
File SizeFormat 
fulltext.html145 BHTMLView/Open
Show simple item record


Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.

Send feedback to Library Systems
Privacy Policy | Copyright | Disclaimer