Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583480
B. Lichtblau, J. Redlich
Network-Wide Broadcasts (NWBs) are a fundamental operation for Wireless Mesh Networks (WMNs), which are required by routing and for distributing information to all nodes in the network. Many optimizations for NWBs exist which aim to counter the broadcast storm problem by reducing redundant transmission. However removing the redundancy can also hurt reliability in lossy networks like WMNs. We therefore look at the other side. What happens if we increase redundancy to improve the reliability by using retransmissions and acknowledgements, which are said to amplify the broadcast storm? In this paper, a model for calculating forwarder sets locally based on measured link qualities is developed together with an algorithm for reliable NWBs. We evaluate our approach empirically in different simulation and testbed scenarios and compare it with protocols from the literature. The results show that redundancy is needed for achieving a high reliability and should not be abandoned. Furthermore, the impact of different parameters on our approach is evaluated.
{"title":"Link quality based forwarder selection strategies for reliable Network-Wide Broadcasts","authors":"B. Lichtblau, J. Redlich","doi":"10.1109/WoWMoM.2013.6583480","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583480","url":null,"abstract":"Network-Wide Broadcasts (NWBs) are a fundamental operation for Wireless Mesh Networks (WMNs), which are required by routing and for distributing information to all nodes in the network. Many optimizations for NWBs exist which aim to counter the broadcast storm problem by reducing redundant transmission. However removing the redundancy can also hurt reliability in lossy networks like WMNs. We therefore look at the other side. What happens if we increase redundancy to improve the reliability by using retransmissions and acknowledgements, which are said to amplify the broadcast storm? In this paper, a model for calculating forwarder sets locally based on measured link qualities is developed together with an algorithm for reliable NWBs. We evaluate our approach empirically in different simulation and testbed scenarios and compare it with protocols from the literature. The results show that redundancy is needed for achieving a high reliability and should not be abandoned. Furthermore, the impact of different parameters on our approach is evaluated.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"21 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":"127515609","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.6583376
Ajay Thampi, S. Armour, Z. Fan, D. Kaleshi
In this paper, the problem of location classification in OFDMA-based FFR systems is considered for two FFR schemes, namely Strict FFR (FFR-A) and Soft Frequency Reuse (FFR-B). The FFR systems considered in the literature are mostly studied with static resource partitioning where a greater portion of the sub-carrier resources are reserved for users in the cell centre and a smaller portion for users near the edge. Once the resources are statically partitioned, they can then be allocated dynamically. In order to ensure proper resource allocation, the base station has to classify the location of the user as either cell-centre or cell-edge. A common practice is to use a one-dimensional threshold such as SINR, which is assumed to be a good indicator of distance. In this paper, the impact of misclassifying the user location on the overall system performance is studied. It is shown that in an urban environment with shadowing, the one-dimensional threshold approach gets the location classification right only 67% of the time and when compared to an ideal system based on accurate location, the overall cell throughput drops by 38% for FFR-A and 14% for FFR-B. Similarly, service rate drops of 24% and 28% are also observed for FFR-A and FFR-B respectively. A better technique based on a combination of two measurements, namely received power and SINR, is proposed where the higherdimensional threshold is determined through Logistic Regression. This new approach is shown to have a classification accuracy of more than 80%. As a result, the system performance is shown to be much better than the one-dimensional threshold approach and comparable to that based on accurate location.
{"title":"A logistic regression approach to location classification in OFDMA-based FFR systems","authors":"Ajay Thampi, S. Armour, Z. Fan, D. Kaleshi","doi":"10.1109/WoWMoM.2013.6583376","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583376","url":null,"abstract":"In this paper, the problem of location classification in OFDMA-based FFR systems is considered for two FFR schemes, namely Strict FFR (FFR-A) and Soft Frequency Reuse (FFR-B). The FFR systems considered in the literature are mostly studied with static resource partitioning where a greater portion of the sub-carrier resources are reserved for users in the cell centre and a smaller portion for users near the edge. Once the resources are statically partitioned, they can then be allocated dynamically. In order to ensure proper resource allocation, the base station has to classify the location of the user as either cell-centre or cell-edge. A common practice is to use a one-dimensional threshold such as SINR, which is assumed to be a good indicator of distance. In this paper, the impact of misclassifying the user location on the overall system performance is studied. It is shown that in an urban environment with shadowing, the one-dimensional threshold approach gets the location classification right only 67% of the time and when compared to an ideal system based on accurate location, the overall cell throughput drops by 38% for FFR-A and 14% for FFR-B. Similarly, service rate drops of 24% and 28% are also observed for FFR-A and FFR-B respectively. A better technique based on a combination of two measurements, namely received power and SINR, is proposed where the higherdimensional threshold is determined through Logistic Regression. This new approach is shown to have a classification accuracy of more than 80%. As a result, the system performance is shown to be much better than the one-dimensional threshold approach and comparable to that based on accurate location.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"17 1 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":"128570526","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.6583471
Joe H. Novak, S. Kasera, Neal Patwari
Configuration errors are the most significant cause of failure in networks. Little research has been devoted to preventing network configuration errors using device fingerprints. We demonstrate how they can be used to prevent information from being incorrectly routed in an IEEE 802.15.4 beacon-enabled wireless sensor network with multiple coordinators. To determine if they are appropriate for this application, we investigate the number of unique fingerprints that clock skew and radio frequency characteristics provide.
{"title":"Preventing wireless network configuration errors in patient monitoring using device fingerprints","authors":"Joe H. Novak, S. Kasera, Neal Patwari","doi":"10.1109/WoWMoM.2013.6583471","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583471","url":null,"abstract":"Configuration errors are the most significant cause of failure in networks. Little research has been devoted to preventing network configuration errors using device fingerprints. We demonstrate how they can be used to prevent information from being incorrectly routed in an IEEE 802.15.4 beacon-enabled wireless sensor network with multiple coordinators. To determine if they are appropriate for this application, we investigate the number of unique fingerprints that clock skew and radio frequency characteristics provide.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 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":"128607075","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.6583442
Radu-Ioan Ciobanu, C. Dobre, V. Cristea
Opportunistic networks are mobile networks that rely on the store-carry-and-forward paradigm, using contacts between nodes to opportunistically transfer data. For this reason, traditional routing mechanisms are no longer suitable. To increase the probability of successfull message delivery, we propose SPRINT, an opportunistic routing algorithm that introduces an additional routing criterion: online social information about nodes. Furthermore, previous results show that, for particular environments, contacts between devices in opportunistic networks are highly predictable. When users follow rare events-based mobility patterns, we show that human mobility can be approximated as a Poisson distribution. Based on this result, we add an additional prediction component into our routing algorithm. Our solution delivers better results compared to traditional social-based routing approaches, for different real-world and synthetic mobility scenarios.
{"title":"SPRINT: Social prediction-based opportunistic routing","authors":"Radu-Ioan Ciobanu, C. Dobre, V. Cristea","doi":"10.1109/WoWMoM.2013.6583442","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583442","url":null,"abstract":"Opportunistic networks are mobile networks that rely on the store-carry-and-forward paradigm, using contacts between nodes to opportunistically transfer data. For this reason, traditional routing mechanisms are no longer suitable. To increase the probability of successfull message delivery, we propose SPRINT, an opportunistic routing algorithm that introduces an additional routing criterion: online social information about nodes. Furthermore, previous results show that, for particular environments, contacts between devices in opportunistic networks are highly predictable. When users follow rare events-based mobility patterns, we show that human mobility can be approximated as a Poisson distribution. Based on this result, we add an additional prediction component into our routing algorithm. Our solution delivers better results compared to traditional social-based routing approaches, for different real-world and synthetic mobility scenarios.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"43 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":"126344415","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.6583440
L. Lambrinos, Constantinos Djouvas, C. Chrysostomou
The availability of off-the-shelf equipment that facilitates long range wireless connectivity can prove to be useful in maritime communications. By establishing terrestrial wireless links, vessels may exchange data between them or with shore-based stations avoiding the use of costly satellite connectivity. On the other hand, vessel mobility and large distances between its nodes make a wireless maritime network hard to manage; frequent disconnections are expected to be the norm in this primarily low node density environment. As such, maritime communications appear as an ideal environment for delay tolerant networking. To this extent, we use actual vessel mobility data to evaluate some existing delay tolerant networking routing algorithms and identify where they fall short from the perspective of our particular domain. It appears that a hybrid approach in the form of a new routing algorithm that addresses the particular characteristics of a maritime network can prove beneficial.
{"title":"Applying delay tolerant networking routing algorithms in maritime communications","authors":"L. Lambrinos, Constantinos Djouvas, C. Chrysostomou","doi":"10.1109/WoWMoM.2013.6583440","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583440","url":null,"abstract":"The availability of off-the-shelf equipment that facilitates long range wireless connectivity can prove to be useful in maritime communications. By establishing terrestrial wireless links, vessels may exchange data between them or with shore-based stations avoiding the use of costly satellite connectivity. On the other hand, vessel mobility and large distances between its nodes make a wireless maritime network hard to manage; frequent disconnections are expected to be the norm in this primarily low node density environment. As such, maritime communications appear as an ideal environment for delay tolerant networking. To this extent, we use actual vessel mobility data to evaluate some existing delay tolerant networking routing algorithms and identify where they fall short from the perspective of our particular domain. It appears that a hybrid approach in the form of a new routing algorithm that addresses the particular characteristics of a maritime network can prove beneficial.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"56 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":"128237976","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.6583416
Javier Barrachina, Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni
Vehicle density is one of the main metrics used for assessing the road traffic conditions. In this paper, we present a solution to estimate the density of vehicles that has been specially designed for Vehicular Networks. Our proposal allows Intelligent Transportation Systems to continuously estimate the vehicular density by accounting for the number of beacons received per Road Side Unit, as well as the roadmap topology. Simulation results indicate that our approach accurately estimates the vehicular density, and therefore automatic traffic controlling systems may use it to predict traffic jams and introduce countermeasures.
{"title":"Assessing vehicular density estimation using vehicle-to-infrastructure communications","authors":"Javier Barrachina, Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1109/WoWMoM.2013.6583416","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583416","url":null,"abstract":"Vehicle density is one of the main metrics used for assessing the road traffic conditions. In this paper, we present a solution to estimate the density of vehicles that has been specially designed for Vehicular Networks. Our proposal allows Intelligent Transportation Systems to continuously estimate the vehicular density by accounting for the number of beacons received per Road Side Unit, as well as the roadmap topology. Simulation results indicate that our approach accurately estimates the vehicular density, and therefore automatic traffic controlling systems may use it to predict traffic jams and introduce countermeasures.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 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":"130485363","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.6583479
Fawaz S. Bokhari, G. Záruba
In this paper, we address the problem of channel assignment considering partially overlapping channels (POCs) for interference avoidance in 802.11-based wireless mesh networks. A novel interference model is proposed which provides a systematic approach of measuring the interference caused by links operating on POCs by taking into account both the adjacent channel interference and the corresponding physical distance between mesh nodes. Based on this model, we design a centralized and a distributed interference-aware channel assignment algorithm called i-POCA which enables the use of smart ants for assigning orthogonal and non-orthogonal channels to radios in order to minimize total network interference. We evaluate our algorithms through extensive simulations and demonstrate that our proposed algorithms improve network throughput by efficient utilization of the available spectrum.
{"title":"i-POCA: Interference-aware partially overlapping channel assignment in 802.11-based meshes","authors":"Fawaz S. Bokhari, G. Záruba","doi":"10.1109/WoWMoM.2013.6583479","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583479","url":null,"abstract":"In this paper, we address the problem of channel assignment considering partially overlapping channels (POCs) for interference avoidance in 802.11-based wireless mesh networks. A novel interference model is proposed which provides a systematic approach of measuring the interference caused by links operating on POCs by taking into account both the adjacent channel interference and the corresponding physical distance between mesh nodes. Based on this model, we design a centralized and a distributed interference-aware channel assignment algorithm called i-POCA which enables the use of smart ants for assigning orthogonal and non-orthogonal channels to radios in order to minimize total network interference. We evaluate our algorithms through extensive simulations and demonstrate that our proposed algorithms improve network throughput by efficient utilization of the available spectrum.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"81 4 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":"116345613","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.6583425
Imran Khan
Wireless Sensor Networks (WSNs) are used in many application areas including health, agriculture and gaming. New advances in sensor technology make it pertinent to consider sharing a deployed WSN infrastructure by multiple applications, including applications which are designed after the WSN deployment. For my PhD research I propose a novel WSN virtualization framework that allows multiple users to run their application tasks over underlying WSN resources in a transparent way. This paper presents the overview of the proposed WSN virtualization framework, related work, current status and future work.
{"title":"Design and analysis of virtualization framework for Wireless Sensor Networks","authors":"Imran Khan","doi":"10.1109/WoWMoM.2013.6583425","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583425","url":null,"abstract":"Wireless Sensor Networks (WSNs) are used in many application areas including health, agriculture and gaming. New advances in sensor technology make it pertinent to consider sharing a deployed WSN infrastructure by multiple applications, including applications which are designed after the WSN deployment. For my PhD research I propose a novel WSN virtualization framework that allows multiple users to run their application tasks over underlying WSN resources in a transparent way. This paper presents the overview of the proposed WSN virtualization framework, related work, current status and future work.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"94 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":"114543744","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.6583362
M. Aymerich, Roger Baig, P. Garcia, Ivan Vilata i Balaguer, Axel Neumann, Davide Vega, E. López, Felix Freitag, L. Navarro
Community-Lab is a testbed for researchers to carry out experiments within wireless community networks. Community networks are an emergent model of infrastructures built with off-the-shelf communication equipment that aims to satisfy a community's demand for Internet access and ICT services. Community-Lab consists of a set of nodes that are integrated in existing community networks, thus giving researchers access to community networks and allowing them to conduct experimental evaluation of applications deployed there. ICT services and applications beyond Internet access are an important milestone - yet not completely reached - to add value to community networks. The challenging environment of community networks however needs a careful evaluation of application performance to make the user experience successful. This paper focuses on demonstrating the deployment of applications in Community-Lab. By means of selected applications, we show how Community-Lab can be used by researchers to perform experiments with applications in community networks.
{"title":"Deploying applications with Community-Lab in wireless community networks","authors":"M. Aymerich, Roger Baig, P. Garcia, Ivan Vilata i Balaguer, Axel Neumann, Davide Vega, E. López, Felix Freitag, L. Navarro","doi":"10.1109/WoWMoM.2013.6583362","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583362","url":null,"abstract":"Community-Lab is a testbed for researchers to carry out experiments within wireless community networks. Community networks are an emergent model of infrastructures built with off-the-shelf communication equipment that aims to satisfy a community's demand for Internet access and ICT services. Community-Lab consists of a set of nodes that are integrated in existing community networks, thus giving researchers access to community networks and allowing them to conduct experimental evaluation of applications deployed there. ICT services and applications beyond Internet access are an important milestone - yet not completely reached - to add value to community networks. The challenging environment of community networks however needs a careful evaluation of application performance to make the user experience successful. This paper focuses on demonstrating the deployment of applications in Community-Lab. By means of selected applications, we show how Community-Lab can be used by researchers to perform experiments with applications in community networks.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"62 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":"114636299","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.6583427
Karim Emara
Location privacy is one of the main challenges in vehicular ad hoc networks (VANET), which aim to protect vehicles from being tracked. Most of research work concern changing pseudonyms effectively to avoid linking messages through them. However, the sensitive information the vehicles send periodically in beacon messages make them vulnerable to tracking even if beacons are totally anonymous. In this thesis, we consider how to protect vehicles from being tracked while they are sharing sensitive information in beacons. The high beacon rate, high precision of shared information and strict latency constraints of application are the main challenges to our objective. We propose two solutions for this issue. The first one is to send the precise information only every period of time while sending inaccurate beacons in between. The second solution is to use secure group communication to prevent attacker from overhearing broadcast information. Both choices will be implemented and evaluated against a state-of-the-art tracker.
{"title":"Location privacy in vehicular networks","authors":"Karim Emara","doi":"10.1109/WoWMoM.2013.6583427","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583427","url":null,"abstract":"Location privacy is one of the main challenges in vehicular ad hoc networks (VANET), which aim to protect vehicles from being tracked. Most of research work concern changing pseudonyms effectively to avoid linking messages through them. However, the sensitive information the vehicles send periodically in beacon messages make them vulnerable to tracking even if beacons are totally anonymous. In this thesis, we consider how to protect vehicles from being tracked while they are sharing sensitive information in beacons. The high beacon rate, high precision of shared information and strict latency constraints of application are the main challenges to our objective. We propose two solutions for this issue. The first one is to send the precise information only every period of time while sending inaccurate beacons in between. The second solution is to use secure group communication to prevent attacker from overhearing broadcast information. Both choices will be implemented and evaluated against a state-of-the-art tracker.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"25 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":"123443548","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
扫码关注我们
求助内容：
应助结果提醒方式：