Clock synchronization protocols in wireless sensor networks (WSNs) provide a uniform notion of time which is required by both system as well as application level programs of WSNs. Since nodes have limited energy, it is required that the energy consumed by the clock synchronization protocols is as minimum as possible. Synchronous clock synchronization protocols execute their clock synchronization process at each node, roughly during the same real-time interval, called synchronization phase. The energy consumed by these protocols depends on the duration of the synchronization phase and how frequently the synchronization phase is executed. Hence, to minimize the energy consumption by each node, the duration of synchronization phase should be as small as possible, and the interval between consecutive synchronization phases as large as possible. Due to different drift rates of the clocks, the synchronization phases at different nodes drift apart and special techniques are required to keep them in sync. Keeping synchronization phases at neighbouring nodes in sync helps to reduce the synchronization phase. In this paper, we propose a novel technique using TDMA-based MAC protocol to keep the synchronization phases at neighbouring nodes in sync much more tightly than the existing techniques. We have applied the technique in the improved weighted-average based clock synchronization (IWICS) protocol to reduce the synchronization phase considerably and the modified TDMA-based IWICS protocol is named TIWICS protocol. This reduction in energy consumption is achieved without reducing the synchronization accuracy. Simulation results obtained using Castalia network simulator and the experimental results obtained using a test bed of WSN consisting of a few TELUS motes confirm the effectiveness of the approach.
{"title":"Improving the Energy Efficiency of a Clock Synchronization Protocol for WSNs Using a TDMA-Based MAC Protocol","authors":"Siddharth Watwe, R. Hansdah","doi":"10.1109/AINA.2015.190","DOIUrl":"https://doi.org/10.1109/AINA.2015.190","url":null,"abstract":"Clock synchronization protocols in wireless sensor networks (WSNs) provide a uniform notion of time which is required by both system as well as application level programs of WSNs. Since nodes have limited energy, it is required that the energy consumed by the clock synchronization protocols is as minimum as possible. Synchronous clock synchronization protocols execute their clock synchronization process at each node, roughly during the same real-time interval, called synchronization phase. The energy consumed by these protocols depends on the duration of the synchronization phase and how frequently the synchronization phase is executed. Hence, to minimize the energy consumption by each node, the duration of synchronization phase should be as small as possible, and the interval between consecutive synchronization phases as large as possible. Due to different drift rates of the clocks, the synchronization phases at different nodes drift apart and special techniques are required to keep them in sync. Keeping synchronization phases at neighbouring nodes in sync helps to reduce the synchronization phase. In this paper, we propose a novel technique using TDMA-based MAC protocol to keep the synchronization phases at neighbouring nodes in sync much more tightly than the existing techniques. We have applied the technique in the improved weighted-average based clock synchronization (IWICS) protocol to reduce the synchronization phase considerably and the modified TDMA-based IWICS protocol is named TIWICS protocol. This reduction in energy consumption is achieved without reducing the synchronization accuracy. Simulation results obtained using Castalia network simulator and the experimental results obtained using a test bed of WSN consisting of a few TELUS motes confirm the effectiveness of the approach.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"34 1","pages":"231-238"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82665871","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}
Danish Mahmood, N. Javaid, M. Imran, Z. Khan, U. Qasim, M. Alnuem
Orientation sensing is not a new concept. It is being used since ages however, with emergence of new technologies such as Wireless Body Area Sensor Networks (WBASNs), it gives new challenges. Commencement of smart phones that have built in orientation sensors are replacing expensive and complex Inertial Measurement Units (IMUs) designed for a specific purpose. Orientation sensing in WBASN have numerous applications. In e-health applications, rehabilitation investigation of backbone injuries can be measured by continues readings of posture. For that, gyroscopes and accelerometers are key sensors that play vital role. For machines such as robots and air crafts, such data fusion is in practice. However, considering human body movements yet there is a need to find an accurate fusion algorithm that meets all demands with low complexity. In this work, we discussed and compared two algorithms considering Wireless Body Area Sensor Fusion (WBASF) i.e. Kalman and Complementary data fusion techniques. According to our findings, Kalman Filter may have given very good results regarding machines however, Complementary filter proved itself better in performance, complexity and required computational power in WBASNs.
{"title":"On Data Fusion for Orientation Sensing in WBASNs Using Smart Phones","authors":"Danish Mahmood, N. Javaid, M. Imran, Z. Khan, U. Qasim, M. Alnuem","doi":"10.1109/AINA.2015.222","DOIUrl":"https://doi.org/10.1109/AINA.2015.222","url":null,"abstract":"Orientation sensing is not a new concept. It is being used since ages however, with emergence of new technologies such as Wireless Body Area Sensor Networks (WBASNs), it gives new challenges. Commencement of smart phones that have built in orientation sensors are replacing expensive and complex Inertial Measurement Units (IMUs) designed for a specific purpose. Orientation sensing in WBASN have numerous applications. In e-health applications, rehabilitation investigation of backbone injuries can be measured by continues readings of posture. For that, gyroscopes and accelerometers are key sensors that play vital role. For machines such as robots and air crafts, such data fusion is in practice. However, considering human body movements yet there is a need to find an accurate fusion algorithm that meets all demands with low complexity. In this work, we discussed and compared two algorithms considering Wireless Body Area Sensor Fusion (WBASF) i.e. Kalman and Complementary data fusion techniques. According to our findings, Kalman Filter may have given very good results regarding machines however, Complementary filter proved itself better in performance, complexity and required computational power in WBASNs.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"461-467"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77290913","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}
A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider
In this paper, we present need-based clustering (NbC) with dynamic sink mobility (DYN-NbC) scheme for wireless sensor networks (WSNs). Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that mobile sink (MS) moves from dense (in terms of number of nodes) regions towards sparse regions. Intelligently moving the sink to high density regions ensure maximum collection of data. As, more number of nodes (sensors) are able to send data directly to MS, therefore, significant amount of energy is saved in each particular round. However, there is a certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there are chances of buffer (node storage) overflow that is not desirable. To overcome this issue our scheme includes. Clustering (communication via CHs) becomes the part for those regions which are away from MS. Simulation results show that DYN-NbC outperforms the other two protocols D-LEACH and LEACH in terms of stability period, network lifetime, and network throughput.
{"title":"DYN-NbC: A New Routing Scheme to Maximize Lifetime and Throughput of WSNs","authors":"A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider","doi":"10.1109/AINA.2015.171","DOIUrl":"https://doi.org/10.1109/AINA.2015.171","url":null,"abstract":"In this paper, we present need-based clustering (NbC) with dynamic sink mobility (DYN-NbC) scheme for wireless sensor networks (WSNs). Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that mobile sink (MS) moves from dense (in terms of number of nodes) regions towards sparse regions. Intelligently moving the sink to high density regions ensure maximum collection of data. As, more number of nodes (sensors) are able to send data directly to MS, therefore, significant amount of energy is saved in each particular round. However, there is a certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there are chances of buffer (node storage) overflow that is not desirable. To overcome this issue our scheme includes. Clustering (communication via CHs) becomes the part for those regions which are away from MS. Simulation results show that DYN-NbC outperforms the other two protocols D-LEACH and LEACH in terms of stability period, network lifetime, and network throughput.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"10 1","pages":"92-97"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77539793","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 presents an object-based method for indexing recursive structured XML data and process branched queries efficiently. The proposed method is called Object-based Twig Query processing for Recursive data (OTQℜ). It is an extended approach of our existing work in [1] in order to handle recursion in XML data. Our motivation of extending OTQ to OTQℜ is to support many applications that require recursive data structure to be fully functional. OTQℜ is proposed to utilize semantics of XML data to efficiently process branched queries on recursive XML data. The experiments and evaluation are presented to cover variant evaluating points and the efficiency of our approach.
{"title":"Efficient Processing of Queries over Recursive XML Data","authors":"N. Alghamdi, J. Rahayu, E. Pardede","doi":"10.1109/AINA.2015.177","DOIUrl":"https://doi.org/10.1109/AINA.2015.177","url":null,"abstract":"This paper presents an object-based method for indexing recursive structured XML data and process branched queries efficiently. The proposed method is called Object-based Twig Query processing for Recursive data (OTQℜ). It is an extended approach of our existing work in [1] in order to handle recursion in XML data. Our motivation of extending OTQ to OTQℜ is to support many applications that require recursive data structure to be fully functional. OTQℜ is proposed to utilize semantics of XML data to efficiently process branched queries on recursive XML data. The experiments and evaluation are presented to cover variant evaluating points and the efficiency of our approach.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"99 1","pages":"134-142"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72900280","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 the rapidly expanding fields of cellular and molecular biology, fluorescence illumination and observation is becoming one of the techniques of choice to study the localization and dynamics of proteins, organelles, and other cellular compartments, as well as a tracer of intracellular protein trafficking. The automatic analysis of these images and signals in medicine, biotechnology, and chemistry is a challenging and demanding field. Signal-producing procedures by microscopes, spectrometers and other sensors have found their way into wide fields of medicine, biotechnology, economy and environmental analysis. With this arises the problem of the automatic mass analysis of signal information. Signal-interpreting systems which automatically generate the desired target statements from the signals are therefore of compelling necessity. The continuation of mass analysis on the basis of the classical procedures leads to investments of proportions that are not feasible. New procedures and system architectures are therefore required. We will present, based on our flexible image analysis and interpretation system Cell interpret, new intelligent and automatic image analysis and interpretation procedures. We will demonstrate it in the application of the HEp-2 cell pattern analysis.
{"title":"New Methods for Big Data Analysis in Images","authors":"P. Perner","doi":"10.1109/WAINA.2015.75","DOIUrl":"https://doi.org/10.1109/WAINA.2015.75","url":null,"abstract":"In the rapidly expanding fields of cellular and molecular biology, fluorescence illumination and observation is becoming one of the techniques of choice to study the localization and dynamics of proteins, organelles, and other cellular compartments, as well as a tracer of intracellular protein trafficking. The automatic analysis of these images and signals in medicine, biotechnology, and chemistry is a challenging and demanding field. Signal-producing procedures by microscopes, spectrometers and other sensors have found their way into wide fields of medicine, biotechnology, economy and environmental analysis. With this arises the problem of the automatic mass analysis of signal information. Signal-interpreting systems which automatically generate the desired target statements from the signals are therefore of compelling necessity. The continuation of mass analysis on the basis of the classical procedures leads to investments of proportions that are not feasible. New procedures and system architectures are therefore required. We will present, based on our flexible image analysis and interpretation system Cell interpret, new intelligent and automatic image analysis and interpretation procedures. We will demonstrate it in the application of the HEp-2 cell pattern analysis.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"35 1","pages":"255-260"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73825166","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}
Lu Shi, S. Butakov, Dale Lindskog, Ron Ruhl, Evgeny Storozhenko
The paper studies the applicability of a probabilistic data structure known as Bloom Filter (BF) in the content analysis component of Data Loss Prevention (DLP) Systems. The study shows that Bus may serve as preliminary selection mechanism in content analysis. The goal of such mechanism is to quickly pre-select documents that may be similar to the one being checked. This selection should be accompanied by more detailed comparison to cope with false positive results produced by BFs. Specialized form of the filter called Matrix BF has been found particularly helpful for the content analysis task as it provides search localization and allows the filter to grow along with the document database and maintain liner search time. The paper outlined theoretical threshold for false positives for comparison of two rows in the Matrix BF. The threshold was confirmed by experiments. The experiments also indicated acceptable performance in terms of computational performance and level of false positives. Tests with obfuscated texts revealed some limitations of the proposed approach.
{"title":"Applicability of Probablistic Data Structures for Filtering Tasks in Data Loss Prevention Systems","authors":"Lu Shi, S. Butakov, Dale Lindskog, Ron Ruhl, Evgeny Storozhenko","doi":"10.1109/WAINA.2015.47","DOIUrl":"https://doi.org/10.1109/WAINA.2015.47","url":null,"abstract":"The paper studies the applicability of a probabilistic data structure known as Bloom Filter (BF) in the content analysis component of Data Loss Prevention (DLP) Systems. The study shows that Bus may serve as preliminary selection mechanism in content analysis. The goal of such mechanism is to quickly pre-select documents that may be similar to the one being checked. This selection should be accompanied by more detailed comparison to cope with false positive results produced by BFs. Specialized form of the filter called Matrix BF has been found particularly helpful for the content analysis task as it provides search localization and allows the filter to grow along with the document database and maintain liner search time. The paper outlined theoretical threshold for false positives for comparison of two rows in the Matrix BF. The threshold was confirmed by experiments. The experiments also indicated acceptable performance in terms of computational performance and level of false positives. Tests with obfuscated texts revealed some limitations of the proposed approach.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"262 1","pages":"582-586"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75105027","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}
Hyeryun Lee, Kyunghee Choi, K. Chung, Jaein Kim, Kangbin Yim
There have been many warnings that automobiles are vulnerable to the attacks through the network, CAN which connects the ECUs (Electrical Control Units) embedded in the automobiles. Some previous studies showed that the warnings were actual treats. They analyzed the packets flowing on the network and used the packets constructed based on the analysis. We show that it is possible to attack automobiles without any in-depth knowledge about automobiles and specially designed tools to analyze the packets. Experiments are performed in two phases. In the first phase, the victims automobiles are attacked with the packets constructed with the CAN IDs gathered from the sniffed packets flowing in the automobiles. It is not a problem at all to gather CANIDs since CAN is an open simple standard protocol and there are many tools to sniff CAN packets in the Internet. In the second phase, the attack packets are constructed in a completely random manner without any previous information such as CAN IDs. The packets are injected into the network via Bluetooth, a wireless channel. Through the experiments, we show the network vulnerability of automobiles.
{"title":"Fuzzing CAN Packets into Automobiles","authors":"Hyeryun Lee, Kyunghee Choi, K. Chung, Jaein Kim, Kangbin Yim","doi":"10.1109/AINA.2015.274","DOIUrl":"https://doi.org/10.1109/AINA.2015.274","url":null,"abstract":"There have been many warnings that automobiles are vulnerable to the attacks through the network, CAN which connects the ECUs (Electrical Control Units) embedded in the automobiles. Some previous studies showed that the warnings were actual treats. They analyzed the packets flowing on the network and used the packets constructed based on the analysis. We show that it is possible to attack automobiles without any in-depth knowledge about automobiles and specially designed tools to analyze the packets. Experiments are performed in two phases. In the first phase, the victims automobiles are attacked with the packets constructed with the CAN IDs gathered from the sniffed packets flowing in the automobiles. It is not a problem at all to gather CANIDs since CAN is an open simple standard protocol and there are many tools to sniff CAN packets in the Internet. In the second phase, the attack packets are constructed in a completely random manner without any previous information such as CAN IDs. The packets are injected into the network via Bluetooth, a wireless channel. Through the experiments, we show the network vulnerability of automobiles.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"228 1","pages":"817-821"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74468328","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}
Young-Sil Lee, Bruce Ndibanje, Non Thiranant, E. Alasaarela, Hoon-Jae Lee
In many countries, the increasing longevity and declining fertility rates have contributed to aging populations and thus increased medical needs. The traditional healthcare methodology is being replaced by smarter healthcare (a.k.a. E-healthcare, u-healthcare, m-healthcare or cloud-healthcare). The cloud computing has gained more and more popularity in recent years. Several cloud based healthcare solutions have been proposed in previous publication. However, even though cloud computing gives many benefits for healthcare system, is not without its risks. In this paper, we are introducing few security requirements for healthcare system and propose a hybrid cloud service based healthcare solution. We also propose secure sensor module to protect the sensed patient biological data during transmit.
{"title":"Hybrid Cloud Service Based Healthcare Solutions","authors":"Young-Sil Lee, Bruce Ndibanje, Non Thiranant, E. Alasaarela, Hoon-Jae Lee","doi":"10.1109/WAINA.2015.42","DOIUrl":"https://doi.org/10.1109/WAINA.2015.42","url":null,"abstract":"In many countries, the increasing longevity and declining fertility rates have contributed to aging populations and thus increased medical needs. The traditional healthcare methodology is being replaced by smarter healthcare (a.k.a. E-healthcare, u-healthcare, m-healthcare or cloud-healthcare). The cloud computing has gained more and more popularity in recent years. Several cloud based healthcare solutions have been proposed in previous publication. However, even though cloud computing gives many benefits for healthcare system, is not without its risks. In this paper, we are introducing few security requirements for healthcare system and propose a hybrid cloud service based healthcare solution. We also propose secure sensor module to protect the sensed patient biological data during transmit.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"31 1","pages":"25-30"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75133120","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 the QR Code authentication technique, smart phone has become a great tool and played an important role in the authentication process. It has been used in various fields over the internet, especially in multi-factor authentication. However, security aspects should be well taken care of. In this paper, the performance comparison between RSA and Elliptic Curve Cryptography-based QR Code Authentication is proposed. It mainly focuses on QR Code, as it is now widely used all over the world. In addition, existing and related work has leveraged the use of RSA, but no work done on Elliptic Curve Cryptography. The experiment results and comparisons are shown and described in this paper.
{"title":"Performance Comparison Between RSA and Elliptic Curve Cryptography-Based QR Code Authentication","authors":"Non Thiranant, Young-Sil Lee, Hoon-Jae Lee","doi":"10.1109/WAINA.2015.62","DOIUrl":"https://doi.org/10.1109/WAINA.2015.62","url":null,"abstract":"In the QR Code authentication technique, smart phone has become a great tool and played an important role in the authentication process. It has been used in various fields over the internet, especially in multi-factor authentication. However, security aspects should be well taken care of. In this paper, the performance comparison between RSA and Elliptic Curve Cryptography-based QR Code Authentication is proposed. It mainly focuses on QR Code, as it is now widely used all over the world. In addition, existing and related work has leveraged the use of RSA, but no work done on Elliptic Curve Cryptography. The experiment results and comparisons are shown and described in this paper.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"70 1","pages":"278-282"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75257391","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}
With the exponential growth of devices connected to the Internet, security networks as one of the hardest challenge for network managers. Maintaining and securing such large scale and heterogeneous network is a challenging task. In this context, the new networking paradigm, the Software Defined Networking (SDN), introduces many opportunities and provides the potential to overcome those challenges. In this article, we first present a new SDN based architecture for networking with or without infrastructure, that we call an SDN domain. A single domain includes wired network, wireless network and Ad-Hoc networks. Next, we propose a second architecture to include sensor networks in an SDN-based network and in a domain. Third, we interconnect multiple domains and we describe how we can enhanced the security of each domain and how to distribute the security rules in order not to compromise the security of one domain. Finally, we propose a new secure and distributed architecture for IoT (Internet of Things).
{"title":"SDN Based Architecture for IoT and Improvement of the Security","authors":"O. Flauzac, Carlos Gonzalez, A. Hachani, F. Nolot","doi":"10.1109/WAINA.2015.110","DOIUrl":"https://doi.org/10.1109/WAINA.2015.110","url":null,"abstract":"With the exponential growth of devices connected to the Internet, security networks as one of the hardest challenge for network managers. Maintaining and securing such large scale and heterogeneous network is a challenging task. In this context, the new networking paradigm, the Software Defined Networking (SDN), introduces many opportunities and provides the potential to overcome those challenges. In this article, we first present a new SDN based architecture for networking with or without infrastructure, that we call an SDN domain. A single domain includes wired network, wireless network and Ad-Hoc networks. Next, we propose a second architecture to include sensor networks in an SDN-based network and in a domain. Third, we interconnect multiple domains and we describe how we can enhanced the security of each domain and how to distribute the security rules in order not to compromise the security of one domain. Finally, we propose a new secure and distributed architecture for IoT (Internet of Things).","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"63 1","pages":"688-693"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77600153","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
扫码关注我们
求助内容：
应助结果提醒方式：