Penglin Dai, Kai Liu, Liang Feng, Qingfeng Zhuge, V. Lee, S. Son
Real-time and temporal information services are intrinsic characteristics in vehicular networks, where the timeliness of data dissemination and the maintenance of data quality interplay with each other and influence overall system performance. In this work, we present the system architecture where multiple road side units (RSUs) are cooperated to provide information services, and the vehicles can upload up-to-date information to RSUs via vehicle-to-infrastructure (V2I) communication. On this basis, we formulate the distributed temporal data management (DTDM) problem as a two-objective problem, which aims to enhance overall system performance on both the service quality and the service ratio simultaneously. Further, we propose a multiobjective evolutionary algorithm called MO-DTDM to obtain a set of pareto solutions and analyze how to fulfill given requirements on system performance with obtained pareto solutions. Finally, we build the simulation model and give a comprehensive performance evaluation, which demonstrates the superiority of the proposed optimization method.
{"title":"Towards Real-Time and Temporal Information Services in Vehicular Networks via Multi-Objective Optimization","authors":"Penglin Dai, Kai Liu, Liang Feng, Qingfeng Zhuge, V. Lee, S. Son","doi":"10.1109/LCN.2016.117","DOIUrl":"https://doi.org/10.1109/LCN.2016.117","url":null,"abstract":"Real-time and temporal information services are intrinsic characteristics in vehicular networks, where the timeliness of data dissemination and the maintenance of data quality interplay with each other and influence overall system performance. In this work, we present the system architecture where multiple road side units (RSUs) are cooperated to provide information services, and the vehicles can upload up-to-date information to RSUs via vehicle-to-infrastructure (V2I) communication. On this basis, we formulate the distributed temporal data management (DTDM) problem as a two-objective problem, which aims to enhance overall system performance on both the service quality and the service ratio simultaneously. Further, we propose a multiobjective evolutionary algorithm called MO-DTDM to obtain a set of pareto solutions and analyze how to fulfill given requirements on system performance with obtained pareto solutions. Finally, we build the simulation model and give a comprehensive performance evaluation, which demonstrates the superiority of the proposed optimization method.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"21 1","pages":"671-679"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73048390","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}
Participatory sensing is a revolutionary new paradigm where citizens voluntarily sense their surroundings using readily available sensing devices such as mobile phones and share this information for mutual benefit of community members. To encourage ample participation of users, ensuring their privacy is inevitable. Existing techniques that attempt to protect location privacy with spatial cloaking suffer from irrecoverable data quality degradation. To the best of our knowledge, very few works provided a solution preserving high data quality/utility at the destination server, however, suffered from unacceptable computational overhead. This paper presents an improved deterministic alternative and also a faster variant by exploiting several optimization issues. Theoretical formulations and extensive simulation results are presented to establish the applicability of our proposed techniques.
{"title":"Anonymization Techniques for Preserving Data Quality in Participatory Sensing","authors":"Tishna Sabrina, M. Murshed, Anindya Iqbal","doi":"10.1109/LCN.2016.103","DOIUrl":"https://doi.org/10.1109/LCN.2016.103","url":null,"abstract":"Participatory sensing is a revolutionary new paradigm where citizens voluntarily sense their surroundings using readily available sensing devices such as mobile phones and share this information for mutual benefit of community members. To encourage ample participation of users, ensuring their privacy is inevitable. Existing techniques that attempt to protect location privacy with spatial cloaking suffer from irrecoverable data quality degradation. To the best of our knowledge, very few works provided a solution preserving high data quality/utility at the destination server, however, suffered from unacceptable computational overhead. This paper presents an improved deterministic alternative and also a faster variant by exploiting several optimization issues. Theoretical formulations and extensive simulation results are presented to establish the applicability of our proposed techniques.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"8 1","pages":"607-610"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81530624","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}
This paper proposes a tree-based RFID tag anti-collision protocol, called the silence coding query tree (SCQT) protocol, based on a novel coding scheme, namely the silence coding, to speed up tag identification. The proposed protocol can identify multiple tags at a time even at the appearance of tag signal collisions. Simulation results show that the SCQT protocol significantly outperforms other related tree-based protocols in terms of the number of cycles to identify tags.
{"title":"Silence Coding for RFID Tag Anti-Collision","authors":"Ming-Kuei Yeh, Yung-Liang Lai, Jehn-Ruey Jiang","doi":"10.1109/LCN.2016.111","DOIUrl":"https://doi.org/10.1109/LCN.2016.111","url":null,"abstract":"This paper proposes a tree-based RFID tag anti-collision protocol, called the silence coding query tree (SCQT) protocol, based on a novel coding scheme, namely the silence coding, to speed up tag identification. The proposed protocol can identify multiple tags at a time even at the appearance of tag signal collisions. Simulation results show that the SCQT protocol significantly outperforms other related tree-based protocols in terms of the number of cycles to identify tags.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"1097 1","pages":"240-243"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76732051","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}
Providing efficient security services in dynamic low-power environments as the Internet of Things (IoT) is a challenging task. The deployment of static security services will consume the energy even if it is not required in some situations, so this induces a waste of resources. In this paper, we introduce an efficient model for adaptive security in the IoT based on trust management. Most of existing adaptive security approaches lack of practical means to evaluate threats. On the other hand, trust management systems are designed to deal with selfish behaviors or internal attacks and not to assist cryptographic measures. Our solution evaluates the trust level related to the presence of security threats among nodes, and adapt consequently cryptographic measures. The obtained simulation results show that our solution reduces considerably energy consumption and remains yet secure.
{"title":"TAS-IoT: Trust-Based Adaptive Security in the IoT","authors":"Hamed Hellaoui, A. Bouabdallah, M. Koudil","doi":"10.1109/LCN.2016.101","DOIUrl":"https://doi.org/10.1109/LCN.2016.101","url":null,"abstract":"Providing efficient security services in dynamic low-power environments as the Internet of Things (IoT) is a challenging task. The deployment of static security services will consume the energy even if it is not required in some situations, so this induces a waste of resources. In this paper, we introduce an efficient model for adaptive security in the IoT based on trust management. Most of existing adaptive security approaches lack of practical means to evaluate threats. On the other hand, trust management systems are designed to deal with selfish behaviors or internal attacks and not to assist cryptographic measures. Our solution evaluates the trust level related to the presence of security threats among nodes, and adapt consequently cryptographic measures. The obtained simulation results show that our solution reduces considerably energy consumption and remains yet secure.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"51 12 1","pages":"599-602"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76889250","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}
Explicit Congestion Notification (ECN) lets a bottleneck's Active Queue Management (AQM) mechanism inform an endpoint about congestion without having to drop a packet. A recently proposed sender-side modification called Alternative Backoff with ECN (ABE) enables reduced latency while maintaining good utilization with ECN. However, under certain circumstances ABE can produce a degree of unfair behavior between ABE-enabled TCP senders and conventional TCP senders. We propose specific guidance for configuring bottleneck AQMs to assist in fairness between ABE-enabled and conventional TCP flows. We evaluate our proposal using RED, then describe how it can be applied to other AQM mechanisms and incrementally introduced into the Internet.
{"title":"Improving the Fairness of Alternative Backoff with ECN (ABE)","authors":"Naeem Khademi, M. Welzl, G. Armitage, S. Gjessing","doi":"10.1109/LCN.2016.19","DOIUrl":"https://doi.org/10.1109/LCN.2016.19","url":null,"abstract":"Explicit Congestion Notification (ECN) lets a bottleneck's Active Queue Management (AQM) mechanism inform an endpoint about congestion without having to drop a packet. A recently proposed sender-side modification called Alternative Backoff with ECN (ABE) enables reduced latency while maintaining good utilization with ECN. However, under certain circumstances ABE can produce a degree of unfair behavior between ABE-enabled TCP senders and conventional TCP senders. We propose specific guidance for configuring bottleneck AQMs to assist in fairness between ABE-enabled and conventional TCP flows. We evaluate our proposal using RED, then describe how it can be applied to other AQM mechanisms and incrementally introduced into the Internet.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"4 1","pages":"78-86"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78579413","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}
Wireless systems have migrated into the automotive domain very fast in the recent years. Car passengers expect to have seamless integration of their consumer electronic devices in their cars. IEEE 802.11 systems are popular for entertainment services inside the car, however due to the fact that IEEE 802.11 use the unlicensed industrial, scientific and medical (ISM) radio bands, the wireless coexistence problem will lead to dramatic decrease of throughput. This can affect the performance of different applications in cars. This paper presents both test drives and measurements in the lab. The target is to have an impression on the influence of the surrounding systems on 802.11 systems inside the cars. The results show that the WLAN signals from the surrounding strongly affect the throughput of the systems inside the cars. A throughput drop by 80% compared to maximum was observed in one test drive in the city center.
{"title":"Performance Evaluation of Concurrent IEEE 802.11 Systems in the Automotive Domain","authors":"A. Mourad, F. Heigl, P. Hoeher","doi":"10.1109/LCN.2016.115","DOIUrl":"https://doi.org/10.1109/LCN.2016.115","url":null,"abstract":"Wireless systems have migrated into the automotive domain very fast in the recent years. Car passengers expect to have seamless integration of their consumer electronic devices in their cars. IEEE 802.11 systems are popular for entertainment services inside the car, however due to the fact that IEEE 802.11 use the unlicensed industrial, scientific and medical (ISM) radio bands, the wireless coexistence problem will lead to dramatic decrease of throughput. This can affect the performance of different applications in cars. This paper presents both test drives and measurements in the lab. The target is to have an impression on the influence of the surrounding systems on 802.11 systems inside the cars. The results show that the WLAN signals from the surrounding strongly affect the throughput of the systems inside the cars. A throughput drop by 80% compared to maximum was observed in one test drive in the city center.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"29 1 1","pages":"655-661"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77913690","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}
In this paper we propose a hybrid heuristic approach for public data delivery under ultra-large-scale smart-city settings. In this approach, public transportation vehicles are going into election process to be utilized as Mobile Couriers (MCs) that read public Access Points (APs) data loads and relay it back to a central processing base-station. We also introduce a cost-based fitness function for the MCs election in the smart-city project which forms a real implementation for the Internet of Things (IoT) paradigm. Our cost-based function considers mobile resource limitations in terms count, storage and energy. Extensive simulations are performed and the results confirm the effectiveness of the proposed approach in comparison to other heuristic approaches with identical objectives.
{"title":"Hybrid Approach for Mobile Couriers Election in Smart-Cities","authors":"F. Al-turjman","doi":"10.1109/LCN.2016.79","DOIUrl":"https://doi.org/10.1109/LCN.2016.79","url":null,"abstract":"In this paper we propose a hybrid heuristic approach for public data delivery under ultra-large-scale smart-city settings. In this approach, public transportation vehicles are going into election process to be utilized as Mobile Couriers (MCs) that read public Access Points (APs) data loads and relay it back to a central processing base-station. We also introduce a cost-based fitness function for the MCs election in the smart-city project which forms a real implementation for the Internet of Things (IoT) paradigm. Our cost-based function considers mobile resource limitations in terms count, storage and energy. Extensive simulations are performed and the results confirm the effectiveness of the proposed approach in comparison to other heuristic approaches with identical objectives.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"6 1","pages":"507-510"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76046261","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}
Tim Dittler, Florian Tschorsch, S. Dietzel, B. Scheuermann
While location management is a key component of cellular networks, it is also a major privacy issue: location management empowers the network operator to track users. In today's public and scientific discussion, the centralized storage of location data is mostly taken as a fact, and users are expected to trust the network operator. With ANOTEL we present a novel, clean-slate approach of location management in cellular networks that challenges this assumption. The design is able to route calls to users who move through cellular networks, without violating their location privacy.
{"title":"ANOTEL: Cellular Networks with Location Privacy","authors":"Tim Dittler, Florian Tschorsch, S. Dietzel, B. Scheuermann","doi":"10.1109/LCN.2016.110","DOIUrl":"https://doi.org/10.1109/LCN.2016.110","url":null,"abstract":"While location management is a key component of cellular networks, it is also a major privacy issue: location management empowers the network operator to track users. In today's public and scientific discussion, the centralized storage of location data is mostly taken as a fact, and users are expected to trust the network operator. With ANOTEL we present a novel, clean-slate approach of location management in cellular networks that challenges this assumption. The design is able to route calls to users who move through cellular networks, without violating their location privacy.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"69 1","pages":"635-638"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86440536","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}
In this paper, we propose a policy driven security architecture for securing end to end services across multiple autonomous domain based SDN environment. We develop a language based approach to designing a range of security policies that are relevant for SDN services and communications. The design of a security architecture that enables secure routing of packets based on the specified security policies in the SDN Controller is described.
{"title":"On the Design and Implementation of a Security Architecture for End to End Services in Software Defined Networks","authors":"K. Karmakar, V. Varadharajan, U. Tupakula","doi":"10.1109/LCN.2016.82","DOIUrl":"https://doi.org/10.1109/LCN.2016.82","url":null,"abstract":"In this paper, we propose a policy driven security architecture for securing end to end services across multiple autonomous domain based SDN environment. We develop a language based approach to designing a range of security policies that are relevant for SDN services and communications. The design of a security architecture that enables secure routing of packets based on the specified security policies in the SDN Controller is described.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"60 1","pages":"519-522"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90214164","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}
M. Wichtlhuber, Sebastian Bücker, R. Kluge, Mahdi Mousavi, D. Hausheer
Reputation networks are an important building block of distributed systems whenever reliability of nodes is an issue. However, reputation ratings can easily be undercut: colluding nodes can spread good ratings for each other while third parties are hardly able to detect the fraud. There is strong analytical evidence that reputation networks cannot be constructed in a way to guarantee security. Consequently, only statistical approaches are promising. This work pursues a statistical approach inspired by the idea that colluding node's behavior changes the local structure of a reputation network. To measure these structural changes, we extend a graph analysis method originating from molecular biology and combine it with a machine learning approach to analyze fingerprints of node's interactions. We evaluate our method using an adaptive Peer-to-Peer (P2P) streaming system and show that a correct classification of up to 98% is possible.
{"title":"Of Strategies and Structures: Motif-Based Fingerprinting Analysis of Online Reputation Networks","authors":"M. Wichtlhuber, Sebastian Bücker, R. Kluge, Mahdi Mousavi, D. Hausheer","doi":"10.1109/LCN.2016.76","DOIUrl":"https://doi.org/10.1109/LCN.2016.76","url":null,"abstract":"Reputation networks are an important building block of distributed systems whenever reliability of nodes is an issue. However, reputation ratings can easily be undercut: colluding nodes can spread good ratings for each other while third parties are hardly able to detect the fraud. There is strong analytical evidence that reputation networks cannot be constructed in a way to guarantee security. Consequently, only statistical approaches are promising. This work pursues a statistical approach inspired by the idea that colluding node's behavior changes the local structure of a reputation network. To measure these structural changes, we extend a graph analysis method originating from molecular biology and combine it with a machine learning approach to analyze fingerprints of node's interactions. We evaluate our method using an adaptive Peer-to-Peer (P2P) streaming system and show that a correct classification of up to 98% is possible.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"220 ","pages":"469-476"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91449631","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
扫码关注我们
求助内容：
应助结果提醒方式：