Pub Date : 2019-10-24DOI: 10.4108/eai.24-10-2019.160985
T. Nguyen, Dang Qua Nguyen, V. Nguyen
This paper investigates power allocation for D2D communications in a Heterogeneous Network (HetNet) which includes a macro cell and pico cells, whereas femto cells are distributed inside. The objective is to minimize the total power consumption of D2D transmitter while satisfying a set of Quality of Service in D2D receivers and cellular users communication interference. To this end, we first obtain expression for the formula of signal to interference plus noise ratio (SINR) and spectral efficiency of each D2D receiver. Then, an optimization problem is formulated to minimize the total transmit power of D2D transmitters subject to QoS constraints. It is shown that this optimization problem is linear programming and it can be solved in polynomial time with standard tools. In addition, the maximization value of D2D pair transmission rates are determined with fixed cellular users parameters.
{"title":"Quality of Service Provisioning for D2D Users in Heterogeneous Networks","authors":"T. Nguyen, Dang Qua Nguyen, V. Nguyen","doi":"10.4108/eai.24-10-2019.160985","DOIUrl":"https://doi.org/10.4108/eai.24-10-2019.160985","url":null,"abstract":"This paper investigates power allocation for D2D communications in a Heterogeneous Network (HetNet) which includes a macro cell and pico cells, whereas femto cells are distributed inside. The objective is to minimize the total power consumption of D2D transmitter while satisfying a set of Quality of Service in D2D receivers and cellular users communication interference. To this end, we first obtain expression for the formula of signal to interference plus noise ratio (SINR) and spectral efficiency of each D2D receiver. Then, an optimization problem is formulated to minimize the total transmit power of D2D transmitters subject to QoS constraints. It is shown that this optimization problem is linear programming and it can be solved in polynomial time with standard tools. In addition, the maximization value of D2D pair transmission rates are determined with fixed cellular users parameters.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75039909","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-10-24DOI: 10.4108/eai.24-10-2019.160984
L. Dung, B. Nguyen, T. Hoang
{"title":"A Simulation Analysis of the Connectivity of Multi-hop Path between Two Arbitrary Nodes in Cognitive Radio Ad Hoc Networks","authors":"L. Dung, B. Nguyen, T. Hoang","doi":"10.4108/eai.24-10-2019.160984","DOIUrl":"https://doi.org/10.4108/eai.24-10-2019.160984","url":null,"abstract":"","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77525145","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-10-24DOI: 10.4108/eai.24-10-2019.160982
V. Dinh, Minh-Tuan Le, Vu-Duc Ngo, X. Tran, C. Ta
In this paper, we investigate the combination of linear group precoding with a transmit antenna group selection (TA-GS) algorithm based on the channel capacity analysis for Massive MIMO systems. Simultaneously, we propose a low complexity linear precoding algorithm that works on the selected antennas. The proposed precoder is developed based on the conventional linear precoders in combination with the element-base lattice reduction shortest longest vector technique having low complexity. Numerical and simulation results show that the system performance significantly improves when the transmit selection technique is applied. Besides, the proposed precoder has remarkably lower computational complexity than its LC-RBD-LR-ZF counterpart. The bit error rate (BER) performance of the proposed precoder can approach that of the LC-RBD-LR-ZF precoder as the number of groups increases, yet at the cost of higher detection complexity.
{"title":"Transmit Antenna Selection Aided Linear Group Precoding for Massive MIMO Systems","authors":"V. Dinh, Minh-Tuan Le, Vu-Duc Ngo, X. Tran, C. Ta","doi":"10.4108/eai.24-10-2019.160982","DOIUrl":"https://doi.org/10.4108/eai.24-10-2019.160982","url":null,"abstract":"In this paper, we investigate the combination of linear group precoding with a transmit antenna group selection (TA-GS) algorithm based on the channel capacity analysis for Massive MIMO systems. Simultaneously, we propose a low complexity linear precoding algorithm that works on the selected antennas. The proposed precoder is developed based on the conventional linear precoders in combination with the element-base lattice reduction shortest longest vector technique having low complexity. Numerical and simulation results show that the system performance significantly improves when the transmit selection technique is applied. Besides, the proposed precoder has remarkably lower computational complexity than its LC-RBD-LR-ZF counterpart. The bit error rate (BER) performance of the proposed precoder can approach that of the LC-RBD-LR-ZF precoder as the number of groups increases, yet at the cost of higher detection complexity.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91345503","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-09-24DOI: 10.4108/eai.13-7-2018.160389
Trong-Minh Hoang, L. V. Ngoc, Tuan-Nguyen Lang, Dang-Hai Hoang
In the last few years, the Internet of Things (IoT) has experienced exponential advancements. In IoT infrastructures, Wireless Sensor Network (WSN) has been considered as one of the crucial technologies to support a lot of amazing services. To fulfill new requirements of deployed network environments, the security issue in wireless sensor networks has to be met new challenges such as secured and lightweight requirements
{"title":"A Secure Authentication Scheme based on Brownian Motion in hierarchy Wireless Sensor Networks","authors":"Trong-Minh Hoang, L. V. Ngoc, Tuan-Nguyen Lang, Dang-Hai Hoang","doi":"10.4108/eai.13-7-2018.160389","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.160389","url":null,"abstract":"In the last few years, the Internet of Things (IoT) has experienced exponential advancements. In IoT infrastructures, Wireless Sensor Network (WSN) has been considered as one of the crucial technologies to support a lot of amazing services. To fulfill new requirements of deployed network environments, the security issue in wireless sensor networks has to be met new challenges such as secured and lightweight requirements","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86918281","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-08-30DOI: 10.4108/eai.13-7-2018.159944
Hemant Kumar Gianey, T. Choudhury, Ahmed A. Elngar
Effective routing is one important research issue for mobile ad-hoc network where gadgets have confined resources. Due to non-foreseeing network topology, frequent link failure occurred that drives route break, partitions and high routing overhead issue. These issues result superfluous resource wastage and diminish network life. Existing reactive routing algorithm helps nodes to discover route via broadcast of route request to all these reachable nodes. Receiving node of route request further forward to all its neighbours’ nodes that lead flooding. Here broadcasting of route request results several issues such as wastage of resources, congestions, redundancy of route request and broadcast storm problem. Though to maximize resource utilization and minimize broadcast storm problem, efficient broadcast method in routing algorithm is required. Numerous contributions have done towards efficient broadcasting which concentrate different aspects. In this paper, NCBEF method is presented that motive was to do efficient flooding. NCBEF method enables node to broadcast route request to some neighbours instead of all. To do this, NCBEF method, determine high creditable neighbours during hello signal transmission. Few hypotheses were formulated to evaluate and test NCBEF method. Hypotheses were evaluated by simulation of NCBEF method in network simulator software on the basis of certain criteria.
{"title":"Node Credit Based Efficient Flooding (NCBEF) Method for Mobile Ad-hoc Networks","authors":"Hemant Kumar Gianey, T. Choudhury, Ahmed A. Elngar","doi":"10.4108/eai.13-7-2018.159944","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.159944","url":null,"abstract":"Effective routing is one important research issue for mobile ad-hoc network where gadgets have confined resources. Due to non-foreseeing network topology, frequent link failure occurred that drives route break, partitions and high routing overhead issue. These issues result superfluous resource wastage and diminish network life. Existing reactive routing algorithm helps nodes to discover route via broadcast of route request to all these reachable nodes. Receiving node of route request further forward to all its neighbours’ nodes that lead flooding. Here broadcasting of route request results several issues such as wastage of resources, congestions, redundancy of route request and broadcast storm problem. Though to maximize resource utilization and minimize broadcast storm problem, efficient broadcast method in routing algorithm is required. Numerous contributions have done towards efficient broadcasting which concentrate different aspects. In this paper, NCBEF method is presented that motive was to do efficient flooding. NCBEF method enables node to broadcast route request to some neighbours instead of all. To do this, NCBEF method, determine high creditable neighbours during hello signal transmission. Few hypotheses were formulated to evaluate and test NCBEF method. Hypotheses were evaluated by simulation of NCBEF method in network simulator software on the basis of certain criteria.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75678404","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-08-30DOI: 10.4108/eai.13-7-2018.159945
Van-Long Nguyen, Dac-Binh Ha, Duc-Dung Tran, Yoonill Lee
This paper does the study on the performance of the physical layer secrecy of nonorthogonal multiple access (NOMA) in downlink cooperative. The given system includes one source, multiple legitimate user pairs in the form of an eavesdropper. By applying the decode-and-forward (DF) scheme, a good user will take the information from the source to send it to the bad user in every pair, we assume that the eavesdropper will spend effort to decode the message from the bad user. To enhance the secrecy performance of given system, the artificial noise cooperative transmission scheme named ANCOTRAS is suggested. To assess the performance of the suggested scheme, we obtained the lower bound and exact closed-form expressions of secrecy outage probability by implementing statistical characteristics of signal-to-noise ratio (SNR) and signalto-interferenceplus-noise ratio (SINR). Furthermore, the secrecy performance of given system is studied basing on key parameters (including the power allocation ratio), average transmit power and amount of user pair for verifying the suggested scheme. At the end, the accuracy of final analytical outcome is reassured by using the Monte-Carlo simulation results. Received on 14 July 2019; accepted on 25 July 2019; published on 30 August 2019
{"title":"Enhancing Physical Layer Security for Cooperative Non-Orthogonal Multiple Access Networks with Artificial Noise","authors":"Van-Long Nguyen, Dac-Binh Ha, Duc-Dung Tran, Yoonill Lee","doi":"10.4108/eai.13-7-2018.159945","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.159945","url":null,"abstract":"This paper does the study on the performance of the physical layer secrecy of nonorthogonal multiple access (NOMA) in downlink cooperative. The given system includes one source, multiple legitimate user pairs in the form of an eavesdropper. By applying the decode-and-forward (DF) scheme, a good user will take the information from the source to send it to the bad user in every pair, we assume that the eavesdropper will spend effort to decode the message from the bad user. To enhance the secrecy performance of given system, the artificial noise cooperative transmission scheme named ANCOTRAS is suggested. To assess the performance of the suggested scheme, we obtained the lower bound and exact closed-form expressions of secrecy outage probability by implementing statistical characteristics of signal-to-noise ratio (SNR) and signalto-interferenceplus-noise ratio (SINR). Furthermore, the secrecy performance of given system is studied basing on key parameters (including the power allocation ratio), average transmit power and amount of user pair for verifying the suggested scheme. At the end, the accuracy of final analytical outcome is reassured by using the Monte-Carlo simulation results. Received on 14 July 2019; accepted on 25 July 2019; published on 30 August 2019","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83678579","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-08-30DOI: 10.4108/eai.16-9-2019.160074
D. Tan
{"title":"Network Coding Design for Reliable Satellite Communication Services","authors":"D. Tan","doi":"10.4108/eai.16-9-2019.160074","DOIUrl":"https://doi.org/10.4108/eai.16-9-2019.160074","url":null,"abstract":"","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87602982","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-08-07DOI: 10.4108/EAI.13-7-2018.159802
Antonino Masaracchia, Dac-Binh Ha, N. Le
{"title":"On the optimal user grouping in NOMA system technology","authors":"Antonino Masaracchia, Dac-Binh Ha, N. Le","doi":"10.4108/EAI.13-7-2018.159802","DOIUrl":"https://doi.org/10.4108/EAI.13-7-2018.159802","url":null,"abstract":"","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73961587","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-06-13DOI: 10.4108/eai.13-6-2019.159121
A. Samad, Muhammad Arshad Islam, M. Iqbal, Muhammad Aleem
{"title":"Centrality-Based Paper Citation Recommender System","authors":"A. Samad, Muhammad Arshad Islam, M. Iqbal, Muhammad Aleem","doi":"10.4108/eai.13-6-2019.159121","DOIUrl":"https://doi.org/10.4108/eai.13-6-2019.159121","url":null,"abstract":"","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77999135","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-06-13DOI: 10.4108/eai.13-6-2019.159123
M. Nguyen, Hien M. Nguyen, Antonino Masaracchia, Cuong V. Nguyen
Wireless sensor networks (WSNs) provide a lot of emerging applications. They suffer from some limitations such as energy constraints and cooperative demands essential to perform sensing or data routing. The networks could be exploited more effectively if they are well managed with power consumption since all sensors are randomly deployed in sensing areas needed to be observed without battery recharge or remote control. In this work, we proposed some stochastic-based methods to calculate total power consumption for such networks. We model common arbitrary networks with different types of sensing areas, circular and square shapes, then analyze and calculate the power consumption for data transmission based on statistic problems. Almost common data collection methods are employed such as cluster-based, tree-based, neighborhood based and random routing. In each method, the total power consumption is formulated and then simulated to be verified. This paper shows promise that all the formulas could be applied not only on WSNs but also mobile sensor networks (MSNs) while the mobile sensors are considered moving at random positions. Received on 05 June 2019; accepted on 12 June 2019; published on 13 June 2019
{"title":"Stochastic-Based Power Consumption Analysis for Data Transmission in Wireless Sensor Networks","authors":"M. Nguyen, Hien M. Nguyen, Antonino Masaracchia, Cuong V. Nguyen","doi":"10.4108/eai.13-6-2019.159123","DOIUrl":"https://doi.org/10.4108/eai.13-6-2019.159123","url":null,"abstract":"Wireless sensor networks (WSNs) provide a lot of emerging applications. They suffer from some limitations such as energy constraints and cooperative demands essential to perform sensing or data routing. The networks could be exploited more effectively if they are well managed with power consumption since all sensors are randomly deployed in sensing areas needed to be observed without battery recharge or remote control. In this work, we proposed some stochastic-based methods to calculate total power consumption for such networks. We model common arbitrary networks with different types of sensing areas, circular and square shapes, then analyze and calculate the power consumption for data transmission based on statistic problems. Almost common data collection methods are employed such as cluster-based, tree-based, neighborhood based and random routing. In each method, the total power consumption is formulated and then simulated to be verified. This paper shows promise that all the formulas could be applied not only on WSNs but also mobile sensor networks (MSNs) while the mobile sensors are considered moving at random positions. Received on 05 June 2019; accepted on 12 June 2019; published on 13 June 2019","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72403145","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
扫码关注我们
求助内容：
应助结果提醒方式：