Please use this identifier to cite or link to this item:
|Title:||Priority handling aggregation technique (PHAT) for wireless sensor networks||Authors:||Koubias, Stavros A.
Dima, Sofia Maria
Kritikakou, Angeliki S.
Panagiotou, Christos F.
Gialelis, John V.
|Keywords:||Aggregation techniques;Data aggregation;Hybrid techniques;Incoming packets;Low priorities;Power capability;Traffic loads;Wireless sensor network (WSNs);Energy utilization;Factory automation;Wireless sensor networks||Category:||Electrical Engineering - Electronic Engineering - Information Engineering||Field:||Engineering and Technology||Issue Date:||2012||Source:||17th Conference on Emerging Technologies & Factory Automation (ETFA), Krakow, Poland, 17-21 September, 2012||Conference:||Conference on Emerging Technologies & Factory Automation (ETFA)||Abstract:||Wireless Sensor Networks (WSNs) have limited power capabilities, whereas they serve applications which usually require specific packets, i.e. High Priority Packets (HPP), to be delivered before a deadline. Hence, it is essential to reduce the energy consumption and to have real-time behavior. To achieve this goal we propose a hybrid technique which explores the benefits of data aggregation without data size reduction in combination with prioritized queues. The energy consumption is reduced by appending data from incoming packets with already buffered Low Priority Packets (LPP). The real-time behavior is achieved by directly forwarding the HPP to the next node. Our study explores the impact of the proposed hybrid technique in several all-to-one data flow scenarios with various traffic loads, wait time intervals and percentage of HPP. Our results show gain up to 23,3% in packet loss and 36,6% in energy consumption compared with the direct forwarding of packets. 2012 IEEE.||URI:||http://ktisis.cut.ac.cy/handle/10488/3744||DOI:||10.1109/ETFA.2012.6489574||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
checked on Apr 30, 2018
Page view(s) 5056
checked on Jun 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.