In this paper, we propose a lane-level dynamic traffic control (LDTC) system targeting at driving efficiency optimization. The LDTC system integrates vehicular networks with intersection cameras to collect fine-grained information of vehicles, such as turning intentions and lane positions. LDTC can maximize the intersection throughput and provide fairness among traffic flows. With vehicular networks, the traffic controller of an intersection can collect all turning information before vehicles make their turns. With intersection cameras, the lane positions of vehicles can be detected even if GPS is not accurate enough to provide lane localization. In addition, the traffic condition can be continually monitored as some vehicles are not equipped with onboard units for vehicular communications. In LDTC, while allocating the green light to the traffic flows with higher passing rates for throughput maximization, it also allocates the green light to the ones with lower passing rates for fairness provision. This paper demonstrates our current prototype.
{"title":"A lane-level dynamic traffic control system for driving efficiency optimization based on vehicular networks","authors":"Lien-Wu Chen, Chia-Chen Chang, Pranay Sharma, Jen-Hsiang Cheng, Chien-Cheng Wu, Y. Tseng","doi":"10.1109/PerComW.2013.6529498","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529498","url":null,"abstract":"In this paper, we propose a lane-level dynamic traffic control (LDTC) system targeting at driving efficiency optimization. The LDTC system integrates vehicular networks with intersection cameras to collect fine-grained information of vehicles, such as turning intentions and lane positions. LDTC can maximize the intersection throughput and provide fairness among traffic flows. With vehicular networks, the traffic controller of an intersection can collect all turning information before vehicles make their turns. With intersection cameras, the lane positions of vehicles can be detected even if GPS is not accurate enough to provide lane localization. In addition, the traffic condition can be continually monitored as some vehicles are not equipped with onboard units for vehicular communications. In LDTC, while allocating the green light to the traffic flows with higher passing rates for throughput maximization, it also allocates the green light to the ones with lower passing rates for fairness provision. This paper demonstrates our current prototype.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127156503","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529510
Joost van Velzen, Marco Zúñiga
A large fraction of indoor localization methods rely on anchor nodes that periodically transmit their coordinates using radio signals. Mobile nodes then use the received information to decode their own locations. For all these methods to work, the underlying assumption is that anchors should send their beacons at different times, i.e. the beacons should not collide. We propose a radically new approach for indoor localization: to overlap the transmissions of beacons (synchronized collisions). Our collision-based method leverages the capture effect, which states that when several radio signals collide, only the strongest (nearest) signal is detected. Compared to the state of the art, our simple change of perspective -from non-colliding to colliding beacons- provides two important advantages. First, the lifetime of the mobile nodes can be increased by three orders of magnitude (from days to years). Second, our method is more resilient to external interfering sources, such as WiFi stations. In this work-in-progress, we (i) provide a preliminary evaluation of our prototype, and (ii) describe the challenges that we are currently working on to produce a fully-fleshed commercial system. While indoor localization is a very active research area, to the best of our knowledge, we are the first ones to evaluate a collision-based approach.
{"title":"Let's collide to localize: Achieving indoor localization with packet collisions","authors":"Joost van Velzen, Marco Zúñiga","doi":"10.1109/PerComW.2013.6529510","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529510","url":null,"abstract":"A large fraction of indoor localization methods rely on anchor nodes that periodically transmit their coordinates using radio signals. Mobile nodes then use the received information to decode their own locations. For all these methods to work, the underlying assumption is that anchors should send their beacons at different times, i.e. the beacons should not collide. We propose a radically new approach for indoor localization: to overlap the transmissions of beacons (synchronized collisions). Our collision-based method leverages the capture effect, which states that when several radio signals collide, only the strongest (nearest) signal is detected. Compared to the state of the art, our simple change of perspective -from non-colliding to colliding beacons- provides two important advantages. First, the lifetime of the mobile nodes can be increased by three orders of magnitude (from days to years). Second, our method is more resilient to external interfering sources, such as WiFi stations. In this work-in-progress, we (i) provide a preliminary evaluation of our prototype, and (ii) describe the challenges that we are currently working on to produce a fully-fleshed commercial system. While indoor localization is a very active research area, to the best of our knowledge, we are the first ones to evaluate a collision-based approach.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"54 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116473700","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529580
Mingsen Xu
In an energy-harvesting sensor network for perpetual lifetime, the operation of sensor nodes are synchronized with the energy fluctuations, causing the network connectivity to be disruptive and unstable. The unpredictable network disruptions and challenging communication environments make the traditional communication protocols inefficient and require a new paradigm-shift in design. In this thesis, we address several issues in collaborative data collection and storage in disruptive sensor networks. Our solutions are based on erasure codes and probabilistic network coding operations. The proposed set of algorithms improve data throughput and persistency because they are inherently amenable to probabilistic nature of transmission in wireless networks. Our contributions consist of five parts. First, we propose a collaborative data delivery protocol to exploit multiple energy-synchronized paths based on a new max-flow min-variance algorithm. In consort with this data delivery protocol, a localized TDMA MAC protocol is designed to synchronize nodes' duty-cycles and mitigate media access contentions. Second, we present Opportunistic Network Erasure Coding protocol, to collaboratively collect data in dynamic disruptive networks. ONEC derives the probability distribution of coding degree in each node and enable opportunistic in-network recoding, and guarantee the recovery of original sensor data can be achieved with high probability upon receiving any sufficient amount of encoded packets. Third, we present OnCode, an opportunistic in-network data coding and delivery protocol that provides good quality of services of data delivery under the constraints of energy synchronization. It is resilient to packet loss and network disruptions, and does not require any end-to-end feedback message. Fourth, we present a network Erasure Coding with randomized Power Control (ECPC) mechanism for data persistence in disruptive sensor networks, which only requires each node to perform a single broadcast at each of its several randomly selected power levels. Thus it incurs low communication overhead. Finally, we study an integrated algorithm and protocol middleware to preserve data persistency with heterogeneous disruption probabilities across the network.
{"title":"Collaborative opportunistic network coding for persistent data stream in disruptive sensor networks","authors":"Mingsen Xu","doi":"10.1109/PerComW.2013.6529580","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529580","url":null,"abstract":"In an energy-harvesting sensor network for perpetual lifetime, the operation of sensor nodes are synchronized with the energy fluctuations, causing the network connectivity to be disruptive and unstable. The unpredictable network disruptions and challenging communication environments make the traditional communication protocols inefficient and require a new paradigm-shift in design. In this thesis, we address several issues in collaborative data collection and storage in disruptive sensor networks. Our solutions are based on erasure codes and probabilistic network coding operations. The proposed set of algorithms improve data throughput and persistency because they are inherently amenable to probabilistic nature of transmission in wireless networks. Our contributions consist of five parts. First, we propose a collaborative data delivery protocol to exploit multiple energy-synchronized paths based on a new max-flow min-variance algorithm. In consort with this data delivery protocol, a localized TDMA MAC protocol is designed to synchronize nodes' duty-cycles and mitigate media access contentions. Second, we present Opportunistic Network Erasure Coding protocol, to collaboratively collect data in dynamic disruptive networks. ONEC derives the probability distribution of coding degree in each node and enable opportunistic in-network recoding, and guarantee the recovery of original sensor data can be achieved with high probability upon receiving any sufficient amount of encoded packets. Third, we present OnCode, an opportunistic in-network data coding and delivery protocol that provides good quality of services of data delivery under the constraints of energy synchronization. It is resilient to packet loss and network disruptions, and does not require any end-to-end feedback message. Fourth, we present a network Erasure Coding with randomized Power Control (ECPC) mechanism for data persistence in disruptive sensor networks, which only requires each node to perform a single broadcast at each of its several randomly selected power levels. Thus it incurs low communication overhead. Finally, we study an integrated algorithm and protocol middleware to preserve data persistency with heterogeneous disruption probabilities across the network.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130282470","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529464
Ralph Löwe, P. Mandl, M. Weber
Most of the advances in the field of context-aware middleware center on the research of the components necessary to create one. Although this is vital and gives important insights, it does not immediately enable us to build context-aware applications more easily. Too few projects reach the state of a usable software product. In this paper we describe an approach to separate the building of context-aware applications from the middleware. The centerpiece is an interface to independently define a context-aware application and its state. Additionally we provide a coarse protocol definition for the communication between the instances of a context-aware middleware by the example of a client/server system for mobile devices.
{"title":"Supporting generic context-aware applications for mobile devices","authors":"Ralph Löwe, P. Mandl, M. Weber","doi":"10.1109/PerComW.2013.6529464","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529464","url":null,"abstract":"Most of the advances in the field of context-aware middleware center on the research of the components necessary to create one. Although this is vital and gives important insights, it does not immediately enable us to build context-aware applications more easily. Too few projects reach the state of a usable software product. In this paper we describe an approach to separate the building of context-aware applications from the middleware. The centerpiece is an interface to independently define a context-aware application and its state. Additionally we provide a coarse protocol definition for the communication between the instances of a context-aware middleware by the example of a client/server system for mobile devices.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063630","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529537
Shuta Kako, T. Fujii, O. Takyu
In this paper, we have proposed secondary user (SU) resource assignment algorithm for a multi-hop cognitive radio network to improve end-to-end latency. In the multihop networks for spectrum sharing, a traffic-cross, in which multiple flows are crossed each other, degrades the throughput due to appearing high traffic and shortage resource area. However each SU has to protect the flow of primary users (PU). To overcome this problem, we have set the PU acceptable received power which is decided by the acknowledgment (ACK) power from PU receiver to each SU user. From this information, we analyzed the performance of the proposed algorithm to minimize the end-to-end delay of SU multi-hop flow considering PU acceptable interference power by optimizing SU transmit power, where Lagrangian duality based technique has been utilized to solve the optimization problem and effective allocate the power for each SU users.
{"title":"Resource control for cognitive multi-hop network in traffic cross environment","authors":"Shuta Kako, T. Fujii, O. Takyu","doi":"10.1109/PerComW.2013.6529537","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529537","url":null,"abstract":"In this paper, we have proposed secondary user (SU) resource assignment algorithm for a multi-hop cognitive radio network to improve end-to-end latency. In the multihop networks for spectrum sharing, a traffic-cross, in which multiple flows are crossed each other, degrades the throughput due to appearing high traffic and shortage resource area. However each SU has to protect the flow of primary users (PU). To overcome this problem, we have set the PU acceptable received power which is decided by the acknowledgment (ACK) power from PU receiver to each SU user. From this information, we analyzed the performance of the proposed algorithm to minimize the end-to-end delay of SU multi-hop flow considering PU acceptable interference power by optimizing SU transmit power, where Lagrangian duality based technique has been utilized to solve the optimization problem and effective allocate the power for each SU users.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099301","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529477
L. Butgereit, R. Botha
Micro-Volunteering is the phenomenon of volunteering one's time and energy for extremely short periods of time. It is often considered a subset of Virtual Volunteering where one can volunteer one's time and energy via the Internet. There are many successful examples of Virtual Volunteering such as the Gutenberg project and the Librivox project. However, in both these cases, a volunteer must donate a substantial amount of his or her time in activities such as reading books or proofreading books. This paper examines the concept of synchronous micro-volunteering where potential volunteers can effectively donate as little as 10 minutes of their time and immediately assist other people. The paper then describes the architecture which supports synchronous micro-volunteering.
{"title":"An architecture for synchronous micro-volunteering in Africa using social media","authors":"L. Butgereit, R. Botha","doi":"10.1109/PerComW.2013.6529477","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529477","url":null,"abstract":"Micro-Volunteering is the phenomenon of volunteering one's time and energy for extremely short periods of time. It is often considered a subset of Virtual Volunteering where one can volunteer one's time and energy via the Internet. There are many successful examples of Virtual Volunteering such as the Gutenberg project and the Librivox project. However, in both these cases, a volunteer must donate a substantial amount of his or her time in activities such as reading books or proofreading books. This paper examines the concept of synchronous micro-volunteering where potential volunteers can effectively donate as little as 10 minutes of their time and immediately assist other people. The paper then describes the architecture which supports synchronous micro-volunteering.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128497336","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529565
R. Klauck, M. Kirsche
With the integration of smart objects into the Internet with the help of tiny IP stacks, a direct connection between these objects and ordinary computational devices can be realized at the IP layer. As IP alone cannot ensure an automatic integration at the higher layers, an homogeneous access via services (e.g., discovery, self-configuration) for the Internet of Things vision should be provided for all connected device types. Multicast DNS and DNS Service Discovery are established and widely used standards in current IP-based networks to enable the discovery of devices and services at the application layer with DNS messages. To comply with the current Internet infrastructure, the lightweight implementation uBonjour makes mDNS and DNS-SD available on smart objects. As DNS does not meet the requirements of low data rate smart object networks, we propose to extend DNS with enhanced message compression mechanisms to effectively reduce the number of exchanged IP packets in 6LoWPANs while ensuring backward compatibility.
{"title":"Enhanced DNS message compression - Optimizing mDNS/DNS-SD for the use in 6LoWPANs","authors":"R. Klauck, M. Kirsche","doi":"10.1109/PerComW.2013.6529565","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529565","url":null,"abstract":"With the integration of smart objects into the Internet with the help of tiny IP stacks, a direct connection between these objects and ordinary computational devices can be realized at the IP layer. As IP alone cannot ensure an automatic integration at the higher layers, an homogeneous access via services (e.g., discovery, self-configuration) for the Internet of Things vision should be provided for all connected device types. Multicast DNS and DNS Service Discovery are established and widely used standards in current IP-based networks to enable the discovery of devices and services at the application layer with DNS messages. To comply with the current Internet infrastructure, the lightweight implementation uBonjour makes mDNS and DNS-SD available on smart objects. As DNS does not meet the requirements of low data rate smart object networks, we propose to extend DNS with enhanced message compression mechanisms to effectively reduce the number of exchanged IP packets in 6LoWPANs while ensuring backward compatibility.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130016499","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}
Pub Date : 2013-03-18DOI: 10.1109/PERCOMW.2013.6529571
Udayanto Dwi Atmojo, Z. Salcic, K. Wang
Wireless sensor and actuator networks (WSAN) have become pervasive and are found in many embedded and intelligent systems. However, the complexity of applications based on WSANs is limited due to the lack of programming tools for this type of networks. In this paper, we show how a concurrent programming language, SystemJ, is used to develop a middleware-free distributed system that consists of a combination of stationary and mobile WSAN nodes. A distributed Ambient Intelligence (AmI) monitoring and control scenario that consists of collaborating stationary and mobile WSAN nodes with high degree of reactivity is presented. The system is designed and implemented using SystemJ to demonstrate the proposed system-level design approach. SystemJ is designed specifically to handle reactive and concurrent behaviors while providing modular and scalable methodology for distributed system composition. In addition, SystemJ removes the need for a middleware and allows system designers to focus on implementing system functionality rather than to deal with the low level programming details.
{"title":"System-level approach to the design of collaborative distributed systems based on wireless sensor and actuator networks","authors":"Udayanto Dwi Atmojo, Z. Salcic, K. Wang","doi":"10.1109/PERCOMW.2013.6529571","DOIUrl":"https://doi.org/10.1109/PERCOMW.2013.6529571","url":null,"abstract":"Wireless sensor and actuator networks (WSAN) have become pervasive and are found in many embedded and intelligent systems. However, the complexity of applications based on WSANs is limited due to the lack of programming tools for this type of networks. In this paper, we show how a concurrent programming language, SystemJ, is used to develop a middleware-free distributed system that consists of a combination of stationary and mobile WSAN nodes. A distributed Ambient Intelligence (AmI) monitoring and control scenario that consists of collaborating stationary and mobile WSAN nodes with high degree of reactivity is presented. The system is designed and implemented using SystemJ to demonstrate the proposed system-level design approach. SystemJ is designed specifically to handle reactive and concurrent behaviors while providing modular and scalable methodology for distributed system composition. In addition, SystemJ removes the need for a middleware and allows system designers to focus on implementing system functionality rather than to deal with the low level programming details.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128961534","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}
Pub Date : 2013-03-18DOI: 10.1109/PERCOMW.2013.6529479
Shoichi Higuchi, T. Kuboyama, T. Hashimoto, K. Hirata
In this paper, we design a new method to explore the social context as a community mapping from a buzz marketing site. In this method, after extracting significant topical terms from messages in buzz marketing sites, first we construct a snapshot co-occurrence network at each time stamp. Next, we organize topic hierarchical structures from each co-occurrence network by using the modularity. Then, we explore a community mapping as an LCA-preserving mapping between topic hierarchical structures and a topic mapping as a correspondence in a community mapping. Hence, we can extract a topic transition as topic mappings for the same topic. Finally, we give experimental results related to the East Japan Great Earthquake in the buzz marketing site.
{"title":"Exploring social context from buzz marketing site - Community mapping based on tree edit distance -","authors":"Shoichi Higuchi, T. Kuboyama, T. Hashimoto, K. Hirata","doi":"10.1109/PERCOMW.2013.6529479","DOIUrl":"https://doi.org/10.1109/PERCOMW.2013.6529479","url":null,"abstract":"In this paper, we design a new method to explore the social context as a community mapping from a buzz marketing site. In this method, after extracting significant topical terms from messages in buzz marketing sites, first we construct a snapshot co-occurrence network at each time stamp. Next, we organize topic hierarchical structures from each co-occurrence network by using the modularity. Then, we explore a community mapping as an LCA-preserving mapping between topic hierarchical structures and a topic mapping as a correspondence in a community mapping. Hence, we can extract a topic transition as topic mappings for the same topic. Finally, we give experimental results related to the East Japan Great Earthquake in the buzz marketing site.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123003817","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}
Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529474
Muhammed Fatih Bulut, M. Demirbas
The proximity alert service on Android is important as an enabler of ubiquitous location-based services, however, it is also limited in this role due to its excessive energy expenditure. In this paper, we present the design and implementation of an energy-efficient proximity alert service for Android. Our method utilizes the distance to the point of interest and the user's transportation mode in order to dynamically determine the location-sensing interval and the location providers (GPS, GSM, or Wi-Fi) to be used. We implement our method as a middleware service in the Android open source project. Our service, for a realistic scenario, reduces GPS usage by 96.66% and increases battery life time by 75.71% compared to the baseline proximity alert in Android.
{"title":"Energy efficient proximity alert on Android","authors":"Muhammed Fatih Bulut, M. Demirbas","doi":"10.1109/PerComW.2013.6529474","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529474","url":null,"abstract":"The proximity alert service on Android is important as an enabler of ubiquitous location-based services, however, it is also limited in this role due to its excessive energy expenditure. In this paper, we present the design and implementation of an energy-efficient proximity alert service for Android. Our method utilizes the distance to the point of interest and the user's transportation mode in order to dynamically determine the location-sensing interval and the location providers (GPS, GSM, or Wi-Fi) to be used. We implement our method as a middleware service in the Android open source project. Our service, for a realistic scenario, reduces GPS usage by 96.66% and increases battery life time by 75.71% compared to the baseline proximity alert in Android.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132812638","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：