Pub Date : 2018-06-01DOI: 10.1109/ISNCC.2018.8530995
M. Hossain, Jundong Chen, K. Rahman
The traditional architecture of serial fusion based multi-biometric verification systems places an average performing or the worst performing individual verifier in the final stage. Because the final stage gives the verification decision using a single threshold and takes on the most confusing samples which are rejected by all previous stages, an average or the worst performing individual verifier may incur high verification errors in the final stage, which may negatively impact the performance of the whole system. Unfortunately, it is not possible to place a strong individual verifier in the final stage of a traditional architecture because if we place a strong individual verifier in the final stage, we will have to place a weak individual verifier in an earlier stage. Studies show that placing a weak individual verifier in an earlier stage worsens the performance of the whole system by giving more wrong decision earlier. Hence, the challenge is-how can we place the best performing individual verifier in the first stage and at the same time not place an average or the worst performing individual verifier in the final stage? In this paper, we address this challenge. We have come up with a very simple but effective solution. We have proposed a modification to the traditional architecture of serial fusion based multi-biometric verification systems. With rigorous experiments on the NIST multi-modal dataset and using three serial fusion based multi-biometric verification schemes, we demonstrated that our proposed architecture significantly improves the performance of serial fusion based multi-biometric verification systems.
{"title":"An Enhanced Architecture for Serial Fusion based Multi-biometric Verification System","authors":"M. Hossain, Jundong Chen, K. Rahman","doi":"10.1109/ISNCC.2018.8530995","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530995","url":null,"abstract":"The traditional architecture of serial fusion based multi-biometric verification systems places an average performing or the worst performing individual verifier in the final stage. Because the final stage gives the verification decision using a single threshold and takes on the most confusing samples which are rejected by all previous stages, an average or the worst performing individual verifier may incur high verification errors in the final stage, which may negatively impact the performance of the whole system. Unfortunately, it is not possible to place a strong individual verifier in the final stage of a traditional architecture because if we place a strong individual verifier in the final stage, we will have to place a weak individual verifier in an earlier stage. Studies show that placing a weak individual verifier in an earlier stage worsens the performance of the whole system by giving more wrong decision earlier. Hence, the challenge is-how can we place the best performing individual verifier in the first stage and at the same time not place an average or the worst performing individual verifier in the final stage? In this paper, we address this challenge. We have come up with a very simple but effective solution. We have proposed a modification to the traditional architecture of serial fusion based multi-biometric verification systems. With rigorous experiments on the NIST multi-modal dataset and using three serial fusion based multi-biometric verification schemes, we demonstrated that our proposed architecture significantly improves the performance of serial fusion based multi-biometric verification systems.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114183785","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531052
Ákos Leiter
In the recent years, the research and development of the 5th generation mobile networks (5G) has been continuously accelerating. Several new architectures and usability models have emerged from scratch and will influence the way how the 5G and the whole telecommunication industry look like. Some principles come from the “traditional” Information Technology (IT) industry like cloud computing, others internally such as Software Defined Networks (SDN). In this paper I would like to propose a new way of utilizing telecommunication and cloud resources with introduction a so-called Cloud Stock concept which address the usage of cloud resources differently by creating real time prices.
{"title":"Cloud Stock Exchange for Telecommunication","authors":"Ákos Leiter","doi":"10.1109/ISNCC.2018.8531052","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531052","url":null,"abstract":"In the recent years, the research and development of the 5th generation mobile networks (5G) has been continuously accelerating. Several new architectures and usability models have emerged from scratch and will influence the way how the 5G and the whole telecommunication industry look like. Some principles come from the “traditional” Information Technology (IT) industry like cloud computing, others internally such as Software Defined Networks (SDN). In this paper I would like to propose a new way of utilizing telecommunication and cloud resources with introduction a so-called Cloud Stock concept which address the usage of cloud resources differently by creating real time prices.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114663950","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530985
Salman Behboudi Amlashi, A. Araghi, G. Dadashzadeh
In the present paper, a photoconductive antenna is designed to work as both pulse-terahertz emitter and receiver. The proposed two-port antenna benefits from polarization diversity with high sensitivity of polarization detection. The antenna electrodes consist of three arms and two gaps that can be excited by laser illumination. An 800 nm wavelength laser beam with output power of 80 mW, 100 MHz repetition rate, and 100 fs laser pulse duration is considered as optical excitation. Each port stimulates a pulse that its polarization is orthogonal to that of the other one according to their arrangement. Along with GaAs as photoconductive substrate beneath the antenna electrodes, an anti-reflection coating of Taconic RF-35 is used for depreciating unwanted terahertz echoes. The simulated results clarify that the proposed antenna shows polarization diversity and also, proper broadband behavior.
{"title":"Design of a Photoconductive Antenna for Pulsed-Terahertz Spectroscopy with Polarization Diversity","authors":"Salman Behboudi Amlashi, A. Araghi, G. Dadashzadeh","doi":"10.1109/ISNCC.2018.8530985","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530985","url":null,"abstract":"In the present paper, a photoconductive antenna is designed to work as both pulse-terahertz emitter and receiver. The proposed two-port antenna benefits from polarization diversity with high sensitivity of polarization detection. The antenna electrodes consist of three arms and two gaps that can be excited by laser illumination. An 800 nm wavelength laser beam with output power of 80 mW, 100 MHz repetition rate, and 100 fs laser pulse duration is considered as optical excitation. Each port stimulates a pulse that its polarization is orthogonal to that of the other one according to their arrangement. Along with GaAs as photoconductive substrate beneath the antenna electrodes, an anti-reflection coating of Taconic RF-35 is used for depreciating unwanted terahertz echoes. The simulated results clarify that the proposed antenna shows polarization diversity and also, proper broadband behavior.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114571147","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531077
Qi Zeng, Junfang Zhong, Xianhua Niu
To improve the anti-jamming capability and the spectrum efficiency in wireless communication links with high-moving targets, an adaptive beamforming (BF) technique based on antenna array is proposed for FH systems in this paper (i.e., FH-BF systems). A modified FH-BF receiver structure based on uniform circle array (UCA) is designed so as to reduce the steering-vector fluctuation and to improve the convergence rate. The performance of the proposed system, i.e., bit-error-rate (BER), output signal-to-interference-and-noise (SINR) and convergence rate of the adaptive BF, are fully investigated under a serious jamming attack. The simulation results show that the proposed FH-BF system with $M$-ary FSK signal converges in a reasonably low number of snapshots, which implies that the beamformer can quickly keep up with the position change of high-speed jammers. In addition, the proposed system can significantly offer the additional SINR gains, and improve the anti-jamming capability without any extra cost of bandwidth.
{"title":"An Efficient Jamming Rejection Scheme of FH-Based Adaptive Beamforming System for High-Mobility Communication Links","authors":"Qi Zeng, Junfang Zhong, Xianhua Niu","doi":"10.1109/ISNCC.2018.8531077","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531077","url":null,"abstract":"To improve the anti-jamming capability and the spectrum efficiency in wireless communication links with high-moving targets, an adaptive beamforming (BF) technique based on antenna array is proposed for FH systems in this paper (i.e., FH-BF systems). A modified FH-BF receiver structure based on uniform circle array (UCA) is designed so as to reduce the steering-vector fluctuation and to improve the convergence rate. The performance of the proposed system, i.e., bit-error-rate (BER), output signal-to-interference-and-noise (SINR) and convergence rate of the adaptive BF, are fully investigated under a serious jamming attack. The simulation results show that the proposed FH-BF system with $M$-ary FSK signal converges in a reasonably low number of snapshots, which implies that the beamformer can quickly keep up with the position change of high-speed jammers. In addition, the proposed system can significantly offer the additional SINR gains, and improve the anti-jamming capability without any extra cost of bandwidth.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124860023","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531027
T. Panetti, A. D’Ambrogio
This paper illustrates an approach, denoted as MDA-VIEW, for the automated generation of Web-based applications in the data management domain. The run-time application generated by use of the MDA-VIEW approach is ready to be deployed into a multi-tenant cloud environment. The approach takes into account both the fact that create, read, update and delete (CRUD) operations contribute to a large part of software development in data-intensive applications and the fact that modern databases can be used for storing additional information like data model documentation and integrity checks. By using the proposed approach, CRUD operations, integrity checks and user documentation can be auto-generated from the physical data model specified in standard UML by use of a conventional CASE tool. We define MDA-VIEW as a complexity-less approach, meaning that developers can easily create very complex applications by auto-generating them from data model definitions. The paper also describes a proof of concept by illustrating both the approach implementation and an example application to the generation of a data-intensive business software.
{"title":"A Complexity-less Approach for Automated Development of Data-intensive Web Applications","authors":"T. Panetti, A. D’Ambrogio","doi":"10.1109/ISNCC.2018.8531027","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531027","url":null,"abstract":"This paper illustrates an approach, denoted as MDA-VIEW, for the automated generation of Web-based applications in the data management domain. The run-time application generated by use of the MDA-VIEW approach is ready to be deployed into a multi-tenant cloud environment. The approach takes into account both the fact that create, read, update and delete (CRUD) operations contribute to a large part of software development in data-intensive applications and the fact that modern databases can be used for storing additional information like data model documentation and integrity checks. By using the proposed approach, CRUD operations, integrity checks and user documentation can be auto-generated from the physical data model specified in standard UML by use of a conventional CASE tool. We define MDA-VIEW as a complexity-less approach, meaning that developers can easily create very complex applications by auto-generating them from data model definitions. The paper also describes a proof of concept by illustrating both the approach implementation and an example application to the generation of a data-intensive business software.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267955","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530999
Mostafa M. Abdelhakam, M. M. Elmesalawy
In this paper, we consider the joint transmission coordinated multi-point (CoMP) technique in a downlink heterogeneous cloud radio access network (C-RAN). The joint beamforming design and baseband unit (BBU) computational resources allocation problem in Heterogenous C-RAN is investigated. This problem is formulated as an optimization problem to minimize the overall system power consumption under per-user quality-of-service (QoS), fronthaul capacity, per-antenna transmit power and per-remote radio head (RRH) total transmit power constraints. The considered problem is a non-convex optimization problem due to the presence of the binary indicator in the fronthaul constraints. To address this challenge, we use the re-weighted $boldsymbol{ell}_{1}$-norm technique and reformulate the problem into a tractable form. Then, we transform the problem to a weighted sum mean square error (MSE) minimization problem and propose a weighted minimum mean square error (WMMSE) algorithm to solve it. Simulation results are provided to verify the effectiveness of the proposed algorithm.
{"title":"Joint Beamforming Design and BBU Computational Resources Allocation in Heterogeneous C-RAN with QoS Guarantee","authors":"Mostafa M. Abdelhakam, M. M. Elmesalawy","doi":"10.1109/ISNCC.2018.8530999","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530999","url":null,"abstract":"In this paper, we consider the joint transmission coordinated multi-point (CoMP) technique in a downlink heterogeneous cloud radio access network (C-RAN). The joint beamforming design and baseband unit (BBU) computational resources allocation problem in Heterogenous C-RAN is investigated. This problem is formulated as an optimization problem to minimize the overall system power consumption under per-user quality-of-service (QoS), fronthaul capacity, per-antenna transmit power and per-remote radio head (RRH) total transmit power constraints. The considered problem is a non-convex optimization problem due to the presence of the binary indicator in the fronthaul constraints. To address this challenge, we use the re-weighted $boldsymbol{ell}_{1}$-norm technique and reformulate the problem into a tractable form. Then, we transform the problem to a weighted sum mean square error (MSE) minimization problem and propose a weighted minimum mean square error (WMMSE) algorithm to solve it. Simulation results are provided to verify the effectiveness of the proposed algorithm.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129716800","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530963
Burak H. Çorak, F. Y. Okay, Metehan Guzel, Sahin Murt, S. Özdemir
With the proliferation of machine-to-machine communication, there are many communication protocols standardized for IoT applications. Performances of these protocols may significantly deviate from each other even under the same operating conditions. In this paper, we quantitatively compare the performances of a set of well-known IoT communication protocols, namely CoAP (Constrained Application Protocol), MQTT (Message Queuing Telemetry Transport) and XMPP (Extendible Message Persistent Protocol) in a real-world testbed. CoAP employs UDP packets for transmission while others use TCP. For this purpose, we design as small testbed that collects real-time environmental data. By designing such a system, we aim to reveal the differences among protocols in terms of packet creation time and packet transmission time. The obtained results show that XMPP is worse than other protocols in both metrics and MQTT and CoAP perform almost equally.
{"title":"Comparative Analysis of IoT Communication Protocols","authors":"Burak H. Çorak, F. Y. Okay, Metehan Guzel, Sahin Murt, S. Özdemir","doi":"10.1109/ISNCC.2018.8530963","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530963","url":null,"abstract":"With the proliferation of machine-to-machine communication, there are many communication protocols standardized for IoT applications. Performances of these protocols may significantly deviate from each other even under the same operating conditions. In this paper, we quantitatively compare the performances of a set of well-known IoT communication protocols, namely CoAP (Constrained Application Protocol), MQTT (Message Queuing Telemetry Transport) and XMPP (Extendible Message Persistent Protocol) in a real-world testbed. CoAP employs UDP packets for transmission while others use TCP. For this purpose, we design as small testbed that collects real-time environmental data. By designing such a system, we aim to reveal the differences among protocols in terms of packet creation time and packet transmission time. The obtained results show that XMPP is worse than other protocols in both metrics and MQTT and CoAP perform almost equally.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130898524","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531034
Teklay Gebremichael, Ulf Jennehag, M. Gidlund
Group communication in the context of Internet of Things (IoT) is an efficient and fast way of broadcasting group messages. A message needs to be sent securely to maintain confidentiality of data and privacy of users. The main challenges in sharing group keys consist in designing and implementing a group key establishment scheme that is feasible for devices with limited computational capabilities. Existing group establishment schemes do not offer a good solution for resource-constrained IoT devices, a solution that provides secure group key management procedures when new nodes join or leave the group without compromising the security of the system. In this paper, we propose a lightweight and computationally secure group key establishment scheme suitable for resource constrained IoT networks. The proposed scheme is based on elliptic curve cryptography and cryptographic one-way accumulators. We show how to combine the aforementioned concepts to design a group key establishment scheme that guarantees both forward and backward secrecy. Finally, we show how the established group key is updated when the group size dynamically changes and how the proposed solution can be used with block and stream ciphers.
{"title":"Lightweight IoT Group Key Establishment Scheme Using One-way Accumulator","authors":"Teklay Gebremichael, Ulf Jennehag, M. Gidlund","doi":"10.1109/ISNCC.2018.8531034","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531034","url":null,"abstract":"Group communication in the context of Internet of Things (IoT) is an efficient and fast way of broadcasting group messages. A message needs to be sent securely to maintain confidentiality of data and privacy of users. The main challenges in sharing group keys consist in designing and implementing a group key establishment scheme that is feasible for devices with limited computational capabilities. Existing group establishment schemes do not offer a good solution for resource-constrained IoT devices, a solution that provides secure group key management procedures when new nodes join or leave the group without compromising the security of the system. In this paper, we propose a lightweight and computationally secure group key establishment scheme suitable for resource constrained IoT networks. The proposed scheme is based on elliptic curve cryptography and cryptographic one-way accumulators. We show how to combine the aforementioned concepts to design a group key establishment scheme that guarantees both forward and backward secrecy. Finally, we show how the established group key is updated when the group size dynamically changes and how the proposed solution can be used with block and stream ciphers.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121988202","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530998
Carlo Augusto Grazia, Martin Klapež, M. Casoni
In this paper, we present and characterize a phenomenon that arises when network congestion is met with packet redundancy at a distributed bottleneck. Congestion typically causes packet drops at the queueing level, especially when Active Queue Management techniques are employed to mitigate the bufferbloat effect. Redundancy may be present in the form of packet replication over different paths, as a solution to increase network resilience and network availability guarantees. When both network congestion and packet redundancy are in place, a counterintuitive throughput-boosting effect may originate from them. We named this phenomenon bufferboost, for the key role played by packet drops introduced to avoid bufferbloat effects. The contributions of this paper are the definition of the buffer-boost phenomenon, its modelling through a mathematical upper bound formulation, its isolation in an emulated environment for reproducibility and its validation through an extensive numerical evaluation that also verifies the introduced model. Results show that bufferboost is a favorable side effect able to boost network throughput.
{"title":"The Bufferboost Effect: when Drops and Redundancy boost the Throughput","authors":"Carlo Augusto Grazia, Martin Klapež, M. Casoni","doi":"10.1109/ISNCC.2018.8530998","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530998","url":null,"abstract":"In this paper, we present and characterize a phenomenon that arises when network congestion is met with packet redundancy at a distributed bottleneck. Congestion typically causes packet drops at the queueing level, especially when Active Queue Management techniques are employed to mitigate the bufferbloat effect. Redundancy may be present in the form of packet replication over different paths, as a solution to increase network resilience and network availability guarantees. When both network congestion and packet redundancy are in place, a counterintuitive throughput-boosting effect may originate from them. We named this phenomenon bufferboost, for the key role played by packet drops introduced to avoid bufferbloat effects. The contributions of this paper are the definition of the buffer-boost phenomenon, its modelling through a mathematical upper bound formulation, its isolation in an emulated environment for reproducibility and its validation through an extensive numerical evaluation that also verifies the introduced model. Results show that bufferboost is a favorable side effect able to boost network throughput.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116201342","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531046
D. Basu, G. S. Gupta, Yan Zhang, A. Nag, L. Doyle
Transmission power control in energy-constrained mobile wireless sensor nodes is a necessary means to extend the battery lifetime and reduce the overall operational expenditure. The body-wearable sensors are perhaps the best examples when they are used for tracking and monitoring health of individuals and to carry out data analysis for possible symptoms of any disease. In indoor environments, the challenge is increased manifold due to complex multi-path propagation and temporal variation of link quality. This paper has enhanced our previous work on the state based adaptive power control protocol (SAPC) to suit well in indoor dynamic radio environments. The proposed protocol adjusts the state-transition rate $R$ (drop-off rate) from a higher to a lower state, depending on the radio link quality. This improvement is implemented in SAPC protocol and renamed as SAPC-R. This protocol is compared with an existing practical adaptive power control protocol (P-ATPC) that can track variations in the radio link quality, and select an appropriate transmission power level and the number of retransmissions. The aim is to keep the algorithm computationally simple as it will run on battery powered devices and therefore are energy-constrained. Simulation results show that SAPC-R can save at least 25% energy as compared to P-ATPC. Results from the experiments that were conducted inside a University building show that by using the SAPC-R algorithm, energy consumption per successful transmission can be reduced by at least 15% as compared to P-ATPC while the packet success rates are comparable. This is a significant improvement, given the small changes in current consumption corresponding to the large changes in transmission power in present-day low power wireless transmitters.
{"title":"Experimental evaluation of SAPC-R: an adaptive power control protocol for mobile sensors","authors":"D. Basu, G. S. Gupta, Yan Zhang, A. Nag, L. Doyle","doi":"10.1109/ISNCC.2018.8531046","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531046","url":null,"abstract":"Transmission power control in energy-constrained mobile wireless sensor nodes is a necessary means to extend the battery lifetime and reduce the overall operational expenditure. The body-wearable sensors are perhaps the best examples when they are used for tracking and monitoring health of individuals and to carry out data analysis for possible symptoms of any disease. In indoor environments, the challenge is increased manifold due to complex multi-path propagation and temporal variation of link quality. This paper has enhanced our previous work on the state based adaptive power control protocol (SAPC) to suit well in indoor dynamic radio environments. The proposed protocol adjusts the state-transition rate $R$ (drop-off rate) from a higher to a lower state, depending on the radio link quality. This improvement is implemented in SAPC protocol and renamed as SAPC-R. This protocol is compared with an existing practical adaptive power control protocol (P-ATPC) that can track variations in the radio link quality, and select an appropriate transmission power level and the number of retransmissions. The aim is to keep the algorithm computationally simple as it will run on battery powered devices and therefore are energy-constrained. Simulation results show that SAPC-R can save at least 25% energy as compared to P-ATPC. Results from the experiments that were conducted inside a University building show that by using the SAPC-R algorithm, energy consumption per successful transmission can be reduced by at least 15% as compared to P-ATPC while the packet success rates are comparable. This is a significant improvement, given the small changes in current consumption corresponding to the large changes in transmission power in present-day low power wireless transmitters.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121469320","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
扫码关注我们
求助内容：
应助结果提醒方式：