Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583389
Junseok Kim, M. Krunz
Multi-channel medium access control (MMAC) has the potential to significantly improve the network throughput by enabling parallel transmissions over different frequency channels. In many MMAC protocols, nodes exchange control packets over a dedicated control channel (CC). The CC transmission rate (CCR) is usually set to the lowest possible value, so as to maximize the reachability of control packets. However, in a multi-hop ad hoc network, this choice of the CCR may lead to a CC bottleneck, especially under high traffic load. While increasing the CCR can alleviate this bottleneck and improve the single-hop MMAC performance, it may also increase the number of hops along the path and hence degrade the end-to-end network performance. In this paper, we investigate the impact of the CCR on the performance of a multi-channel, multi-hop wireless network under a general MMAC protocol. To derive the queuing and channel access delays, we model the network as a G/G/1 queuing system. In our analysis, we consider detailed packet-level operations and non-saturated traffic. The average number of hops is also analytically obtained when nodes are randomly distributed. Our analysis is evaluated via network simulations, using 802.11a parameters. The simulation and numerical results reveal that the lowest transmission rate is not the optimal CCR. Our simulations show that the received power threshold has a significant impact on the optimal CCR.
{"title":"Impact of the control-channel transmission rate in a multi-channel wireless network","authors":"Junseok Kim, M. Krunz","doi":"10.1109/WoWMoM.2013.6583389","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583389","url":null,"abstract":"Multi-channel medium access control (MMAC) has the potential to significantly improve the network throughput by enabling parallel transmissions over different frequency channels. In many MMAC protocols, nodes exchange control packets over a dedicated control channel (CC). The CC transmission rate (CCR) is usually set to the lowest possible value, so as to maximize the reachability of control packets. However, in a multi-hop ad hoc network, this choice of the CCR may lead to a CC bottleneck, especially under high traffic load. While increasing the CCR can alleviate this bottleneck and improve the single-hop MMAC performance, it may also increase the number of hops along the path and hence degrade the end-to-end network performance. In this paper, we investigate the impact of the CCR on the performance of a multi-channel, multi-hop wireless network under a general MMAC protocol. To derive the queuing and channel access delays, we model the network as a G/G/1 queuing system. In our analysis, we consider detailed packet-level operations and non-saturated traffic. The average number of hops is also analytically obtained when nodes are randomly distributed. Our analysis is evaluated via network simulations, using 802.11a parameters. The simulation and numerical results reveal that the lowest transmission rate is not the optimal CCR. Our simulations show that the received power threshold has a significant impact on the optimal CCR.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116086606","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-06-04DOI: 10.1109/WoWMoM.2013.6583467
R. D. Pietro, Stefano Guarino
In Mobile Unattended Wireless Sensor Networks (MUWSNs), nodes sense the environment and store the acquired data until the arrival of a trusted data sink. MUWSNs, other than being a reference model for an increasing number of military and civilian applications, also capture a few important characteristics of emerging computing paradigms like Participatory Sensing (PS). In this paper, we start by identifying the main features and issues of MUWSNs, revising the related work in the area and highlighting their shortcomings. We then propose a new approach based on secret sharing and information diffusion to improve data integrity and confidentiality, and present experimental results confirming the effectiveness of this solution. The rationale is that information sharing among neighboring nodes, combined with nodes mobility, helps distributing the information into the network in a way that, at the same time, facilitates data recovering and is resilient to data loss or stealing. This is a first step towards the general objective of providing closed results about how secret sharing schemes and nodes mobility can help in assuring data security using local communications only, and understanding how to set system parameters to achieve the desired trade-off between confidentiality and availability.
{"title":"Confidentiality and availability issues in Mobile Unattended Wireless Sensor Networks","authors":"R. D. Pietro, Stefano Guarino","doi":"10.1109/WoWMoM.2013.6583467","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583467","url":null,"abstract":"In Mobile Unattended Wireless Sensor Networks (MUWSNs), nodes sense the environment and store the acquired data until the arrival of a trusted data sink. MUWSNs, other than being a reference model for an increasing number of military and civilian applications, also capture a few important characteristics of emerging computing paradigms like Participatory Sensing (PS). In this paper, we start by identifying the main features and issues of MUWSNs, revising the related work in the area and highlighting their shortcomings. We then propose a new approach based on secret sharing and information diffusion to improve data integrity and confidentiality, and present experimental results confirming the effectiveness of this solution. The rationale is that information sharing among neighboring nodes, combined with nodes mobility, helps distributing the information into the network in a way that, at the same time, facilitates data recovering and is resilient to data loss or stealing. This is a first step towards the general objective of providing closed results about how secret sharing schemes and nodes mobility can help in assuring data security using local communications only, and understanding how to set system parameters to achieve the desired trade-off between confidentiality and availability.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277066","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-06-04DOI: 10.1109/WoWMoM.2013.6583437
M. Mordacchini, L. Valerio, M. Conti, A. Passarella
Opportunistic networking is one of the key paradigms to support direct communication between devices in a mobile scenario. In this context, the high volatility and dynamicity of information and the fact that mobile nodes have to make decisions in condition of partial or incomplete knowledge, makes the development of effective and efficient data dissemination schemes very challenging. In this paper we present algorithms based on well-established models in cognitive sciences, in order to disseminate both data items, and semantic information associated with them. In our approach, semantic information represents both meta-data associated to data items (e.g., tags associated to them), and meta-data describing the interests of the users (e.g., topics for which they would like to receive data items). Our solution exploits dissemination of semantic data about the users' interests to guide the dissemination of the corresponding data items. Both dissemination processes are based on models coming from the cognitive sciences field, named cognitive heuristics, which describe how humans organise information in their memory and exchange it during interactions based on partial and incomplete information. We exploit a model describing how semantic data can be organised in each node in a semantic network, based on how humans organise information in their memory. Then, we define algorithms based on cognitive heuristics to disseminate both semantic data and data items between nodes upon encounters. Finally, we provide initial performance results about the diffusion of interests among users, and the corresponding diffusion of data items.
{"title":"A cognitive-based solution for semantic knowledge and content dissemination in opportunistic networks","authors":"M. Mordacchini, L. Valerio, M. Conti, A. Passarella","doi":"10.1109/WoWMoM.2013.6583437","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583437","url":null,"abstract":"Opportunistic networking is one of the key paradigms to support direct communication between devices in a mobile scenario. In this context, the high volatility and dynamicity of information and the fact that mobile nodes have to make decisions in condition of partial or incomplete knowledge, makes the development of effective and efficient data dissemination schemes very challenging. In this paper we present algorithms based on well-established models in cognitive sciences, in order to disseminate both data items, and semantic information associated with them. In our approach, semantic information represents both meta-data associated to data items (e.g., tags associated to them), and meta-data describing the interests of the users (e.g., topics for which they would like to receive data items). Our solution exploits dissemination of semantic data about the users' interests to guide the dissemination of the corresponding data items. Both dissemination processes are based on models coming from the cognitive sciences field, named cognitive heuristics, which describe how humans organise information in their memory and exchange it during interactions based on partial and incomplete information. We exploit a model describing how semantic data can be organised in each node in a semantic network, based on how humans organise information in their memory. Then, we define algorithms based on cognitive heuristics to disseminate both semantic data and data items between nodes upon encounters. Finally, we provide initial performance results about the diffusion of interests among users, and the corresponding diffusion of data items.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806863","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-06-04DOI: 10.1109/WoWMoM.2013.6583404
Maulik Desai, N. Maxemchuk, T. Klein
We propose an efficient encoding algorithm that considers multiple neighbors as next hop candidates for a packet, while searching for an optimal packet combination to transmit. Our algorithm, based on bipartite graphs, lets a node exhaustively search its queue to identify the maximum set of packets that can be combined in a single transmission. This algorithm can be easily integrated with a routing scheme in which a node considers multiple neighbors before choosing to forward a packet to one of them. We demonstrate this by integrating our algorithm with delta routing. Throughput benefit offered due to network coding is often hampered by congested nodes in a network. Delta routing improves throughput of a network by helping packets circumnavigate congestion. We demonstrate how our packet encoding algorithm can be coupled with such a routing mechanism in order to leverage the benefits offered by an efficient encoding scheme and enhanced routing both.
{"title":"A packet encoding algorithm for network coding with multiple next hop neighbor consideration and its integration with delta routing","authors":"Maulik Desai, N. Maxemchuk, T. Klein","doi":"10.1109/WoWMoM.2013.6583404","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583404","url":null,"abstract":"We propose an efficient encoding algorithm that considers multiple neighbors as next hop candidates for a packet, while searching for an optimal packet combination to transmit. Our algorithm, based on bipartite graphs, lets a node exhaustively search its queue to identify the maximum set of packets that can be combined in a single transmission. This algorithm can be easily integrated with a routing scheme in which a node considers multiple neighbors before choosing to forward a packet to one of them. We demonstrate this by integrating our algorithm with delta routing. Throughput benefit offered due to network coding is often hampered by congested nodes in a network. Delta routing improves throughput of a network by helping packets circumnavigate congestion. We demonstrate how our packet encoding algorithm can be coupled with such a routing mechanism in order to leverage the benefits offered by an efficient encoding scheme and enhanced routing both.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122765292","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-06-04DOI: 10.1109/WoWMoM.2013.6583373
Michele Rondinone, J. Gozálvez, Jérémie Leguay, V. Conan
Cooperative ITS systems are expected to highly improve the efficiency of road mobility. Wireless communications are used by these systems to disseminate centralized real-time traffic information to radio-equipped vehicles. Current proposals for traffic information dissemination either exploit dedicated cellular transmissions to interested vehicles, or cooperatively relay the information through vehicular ad-hoc networks. However, dedicated cellular transmissions may pose energy cost and traffic scalability issues to network operators. On the contrary, purely ad-hoc solutions may suffer from network disconnections and not always ensure adequate service reliability. To overcome these limitations, this paper introduces RoAHD, a hybrid approach in which a few messages injected through the cellular system are followed by a cooperative multi-hop dissemination in the vehicular network. RoAHD exploits multi-hop road connectivity information obtained at a low channel cost. Thanks to this knowledge, it is capable to operate smart injection decisions to ensure good levels of message delivery.
{"title":"Exploiting context information for V2X dissemination in vehicular networks","authors":"Michele Rondinone, J. Gozálvez, Jérémie Leguay, V. Conan","doi":"10.1109/WoWMoM.2013.6583373","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583373","url":null,"abstract":"Cooperative ITS systems are expected to highly improve the efficiency of road mobility. Wireless communications are used by these systems to disseminate centralized real-time traffic information to radio-equipped vehicles. Current proposals for traffic information dissemination either exploit dedicated cellular transmissions to interested vehicles, or cooperatively relay the information through vehicular ad-hoc networks. However, dedicated cellular transmissions may pose energy cost and traffic scalability issues to network operators. On the contrary, purely ad-hoc solutions may suffer from network disconnections and not always ensure adequate service reliability. To overcome these limitations, this paper introduces RoAHD, a hybrid approach in which a few messages injected through the cellular system are followed by a cooperative multi-hop dissemination in the vehicular network. RoAHD exploits multi-hop road connectivity information obtained at a low channel cost. Thanks to this knowledge, it is capable to operate smart injection decisions to ensure good levels of message delivery.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123026510","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-06-04DOI: 10.1109/WoWMoM.2013.6583414
L. Badia, R. Re, F. Guidolin, A. Orsino, M. Zorzi
Current spectrum allocation policies, imposing exclusive usage of a licensed operator, may lead to inefficient management and waste of resources. Spectrum sharing, i.e., usage by the same frequency band by multiple operators, can improve the efficiency of the allocation. We analyze a scenario where two mobile operators managing neighboring cells also share a fraction of their available spectrum and quantify the performance gain. To this end, we propose a framework based on the definition of the Interference Suppression Ratio, which models effects such as beamforming or directional antennas. Depending on its value, mutual interference among the operators is reduced and sharing gains can be achieved. We implemented this framework in the well known open-source simulator ns-3 and we ran a parametric analysis of the impacting factors, including noise and cell radius. Simulation results confirm that significant gains can be achieved in terms of network capacity and throughput, provided that the Interference Suppression Ratio is above a given value.
{"title":"A tunable framework for performance evaluation of spectrum sharing in LTE networks","authors":"L. Badia, R. Re, F. Guidolin, A. Orsino, M. Zorzi","doi":"10.1109/WoWMoM.2013.6583414","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583414","url":null,"abstract":"Current spectrum allocation policies, imposing exclusive usage of a licensed operator, may lead to inefficient management and waste of resources. Spectrum sharing, i.e., usage by the same frequency band by multiple operators, can improve the efficiency of the allocation. We analyze a scenario where two mobile operators managing neighboring cells also share a fraction of their available spectrum and quantify the performance gain. To this end, we propose a framework based on the definition of the Interference Suppression Ratio, which models effects such as beamforming or directional antennas. Depending on its value, mutual interference among the operators is reduced and sharing gains can be achieved. We implemented this framework in the well known open-source simulator ns-3 and we ran a parametric analysis of the impacting factors, including noise and cell radius. Simulation results confirm that significant gains can be achieved in terms of network capacity and throughput, provided that the Interference Suppression Ratio is above a given value.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131109104","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-06-04DOI: 10.1109/WoWMoM.2013.6583410
André Egners, Patrick Herrmann, Ulrike Meyer
Wireless Mesh Networks (WMN) consist of a wireless infrastructure of mesh routers which are connected to the Internet via mesh gateways. Mesh clients on the other hand connect to these routers. To make full use of the connectivity and services offered by a WMN, users should be able to securely hand over from one router to the next. In particular, keying material has to be supplied to the new router. Handover protocols designed for infrastructure WLAN cannot be directly applied here as they have clearly been designed with a trusted backbone in mind. In this paper we propose three complementary secure, efficient, and practical proactive handover protocols, which are able to cope with the unique characteristics of WMNs such as the wireless infrastructure and untrusted intermediaries.We have also implemented and evaluated our protocols using our WMN testbed and thus show the feasibility of our solution in time critical contexts.
{"title":"Secure and efficient handover protocols for WMNs","authors":"André Egners, Patrick Herrmann, Ulrike Meyer","doi":"10.1109/WoWMoM.2013.6583410","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583410","url":null,"abstract":"Wireless Mesh Networks (WMN) consist of a wireless infrastructure of mesh routers which are connected to the Internet via mesh gateways. Mesh clients on the other hand connect to these routers. To make full use of the connectivity and services offered by a WMN, users should be able to securely hand over from one router to the next. In particular, keying material has to be supplied to the new router. Handover protocols designed for infrastructure WLAN cannot be directly applied here as they have clearly been designed with a trusted backbone in mind. In this paper we propose three complementary secure, efficient, and practical proactive handover protocols, which are able to cope with the unique characteristics of WMNs such as the wireless infrastructure and untrusted intermediaries.We have also implemented and evaluated our protocols using our WMN testbed and thus show the feasibility of our solution in time critical contexts.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"25 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191492","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-06-04DOI: 10.1109/WoWMoM.2013.6583499
Elena Polycarpou, L. Lambrinos, Eftychios E. Protopapadakis
Finding a parking place in a busy city centre is often a frustrating task for many drivers; time and fuel are wasted in the quest for a vacant spot and traffic in the area increases due to the slow moving vehicles circling around. In this paper, we present the results of a survey on the needs of drivers from parking infrastructures from a smart services perspective. As smart parking systems are becoming a necessity in today's urban areas, we discuss the latest trends in parking availability monitoring, parking reservation and dynamic pricing schemes. We also examine how these schemes can be integrated forming technologically advanced parking infrastructures whose aim is to benefit both the drivers and the parking operators alike.
{"title":"Smart parking solutions for urban areas","authors":"Elena Polycarpou, L. Lambrinos, Eftychios E. Protopapadakis","doi":"10.1109/WoWMoM.2013.6583499","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583499","url":null,"abstract":"Finding a parking place in a busy city centre is often a frustrating task for many drivers; time and fuel are wasted in the quest for a vacant spot and traffic in the area increases due to the slow moving vehicles circling around. In this paper, we present the results of a survey on the needs of drivers from parking infrastructures from a smart services perspective. As smart parking systems are becoming a necessity in today's urban areas, we discuss the latest trends in parking availability monitoring, parking reservation and dynamic pricing schemes. We also examine how these schemes can be integrated forming technologically advanced parking infrastructures whose aim is to benefit both the drivers and the parking operators alike.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"28 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114043363","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-06-04DOI: 10.1109/WoWMoM.2013.6583486
Bachir Chihani, E. Bertin, N. Crespi
Several frameworks have already been proposed to simplify the development of context-aware applications. These frameworks are focused on collecting and publishing contextual data, and on providing common semantics, definitions and representations of these data. This implies that applications share the same semantics, which limits the range of use cases where a framework can be used since that assumption induces a strong coupling between context management and application logic. This article proposes a framework that decouples context management from application business logic. The aim is to reduce the overhead for applications that run on resource-limited devices while still providing efficient mechanisms to support context-awareness and behavior adaptation. This framework implements an innovative approach that involves third parties in the process of context processing definition by structuring it in atomic functions, and describing it with an XML-based programming language. Its implementation and evaluation demonstrates the benefits, in terms of flexibility, of using trusted design patterns from software engineering for developing context-aware application.
{"title":"Decoupling context management and application logic: A new framework","authors":"Bachir Chihani, E. Bertin, N. Crespi","doi":"10.1109/WoWMoM.2013.6583486","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583486","url":null,"abstract":"Several frameworks have already been proposed to simplify the development of context-aware applications. These frameworks are focused on collecting and publishing contextual data, and on providing common semantics, definitions and representations of these data. This implies that applications share the same semantics, which limits the range of use cases where a framework can be used since that assumption induces a strong coupling between context management and application logic. This article proposes a framework that decouples context management from application business logic. The aim is to reduce the overhead for applications that run on resource-limited devices while still providing efficient mechanisms to support context-awareness and behavior adaptation. This framework implements an innovative approach that involves third parties in the process of context processing definition by structuring it in atomic functions, and describing it with an XML-based programming language. Its implementation and evaluation demonstrates the benefits, in terms of flexibility, of using trusted design patterns from software engineering for developing context-aware application.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"769 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115108474","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-06-04DOI: 10.1109/WoWMoM.2013.6583401
R. D. Pietro, Roberto Mandati, Nino Vincenzo Verde
Although Location-based Services (LBSs) offer evident advantages to their users, many privacy concerns are sought when user tracking data are shared with the service provider. Existing privacy enhancing solutions (e.g. k-anonymity) usually degrade service precision, and also require the collaboration of the service provider-this latter one not always willing to lose control over the user's location data. In this paper, we propose a solution that is able to obfuscate the user's path to the service provider, while preserving (for the LBS) the capability to compute a few functions-useful for the user-over the obfuscated path. In particular, we provide several contributions: first, we formalize the concept of obfuscation function, and we propose a solution that provides user privacy while allowing users to continue leveraging the services offered by the service provider. Moreover, we formally prove the privacy preserving properties of our approach. Finally, an extensive experimental campaign supports the feasibility of our approach, showing that the proposed solution can be efficiently implemented over mobile device.
{"title":"Track me if you can: Transparent obfuscation for Location based Services","authors":"R. D. Pietro, Roberto Mandati, Nino Vincenzo Verde","doi":"10.1109/WoWMoM.2013.6583401","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583401","url":null,"abstract":"Although Location-based Services (LBSs) offer evident advantages to their users, many privacy concerns are sought when user tracking data are shared with the service provider. Existing privacy enhancing solutions (e.g. k-anonymity) usually degrade service precision, and also require the collaboration of the service provider-this latter one not always willing to lose control over the user's location data. In this paper, we propose a solution that is able to obfuscate the user's path to the service provider, while preserving (for the LBS) the capability to compute a few functions-useful for the user-over the obfuscated path. In particular, we provide several contributions: first, we formalize the concept of obfuscation function, and we propose a solution that provides user privacy while allowing users to continue leveraging the services offered by the service provider. Moreover, we formally prove the privacy preserving properties of our approach. Finally, an extensive experimental campaign supports the feasibility of our approach, showing that the proposed solution can be efficiently implemented over mobile device.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115246536","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
扫码关注我们
求助内容：
应助结果提醒方式：