1 / 18

Contention-based MAC Protocol for Wireless Sensor Networks

This paper explores a contention-based MAC protocol for wireless sensor networks, focusing on energy efficiency and scalability. The protocol utilizes techniques such as periodic listen and sleep cycles, collision and overhearing avoidance, and message passing. Experimental results demonstrate the effectiveness of the protocol.

rvilleda
Download Presentation

Contention-based MAC Protocol for Wireless Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang4/20/2009 CS541 Advanced Networking

  2. Outline • Reference • Design Goals • Sources of Energy Waste • S-MAC • Experiment Results CS541 Advanced Networking

  3. Reference • W. Ye, J. Heidemann and D. Estrin, Medium access control with • coordinated adaptive sleeping for wireless sensor networks, IEEE/ACM • Transactions on Networking, Vol. 12, No. 3, 2004, pp. 493-506. CS541 Advanced Networking

  4. Design Goals • Primary goals: Energy efficiency and scalability • Secondary goals: Throughput, fairness and delay CS541 Advanced Networking

  5. Sources of Energy Waste • Collision • Overhearing • Control packet overhead • Idle listening: 50%-100% of receiving power CS541 Advanced Networking

  6. Assumptions • Large network size. • Short-range, multihop communications. • Most communications will occur between nodes as peers, rather than to a single base station. • Applications have long idle periods and can tolerate latency in the order of network messaging time. CS541 Advanced Networking

  7. S-MAC • Periodic listen and sleep • Collision and overhearing avoidance • Message passing CS541 Advanced Networking

  8. Periodic Listen and Sleep • A complete cycle of listen and sleep is called a frame. The duty cycle is defined as the ratio of the listen interval to the frame length. The listen interval and duty cycle are fixed. • Nodes exchange their listen-sleep schedules by periodically broadcasting a SYNC packet to their immediate neighbors. CS541 Advanced Networking

  9. Schedule Maintenance • A node first listens for a while. If it does not hear a schedule from another node, it immediately chooses its own schedule and announces the schedule by broadcasting a SYNC packet. • If the node receives a schedule from a neighbor before choosing or announcing its own schedule, it follows that schedule and then will announce its schedule at its next scheduled listen time. • If a node receives a different schedule after it chooses and announces its own schedule. If the node has no other neighbors, it will discard its current schedule and follow the new one. If the node already follows a schedule with one or more neighbors, it adopts both. CS541 Advanced Networking

  10. Synchronization Maintenance • When a receiver gets the time from the SYNC packet it subtracts the packet transmission time and use the new value to adjust its timer. • The listen period is significantly longer than clock drift rates. For example, the listen time of 0.5s is more than 10 times longer than typical clock drift rates. • The synchronization period is 10s and the neighbor discovery (listen for the whole synchronization period) period is 2min. CS541 Advanced Networking

  11. Data Transmission CS541 Advanced Networking

  12. Adaptive Listening • The basic idea is to let the node which overhears its neighbor’s transmissions (ideally only RTS or CTS) wake up for a short period of time at the end of the transmission. • If the node is the next-hop node, its neighbor is able to immediately pass the data to it instead of waiting for its scheduled listen time. • If the node does not receive anything during the adaptive listening, it will go back to sleep until its next scheduled listen time. • Adaptive listen and transmission are not performed if the duration from the time the previous transmission is finished to the normally scheduled listen time is shorter than the adaptive listen interval. CS541 Advanced Networking

  13. Collision and Overhearing Avoidance • Collision avoidance: CSMA/CA with RTS/CTS • Overhearing avoidance: all immediate neighbors of both the sender and receiver should sleep after they hear the RTS or CTS until the current transmission is over. Thus, a node should sleep to avoid overhearing if its NAV is not zero. It can wake up when its NAV becomes zero. CS541 Advanced Networking

  14. Message Passing • Fragment the long message into many small fragments, and transmit them in a burst. • Only one RTS and one CTS are used. They reserve the medium for transmitting all the fragments. • Every time a data fragment is transmitted, the sender waits for an ACK from the receiver. If it fails to receive the ACK, it will extend the reserved transmission time for one more fragment, and re-transmit the current fragment immediately. • Each data fragment or ACK also has the duration field. In this way, if a node wakes up or a new node joins in the middle of a transmission, it can properly go to sleep again. CS541 Advanced Networking

  15. Experiment Setting CS541 Advanced Networking

  16. Simulation Results CS541 Advanced Networking

  17. Simulation Results CS541 Advanced Networking

  18. Simulation Results CS541 Advanced Networking

More Related