1 / 28

Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks

Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks. Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of Illinois at Chicago IEEE SECON 2004. Presented by Yung-Lin Yu. Outline. Introduction Motivation Channel and Traffic Assumption

sailor
Download Presentation

Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up 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. Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of Illinois at Chicago IEEE SECON 2004 Presented by Yung-Lin Yu

  2. Outline • Introduction • Motivation • Channel and Traffic Assumption • TDMA-W: Details • Self-Organization • TDMA-W Channel Access Protocol • Simulation Results • Conclusion

  3. Introduction (1/2) • Sensor networks are different from other wireless communication networks • In WSN, Traffic rate is very low • Typical communication frequency is at minutes or hours level • Sensor networks are battery powered and recharging is usually unavailable • Energy is an extremely expensive resource

  4. Introduction (2/2) • Sensor nodes are generally stationary after their deployment • Sensor nodes coordinate with each other to implement a certain function • Traffic is not randomly generated as those in mobile ad hoc networks • Due to these differences, existing wireless MAC protocol are not suitable for WSN

  5. Motivation (1/2) • Design a MAC protocol for WSN has two aspects • Contention-based • Schedule-based • This paper proposed a schedule-based MAC protocol as TDMA-W • Due to traffic rate is relatively low, we can have fix timings for door knocking for each node • It is a suitable MAC protocol for WSN for its collision-free and maintenance simplicity

  6. Motivation (2/2) • TDMA-W • Each node is assigned two slots • Transmission/Send slot (s-slot) • Wakeup slot (w-slot)

  7. Channel and Traffic Assumption • A TDMA-W frame lasts for Tframeseconds • Tframeis known to all nodes and is preset before deployment • A TDMA-W frame is divided into slots • Each node is assigned one slot for transmission and one slot for wakeup • Networks are synchronized

  8. Self-Organization (1/9) • Assign time slots to the sensors within each TDMA-W frame • Assume sensor networks has data rate of 1 Mbps • Transmission of a 512 byte packet occupies the channel for about 3.9 ms • Assume a TDMA-W frame of 1 second divided into 256 slots • Each slot is of 3.9 ms • Capable of communicating 512 bytes

  9. Self-Organization (2/9) • Each node randomly selects a slot with uniform probability among all slots to be its s-slot • During its selected s-slot, each node broadcasts • It’s Node ID • It’s S-slot number • One-hop neighbors’ IDs • One-hop neighbors’ S-slot assignments • Slot number of any s-slot during which this node has identified a collision

  10. Self-Organization (3/9) • When a node is not transmitting, it turns on its receiver circuit and listens to the traffic from neighbors • The node should record all the information being broadcast by all its neighbors • Their s-slot assignments and their node IDs • The slot number of any slot being broadcast as a collision-prone slot

  11. Self-Organization (4/9) • If a node determines that • it is involved in a collision • or finds out that one of its two-hop neighbors has the same s-slot • It then randomly selects an unused slot and go to step 2

  12. Self-Organization (5/9) • If • no new nodes are joining in • or s-slot assignments are not changing • or no collisions are detected for a certain period • It implies all neighbor nodes are found and all the s-slots are final

  13. Self-Organization (6/9) • Each node identifies an unused slot or any s-slot being used by the nodes beyond its two-hop neighbors and declares it as its w-slot • Note that w-slots need not be unique • Each node broadcasts its w-slot and the self-organization is complete

  14. Self-Organization (7/9) • Some problems Collision Collision Slot=5 Slot=5 Select another Select another

  15. Self-Organization (8/9) • Some problems • To solve this problem • Let one node go to the listening mode in its assigned s-slot with a probability Slot=5 Slot=5

  16. slot=2 slot=2 slot=2 slot=2 Self-Organization (9/9) • To listen during s-slot with a probability • To set a collision counter • Collision in the same slot repeats, nodes can realize a deadlock has occurred slot=1 slot=1 Report collide slot=1 slot=1

  17. TDMA-W Channel Access Protocol (1/4) • Each node maintains a pair of counters for every neighbors • Outgoing counters • Incoming counters • These counters are preset to an initial value • If no outgoing data is sent to a node in a TDMA-W frame • The node decrements the corresponding outgoing counter by one • Otherwise it resets the counter to the initial value

  18. TDMA-W Channel Access Protocol (2/4) • If no incoming data is received from a neighboring node in a TDMA-W frame • The node decrements the corresponding incoming counter by one • If the counter is less than or equal to zero, the node stop listening to that slot starting from next TDMA-W frame

  19. TDMA-W Channel Access Protocol (3/4) • If a outgoing data transmission request arrives • The node first checks the outgoing counter • If the counter is greater than zero, then the link is considered active and the packet can be sent out during the s-slot • If the counter is less than or equal to zero, a wakeup packet is sent out during the w-slot of the destination node prior to the data transmission

  20. TDMA-W Channel Access Protocol (4/4) • If a node receives a wakeup packet in its w-slot • It turns itself on during the s-slot corresponding to the source node ID contained in the wakeup packet

  21. Simulation Results (1/6) • Nodes are deployed randomly in a 500x500 sq. ft. area • Communication range is 100 feet for all nodes • Assume an IEEE 802.11 basic rate of 1 Mbps as the physical layer transmission rate • Slot length is set to be 4 ms • Long enough for transmitting a 512-byte packet • Tframe is set to 1 second • A TDMA-W frame has 250 slots

  22. Simulation Results (2/6) • Self-organization protocol

  23. Simulation Results (3/6) • Power consumption • Transmission : Receiving/Listening : Sleeping = 1.83: 1 : 0.001 • The network is synchronized • All the nodes become active at the same time • All data packets are fixed to be 256 bytes in length • Control packets (RTS, CTS, ACK in S-MAC and Wakeup packet in TDMA-W) are about 20 bytes in length • Initial value for counters is set to 3

  24. Simulation Results (4/6) • One-Hop Random Traffic 10.1% 4.7% 0.7% 0.16%

  25. Simulation Results (5/6) • Delay of Random One-Hop Traffic

  26. Simulation Results (6/6) • Delay of All to One Reduction Operation Traffic

  27. Conclusion • The proposed protocol only consumes 1.5% to 15% power of 10% S-MAC • It is about 6~67 times longer than 10% S-MAC • The proposed scheme also show the event with a delay comparable to S-MAC for one-hop traffic • The proposed protocol is collision free for data traffic so reliable transmission is guaranteed for all types of traffic

More Related