• DocumentCode
    2467212
  • Title

    Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations

  • Author

    Ranganathan, Prasanna ; Ranganathan, Aravind ; Berman, Kenneth ; Minai, Ali

  • Author_Institution
    Cincinnati Univ., Cincinnati
  • fYear
    0
  • fDate
    0-0 0
  • Firstpage
    3064
  • Lastpage
    3070
  • Abstract
    Ad-hoc sensor networks comprising large numbers of randomly deployed wireless sensors have recently been an active focus of investigation. These networks require self-organized configuration after deployment, and ad-hoc heuristic methods for such configuration have been proposed with regard to many aspects of the networks´ performance. However, systematic approaches for such configuration remain elusive. In this paper, we present a preliminary attempt towards such a systematic approach using evolutionary algorithms and reverse engineering. In particular, we focus on the problem of obtaining heterogeneous networks that optimize global functional properties through local adaptive rules. Almost all work on ad-hoc sensor network has so far involved homogeneous networks where all nodes transmit with the same power level, creating a symmetric connectivity. It is possible to construct heterogeneous networks by allowing nodes to transmit at different power levels, and such networks are known to provide improvements in network lifetime, power efficiency, routing, etc. However, such networks are difficult to build mainly because the optimal power level for each node depends on the node location and spatial context, which are not known before deployment. A few heuristic schemes focused on improving power consumption have been proposed in the literature, but the issue has not been investigated sufficiently at a general level. In this paper, we present a new and improved heuristic developed using a reverse engineered approach. A genetic algorithm is used to generate a set of heterogeneous sensor networks that are characterized by low short paths and minimal congestion. Analysis of this optimal network set yields rules that form the basis for a local heuristic. We show that networks adapted using this heuristic produce significant improvement over the homogeneous case. More importantly, the results validate the utility of the proposed approach that can be used in other self-orga- nizing systems.
  • Keywords
    ad hoc networks; genetic algorithms; reverse engineering; wireless sensor networks; ad-hoc sensor network; evolutionary algorithm; genetic algorithm; heterogeneous sensor networks; local adaptive rule; optimal network; power consumption; reverse engineering; self-organized configuration; Ad hoc networks; Character generation; Energy consumption; Evolutionary computation; Genetic algorithms; Power system modeling; Reverse engineering; Routing; Sensor phenomena and characterization; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2006. CEC 2006. IEEE Congress on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    0-7803-9487-9
  • Type

    conf

  • DOI
    10.1109/CEC.2006.1688696
  • Filename
    1688696