On the RFID Wake-up Impulse for Multi-hop Sensor Networks
Files in This Item:
|P296-Ruzzelli,Jurdak,O'Hare-07.pdf||204.62 kB||Adobe PDF||Download|
|Title:||On the RFID Wake-up Impulse for Multi-hop Sensor Networks||Authors:||Ruzzelli, Antonio G.
O'Hare, G. M. P. (Greg M. P.)
|Permanent link:||http://hdl.handle.net/10197/4537||Date:||4-Nov-2007||Abstract:||Communication protocols for wireless sensor networks reduce the energy consumption by duty cycling the node activity and adopting a periodic sleeping scheduling. This approach often results in idle listening and therefore energy dissipated for listening to a channel free from packet transmitted. Duty cycling trades-off energy consumption due to idle listening and high end-to-end delay. Proposed solutions mitigate this issue for example through extra low-power radio components (wake-up radio) that listen to the radio and wake-up the node if some channel activity is sensed. These extra components also consume some energy to listen to the channel. In contrast, we propose an on-demand wake-up capability, namely RFIDimpulse, which is achieved through using an off-the-shelf batteryless RFID tag attached to each sensor node that is also provided with RFID reader capability. Because modern RFID techniques can trigger all the neighbouring tags at once or pinpoint a particular tag, RFIDimpluse provides both unicast and multicast capability. RFIDimpulse allows eventdriven communication and eliminates node idle listening.||Type of material:||Conference Publication||Keywords:||RFID; Sensor networks||Language:||en||Status of Item:||Peer reviewed||Conference Details:||The 1st ACM Workshop on Convergence of RFID and Wireless Sensor Networks and their Applications (SenseID) at the 5th ACM International Conference on Embedded Networked Sensor Systems (ACM SenSys 2007), Sydney, Australia, November 04-09, 2007|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.