The 32 nd KIPS Fall Conference 2009 An

  • Slides: 15
Download presentation
The 32 nd KIPS Fall Conference 2009 An Efficient Duty Cycle Based Communication Scheme

The 32 nd KIPS Fall Conference 2009 An Efficient Duty Cycle Based Communication Scheme for Wireless Sensor Network Md. Obaidur Rahman 1, Muhammad Mostafa Monowar 1, Cho Jin Woong 2, Lee Jang Yeon 2 and Choong Seon Hong 1 1 Kyung Hee University and 2 Korea Electronics Technology Institute, South Korea.

Introduction Energy is the most critical issue for wireless sensor network (WSN), due to

Introduction Energy is the most critical issue for wireless sensor network (WSN), due to the limited battery life time. Especially, for a monitoring application the operation of a sensor network is quite challenging Most of the time very low traffic Possibility of high traffic burst on the detection of any event To fulfill the demand of such WSN, network life time should be increased in low traffic, while increase throughput in heavy traffic as well. Considering this motivation, a receiver-initiated communication protocol is proposed in this paper. 2 12/14/2021

Problem Statement Problems in synchronous S-MAC and asynchronous ASMAC: Sleep schedule caused packet delay

Problem Statement Problems in synchronous S-MAC and asynchronous ASMAC: Sleep schedule caused packet delay Single packet reception at each wake-up Receiver Sender 1 Tx Data Rx Tx Data Rx Sender 2 Tx Data Rx Sender 3 3 Data Tx Rx 12/14/2021

Goals Our proposed work has the following goals: Energy efficient communication bypassing the most

Goals Our proposed work has the following goals: Energy efficient communication bypassing the most common sources of energy wastes, i. e. , idle listening, overhearing etc. Optimize delay in both low and high traffic load. Better throughput assurance under heavy load. 4 12/14/2021

Preliminaries Operational Cycle This is the time period for the wake-up interval of the

Preliminaries Operational Cycle This is the time period for the wake-up interval of the nodes in the network: Duty Cycle It is the ratio between node's active time to its entire cycle time. Active time includes all the actions and activities of a node (i. e. , channel access, transmission and reception of data, etc. ). Two phase 5 Fair Access Period (FAP) Prioritized Access Period (PAP) 12/14/2021

Proposed Communication Protocol Fair Access Period (FAP) Receiver End: Sender End: 6 Receiver-initiated channel

Proposed Communication Protocol Fair Access Period (FAP) Receiver End: Sender End: 6 Receiver-initiated channel access by sending a beacon packet At this phase, a receiver wakes-up and receives only a single packet from each of the upstream senders and acknowledge those packets After receiving the final packet at FAP, it announces the channel access schedule in the prioritized access phase Receives the beacon and after contention resolution, send the data Senders those looses the contention, waits for the ACK for previous data and contend again after receiving the ACK Piggyback the information of additional data packet in the packet header and request for prioritized channel access 12/14/2021

Proposed Communication Protocol Prioritized Access Period Receiver End Sender End 7 Receiver assigns priority

Proposed Communication Protocol Prioritized Access Period Receiver End Sender End 7 Receiver assigns priority according to the current traffic at the senders and announces the prioritized channel access schedule Receive back-to-back packet from the same sender and send a block ACK Follows the schedule assigned by the receiver Send back-to-back packet 12/14/2021

Proposed Communication Protocol Fair Access Period (FAP) and Prioritized Access Period 8 12/14/2021

Proposed Communication Protocol Fair Access Period (FAP) and Prioritized Access Period 8 12/14/2021

Experimental Validation Simulation in Ns-2 is performed. Uniform random distribution of 100 nodes in

Experimental Validation Simulation in Ns-2 is performed. Uniform random distribution of 100 nodes in 100 x 100 m 2 area. Wake-up interval is considered as 1 second. Traffic load is varied between 0. 1 to 4. 0 pkts/s. Simulation time is 100 seconds. Compared only the energy, delay and throughput performance are measured from the simulation results. 9 12/14/2021

Experimental Validation Energy Usage 10 12/14/2021

Experimental Validation Energy Usage 10 12/14/2021

Experimental Validation Delay 11 12/14/2021

Experimental Validation Delay 11 12/14/2021

Experimental Validation Throughput 12 12/14/2021

Experimental Validation Throughput 12 12/14/2021

Conclusion This paper proposes a different idea in terms of multiple packet reception in

Conclusion This paper proposes a different idea in terms of multiple packet reception in each wake-up Hence, reduce the packet delay In event detection, increases the throughput It is also energy efficient when the network traffic is low. Future work 13 Extend the work for an asynchronous scheduled MAC with multiple wake-up provisions in each operational cycle 12/14/2021

References W. Ye, J. Heidemann, and D. Estrin, “Medium access control with coordinated adaptive

References W. Ye, J. Heidemann, and D. Estrin, “Medium access control with coordinated adaptive sleeping for wireless sensor networks, " IEEE/ACM Trans. Netw. , vol. 12, no. 3, pp. 493 -506, 2004. J. Polastre, J. Hill, and D. Culler, “Versatile low power media access for wireless sensor networks, " in Sen. Sys '04: Proceedings of the 2 nd international conference on Embedded networked sensor systems. New York, NY, USA: ACM, 2004, pp. 95 -107. M. Buettner, G. V. Yee, E. Anderson, and R. Han, “X-mac: a short preamble mac protocol for duty-cycled wireless sensor networks, " in Sen. Sys '06: Proceedings of the 4 th international conference on Embedded networked sensor systems. New York, NY, USA: ACM, 2006, pp. 307{320. Y. Sun, O. Gurewitz, and D. B. Johnson, “Ri-mac: a receiver-initiated asynchronous duty cycle mac protocol for dynamic traffic loads in wireless sensor networks, " in Sen. Sys '08: Proceedings of the 6 th ACM conference on Embedded network sensor systems. New York, NY, USA: ACM, 2008, pp. 114. 14 12/14/2021

Thank You Question ? 15 12/14/2021

Thank You Question ? 15 12/14/2021