Pub Date : 2016-06-27DOI: 10.1109/ISCC.2016.7543902
A. Mammeri, A. Boukerche, El-Hebri Khiari
Text detection and communication in the automotive context has attracted the attention of researchers only over the past few years. Detecting text in the automotive context, as opposed to the detection of text of printed pages, imposes additional challenges, such as the presence of obstacles, blurry frames, speedy vehicles, etc. In this paper, we present an in-vehicle real-time system able to localize texts and communicate them to the drivers. Our system begins by localizing regions of interest as a Maximally Stable Extremal Regions (MSERs). Afterwards, we apply a novel filtering stage which begins by dividing each ROI into 4 × 4 cells, counting the number of edges in each cell and comparing them to a well defined threshold. This is performed in order to filter out a considerable number of unwanted objects. The ROIs that contain text are fed into a recognition module based on the Optical Character Recognizer (OCR). Our proposed method achieves high f-scores when tested against several videos containing a numerous panels.
{"title":"MSER-based text detection and communication algorithm for autonomous vehicles","authors":"A. Mammeri, A. Boukerche, El-Hebri Khiari","doi":"10.1109/ISCC.2016.7543902","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543902","url":null,"abstract":"Text detection and communication in the automotive context has attracted the attention of researchers only over the past few years. Detecting text in the automotive context, as opposed to the detection of text of printed pages, imposes additional challenges, such as the presence of obstacles, blurry frames, speedy vehicles, etc. In this paper, we present an in-vehicle real-time system able to localize texts and communicate them to the drivers. Our system begins by localizing regions of interest as a Maximally Stable Extremal Regions (MSERs). Afterwards, we apply a novel filtering stage which begins by dividing each ROI into 4 × 4 cells, counting the number of edges in each cell and comparing them to a well defined threshold. This is performed in order to filter out a considerable number of unwanted objects. The ROIs that contain text are fed into a recognition module based on the Optical Character Recognizer (OCR). Our proposed method achieves high f-scores when tested against several videos containing a numerous panels.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707321","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543808
Weiyuan Li, Yang Li, Wei Wang, Yonghui Xin, Tao Lin
Content-Centric Networking (CCN) proposals rethink the communication model around named data. In-network caching and multipath routing are regarded as two fundamental features to distinguish the CCN from the current host-centric IP network. In this paper, we tackle the problem of joint collaborative caching and multipath routing in CCN. We achieve this with an online and offline combination caching scheme based on a local content popularity statistic results. Besides, we place the content heterogeneously along a path and resort to a caching aware dynamic multipath routing in a coordination fashion. The proposed scheme can increase the content diversity and improve the caching utility with the aim of minimizing the user access delay. Simulation experiments have been performed to evaluate the proposed scheme. Simulation results show that the proposed scheme is effective and outperforms the existing caching mechanisms in CCN.
{"title":"A popularity-driven caching scheme with dynamic multipath routing in CCN","authors":"Weiyuan Li, Yang Li, Wei Wang, Yonghui Xin, Tao Lin","doi":"10.1109/ISCC.2016.7543808","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543808","url":null,"abstract":"Content-Centric Networking (CCN) proposals rethink the communication model around named data. In-network caching and multipath routing are regarded as two fundamental features to distinguish the CCN from the current host-centric IP network. In this paper, we tackle the problem of joint collaborative caching and multipath routing in CCN. We achieve this with an online and offline combination caching scheme based on a local content popularity statistic results. Besides, we place the content heterogeneously along a path and resort to a caching aware dynamic multipath routing in a coordination fashion. The proposed scheme can increase the content diversity and improve the caching utility with the aim of minimizing the user access delay. Simulation experiments have been performed to evaluate the proposed scheme. Simulation results show that the proposed scheme is effective and outperforms the existing caching mechanisms in CCN.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130962539","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543786
D. Tsolkas, N. Passas
Multiple asynchronous devices, that exploit a pool of radio resources to communicate, form a key 5G communication scenario. Considering multicarrier transmission for this scenario, the expected multiuser synchronization errors at a receiving node, may be compensated by inserting guard subcarriers between transmissions from different devices. We analyze the radio resource overhead due to the use of guard subcarriers in correlation with the adopted multicarrier waveform and subcarrier allocation scheme. We show that Orthogonal Frequency Division Multiplexing (OFDM) can hardly serve the aforementioned scenario, while, in general case the use of guard subcarriers introduces another strain on the resource allocation procedure, questioning the performance of resource allocators that in conventional scenarios are highly efficient.
{"title":"Compensating multiuser synchronization errors in 5G communications: The radio resource overhead","authors":"D. Tsolkas, N. Passas","doi":"10.1109/ISCC.2016.7543786","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543786","url":null,"abstract":"Multiple asynchronous devices, that exploit a pool of radio resources to communicate, form a key 5G communication scenario. Considering multicarrier transmission for this scenario, the expected multiuser synchronization errors at a receiving node, may be compensated by inserting guard subcarriers between transmissions from different devices. We analyze the radio resource overhead due to the use of guard subcarriers in correlation with the adopted multicarrier waveform and subcarrier allocation scheme. We show that Orthogonal Frequency Division Multiplexing (OFDM) can hardly serve the aforementioned scenario, while, in general case the use of guard subcarriers introduces another strain on the resource allocation procedure, questioning the performance of resource allocators that in conventional scenarios are highly efficient.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565293","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543788
H. Mostafaei, Antonio Montieri, V. Persico, A. Pescapé
Wireless sensor networks (WSNs) are currently adopted in a vast variety of domains. Due to practical energy constraints, in this field minimizing sensor energy consumption is a critical challenge. Sleep scheduling approaches give the opportunity of turning off a subset of the nodes of a network- without suspending the monitoring activities performed by the WSN-in order to save energy and increase the lifetime of the sensing system. Our study focuses on partial coverage, targeting scenarios in which the continuous monitoring of a limited portion of the area of interest is enough. In this paper, we present PCLA, an efficient algorithm based on Learning Automata that aims at minimizing the number of sensors to activate, such that a given portion of the area of interest is covered and connectivity among sensors is preserved. Simulation results show how PCLA can select sensors in an efficient way to satisfy the imposed constraints, thus guaranteeing better performance in terms of both working-node ratio and WSN lifetime. Also, we show how PCLA outperforms state-of-the-art partial-coverage algorithms.
{"title":"An efficient partial coverage algorithm for wireless sensor networks","authors":"H. Mostafaei, Antonio Montieri, V. Persico, A. Pescapé","doi":"10.1109/ISCC.2016.7543788","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543788","url":null,"abstract":"Wireless sensor networks (WSNs) are currently adopted in a vast variety of domains. Due to practical energy constraints, in this field minimizing sensor energy consumption is a critical challenge. Sleep scheduling approaches give the opportunity of turning off a subset of the nodes of a network- without suspending the monitoring activities performed by the WSN-in order to save energy and increase the lifetime of the sensing system. Our study focuses on partial coverage, targeting scenarios in which the continuous monitoring of a limited portion of the area of interest is enough. In this paper, we present PCLA, an efficient algorithm based on Learning Automata that aims at minimizing the number of sensors to activate, such that a given portion of the area of interest is covered and connectivity among sensors is preserved. Simulation results show how PCLA can select sensors in an efficient way to satisfy the imposed constraints, thus guaranteeing better performance in terms of both working-node ratio and WSN lifetime. Also, we show how PCLA outperforms state-of-the-art partial-coverage algorithms.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124340110","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543871
Shaoduo Gan, Jiexin Zhang, Jie Yu, Xiaoling Li, Jun Ma, Lei Luo, Q. Wu
Deploying cache has been generally adopted by Internet service providers (ISPs) to mitigate P2P traffic in recent years. Most traditional caching algorithms are designed for locality-unaware P2P networks, which mainly consider the requested frequency of contents as the principle of caching policies. However, in more prevalent locality-aware conditions with biased neighbor-selection policies, the existing caching schemes can hardly optimize the situation. In this paper we show that, what need to be cached in locality-aware conditions are the contents that can not be well provided by local neighbors, rather than the contents which are requested most frequently. Therefore, states of local neighbors should be taken into consideration in caching policies. We first present a new model in which P2P cache and locality-aware neighbor selection work together. We focus on inter-ISP traffic and available bandwidth of users in order to benefit both ISPs and users. Based on the mathematical model, a novel caching algorithm is proposed which considers replacement and allocation policies together. According to trace-driven simulations, the proposed algorithm outperforms other two representative caching algorithms in various scenarios.
{"title":"A novel optimization scheme for caching in locality-aware P2P networks","authors":"Shaoduo Gan, Jiexin Zhang, Jie Yu, Xiaoling Li, Jun Ma, Lei Luo, Q. Wu","doi":"10.1109/ISCC.2016.7543871","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543871","url":null,"abstract":"Deploying cache has been generally adopted by Internet service providers (ISPs) to mitigate P2P traffic in recent years. Most traditional caching algorithms are designed for locality-unaware P2P networks, which mainly consider the requested frequency of contents as the principle of caching policies. However, in more prevalent locality-aware conditions with biased neighbor-selection policies, the existing caching schemes can hardly optimize the situation. In this paper we show that, what need to be cached in locality-aware conditions are the contents that can not be well provided by local neighbors, rather than the contents which are requested most frequently. Therefore, states of local neighbors should be taken into consideration in caching policies. We first present a new model in which P2P cache and locality-aware neighbor selection work together. We focus on inter-ISP traffic and available bandwidth of users in order to benefit both ISPs and users. Based on the mathematical model, a novel caching algorithm is proposed which considers replacement and allocation policies together. According to trace-driven simulations, the proposed algorithm outperforms other two representative caching algorithms in various scenarios.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115043028","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543723
H. Ahmadi, F. Viani, A. Polo, R. Bouallègue
Indoor localization methods based on the received signal strength indicator are widely used in the literature since no additional hardware is required for data acquisition. In this paper, a novel localization algorithm which combines both classification and regression methods is proposed to enhance the localization accuracy of previous methods based on regression tree. The proposed approach is based on the selection of the three anchors nearest to the target for the generation of the training set and during the testing phase. The performances are evaluated using real measurements acquired in office rooms. The experimental results show that the anchor selection procedure provides an increased accuracy if compared to the standard regression tree localization algorithm.
{"title":"An improved anchor selection strategy for wireless localization of WSN nodes","authors":"H. Ahmadi, F. Viani, A. Polo, R. Bouallègue","doi":"10.1109/ISCC.2016.7543723","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543723","url":null,"abstract":"Indoor localization methods based on the received signal strength indicator are widely used in the literature since no additional hardware is required for data acquisition. In this paper, a novel localization algorithm which combines both classification and regression methods is proposed to enhance the localization accuracy of previous methods based on regression tree. The proposed approach is based on the selection of the three anchors nearest to the target for the generation of the training set and during the testing phase. The performances are evaluated using real measurements acquired in office rooms. The experimental results show that the anchor selection procedure provides an increased accuracy if compared to the standard regression tree localization algorithm.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710318","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543725
Yeunwoong Kyung, Youngjun Kim, Kiwon Hong, Hyungoo Choi, Mingyu Joo, Jinwoo Park
As the network grows, the centralized SDN (Software-Defined Networking) architecture causes a scalability problem. To handle this problem, multiple controllers have been used in many related works. However, if the load is concentrated on a certain controller, incoming messages to the controller can be blocked while other controllers are not busy. Especially, this problem becomes critical for handover requests in mobile networks because users will perceive severe QoS deterioration when these requests are blocked. Therefore, this paper presents a mobility-aware load distribution scheme for scalable SDN-based mobile networks. In the proposed scheme, incoming handover request messages can be differentiated among other messages and admitted with priority. In addition, these messages can be migrated to other controllers when the controller has no capacity to prevent them from being blocked. Analytical results confirm that the proposed scheme has lower blocking probability and higher resource utilization ratio than conventional schemes without much additional signaling load as offered load increases.
{"title":"Mobility-aware load distribution scheme for scalable SDN-based mobile networks","authors":"Yeunwoong Kyung, Youngjun Kim, Kiwon Hong, Hyungoo Choi, Mingyu Joo, Jinwoo Park","doi":"10.1109/ISCC.2016.7543725","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543725","url":null,"abstract":"As the network grows, the centralized SDN (Software-Defined Networking) architecture causes a scalability problem. To handle this problem, multiple controllers have been used in many related works. However, if the load is concentrated on a certain controller, incoming messages to the controller can be blocked while other controllers are not busy. Especially, this problem becomes critical for handover requests in mobile networks because users will perceive severe QoS deterioration when these requests are blocked. Therefore, this paper presents a mobility-aware load distribution scheme for scalable SDN-based mobile networks. In the proposed scheme, incoming handover request messages can be differentiated among other messages and admitted with priority. In addition, these messages can be migrated to other controllers when the controller has no capacity to prevent them from being blocked. Analytical results confirm that the proposed scheme has lower blocking probability and higher resource utilization ratio than conventional schemes without much additional signaling load as offered load increases.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125080488","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543805
Jingfei He, Guiling Sun, Y. Zhang, Tianyu Geng
An effective way to reduce the energy consumption of energy constrained wireless sensor networks is reducing the number of collected data, which causes the recovery problem. In this paper, we propose a novel data recovery method based on low-rank tensors for the heterogeneous wireless sensor networks with various sensor types. The proposed method represents the collected high-dimensional data as low-rank tensors to effectively exploit the spatiotemporal correlation that exists in the various data. Furthermore, an algorithm based on the alternating direction method of multipliers is developed to solve the resultant optimization problem efficiently. Experimental results demonstrate that the proposed method significantly outperforms the sparsity constraint method and matrix completion method for each type of signals.
{"title":"Data recovery in heterogeneous wireless sensor networks based on low-rank tensors","authors":"Jingfei He, Guiling Sun, Y. Zhang, Tianyu Geng","doi":"10.1109/ISCC.2016.7543805","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543805","url":null,"abstract":"An effective way to reduce the energy consumption of energy constrained wireless sensor networks is reducing the number of collected data, which causes the recovery problem. In this paper, we propose a novel data recovery method based on low-rank tensors for the heterogeneous wireless sensor networks with various sensor types. The proposed method represents the collected high-dimensional data as low-rank tensors to effectively exploit the spatiotemporal correlation that exists in the various data. Furthermore, an algorithm based on the alternating direction method of multipliers is developed to solve the resultant optimization problem efficiently. Experimental results demonstrate that the proposed method significantly outperforms the sparsity constraint method and matrix completion method for each type of signals.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123739231","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}
Current Internet packet forwarding only relies on destination IP address and thus neglects the validation of packet's IP source address for Internet accountability, which incurs many cyber-security threats. State-of-the-art solutions either have issues in spoofing packet filtering accuracy, e.g., false positive and false negative, or encounter scalability and deployment problems, i.e., end-host TCP/IP stack or router modification. In this article, we propose SAVSH, a practical IP source address validation scheme for Software Defined Networking (SDN) hybrid networks. SAVSH takes advantage of the SDN architecture which possesses global topological view and central control pattern, so that it can locate nodes for the SDN switch replacement and deploy filtering rules onto them with desirable IP prefix-level filtering accuracy. In the meantime, SAVSH also takes network dynamics (e.g., topology changes) into account. Finally, the established prototype experiment and typical topology simulations demonstrate SAVSH not only possesses desirable performance, but also owns the capability that trades the maximal validation effect with the minimal SDN switch deployment cost, which is up to more than 90% prefix coverage benefit to 15% deployment cost on average.
{"title":"SAVSH: IP source address validation for SDN hybrid networks","authors":"Guolong Chen, Guangwu Hu, Yong Jiang, Chaoqin Zhang","doi":"10.1109/ISCC.2016.7543774","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543774","url":null,"abstract":"Current Internet packet forwarding only relies on destination IP address and thus neglects the validation of packet's IP source address for Internet accountability, which incurs many cyber-security threats. State-of-the-art solutions either have issues in spoofing packet filtering accuracy, e.g., false positive and false negative, or encounter scalability and deployment problems, i.e., end-host TCP/IP stack or router modification. In this article, we propose SAVSH, a practical IP source address validation scheme for Software Defined Networking (SDN) hybrid networks. SAVSH takes advantage of the SDN architecture which possesses global topological view and central control pattern, so that it can locate nodes for the SDN switch replacement and deploy filtering rules onto them with desirable IP prefix-level filtering accuracy. In the meantime, SAVSH also takes network dynamics (e.g., topology changes) into account. Finally, the established prototype experiment and typical topology simulations demonstrate SAVSH not only possesses desirable performance, but also owns the capability that trades the maximal validation effect with the minimal SDN switch deployment cost, which is up to more than 90% prefix coverage benefit to 15% deployment cost on average.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126945849","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543790
Sahar Ben Yaala, Fabrice Théoleyre, R. Bouallègue
With the large deployment of smart and heterogeneous devices, interest of researchers to define new protocols to meet Internet of Things (IoT) requirements is growing. A particular interest was accorded to define a robust MAC layer for wireless sensor networks, in order to reduce interference caused by other co-located networks and applications using the ISM band. This paper gives a comprehensive study of the Time Slotted channel Hopping IEEE802.15.4, part of the 6TiSCH stack and explains how its TDMA approach improves the reliability with performance guarantees. We also investigate analytically and experimentally the impact of the scheduling algorithm on the reliability. Then, we provide an experimental evaluation of co-located WSN using the FiT-IoT LAB testbed and the OpenWSN Stack. Performance analysis of IEEE802.15.4e-TSCH is achieved with a variable number of co-located synchronized or unsynchronized instances. While this standard is robust for lightly loaded networks, new mechanisms have to be proposed when we have too much traffic or too many interfering networks.
{"title":"Performance study of co-located IEEE 802.15.4-TSCH networks: Interference and coexistence","authors":"Sahar Ben Yaala, Fabrice Théoleyre, R. Bouallègue","doi":"10.1109/ISCC.2016.7543790","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543790","url":null,"abstract":"With the large deployment of smart and heterogeneous devices, interest of researchers to define new protocols to meet Internet of Things (IoT) requirements is growing. A particular interest was accorded to define a robust MAC layer for wireless sensor networks, in order to reduce interference caused by other co-located networks and applications using the ISM band. This paper gives a comprehensive study of the Time Slotted channel Hopping IEEE802.15.4, part of the 6TiSCH stack and explains how its TDMA approach improves the reliability with performance guarantees. We also investigate analytically and experimentally the impact of the scheduling algorithm on the reliability. Then, we provide an experimental evaluation of co-located WSN using the FiT-IoT LAB testbed and the OpenWSN Stack. Performance analysis of IEEE802.15.4e-TSCH is achieved with a variable number of co-located synchronized or unsynchronized instances. While this standard is robust for lightly loaded networks, new mechanisms have to be proposed when we have too much traffic or too many interfering networks.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130918907","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
扫码关注我们
求助内容：
应助结果提醒方式：