An analysis on the delay-aware data collection network structure using pareto optimality

Chi Tsun Cheng, Chi Kong Tse

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)

Abstract

Clustering techniques are effective techniques in reducing energy consumption in wireless sensor networks (WSNs). A data collection process (DCP) is an operation for a base station (BS) to collect a complete set of data from a WSN. Clustering techniques may, however, introduce bottlenecks to a DCP and cause extra delays. For time-sensitive applications, a delay-aware network structure is necessary. A delay-aware network structure should not only minimize the duration of a single DCP, but also shorten the duration of consecutive DCPs. Furthermore, for better sensing quality, a delay-aware network structure should try to accommodate as many wireless sensor nodes as possible. This paper investigates the trade-offs among the above objective functions in a delay-aware data collection network structure using the concepts of Pareto optimality. The analyses provide an insight into selecting the most suitable network parameters.
Original languageEnglish
Title of host publicationProceedings of the 2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012
Pages348-352
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2012
Event4th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012 - Sanya, China
Duration: 10 Oct 201212 Oct 2012

Conference

Conference4th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012
CountryChina
CitySanya
Period10/10/1212/10/12

Keywords

  • Data Collection Process
  • Delay
  • Pareto Optimality
  • Wireless Sensor Networks

ASJC Scopus subject areas

  • Software

Cite this