Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/836
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorZhao, B-
dc.creatorWang, M-
dc.creatorShao, Z-
dc.creatorCao, J-
dc.creatorChan, KCC-
dc.creatorSu, J-
dc.date.accessioned2014-12-11T08:24:14Z-
dc.date.available2014-12-11T08:24:14Z-
dc.identifier.isbn0-7695-3349-0-
dc.identifier.issn1533-2306-
dc.identifier.urihttp://hdl.handle.net/10397/836-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.rights© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectApplicationsen_US
dc.subjectChemical sensorsen_US
dc.subjectComputer systemsen_US
dc.subjectData fusionen_US
dc.subjectElectric network topologyen_US
dc.subjectEmbedded systemsen_US
dc.subjectEnergy conservationen_US
dc.subjectFusion reactionsen_US
dc.subjectInformation fusionen_US
dc.subjectNetwork protocolsen_US
dc.subjectNuclear propulsionen_US
dc.subjectSchedulingen_US
dc.subjectSensor data fusionen_US
dc.subjectSensor networksen_US
dc.subjectSensorsen_US
dc.subjectTopologyen_US
dc.subjectWireless networksen_US
dc.titleTopology aware task allocation and scheduling for real-time data fusion applications in networked embedded sensor systemsen_US
dc.typeConference Paperen_US
dcterms.abstractIn networked embedded sensor systems, data fusion is a viable solution to significantly reduce energy consumption while achieving real-time guarantee. Emerging data fusion applications demand efficient task allocation and scheduling techniques. However, existing approaches can not be effectively applied concerning both network topology and wireless communications. In this paper, we formally model TATAS, the Topology-Aware Task Allocation and Scheduling problem for real-time data fusion applications, and show it is NP-complete. We also propose an efficient three-phase heuristic to solve the TATAS problem. We implement our technique and conduct experiments based on a simulation environment. Experimental results show that, as compared with traditional approaches, our technique can achieve significant energy saving and effectively meet the real-time requirements as well.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications : Kaohsiung, Taiwan, 25-27 August 2008 : proceedings, p. 293-302-
dcterms.issued2008-
dc.identifier.isiWOS:000260407600031-
dc.identifier.scopus2-s2.0-53549102771-
dc.identifier.rosgroupidr40211-
dc.description.ros2008-2009 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
topology-aware_08.pdf286.1 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

149
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

171
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Mar 29, 2024

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.