Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication10
  4. Energy efficient assignment of events in wireless sensor and mobile actor networks
 
  • Details
Options

Energy efficient assignment of events in wireless sensor and mobile actor networks

Date Issued
01-12-2006
Author(s)
Selvaradjou, Ka
Dhanaraj, M.
C Siva Ram Murthy 
Indian Institute of Technology, Madras
DOI
10.1109/ICON.2006.302649
Abstract
In this work, we address the problem of optimal assignment of mobile actors in Wireless Sensor and Actor Networks (WSANs) to the places of events in real-time with energy and resource constraints. Given the location information about the actors and the places of events, finding the optimal assignment of actors towards the events with the objective of minimizing the overall movement of actors can be shown to be NP-complete. We formulate the problem of assigning the events to the actors in real-time with resource constraints as Mixed Integer Non-Linear Program (MINLP). We also propose inter and intra zone based localized heuristics for finding the near optimal schedule of the actors to the appropriate events. From the simulations, we observed that the combination of the heuristics, "move to the Earliest Deadline First" (EDF) and "assign the tasks to the nearest actor" performs fairly better than others by minimizing the overall movement required by the actors and reducing the deadline miss ratio. The simulation of inter-zone deadline based heuristic gives results as close as 7% to the objective value obtained by the MINLP problem. © 2006 IEEE.
Volume
2
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback