{"title":"Exploiting semantics for event detection systems","authors":"Ronen Vaisenberg","doi":"10.1109/PERCOM.2009.4912817","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912817","url":null,"abstract":"This dissertation is building towards a flexible and scalable middleware for sentient spaces wherein sensors are used to observe the state of a physical environment in real time to create awareness which, in turn, is used to build applications that bring new functionalities and/or new efficiencies to the environment. Examples of such sentient spaces could be as varied as smart buildings that use video sensors for surveillance or for building pervasive applications such as person locator to dynamically instrumented crisis sites wherein sensors carried by first responders and/or brought to crisis sites are used to monitor the crisis site and the progress of response activities. The key goal of this work is towards developing a robust and scalable middleware technology that can handle challenges related to heterogeneity of sensors, limited resources (e.g., network bandwidth), and the need for rapid deployment (e.g., self-calibration of sensing), and programmability (e.g., hiding complexity of sensor and sensor programming from the application writers).","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128707806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"HexNet: Hexagon-based localization technique for wireless sensor networks","authors":"H. AbdelSalam, S. Olariu","doi":"10.1109/PERCOM.2009.4912871","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912871","url":null,"abstract":"Developing efficient localization techniques to allow sensors to estimate their positions has been a hot research topic for long time. Sensory readings are almost meaningless if they are not associated with the locations in which these readings were taken. Getting location information through recording positions manually or through an expensive GPS chip are not valid options for sensor networks. We propose and evaluate, a new localization protocol for sensor networks. Although our technique is presented using only a single anchor, it can be extended easily to benefit from the existence of several anchors. The proposed technique starts by hypothetically tiling the deployment area around the anchor node using identical hexagons. After that, the closest sensor node to the center of each of these hypothetical hexagons is determined, we refer to these nodes as backbone sensors. The positions of hexagon centers hence the positions of backbone sensors are estimated geometrically. After that, backbone sensors are treated as beacons and the positions of all non-backbone sensors are estimated using the centroid approach. Simulation results under noise-free and noisy conditions show that the proposed protocol achieves a localization accuracy that makes it useful for most WSN applications.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"468 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117119399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Felix von Reischach, F. Michahelles, D. Guinard, E. Fleisch
{"title":"A mobile product recommendation system interacting with tagged products","authors":"Felix von Reischach, F. Michahelles, D. Guinard, E. Fleisch","doi":"10.1109/PERCOM.2009.4912751","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912751","url":null,"abstract":"This paper presents a concept that enables consumers to access and share product recommendations using their mobile phone. Based on a review of current product recommendation mechanisms it devises a concept called APriori. APriori leverages the potential of auto-ID-enabled mobile phones (barcode/RFID) to receive and submit product ratings. Since mobile users cannot be expected to have the patience and time to compose text-based reviews on mobile phones, we introduce a new rating concept that allows users to generate new rating criteria. The concept is tailored to the limited attention and input options of mobile users in real-world environment. This work describes the architecture, implementation, and evaluation of APriori. For an evaluation we have taken the approach of interviewing 26 users in the frames of a formative user study, with the goal to further improve the system for an application in the real world. In addition, the paper discusses open issues regarding community-based product recommendations on mobile phones and proposes solutions.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122021405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quality- and energy-aware data compression by aggregation in WSN data streams","authors":"C. Cappiello, F. Schreiber","doi":"10.1109/PERCOM.2009.4912866","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912866","url":null,"abstract":"Sensor networks consist of autonomous devices that cooperatively monitor an environment. Sensors are equipped with capabilities to store information in memory, process information and communicate with neighbors and with a base station. However, due to the sensors' size, their associated resources are limited. In such a context, the main cause of energy dissipation is the use of the wireless link. Solutions that minimize communication are needed. In this paper a framework to manage efficiently data streams is presented. The proposed approach aims at saving energy by capturing signals and compress them instead of sending them in raw form. The algorithm also guarantees that the compressed representation satisfies quality requirements specified in terms of accuracy, precision, and timeliness.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Event Handlers for sensor-driven ubiquitous computing applications","authors":"Sean Reilly","doi":"10.1109/PERCOM.2009.4912823","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912823","url":null,"abstract":"We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: Multi-Event Handlers, Execution Policies and Event Streams. We believe that these additional abstractions simplify the task of writing applications in this domain. We present the abstractions and describe an example application from the sports domain implemented using our prototype middleware.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123767780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yiqiang Chen, Zhuo Sun, Juan Qi, Derek Hao Hu, Qiang Yang
{"title":"LoSeCo: Location-based search computing for pervasive device augmentation","authors":"Yiqiang Chen, Zhuo Sun, Juan Qi, Derek Hao Hu, Qiang Yang","doi":"10.1109/PERCOM.2009.4912830","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912830","url":null,"abstract":"Understanding human intention and performing different activities automatically is one of the key problems in pervasive computing. In this paper, a new location-based search computing framework (LoSeCo) is proposed to allow one's pervasive device to augment search devices. The objective of our problem is to recognize the real-time user goal through goal inference from traditional Wi-Fi localization techniques. We use accelerometer-based tracking to reduce the effort we need to collect Wi-Fi signals and save battery power consumption effectively. With the help of short-range search, the goal recognition module is enhanced, compared to previous “locationonly” approaches. Therefore, we could augment our mobile devices by automatically analyzing our needs and connecting to corresponding devices. Experimental results on real-world wireless network environments validate the effectiveness of our approach and that even a rough localization accuracy can meet the need of QoS (Quality of Service) in search computing behaviors.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126997073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Swarm robot synchronization using RFID tags","authors":"Giulio Zecca, P. Couderc, M. Banâtre, R. Beraldi","doi":"10.1109/PERCOM.2009.4912788","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912788","url":null,"abstract":"The last progress in the pervasive computing field has led to the distribution of knowledge and computational power in the environment, rather than condensing it in a single, powerful entity. This allows agents to behave like insects in a swarm, that can fulfil a task communicating directly or indirectly among them. Following this vision of Ambient Intelligence, our work proposes a straightforward solution to coordinate a swarm of robots that have low computational capabilities. All the information and instructions are found in RFID tags that are used as a pervasive memory distributed in the environment. These robots exploit ubiquitous computing to make a formation in space, synchronise with team mates in the same zone, and finally complete a cooperative task. Before implementing the solution in a real scenario, we show the validation of our algorithm in a simulation environment.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal k-support coverage paths in wireless sensor networks","authors":"Shaojie Tang, Xufei Mao, Xiangyang Li","doi":"10.1109/PERCOM.2009.4912843","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912843","url":null,"abstract":"Coverage is a fundamental problem in wireless sensor networks since sensors may be spread in arbitrary manner. In this paper, we addressed the k-support coverage problem. Most of the existing works assume that the coverage degree is 1, i.e. every point in a certain path falls within the sensing range of at least one sensor node. In this work, we focus on the case when we require that every point on the path is covered by at least k sensors, while optimizing certain objectives. We give an optimal polynomial-time algorithm and prove that the time complexity of our algorithm is O(k2n2). To the best of our knowledge, this is the first polynomial time algorithm finding an optimum k-coverage path in sensor networks with general sensing radius and general k.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient distributed synchronization method for TD/CDMA based Mobile Ad Hoc Networks","authors":"D. Vaman, A. Ashok","doi":"10.1109/PERCOM.2009.4912841","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912841","url":null,"abstract":"Mobile Ad Hoc Network (MANET) and Sensor Networks have no fixed infrastructures such as Base Stations and Towers, and have limited bandwidth across the network elements. They use multi-hop radio communications to deliver multi-service (voice, data, and video) information. Each network element can either send a packet or receive a packet but not both. Therefore, synchronization between radios must be achieved for every packet scheduling time with minimal amount of time to ensure QoS provisioning. This paper presents a novel distributed synchronization scheme for radio communication in a TD/CDMA based MANET and Sensor Networks. The scheme is designed using a first order Digital Phase locked loop (DPLL) which performs the ‘local locking’ at each receiver radio in a cluster of radios. The method exploits the clock drifts in each local clock of a radio with reference to which the local stored clocks are phase adjusted within the loop of the DPLL. A parameter called ‘phase adjustment index’ represented by ‘N’- an integer; is defined and is used as the scaling value of the local clock frequency. Analytical results have been shown to yield an effectively reduced size of overhead when compared to the overhead sizes dedicated for synchronization purpose in IEEE 802.11. The results have been verified by simulation in MATLAB.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134233212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic clustering for tracking multiple transceiver-free objects","authors":"Dian Zhang, L. Ni","doi":"10.1109/PERCOM.2009.4912777","DOIUrl":"https://doi.org/10.1109/PERCOM.2009.4912777","url":null,"abstract":"RF-based transceiver-free object tracking, originally proposed by the authors, allows real-time tracking of a moving object, where the object does not have to be equipped with an RF transceiver. Our previous algorithm, the best cover algorithm, suffers from a drawback, i.e., it does not work well when there are multiple objects in the tracking area. In this paper, we propose a localization model of distance, transmission power and the signal dynamics caused by the objects. The signal dynamics are derived from the measured Radio Signal Strength Indication (RSSI). Using this new model, we propose the “probabilistic cover algorithm” which is based on distributed dynamic clustering thus it can dramatically improve the localization accuracy when multiple objects are present. Moreover, the probabilistic cover algorithm can reduce the tracking latency in the system. We argue that the small overhead of the proposed algorithm makes it scalable for large deployment. Experimental results show that in addition to its ability to identify multiple objects, the tracking accuracy is improved at a rate of 10% to 20%.","PeriodicalId":322416,"journal":{"name":"2009 IEEE International Conference on Pervasive Computing and Communications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134262847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}