• DocumentCode
    3321120
  • Title

    Event ordering in pervasive sensor networks

  • Author

    Kaveti, Lakshman ; Pulluri, Sandeep ; Singh, Gurdip

  • Author_Institution
    Kansas State Univ., Manhattan, KS
  • fYear
    2009
  • fDate
    9-13 March 2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In a pervasive sensor system, application entities may use the available infrastructure resources such as sensing devices, actuators, wireless modules and gateways to accomplish various tasks. For example, a group of humans/robots may use the infrastructure to track the current location of the group members. Many such tasks require a service which keeps track of the order of occurrence of events in the application. Existing algorithms for this problem have been designed for traditional distributed systems using the layering paradigm where the algorithm is able to observe and intercept application messages. Pervasive applications, however, may not be structured as strictly layered systems. In this paper, we study the problem of event ordering in pervasive systems, and propose algorithms for detecting event ordering. Our first algorithm treats the entire network as a single graph, whereas the second algorithm operates in a hierarchical manner by subdividing the network into smaller groups. We present experimental evaluation of our algorithms using both simulation and deployment on a sensor testbed.
  • Keywords
    ubiquitous computing; wireless sensor networks; distributed systems; event ordering; pervasive sensor networks; pervasive sensor system; Algorithm design and analysis; Clocks; Event detection; Humans; Monitoring; Protocols; Robot sensing systems; Sensor phenomena and characterization; Synchronization; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on
  • Conference_Location
    Galveston, TX
  • Print_ISBN
    978-1-4244-3304-9
  • Electronic_ISBN
    978-1-4244-3304-9
  • Type

    conf

  • DOI
    10.1109/PERCOM.2009.4912861
  • Filename
    4912861