Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Attribute-aware data aggregation using potential-based dynamic routing in wireless sensor networks
Ren F., Zhang J., Wu Y., He T., Chen C., Lin C. IEEE Transactions on Parallel and Distributed Systems24 (5):881-892,2013.Type:Article
Date Reviewed: Sep 12 2013

Data aggregation is an important requirement in some types of wireless sensor network (WSN) applications, where generated data packets are delivered to a base station only after in-network data aggregation. Data aggregation in WSNs mitigates data traffic congestion and reduces energy expenditure. The issue of spatial data stream isolation in static routing hinders the effectiveness of data aggregation. In this paper, the authors propose attribute-aware data aggregation (ADA) based on packet attribute identifiers, a combined data aggregation and dynamic routing protocol for heterogeneous WSNs. The performance evaluation in simulation experiments validates the spatial convergence of same-attribute packets, which improves data aggregation performance in the network. The protocol is also shown to be scalable for large-scale networks.

The proposed ADA protocol consists of a packet-driven timing control algorithm and a potential-based dynamic routing (PBDR) protocol. Ant colony-based potential routing is used where, like ants, packets with the same attributes attract each other and converge. The authors propose PBDR, which combines depth potential (from sink) and attribute-based pheromone potential, to design a hybrid potential field. They also propose a packet-driven adaptive timing control algorithm, which enables the same-attribute packets to meet in time for proper data aggregation. For the same-attribute packets, the nodes maintain a timer in queue. When an attribute’s timer fires, the corresponding attribute’s data aggregation is performed. The performance of the proposed ADA protocol is evaluated in a TOSSIM sensor network simulator. ADA performance is compared with shortest-path routing (SPT), shortest-path tree (CT), dominating set (DDS), and directed tree (WCDS). In the simulation setup with 999 sensors, ADA performed much better in terms of normalized queue length, denoting better data aggregation. ADA is also shown to be scalable for large-scale networks and applicable in mobile scenarios, such as tracking mobile agents.

Overall, the idea of in-network aggregation of data packets based on packet attributes (applications) in heterogeneous WSNs is relatively novel. The paper is well written, and is recommended for readers interested in data aggregation protocols, especially in heterogeneous WSNs.

Reviewer:  Debraj De Review #: CR141543 (1311-1010)
Bookmark and Share
 
Sensor Networks (C.2.1 ... )
 
 
Heuristic Methods (I.2.8 ... )
 
 
Routing Protocols (C.2.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Sensor Networks": Date
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
Nayebi A., Sarbazi-Azad H., Karlsson G. Journal of Systems and Software 83(8): 1310-1317, 2010. Type: Article
Nov 8 2010
Heartbeat of a nest: using imagers as biological sensors
Ko T., Ahmadian S., Hicks J., Rahimi M., Estrin D., Soatto S., Coe S., Hamilton M. ACM Transactions on Sensor Networks 6(3): 1-31, 2010. Type: Article
Jan 10 2011
Efficient clustering-based data aggregation techniques for wireless sensor networks
Jung W., Lim K., Ko Y., Park S. Wireless Networks 17(5): 1387-1400, 2011. Type: Article
May 8 2012
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy