Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1068009.1068376acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Compact genetic algorithm for active interval scheduling in hierarchical sensor networks

Published: 25 June 2005 Publication History

Abstract

This paper introduces a novel scheduling problem called the active interval scheduling problem in hierarchical wireless sensor networks for long-term periodical monitoring applications. To improve the report sensitivity of the hierarchical wireless sensor networks, an efficient scheduling algorithm is desired. In this paper, we propose a compact genetic algorithm (CGA) to optimize the solution quality for sensor network maintenance. The experimental result shows that the proposed CGA brings better solutions in acceptable calculation time.

Reference

[1]
Ming-Hui Jin, Yu-Cheng Huang, D. Frank Hsu, Cheng-Yan Kao, You-Rui Wu, and Chih-Kung Lee, "On Active Interval Scheduling in Static Sensor Networks", Proceeding of IASTED International Conference on Communication System and Applications, July 2004. pp. 126 -- 131.

Cited By

View all
  • (2013)A genetic algorithm for spanning tree optimization in sensor networks38th Annual IEEE Conference on Local Computer Networks10.1109/LCN.2013.6761260(324-327)Online publication date: Oct-2013

Index Terms

  1. Compact genetic algorithm for active interval scheduling in hierarchical sensor networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation
    June 2005
    2272 pages
    ISBN:1595930108
    DOI:10.1145/1068009
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 25 June 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. active interval scheduling problem
    2. sensor network

    Qualifiers

    • Article

    Conference

    GECCO05
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 25 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2013)A genetic algorithm for spanning tree optimization in sensor networks38th Annual IEEE Conference on Local Computer Networks10.1109/LCN.2013.6761260(324-327)Online publication date: Oct-2013

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media