English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21714049      Online Users : 395
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/420


    Title: COLLISION AVOIDANCE MULTIPLE ACCESS PROTOCOL FOR WIRELESS SENSOR NETWORKS
    COLLISION AVOIDANCE MULTIPLE ACCESS PROTOCOL FOR WIRELESS SENSOR NETWORKS
    Authors: Widyasmoro
    Contributors: 資訊工程學系碩士班
    Date: 2009
    Issue Date: 2009-10-09 08:38:43 (UTC+0)
    Publisher: 亞洲大學
    Abstract: Collision avoidance multiple access plays a significant role in Wireless Sensor Networks as there may have a huge number of nodes in a network. Therefore, it has big chance to conflict when they want to send a packet to the server at the same time. In our work, we focus on the sensor networks composed of simple function nodes and presented performance analysis of the proposed collision avoidance protocol, with emphasis on the contention process exercising in each contention subframe. We have two proposed contention scheme and we derive the probability distribution of successful minislot for each scheme and examine the efficiency of the system Our simulation results indicate that by applying second scheme, it will give a better communication efficiency rather than when we use first scheme.
    Keywords: collision avoidance protocol, wireless sensor networks, contention process, efficiency.
    Appears in Collections:[資訊工程學系] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML337View/Open


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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback