Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798786
H. Q. Tran, C. Phan, Quoc-Tuan Vien
As a potential access strategy in 5G mobile communication systems, non-orthogonal multiple access (NOMA) has been proposed as a supplement to the traditional orthogonal multiple access (OMA). This paper investigates simultaneous wireless information and power transfer (SWIPT) in a NOMA relaying system. The data is transferred from a source to two end terminals among which the one close to the source acts as a relay employing decode-and-forward protocol to assist the far-end one. In order to simultaneously harvest the energy and information processing at relay node, power-splitting relaying (PSR) and time switching-based relaying (TSR) protocols are sequentially considered. Outage probability and ergodic rate of both protocols are firstly analyzed to realize the impacts of various parameters including energy harvesting time, power splitting ratio, energy harvesting efficiency, source data rate, and the distance between the source and the relay node. Numerical results are then provided to validate the analytical findings. It is shown that the PSR outperforms the TSR at normal SNR regime in terms of throughput and ergodic rate.
{"title":"On the Performance of Regenerative Relaying for SWIPT in NOMA Systems","authors":"H. Q. Tran, C. Phan, Quoc-Tuan Vien","doi":"10.1109/ICT.2019.8798786","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798786","url":null,"abstract":"As a potential access strategy in 5G mobile communication systems, non-orthogonal multiple access (NOMA) has been proposed as a supplement to the traditional orthogonal multiple access (OMA). This paper investigates simultaneous wireless information and power transfer (SWIPT) in a NOMA relaying system. The data is transferred from a source to two end terminals among which the one close to the source acts as a relay employing decode-and-forward protocol to assist the far-end one. In order to simultaneously harvest the energy and information processing at relay node, power-splitting relaying (PSR) and time switching-based relaying (TSR) protocols are sequentially considered. Outage probability and ergodic rate of both protocols are firstly analyzed to realize the impacts of various parameters including energy harvesting time, power splitting ratio, energy harvesting efficiency, source data rate, and the distance between the source and the relay node. Numerical results are then provided to validate the analytical findings. It is shown that the PSR outperforms the TSR at normal SNR regime in terms of throughput and ergodic rate.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545867","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798849
Nguyen Thi Thu Hang, Nguyen Chien Trinh, Nguyen Tien Ban
In multievent wireless sensor networks (WSNs), various events can concurrently require different quality of service (QoS) provision based on different priority levels. For Carrier Sense Multiple Access p-persistent Medium Access Control (MAC) protocol, $boldsymbol{p}$ is used to reduce the chance of collision and improve efficiency. In this paper, we propose different $boldsymbol{p}$ values for different priority levels so that higher priority data frames have the higher probability accessing the shared medium and have better QoS in terms of delay and reliability. Mathematic analysis and simulation show that our proposed Priority MAC protocol for Multi-Event wireless sensor network (PMME) protocol with different $boldsymbol{p}$ values significantly reduce packet delay to all four priority packets and keep high packet success rate compared to other two priority MAC protocols named QoS aware energy-efficient (QAEE) and Multi-priority based QoS (MPQ) in multievent WSNs.
在多事件无线传感器网络(wsn)中，不同的事件可以根据不同的优先级同时要求提供不同的服务质量(QoS)。对于Carrier Sense Multiple Access p-persistent Medium Access Control (MAC)协议，使用$boldsymbol{p}$是为了减少碰撞的机会，提高效率。在本文中，我们针对不同的优先级级别提出了不同的$boldsymbol{p}$值，使得优先级越高的数据帧访问共享介质的概率越高，并且在延迟和可靠性方面具有更好的QoS。数学分析和仿真结果表明，在多事件无线传感器网络(PMME)中，与其他两种优先级MAC协议QAEE和MPQ相比，采用不同$boldsymbol{p}$值的多事件无线传感器网络(PMME)协议，所提出的优先级MAC协议显著降低了4个优先级数据包的数据包延迟，并保持了较高的数据包成功率。
{"title":"Delay and Reliability Analysis of p-persistent Carrier Sense Multiple Access for Multievent Wireless Sensor Network","authors":"Nguyen Thi Thu Hang, Nguyen Chien Trinh, Nguyen Tien Ban","doi":"10.1109/ICT.2019.8798849","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798849","url":null,"abstract":"In multievent wireless sensor networks (WSNs), various events can concurrently require different quality of service (QoS) provision based on different priority levels. For Carrier Sense Multiple Access p-persistent Medium Access Control (MAC) protocol, $boldsymbol{p}$ is used to reduce the chance of collision and improve efficiency. In this paper, we propose different $boldsymbol{p}$ values for different priority levels so that higher priority data frames have the higher probability accessing the shared medium and have better QoS in terms of delay and reliability. Mathematic analysis and simulation show that our proposed Priority MAC protocol for Multi-Event wireless sensor network (PMME) protocol with different $boldsymbol{p}$ values significantly reduce packet delay to all four priority packets and keep high packet success rate compared to other two priority MAC protocols named QoS aware energy-efficient (QAEE) and Multi-priority based QoS (MPQ) in multievent WSNs.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117169929","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798780
Racha Gouareb, V. Friderikos, H. Aghvami
To deploy a wide range of services, improve network flexibility and facilitate the deployment and maintenance of network services, virtualization of network functions promises to make the networks more agile and efficient. Network functions virtualization (NFV) enables network service providers to deal with the increase of traffic of data and the deployment of new services by offering a more scalable and flexible network. Many existing studies on NFV have dealt with the placement of virtual network functions (VNFs) in the software layer as a problem of deploying different network function instances within the network without considering routing and horizontal scalability. In the proposed model, we aim to minimize latency, considering horizontal scaling of VMs by placing VNFs across physical nodes. Routing and placement of VNFs are linked and have a significant impact on latency especially for delay-critical services. Therefore, we aim at optimizing the distribution and utilization of available resources and meet user/tenant requirements with the objective of minimizing the overall accumulated latency on both the edge clouds, where VNFs are running and the flow routing paths.
{"title":"Placement and Routing of VNFs for Horizontal Scaling","authors":"Racha Gouareb, V. Friderikos, H. Aghvami","doi":"10.1109/ICT.2019.8798780","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798780","url":null,"abstract":"To deploy a wide range of services, improve network flexibility and facilitate the deployment and maintenance of network services, virtualization of network functions promises to make the networks more agile and efficient. Network functions virtualization (NFV) enables network service providers to deal with the increase of traffic of data and the deployment of new services by offering a more scalable and flexible network. Many existing studies on NFV have dealt with the placement of virtual network functions (VNFs) in the software layer as a problem of deploying different network function instances within the network without considering routing and horizontal scalability. In the proposed model, we aim to minimize latency, considering horizontal scaling of VMs by placing VNFs across physical nodes. Routing and placement of VNFs are linked and have a significant impact on latency especially for delay-critical services. Therefore, we aim at optimizing the distribution and utilization of available resources and meet user/tenant requirements with the objective of minimizing the overall accumulated latency on both the edge clouds, where VNFs are running and the flow routing paths.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902005","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798806
Pol Serra i Lidón, G. Caso, L. D. Nardis, Alireza Mohammadpour, Eljona Zanaj, Maria-Gabriella Di Benedetto
In the context of massive Machine Type Communication (mMTC), 3GPP has introduced in Release 13 the Narrowband-IoT (NB-IoT) standard, that appears particularly suitable for uplink, delay-tolerant low-rate communications. On the one hand, being compatible with the existing 4G cellular systems, and also envisioned as a primary player in next 5G, NB-IoT is developed upon the existing heterogeneous architecture, formed by several overlapping tiers (HetNets), e.g. macro and small cells. On the other hand, in order to improve coverage and connection reliability in harsh environments, NB-IoT adopts its own coverage enhancement (CE) techniques, mainly based on signal repetition procedures, thus questioning the need of low-level tiers in such new communication scenario. This paper analyzes the performance of NB-IoT in a HetNets system, taking into account its specific features, and how they combine with a multi-tier architecture. The analysis is carried out by simulation, via proper adaptation of ns-3 simulator to the NB-IoT scenario. Results show that the use of a 2-tier dedicated architecture nicely combines with the NB-IoT CE technique, boosting system efficiency and coverage, while also triggering improved load balancing.
{"title":"Two-tier Architecture for NB-IoT: Improving Coverage and Load Balancing","authors":"Pol Serra i Lidón, G. Caso, L. D. Nardis, Alireza Mohammadpour, Eljona Zanaj, Maria-Gabriella Di Benedetto","doi":"10.1109/ICT.2019.8798806","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798806","url":null,"abstract":"In the context of massive Machine Type Communication (mMTC), 3GPP has introduced in Release 13 the Narrowband-IoT (NB-IoT) standard, that appears particularly suitable for uplink, delay-tolerant low-rate communications. On the one hand, being compatible with the existing 4G cellular systems, and also envisioned as a primary player in next 5G, NB-IoT is developed upon the existing heterogeneous architecture, formed by several overlapping tiers (HetNets), e.g. macro and small cells. On the other hand, in order to improve coverage and connection reliability in harsh environments, NB-IoT adopts its own coverage enhancement (CE) techniques, mainly based on signal repetition procedures, thus questioning the need of low-level tiers in such new communication scenario. This paper analyzes the performance of NB-IoT in a HetNets system, taking into account its specific features, and how they combine with a multi-tier architecture. The analysis is carried out by simulation, via proper adaptation of ns-3 simulator to the NB-IoT scenario. Results show that the use of a 2-tier dedicated architecture nicely combines with the NB-IoT CE technique, boosting system efficiency and coverage, while also triggering improved load balancing.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130592336","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798834
Ei Nandar Maung, Yukiko Shimbo, Hirofumi Suganuma, F. Maehara
This paper proposes a low complexity fair user scheduling method employing semi-orthogonal user selection (SUS) for multi-user multiple-input multi-output (MU-MIMO) systems. The intent of the proposed approach is to consider the spatial orthogonality of users into fair user scheduling of the MU-MIMO system, which enhances the system capacity when compared to the traditional round robin (RR) based user scheduling. In the proposed method, the spatial orthogonality is calculated based on SUS which only requires the calculation of inner products among the channel state information (CSI). Therefore, both the improvement of the system capacity and fairness can be achieved with a reduced computational load. Moreover, in contrast to proportional fairness (PF), the proposed user scheduling does not require the heavy calculation of all possible user combinations as is required in MU-MIMO precoding, which is an effective and practical approach. The effectiveness of the proposed method is demonstrated and compared with RR and PF in terms of fairness and computational load.
{"title":"Low Complexity Fair User Scheduling Employing Spatial Orthogonality for MU-MIMO Systems","authors":"Ei Nandar Maung, Yukiko Shimbo, Hirofumi Suganuma, F. Maehara","doi":"10.1109/ICT.2019.8798834","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798834","url":null,"abstract":"This paper proposes a low complexity fair user scheduling method employing semi-orthogonal user selection (SUS) for multi-user multiple-input multi-output (MU-MIMO) systems. The intent of the proposed approach is to consider the spatial orthogonality of users into fair user scheduling of the MU-MIMO system, which enhances the system capacity when compared to the traditional round robin (RR) based user scheduling. In the proposed method, the spatial orthogonality is calculated based on SUS which only requires the calculation of inner products among the channel state information (CSI). Therefore, both the improvement of the system capacity and fairness can be achieved with a reduced computational load. Moreover, in contrast to proportional fairness (PF), the proposed user scheduling does not require the heavy calculation of all possible user combinations as is required in MU-MIMO precoding, which is an effective and practical approach. The effectiveness of the proposed method is demonstrated and compared with RR and PF in terms of fairness and computational load.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125760525","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798846
Bryer Jeannotte, Ali Tekeoglu
Products that are connected and controlled remotely via the Internet are becoming more prevalent, and as a result, homes and businesses have ever increasing attack surfaces on their networks. To raise the standard of security, companies need more ways to automate testing of the most commonly found issues with IoT devices against their products. The creation of an automated security testing framework, such as Artorias, allows companies to automate the process of finding easy to identify problems, saving time for more advanced and manual processes of security and functional testing on a product. To show the framework's stability and reliability, things such as proper coding standards should be adhered to, proper management of the project should be present, and unit-tests or code coverage of the framework should be created and maintained. This ongoing project bridges together the principles of security and proper planning and development of a larger programming effort. In this paper, we introduce the IoT Security Testing Framework Artorias, and present an extensible framework that interested research community members can extend for more coverage on privacy and security issues of IoT devices.
{"title":"Artorias: IoT Security Testing Framework","authors":"Bryer Jeannotte, Ali Tekeoglu","doi":"10.1109/ICT.2019.8798846","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798846","url":null,"abstract":"Products that are connected and controlled remotely via the Internet are becoming more prevalent, and as a result, homes and businesses have ever increasing attack surfaces on their networks. To raise the standard of security, companies need more ways to automate testing of the most commonly found issues with IoT devices against their products. The creation of an automated security testing framework, such as Artorias, allows companies to automate the process of finding easy to identify problems, saving time for more advanced and manual processes of security and functional testing on a product. To show the framework's stability and reliability, things such as proper coding standards should be adhered to, proper management of the project should be present, and unit-tests or code coverage of the framework should be created and maintained. This ongoing project bridges together the principles of security and proper planning and development of a larger programming effort. In this paper, we introduce the IoT Security Testing Framework Artorias, and present an extensible framework that interested research community members can extend for more coverage on privacy and security issues of IoT devices.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128516134","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 : 2019-04-01DOI: 10.1109/ICT.2019.8798848
Thinh Duy Tran, L. Le
The radio frequency (RF)-powered cognitive radio network (CRN) has been introduced with the harvest-then-transmit (HTT) protocol. Here, wireless nodes harvest energy from the ambient signal and transmit data through sharing communication channels with primary users. The transmission efficiency of the HTT protocol, however, depends on the primary channel condition, which varies over time. On the other hand, backscatter communication (BSC) can be integrated into the RF-powered communication to circumvent limitations of the HTT protocol. Therefore, efficient combination of both communication modes is crucial to achieve the highest throughput for the secondary system while respecting regulation constraints of the primary system. In this paper, the Stackelberg game approach is employed to study the interaction between a primary transmitter (PT) and multiple secondary transmitters (STs) who are interested in maximizing their own utilities. Specifically, the PT imposes prices charged to the STs based on the level of interference emitted by the STs during their HTT data transmission mode. Given the prices, the STs optimize the time fractions in the BSC and HTT modes to maximize their utilities. We apply the backward induction method to analyze the game and prove the uniqueness of the Nash equilibrium (NE) for the underlying game. Extensive numerical results confirm the efficacy of our proposed framework in balancing the utilities achieved by the players. They also show that our proposed design framework outperforms other baseline approaches.
{"title":"Hybrid Backscatter and Underlay Transmissions in RF-Powered Cognitive Radio Networks","authors":"Thinh Duy Tran, L. Le","doi":"10.1109/ICT.2019.8798848","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798848","url":null,"abstract":"The radio frequency (RF)-powered cognitive radio network (CRN) has been introduced with the harvest-then-transmit (HTT) protocol. Here, wireless nodes harvest energy from the ambient signal and transmit data through sharing communication channels with primary users. The transmission efficiency of the HTT protocol, however, depends on the primary channel condition, which varies over time. On the other hand, backscatter communication (BSC) can be integrated into the RF-powered communication to circumvent limitations of the HTT protocol. Therefore, efficient combination of both communication modes is crucial to achieve the highest throughput for the secondary system while respecting regulation constraints of the primary system. In this paper, the Stackelberg game approach is employed to study the interaction between a primary transmitter (PT) and multiple secondary transmitters (STs) who are interested in maximizing their own utilities. Specifically, the PT imposes prices charged to the STs based on the level of interference emitted by the STs during their HTT data transmission mode. Given the prices, the STs optimize the time fractions in the BSC and HTT modes to maximize their utilities. We apply the backward induction method to analyze the game and prove the uniqueness of the Nash equilibrium (NE) for the underlying game. Extensive numerical results confirm the efficacy of our proposed framework in balancing the utilities achieved by the players. They also show that our proposed design framework outperforms other baseline approaches.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814172","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}
Mobile Social Networks (MSNs) have been evolving and enabling various fields in recent years. Recent advances in mobile edge computing, caching, and device-to-device communications, can have significant impacts on 5G systems. In those settings, identifying central users is crucial. It can provide important insights into designing and deploying diverse services and applications. However, it is challenging to evaluate the centrality of nodes in MSNs with dynamic environments. In this paper, we propose a Social-Relation based Centrality (SoReC) measure, in which social network information is used to quantify the influence of each user in MSNs. We first introduce a new metric to estimate direct social relations among users via direct contacts, and then extend the metric to explore indirect social relations among users bridging to their neighbors. Based on direct and indirect social relations, we detect the influence spheres of users and quantify their influence in the networks. Simulations on real-world networks show that the proposed measure can perform well in identifying future influential users in MSNs.
{"title":"SoReC: A Social-Relation Based Centrality Measure in Mobile Social Networks","authors":"Bowen Li, Zhenxiang Gao, Xu Shan, Weihua Zhou, Emilio Ferrara","doi":"10.1109/ICT.2019.8798844","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798844","url":null,"abstract":"Mobile Social Networks (MSNs) have been evolving and enabling various fields in recent years. Recent advances in mobile edge computing, caching, and device-to-device communications, can have significant impacts on 5G systems. In those settings, identifying central users is crucial. It can provide important insights into designing and deploying diverse services and applications. However, it is challenging to evaluate the centrality of nodes in MSNs with dynamic environments. In this paper, we propose a Social-Relation based Centrality (SoReC) measure, in which social network information is used to quantify the influence of each user in MSNs. We first introduce a new metric to estimate direct social relations among users via direct contacts, and then extend the metric to explore indirect social relations among users bridging to their neighbors. Based on direct and indirect social relations, we detect the influence spheres of users and quantify their influence in the networks. Simulations on real-world networks show that the proposed measure can perform well in identifying future influential users in MSNs.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132547011","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 : 2019-02-15DOI: 10.1109/ICT.2019.8798857
S. Teli, S. Zvánovec, Zabih Ghassemlooy
This paper experimentally investigates the performance of visible light based optical camera communications (OCC) link with motion detection (MD) for the optical Internet of things applications. This efficient MD can be considered another functionality of OCC in addition to traditional features of vision, illumination data communications and sensing. The experiments were conducted in an indoor static downlink OCC system employing a mobile phone front camera is employed as the receiver and an $8times 8$ red, green, and blue (RGB) light-emitting diode array as the transmitter. The motion is detected by observing the user's finger movement in the form of centroid through the OCC link via a camera. The experiment results demonstrate that, the proposed scheme can detect all considered motions accurately with acceptable bit error rate (BER) performances at a transmission distance of up to 80 cm. We show a BER of $1.7times 10^{-3}$ below the forward error correction limit of $3.8times 10^{-3}$ over a transmission distance of up to 1 m. The proposed neuron based MD combined together with OCC can be considered an efficient system, which provides illumination, communications, and motion detection in a convenient smart home environment.
{"title":"Experimental Investigation of Neuron Based Motion Detection in Internet of Things using Optical Camera Communications","authors":"S. Teli, S. Zvánovec, Zabih Ghassemlooy","doi":"10.1109/ICT.2019.8798857","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798857","url":null,"abstract":"This paper experimentally investigates the performance of visible light based optical camera communications (OCC) link with motion detection (MD) for the optical Internet of things applications. This efficient MD can be considered another functionality of OCC in addition to traditional features of vision, illumination data communications and sensing. The experiments were conducted in an indoor static downlink OCC system employing a mobile phone front camera is employed as the receiver and an $8times 8$ red, green, and blue (RGB) light-emitting diode array as the transmitter. The motion is detected by observing the user's finger movement in the form of centroid through the OCC link via a camera. The experiment results demonstrate that, the proposed scheme can detect all considered motions accurately with acceptable bit error rate (BER) performances at a transmission distance of up to 80 cm. We show a BER of $1.7times 10^{-3}$ below the forward error correction limit of $3.8times 10^{-3}$ over a transmission distance of up to 1 m. The proposed neuron based MD combined together with OCC can be considered an efficient system, which provides illumination, communications, and motion detection in a convenient smart home environment.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132940500","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
扫码关注我们
求助内容：
应助结果提醒方式：