Pub Date : 2019-12-01DOI: 10.1109/ANTS47819.2019.9118081
Haijun Gao, Japjot Singh Bawa, R. Paranjape
The Proportional Fair (PF) scheduler has been extensively studied in wireless communications research. Most of the research done, however, focuses on theoretical or simplistic simulations. In this paper, both theory and practical measurements for a PF scheduler are studied. Two data collections are conducted to verify the performance of the scheduler in an actual LTE-A network (small cells) environment. Allocated Physical Resource Blocks (PRBs) and throughput of each phone used in the data collection are estimated. Three different types of PF schedulers are implemented to predict user throughput. The results show that the scheduler maintains good fairness for both user throughputs and PRB allocation. Further it is shown that our results, derived from actual recorded data are different from those derived from simulation models presented in the literature [1] [2]. Similarly, the cell throughput and fairness values are dynamic and randomly distributed with the time in an actual LTE-A network in contrast to simulation models. From our study, we show that the generalize PF Scheduler performs more accurately to predict the user throughput values. It is concluded that this real-world LTE-A network study is more meaningful and valuable in enhancing the understanding of actual 4G and future 5G networks.
{"title":"An Evaluation of the Proportional Fair Scheduler in a Physically Deployed LTE-A Network","authors":"Haijun Gao, Japjot Singh Bawa, R. Paranjape","doi":"10.1109/ANTS47819.2019.9118081","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118081","url":null,"abstract":"The Proportional Fair (PF) scheduler has been extensively studied in wireless communications research. Most of the research done, however, focuses on theoretical or simplistic simulations. In this paper, both theory and practical measurements for a PF scheduler are studied. Two data collections are conducted to verify the performance of the scheduler in an actual LTE-A network (small cells) environment. Allocated Physical Resource Blocks (PRBs) and throughput of each phone used in the data collection are estimated. Three different types of PF schedulers are implemented to predict user throughput. The results show that the scheduler maintains good fairness for both user throughputs and PRB allocation. Further it is shown that our results, derived from actual recorded data are different from those derived from simulation models presented in the literature [1] [2]. Similarly, the cell throughput and fairness values are dynamic and randomly distributed with the time in an actual LTE-A network in contrast to simulation models. From our study, we show that the generalize PF Scheduler performs more accurately to predict the user throughput values. It is concluded that this real-world LTE-A network study is more meaningful and valuable in enhancing the understanding of actual 4G and future 5G networks.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121820554","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-12-01DOI: 10.1109/ANTS47819.2019.9118070
Rahul Bajpai, Naveen Gupta
The tremendous growth in high-end multimedia applications is increasing day by day. It leads to explore and discover the techniques which will improve the capacity and coverage area for a wireless local area network (WLAN). This paper proposes a novel throughput improvement algorithm evaluate-all-integer-partition (EAIP) for the modified version of distributed coordination function (DCF) which gives the significant performance gain over the existing re-evaluate optimal integer partition (ROIP) algorithm. Among $M$ available links between access points (APs) and end-users, EAIP selects the optimal links that can be shared in space or time to maximize the network throughput. The proposed EAIP algorithm facilitates the simultaneous packet transmission as compared to the standard DCF to increase the overall network throughput. However, the achievable rate for a single link decreases due to the increase in interference. The performance in terms of throughput of 802.11 WLAN has been evaluated and compared to the existing ROIP algorithm. Results show that the EAIP algorithm improves the throughput of the IEEE 802.11 WLAN by 40% as compared to the existing ROIP.
{"title":"A Novel Throughput Improvement Algorithm for High Density Wireless LAN","authors":"Rahul Bajpai, Naveen Gupta","doi":"10.1109/ANTS47819.2019.9118070","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118070","url":null,"abstract":"The tremendous growth in high-end multimedia applications is increasing day by day. It leads to explore and discover the techniques which will improve the capacity and coverage area for a wireless local area network (WLAN). This paper proposes a novel throughput improvement algorithm evaluate-all-integer-partition (EAIP) for the modified version of distributed coordination function (DCF) which gives the significant performance gain over the existing re-evaluate optimal integer partition (ROIP) algorithm. Among $M$ available links between access points (APs) and end-users, EAIP selects the optimal links that can be shared in space or time to maximize the network throughput. The proposed EAIP algorithm facilitates the simultaneous packet transmission as compared to the standard DCF to increase the overall network throughput. However, the achievable rate for a single link decreases due to the increase in interference. The performance in terms of throughput of 802.11 WLAN has been evaluated and compared to the existing ROIP algorithm. Results show that the EAIP algorithm improves the throughput of the IEEE 802.11 WLAN by 40% as compared to the existing ROIP.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125072348","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-12-01DOI: 10.1109/ANTS47819.2019.9117984
Jihas Khan, L. Jacob
URLLC will be a use case of 5G which requires high reliability, low latency and high availability to be satisfied simultaneously. 5G will be using millimeter wave (mmw) communication which suffers from frequent and dynamic blockages impacting reliability. In addition to high SNR line-of-sight (LOS) links and low SNR non-line-of-sight (NLOS) links, complete outage (blockage) links are also anticipated. Link status will be changing dynamically between these three states. Coordinated multipoint joint transmission (CoMP-JT) is an ideal candidate to ensure high reliability, where a group of base stations (BSs) transmits the same data to a user equipment (UE). Due to highly dynamic blockages and backhaul constraints, BSs selected to be part of CoMP cluster based on the reference signal received power (RSRP) alone will be outdated by the time of data transmission. In this paper, a CoMP clustering scheme is proposed in which a neural network algorithm running in each BS learns the spatiotemporal pattern of blockages and predicts the BS-UE link status based on the clock time and location of UE. The BSs with predicted blockage shall be removed and LOS links shall be given higher priority over NLOS links during CoMP clustering, thereby increasing the reliability and availability. Analytical channel model is combined with stochastic geometry based model to characterize the real world spatio-temporal blockages. A modified control flow of events for CoMP-JT in URLLC is proposed to address the issue of backhaul constraints. Simulation results show that the proposed CoMP clustering scheme outperforms the RSRP based CoMP clustering in terms of BLER and SNR.
{"title":"Learning Based CoMP Clustering for URLLC in Millimeter wave 5G networks with Blockages","authors":"Jihas Khan, L. Jacob","doi":"10.1109/ANTS47819.2019.9117984","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9117984","url":null,"abstract":"URLLC will be a use case of 5G which requires high reliability, low latency and high availability to be satisfied simultaneously. 5G will be using millimeter wave (mmw) communication which suffers from frequent and dynamic blockages impacting reliability. In addition to high SNR line-of-sight (LOS) links and low SNR non-line-of-sight (NLOS) links, complete outage (blockage) links are also anticipated. Link status will be changing dynamically between these three states. Coordinated multipoint joint transmission (CoMP-JT) is an ideal candidate to ensure high reliability, where a group of base stations (BSs) transmits the same data to a user equipment (UE). Due to highly dynamic blockages and backhaul constraints, BSs selected to be part of CoMP cluster based on the reference signal received power (RSRP) alone will be outdated by the time of data transmission. In this paper, a CoMP clustering scheme is proposed in which a neural network algorithm running in each BS learns the spatiotemporal pattern of blockages and predicts the BS-UE link status based on the clock time and location of UE. The BSs with predicted blockage shall be removed and LOS links shall be given higher priority over NLOS links during CoMP clustering, thereby increasing the reliability and availability. Analytical channel model is combined with stochastic geometry based model to characterize the real world spatio-temporal blockages. A modified control flow of events for CoMP-JT in URLLC is proposed to address the issue of backhaul constraints. Simulation results show that the proposed CoMP clustering scheme outperforms the RSRP based CoMP clustering in terms of BLER and SNR.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115244329","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-12-01DOI: 10.1109/ANTS47819.2019.9118146
Vinti Agarwal, N. Hubballi, Ambika Shrestha Chitrakar, K. Franke
Web applications are compromised by exploiting different vulnerabilities. The protection systems designed to detect such attacks, screen the HTTP requests to decide whether a particular request is benign or malicious. Generating effective screening rules governs the detection performance and false positive rate. In this paper, we propose to generate classification rules to identify malicious HTTP requests using co-occurrence between certain character combinations. Our idea is motivated by the fact that, a successful attack will have some combination of characters together. For e.g., in an SQL injection attack = sign may appear along with “'”. We propose to learn such character combinations using association rules with a set of carefully chosen feature (character) set. We experiment with a publicly available HTTP dataset and show that malicious HTTP requests can be identified with rules generated from such associations.
{"title":"Identifying Anomalous HTTP Traffic with Association Rule Mining","authors":"Vinti Agarwal, N. Hubballi, Ambika Shrestha Chitrakar, K. Franke","doi":"10.1109/ANTS47819.2019.9118146","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118146","url":null,"abstract":"Web applications are compromised by exploiting different vulnerabilities. The protection systems designed to detect such attacks, screen the HTTP requests to decide whether a particular request is benign or malicious. Generating effective screening rules governs the detection performance and false positive rate. In this paper, we propose to generate classification rules to identify malicious HTTP requests using co-occurrence between certain character combinations. Our idea is motivated by the fact that, a successful attack will have some combination of characters together. For e.g., in an SQL injection attack = sign may appear along with “'”. We propose to learn such character combinations using association rules with a set of carefully chosen feature (character) set. We experiment with a publicly available HTTP dataset and show that malicious HTTP requests can be identified with rules generated from such associations.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122850483","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-12-01DOI: 10.1109/ANTS47819.2019.9118115
J. R. Bhat, V. AnoopC., O. Alfandi
Co-operative data transmission between Device-to-Device (D2D) user terminals is a challenging task due to the selfish behavior of the D2D Users (DUs). Incentivizing the DUs can promote communication which in turn even reduce the transmission burden on the base station (eNB). In this work, we consider a scenario, in which eNB pays incentive to DUs to relay the data among its best neighbors; while the communication is regulated by wireless channel, and social influence factors. In case, DUs refrain from relaying, the eNB ought to transmit directly which increase the cost of the eNB several folds. We model this problem as a Stackelberg game, in which eNB plays the role of a leader to minimize its cost and DUs will be the followers who aim at maximizing their utility. We propose an iterative algorithm to establish the existence of equilibrium. We also prove the equilibrium of DUs subgame for a special case by relating it to a 0/1 knapsack problem. The simulation results show that the proposed algorithm has a better performance in terms of Utility and total base station cost than the conventional schemes.
{"title":"Incentive Based Relaying in D2D Social Networks","authors":"J. R. Bhat, V. AnoopC., O. Alfandi","doi":"10.1109/ANTS47819.2019.9118115","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118115","url":null,"abstract":"Co-operative data transmission between Device-to-Device (D2D) user terminals is a challenging task due to the selfish behavior of the D2D Users (DUs). Incentivizing the DUs can promote communication which in turn even reduce the transmission burden on the base station (eNB). In this work, we consider a scenario, in which eNB pays incentive to DUs to relay the data among its best neighbors; while the communication is regulated by wireless channel, and social influence factors. In case, DUs refrain from relaying, the eNB ought to transmit directly which increase the cost of the eNB several folds. We model this problem as a Stackelberg game, in which eNB plays the role of a leader to minimize its cost and DUs will be the followers who aim at maximizing their utility. We propose an iterative algorithm to establish the existence of equilibrium. We also prove the equilibrium of DUs subgame for a special case by relating it to a 0/1 knapsack problem. The simulation results show that the proposed algorithm has a better performance in terms of Utility and total base station cost than the conventional schemes.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122515298","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-12-01DOI: 10.1109/ANTS47819.2019.9118079
B. Binoy, B. S. Vineeth
The 802.11ax WLAN standard promises four times higher throughput compared with the previous standards. In the uplink, the standard includes OFDMA based scheduled access in which the associated stations can be scheduled by an 802.11ax access point (AP). The quality of service for the associated stations can therefore be enhanced by intelligent scheduling of the stations on the OFDMA uplink. The AP is responsible for partitioning the available spectrum to resource units, allocating the resource units to the stations, and transmit power control at the station. In this paper, we consider the design of joint policies for resource unit allocation and power control for the 802.11ax uplink with the objective of minimizing the average latency (or average queue length) of packets queued at the station destined for the AP, while the average transmit power is constrained. Using the drift plus penalty approach we propose two heuristic scheduling policies for the above problem. The achievable average queue lengths and average powers for these scheduling policies are obtained using simulations.
{"title":"Minimum delay scheduling under average power constraint for 802.11ax uplink","authors":"B. Binoy, B. S. Vineeth","doi":"10.1109/ANTS47819.2019.9118079","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118079","url":null,"abstract":"The 802.11ax WLAN standard promises four times higher throughput compared with the previous standards. In the uplink, the standard includes OFDMA based scheduled access in which the associated stations can be scheduled by an 802.11ax access point (AP). The quality of service for the associated stations can therefore be enhanced by intelligent scheduling of the stations on the OFDMA uplink. The AP is responsible for partitioning the available spectrum to resource units, allocating the resource units to the stations, and transmit power control at the station. In this paper, we consider the design of joint policies for resource unit allocation and power control for the 802.11ax uplink with the objective of minimizing the average latency (or average queue length) of packets queued at the station destined for the AP, while the average transmit power is constrained. Using the drift plus penalty approach we propose two heuristic scheduling policies for the above problem. The achievable average queue lengths and average powers for these scheduling policies are obtained using simulations.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344333","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-12-01DOI: 10.1109/ANTS47819.2019.9118158
Aritra Chatterjee, Suvra Shekhar Das
In this work, the analytical performance evaluation of 3-dimensional dense small cell wireless network is presented using spatial Poisson point processes. As against existing literature which considers simplified channel models without differentiating in LOS/NLOS conditions, this work captures the holistic effect of the realistic propagation (in terms of both path loss and small scale fading) as reported in existing standards. For such practical system model, a numerically simple upper bound of downlink coverage probability has been derived as a function of AP and UE densities which is found to be tight in nature for the whole range of system parameters and thus can be used as a close approximation of the same.
{"title":"Downlink Coverage Analysis of 3-D Ultra Dense Networks with Realistic Propagation Conditions","authors":"Aritra Chatterjee, Suvra Shekhar Das","doi":"10.1109/ANTS47819.2019.9118158","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118158","url":null,"abstract":"In this work, the analytical performance evaluation of 3-dimensional dense small cell wireless network is presented using spatial Poisson point processes. As against existing literature which considers simplified channel models without differentiating in LOS/NLOS conditions, this work captures the holistic effect of the realistic propagation (in terms of both path loss and small scale fading) as reported in existing standards. For such practical system model, a numerically simple upper bound of downlink coverage probability has been derived as a function of AP and UE densities which is found to be tight in nature for the whole range of system parameters and thus can be used as a close approximation of the same.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128435123","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-12-01DOI: 10.1109/ANTS47819.2019.9117955
S. Sharma, K. Deka, V. Bhatia
To increase the data throughout in molecular communications (MC), recently higher order modulation schemes (HOMS) are introduced with increased system complexity. In this paper, we propose a hybrid modulation scheme by encoding information into the time and types of molecules, and it is referred to as position molecule shift keying (PMSK). The PMSK uses minimum types of molecules for information encoding, which results in reduced system complexity as compared to the conventional HOMS. Further, to optimize the energy detector (ED) performance, we propose a $ptext{th}$ power ED and call it modified ED (MED). Numerical results show that, the proposed PMSK and MED can yield higher data throughput and improved symbol error rate performance, respectively, in the presence of both counting and residual noises.
{"title":"Hybrid Modulation Scheme and Modified Energy Detector for Molecular Communications","authors":"S. Sharma, K. Deka, V. Bhatia","doi":"10.1109/ANTS47819.2019.9117955","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9117955","url":null,"abstract":"To increase the data throughout in molecular communications (MC), recently higher order modulation schemes (HOMS) are introduced with increased system complexity. In this paper, we propose a hybrid modulation scheme by encoding information into the time and types of molecules, and it is referred to as position molecule shift keying (PMSK). The PMSK uses minimum types of molecules for information encoding, which results in reduced system complexity as compared to the conventional HOMS. Further, to optimize the energy detector (ED) performance, we propose a $ptext{th}$ power ED and call it modified ED (MED). Numerical results show that, the proposed PMSK and MED can yield higher data throughput and improved symbol error rate performance, respectively, in the presence of both counting and residual noises.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"10 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128525319","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-12-01DOI: 10.1109/ANTS47819.2019.9118165
Anders Frøytlog, Magne Arild Haglund, Linga Reddy Cenkeramaddi, B. Beferull-Lozano
In this paper, we present the design and implementation of a long-rage wake-up radio (WuR) and customized duty cycled (DC) MAC protocol for wireless IoT devices. The WuRx achieves a sensivity of −70 dBm by consuming just 0.032 mA, thereby optimizing the energy consumption of battery powered long-range wireless IoT devices. Reducing the power consumption of these devices minimizes the overall costs when deployed in large scale.
{"title":"Design and implementation of a long-range low-power wake-up radio and customized DC-MAC protocol for LoRaWAN","authors":"Anders Frøytlog, Magne Arild Haglund, Linga Reddy Cenkeramaddi, B. Beferull-Lozano","doi":"10.1109/ANTS47819.2019.9118165","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118165","url":null,"abstract":"In this paper, we present the design and implementation of a long-rage wake-up radio (WuR) and customized duty cycled (DC) MAC protocol for wireless IoT devices. The WuRx achieves a sensivity of −70 dBm by consuming just 0.032 mA, thereby optimizing the energy consumption of battery powered long-range wireless IoT devices. Reducing the power consumption of these devices minimizes the overall costs when deployed in large scale.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128994865","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-12-01DOI: 10.1109/ANTS47819.2019.9118063
M. S. Thakur, S. Sharma, V. Bhatia
In diffusion-based molecular communication (MC), some of the message molecules may not reach the receiver in their expected time slot due to the diffusion process. These straying molecules from previous time slots interfere with the message molecules of the current time slot which leads to inter-symbol-interference (ISI) in MC. In this paper, we propose and analyze the weighted higher order detector for MC systems to mitigate/reduce the ISI and noise. The proposed weighted higher order sum of molecules concentration enhances the signal-to-noise ratio due to the reduced channel tail and noise effect in a frame. Further, the proposed detector does not estimate instantaneous channel impulse response at the receiver, hence, is simple and has low complexity. Numerical results show that the proposed detector performs better than the conventional direct sum detection method. The impact of diffusion coefficient, number of molecules and noise distribution on the proposed detector is also analyzed.
{"title":"Weighted Higher Order Detector for Diffusion based Molecular Communications","authors":"M. S. Thakur, S. Sharma, V. Bhatia","doi":"10.1109/ANTS47819.2019.9118063","DOIUrl":"https://doi.org/10.1109/ANTS47819.2019.9118063","url":null,"abstract":"In diffusion-based molecular communication (MC), some of the message molecules may not reach the receiver in their expected time slot due to the diffusion process. These straying molecules from previous time slots interfere with the message molecules of the current time slot which leads to inter-symbol-interference (ISI) in MC. In this paper, we propose and analyze the weighted higher order detector for MC systems to mitigate/reduce the ISI and noise. The proposed weighted higher order sum of molecules concentration enhances the signal-to-noise ratio due to the reduced channel tail and noise effect in a frame. Further, the proposed detector does not estimate instantaneous channel impulse response at the receiver, hence, is simple and has low complexity. Numerical results show that the proposed detector performs better than the conventional direct sum detection method. The impact of diffusion coefficient, number of molecules and noise distribution on the proposed detector is also analyzed.","PeriodicalId":374743,"journal":{"name":"2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341029","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
扫码关注我们
求助内容：
应助结果提醒方式：