skip to main content
10.1145/1298197.1298209acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

Maximizing network-lifetime in large scale heterogeneous wireless sensor-actuator networks: a near-optimal solution

Published:22 October 2007Publication History

ABSTRACT

Delay and energy constraints have a significant impact on the design and operation of wireless sensor-actuator networks. We cosider a wireless sensor-actuator network, consisting of large number of sensors and few actuators, in which both energy and delay are hard constraints and must be jointly optimized. Abstract In this paper, we propose that each sensor node must transmit its data to only one of the actuators. To maximize the network lifetime and attain minimum end-to-end delays, it is essential to optimally match each sensor node to an actuator and find an optimal routing scheme. We model the actuator selection and optimal flow routing as joint optimization problem, which is NP-hard in general. Therefore, we use a relaxation technique and provide a distributed solution for optimal actuator selection subject to energy and delay constraints. Further, once the destination actuators are fixed, we provide an optimal flow routing solution with the aim of maximizing network lifetime. We then propose to use a delay-energy aware TDMA based MAC protocol in compliance with the routing algorithm. The optimal routing and TDMA MAC schemes together guarantees a near-optimal lifetime. The proposal is validated by means of analysis and ns-2 simulation results.

References

  1. J.-H. Chang and L. Tassiulas. Energy conserving routing in wireless ad hoc networks. Proceedings of IEEE Infocom, Tel Aviv, Israel, Mar. 26-30, 2000, pp. 22--31.Google ScholarGoogle Scholar
  2. M. Bhardwaj and A. P. Chandrakasan. Bounding the lifetime of sensor networks via optimal role assignments. Proceedings of IEEE Infocom, New York, Jun. 23-27, 2002, pp. 1587--1596.Google ScholarGoogle ScholarCross RefCross Ref
  3. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. An application specific protocol architecture for wireless microsensor networks. IEEE Trans. Wireless Comm., 1(4), 660--670, Oct. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. X. Brown, H. N. Gabow, and Q. Zhang. Maximum flow--life curve for a wireless ad hoc network. Proceedings of ACM MobiHoc, Long Beach, CA, Oct. 4-5, pp. 128--136, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Farukh Munir and F. Filali. 2006. A novel self organizing framework for SANETs. Proceedings of European Wireless, Athens, Greece, Apr. 2-6, 2006.Google ScholarGoogle Scholar
  6. T. Melodia, D. Pompili, V. C. Gungor, I. F. Akyildiz, "A Distributed Coordination Framework for Wireless Sensor and Actor Networks, Proceedings of MobiHoc, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. I. F. Akyildiz and I. H. Kasimoglu. Sensor and actor networks: research challenges. Elsevier ad hoc nets., 2(4): 351--367, Oct. 2004.Google ScholarGoogle Scholar
  8. The Network Simulator - ns (version 2.27). http://www.isi.edu/nsnam/ns/.)Google ScholarGoogle Scholar
  9. M. F. Munir and F. Filali. A low-energy adaptive and distributed MAC protocol for wireless sensor-actuator networks, Proceedings of IEEE PIMRC, Athens, Greece, Sep. 3-7, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  10. http://www.tinyos.net/Google ScholarGoogle Scholar

Index Terms

  1. Maximizing network-lifetime in large scale heterogeneous wireless sensor-actuator networks: a near-optimal solution

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        PE-WASUN '07: Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
        October 2007
        104 pages
        ISBN:9781595938084
        DOI:10.1145/1298197

        Copyright © 2007 ACM

        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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 October 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate70of240submissions,29%
      • Article Metrics

        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader