News Column

Researchers from Nanyang Technological University Describe Findings in Algorithms (Distributed Algorithm for Tree-Structured Data Aggregation Service...

July 15, 2014



Researchers from Nanyang Technological University Describe Findings in Algorithms (Distributed Algorithm for Tree-Structured Data Aggregation Service Placement in Smart Grid)

By a News Reporter-Staff News Editor at Journal of Mathematics -- A new study on Algorithms is now available. According to news reporting from Singapore, Singapore, by VerticalNews journalists, research stated, "Smart grid, regarded as the next generation of power grid, uses two-way flows of electricity and information to create a widely distributed automated energy delivery network. One distinguishing aspect of smart grid communication networks is the large-scale deployment of smart meters and sensors."

The news correspondents obtained a quote from the research from Nanyang Technological University, "Thus, a large amount of data and information will be generated from metering, sensing, monitoring, etc. Data aggregation (integration or fusion) aims at the merging of data from disparate sources with differing conceptual, contextual, and typographical representations. In order to satisfy the requirement of different information services, the placement of data aggregation services in smart grid communication networks is a critical design issue. In this paper, we propose a minimum-cost-forwarding-based asynchronous distributed algorithm to find the optimal placement for the data aggregation service tree with optimal cost of in-network processing. It is shown that minimum-cost forwarding can dramatically reduce message overheads of the asynchronous algorithm. It is also shown that our algorithm has less message overheads than the synchronous algorithm (Sync) by both mathematical analysis and simulation-based evaluation."

According to the news reporters, the research concluded: "For a regular grid network and a complete binary service tree, the messages sent at each node are O(root NM) for our proposed algorithm and O(root NM log(2)M) for the Sync, where N is the number of network nodes and M is the number of data objects in the service tree."

For more information on this research see: Distributed Algorithm for Tree-Structured Data Aggregation Service Placement in Smart Grid. IEEE Systems Journal, 2014;8(2):553-561. IEEE Systems Journal can be contacted at: Ieee-Inst Electrical Electronics Engineers Inc, 445 Hoes Lane, Piscataway, NJ 08855-4141, USA. (Institute of Electrical and Electronics Engineers - www.ieee.org/; IEEE Systems Journal - ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4267003)

Our news journalists report that additional information may be obtained by contacting Z.Q. Lu, Nanyang Technological University, Sch Comp Engn, Singapore 639798, Singapore.

Keywords for this news article include: Asia, Algorithms, Information Technology, Information and Data Aggregation

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC


For more stories covering the world of technology, please see HispanicBusiness' Tech Channel



Source: Journal of Mathematics


Story Tools






HispanicBusiness.com Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters