Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413624
S. S. Ray, Surajeet Ghosh, B. Sardar
This paper proposes a novel hardware architecture based on static random access memory (SRAM) for longest prefix match (LPM) search scheme to achieve wire speed IP processing. The central idea of this architecture is to store the IP prefixes virtually in routing table. To virtually store IP prefixes, we reserve only a single bit per prefix irrespective of their lengths. The proposed architecture consumes single memory write cycle to store the IP prefixes those share common initial bits and also takes single memory read cycle for LPM search unlike conventional and existing LPM solutions. The read, write, update time complexity is O(1). This architecture exhibits LPM search time as approximately 1.25 ns and offers search throughput of 805.8 million-search/sec. The numerical results show that this architecture significantly reduces memory requirement, power consumption, and transistor-count/bit requirement.
{"title":"SRAM based longest prefix matching approach for multigigabit IP processing","authors":"S. S. Ray, Surajeet Ghosh, B. Sardar","doi":"10.1109/ANTS.2015.7413624","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413624","url":null,"abstract":"This paper proposes a novel hardware architecture based on static random access memory (SRAM) for longest prefix match (LPM) search scheme to achieve wire speed IP processing. The central idea of this architecture is to store the IP prefixes virtually in routing table. To virtually store IP prefixes, we reserve only a single bit per prefix irrespective of their lengths. The proposed architecture consumes single memory write cycle to store the IP prefixes those share common initial bits and also takes single memory read cycle for LPM search unlike conventional and existing LPM solutions. The read, write, update time complexity is O(1). This architecture exhibits LPM search time as approximately 1.25 ns and offers search throughput of 805.8 million-search/sec. The numerical results show that this architecture significantly reduces memory requirement, power consumption, and transistor-count/bit requirement.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124741379","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413657
Ritamshirsa Choudhuri, R. Das
One important and challenging problem for sensor network is how to ensure coverage of the target area and maximize the lifetime of the network at the same time. This problem is known to be a NP-complete and there are many attempts to find an approximate solution. In this paper, we reduce the problem of area coverage to target coverage and it is possible to compute an upper bound on the lifetime achievable for target coverage. We have given an Integer Programming Problem (IPP) formulation of the problem using this upper bound. We do some approximation on the problem before applying IPP, so that solution could be obtained in reasonable time. In the experiments with number of sensors ranging from 50 to 150 we have been able to achieve the upper bound in all the cases.
{"title":"Maximum lifetime scheduling for area coverage in wireless sensor networks","authors":"Ritamshirsa Choudhuri, R. Das","doi":"10.1109/ANTS.2015.7413657","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413657","url":null,"abstract":"One important and challenging problem for sensor network is how to ensure coverage of the target area and maximize the lifetime of the network at the same time. This problem is known to be a NP-complete and there are many attempts to find an approximate solution. In this paper, we reduce the problem of area coverage to target coverage and it is possible to compute an upper bound on the lifetime achievable for target coverage. We have given an Integer Programming Problem (IPP) formulation of the problem using this upper bound. We do some approximation on the problem before applying IPP, so that solution could be obtained in reasonable time. In the experiments with number of sensors ranging from 50 to 150 we have been able to achieve the upper bound in all the cases.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122586304","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413609
Divya Chitimalla, K. Kondepu, L. Valcarenghi, B. Mukherjee
Common Public Radio Interface (CPRI) is a popular standard to interface the Radio Equipment Control (REC) and the Radio Equipment (RE) in the fronthaul of 5G systems. However, CPRI is expensive to deploy, consumes high bandwidth and, currently, is statically configured. Reconfigurability is highly desirable in 5G systems, and can be classified into two categories: network and bandwidth reconfigurability. This paper gives an overview of advantages, and issues of providing fronthaul reconfigurability along with the advantages and drawbacks of an Ethernet-based fronthaul. Having CPRI protocol run over ubiquitous Ethernet protocol makes CPRI cost-efficient and easily reconfigurable for a dynamic scenario. An FPGA-based pre-synthesis Verilog simulation on Ethernet encapsulation of CPRI data gives the estimate of delay overhead and, correspondingly, of the distances supported by Ethernet-based fronthaul.
{"title":"Reconfigurable and efficient fronthaul of 5G systems","authors":"Divya Chitimalla, K. Kondepu, L. Valcarenghi, B. Mukherjee","doi":"10.1109/ANTS.2015.7413609","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413609","url":null,"abstract":"Common Public Radio Interface (CPRI) is a popular standard to interface the Radio Equipment Control (REC) and the Radio Equipment (RE) in the fronthaul of 5G systems. However, CPRI is expensive to deploy, consumes high bandwidth and, currently, is statically configured. Reconfigurability is highly desirable in 5G systems, and can be classified into two categories: network and bandwidth reconfigurability. This paper gives an overview of advantages, and issues of providing fronthaul reconfigurability along with the advantages and drawbacks of an Ethernet-based fronthaul. Having CPRI protocol run over ubiquitous Ethernet protocol makes CPRI cost-efficient and easily reconfigurable for a dynamic scenario. An FPGA-based pre-synthesis Verilog simulation on Ethernet encapsulation of CPRI data gives the estimate of delay overhead and, correspondingly, of the distances supported by Ethernet-based fronthaul.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115509138","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413628
Rajib Banerjee, S. Bit
Due to inherent limitations in terms of processing power, storage, and bandwidth, data processing is a challenge in wireless multimedia sensor network (WMSN). Transmitting raw data is very costly while limited processing power of the sensor nodes prevents sophisticated multimedia processing. Exploring low-overhead data compression technique is a solution towards this problem. In this work we propose an energy saving image compression technique for WMSN by partial discrete cosine transform (PDCT) considering the application of post-disaster situation analysis through image capturing of the affected area. Here the DCT coefficients of only the last two rows of macroblock of the sensory image are propagated thereby saves energy by transmitting reduced number of bits. Also an existing tree based routing scheme is modified to employ in-network aggregation at merging nodes along the tree saving energy further. Finally the design feasibility along with simulation results including statistical analysis is presented to evaluate efficacy of the scheme in terms of two conflicting parameters viz. energy consumption and peak signal to noise ratio (PSNR). The comparative results confirm our scheme's supremacy in WMSN application domain over existing methods.
{"title":"Low-overhead image compression in WMSN for post disaster situation analysis","authors":"Rajib Banerjee, S. Bit","doi":"10.1109/ANTS.2015.7413628","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413628","url":null,"abstract":"Due to inherent limitations in terms of processing power, storage, and bandwidth, data processing is a challenge in wireless multimedia sensor network (WMSN). Transmitting raw data is very costly while limited processing power of the sensor nodes prevents sophisticated multimedia processing. Exploring low-overhead data compression technique is a solution towards this problem. In this work we propose an energy saving image compression technique for WMSN by partial discrete cosine transform (PDCT) considering the application of post-disaster situation analysis through image capturing of the affected area. Here the DCT coefficients of only the last two rows of macroblock of the sensory image are propagated thereby saves energy by transmitting reduced number of bits. Also an existing tree based routing scheme is modified to employ in-network aggregation at merging nodes along the tree saving energy further. Finally the design feasibility along with simulation results including statistical analysis is presented to evaluate efficacy of the scheme in terms of two conflicting parameters viz. energy consumption and peak signal to noise ratio (PSNR). The comparative results confirm our scheme's supremacy in WMSN application domain over existing methods.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116623091","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413615
Sharda Tripathi, S. De
In this paper, we investigate a data driven approach based on o-Support Vector Regression (o-SVR) to identify the dependence of present sample of power-line frequency on past few samples. In standard practice, the Phasor Measurement Units (PMUs) measure the frequency samples continuously from various bus locations in the power grid and transmit them at a fixed rate, typically at 25 samples/sec, to the Phasor Data Concentrator (PDC). Objective of the proposed strategy is to reduce the sampling rate at a PMU or transmission rate of the fixed-rate samples from a PMU to the PDC such that any impending disturbance in the power system can be detected early without compromising stability of the power system. We evaluate the performance of our proposed model by quantifying the sample data rate reduction and obtaining the average prediction error during the steady state as well as disturbed state conditions in the power gird.
{"title":"Assessment of power system stability using reduced-rate synchrophasor data","authors":"Sharda Tripathi, S. De","doi":"10.1109/ANTS.2015.7413615","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413615","url":null,"abstract":"In this paper, we investigate a data driven approach based on o-Support Vector Regression (o-SVR) to identify the dependence of present sample of power-line frequency on past few samples. In standard practice, the Phasor Measurement Units (PMUs) measure the frequency samples continuously from various bus locations in the power grid and transmit them at a fixed rate, typically at 25 samples/sec, to the Phasor Data Concentrator (PDC). Objective of the proposed strategy is to reduce the sampling rate at a PMU or transmission rate of the fixed-rate samples from a PMU to the PDC such that any impending disturbance in the power system can be detected early without compromising stability of the power system. We evaluate the performance of our proposed model by quantifying the sample data rate reduction and obtaining the average prediction error during the steady state as well as disturbed state conditions in the power gird.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"505 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116885110","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413617
C. Panigrahi, Bibudhendu Pati, Mayank Tiwary, J. Sarkar
Cyber Foraging concepts allow the users to take the benefits of low latency cloud services by offloading the computational requests to the nearest service provider instead of offloading the computational request services to service providers over Wide Area Network (WAN). The cloudlets are major components of cyber foraged systems and are deployed in the physical proximity of the users, where the cloudlets get connected with users through LAN or Wi-Fi. In the mobile state, the cloudlets are deployed over the mobile devices such as smart phones. The performance of mobile cloudlets depends upon the battery life of mobile devices, which is limited. In this work, we propose an energy efficient offloading approach EEOA, which can help in effective resource utilization of mobile cloudlets for optimal energy usage. Based on the simulation results, we observed that the EEOA helps in optimal resource utilization of mobile devices and also minimizes the energy consumption for mobile devices.
{"title":"EEOA: Improving energy efficiency of mobile cloudlets using efficient offloading approach","authors":"C. Panigrahi, Bibudhendu Pati, Mayank Tiwary, J. Sarkar","doi":"10.1109/ANTS.2015.7413617","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413617","url":null,"abstract":"Cyber Foraging concepts allow the users to take the benefits of low latency cloud services by offloading the computational requests to the nearest service provider instead of offloading the computational request services to service providers over Wide Area Network (WAN). The cloudlets are major components of cyber foraged systems and are deployed in the physical proximity of the users, where the cloudlets get connected with users through LAN or Wi-Fi. In the mobile state, the cloudlets are deployed over the mobile devices such as smart phones. The performance of mobile cloudlets depends upon the battery life of mobile devices, which is limited. In this work, we propose an energy efficient offloading approach EEOA, which can help in effective resource utilization of mobile cloudlets for optimal energy usage. Based on the simulation results, we observed that the EEOA helps in optimal resource utilization of mobile devices and also minimizes the energy consumption for mobile devices.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128225704","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413606
S. Chaitanya, K. Naik, S. Rao
While the network traffic has seen exponential increase, the revenues have not maintained the same pace. New methods have to be explored to reduce this gap between traffic and revenue. One such method is convergence in networking layers. In this work, we study the convergence of OTN and DWDM layer from a network planning perspective. We compare the costs of planning networks without and with convergence and show that the multilayer planning offers least cost for higher traffic volumes.
{"title":"A heuristic algorithm for network optimization of OTN over DWDM network","authors":"S. Chaitanya, K. Naik, S. Rao","doi":"10.1109/ANTS.2015.7413606","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413606","url":null,"abstract":"While the network traffic has seen exponential increase, the revenues have not maintained the same pace. New methods have to be explored to reduce this gap between traffic and revenue. One such method is convergence in networking layers. In this work, we study the convergence of OTN and DWDM layer from a network planning perspective. We compare the costs of planning networks without and with convergence and show that the multilayer planning offers least cost for higher traffic volumes.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129849126","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413635
Mayank Swarnkar, N. Hubballi
Application specific intrusion detection methods are used to detect network intrusions targeted at applications. Normally such detection methods require payload or packet content analysis. One of the prominent method of payload modeling and analysis is sequence or ngram modeling. Normally ngrams generated from a packet are compared with a database of ngrams seen during training phase. Depending on the number of ngrams found or not found in the packet it is labeled either as normal or anomalous. Previous methods use either presence or absence of ngram in training dataset or use frequency of its occurrence in the entire training dataset. This approach results into many false positives and false negatives. In this paper we propose a novel payload analysis technique for the detection of Zero day attacks against web traffic. We consider the minimum and maximum occurrence frequency of a particular ngram from a packet in training dataset and find deviations from this range to detect anomalies. Experiments on a large dataset has shown good detection rate with low false positives.
{"title":"Rangegram: A novel payload based anomaly detection technique against web traffic","authors":"Mayank Swarnkar, N. Hubballi","doi":"10.1109/ANTS.2015.7413635","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413635","url":null,"abstract":"Application specific intrusion detection methods are used to detect network intrusions targeted at applications. Normally such detection methods require payload or packet content analysis. One of the prominent method of payload modeling and analysis is sequence or ngram modeling. Normally ngrams generated from a packet are compared with a database of ngrams seen during training phase. Depending on the number of ngrams found or not found in the packet it is labeled either as normal or anomalous. Previous methods use either presence or absence of ngram in training dataset or use frequency of its occurrence in the entire training dataset. This approach results into many false positives and false negatives. In this paper we propose a novel payload analysis technique for the detection of Zero day attacks against web traffic. We consider the minimum and maximum occurrence frequency of a particular ngram from a packet in training dataset and find deviations from this range to detect anomalies. Experiments on a large dataset has shown good detection rate with low false positives.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130449910","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413644
S. Chakraborty, D. Sen
Cooperation in a vehicular network allows to opportunistically form a virtual antenna array (VAA) to accelerate information exchange resulting in safer transportation. Moving to such cooperative communication requires synchronization in order to realize the concept of the distributed coherence. In this paper, we propose a joint parameter estimation of multiple timing offset (MTO) and multiple carrier frequency offset (MCFO) for estimate-and-forward (EF) cooperative communication employing orthogonal frequency division multiplexing (OFDM). The estimation errors at the relays which contribute inter carrier interferences (ICI) are considered for mathematical analysis. The system model considers multiple antennas at the relays. An iterative algorithm based on expectation conditional maximization (ECM) is proposed for joint estimation of synchronization parameters over a quasi-static channel. Performance of the estimator is evaluated by means of mean square error (MSE) and bit error rate (BER). ECM estimator's performance is enhanced for multi-input multi-output (MIMO) configuration at the relays.
{"title":"Joint time and frequency offset estimation for DMIMO-OFDM in vehicular networks","authors":"S. Chakraborty, D. Sen","doi":"10.1109/ANTS.2015.7413644","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413644","url":null,"abstract":"Cooperation in a vehicular network allows to opportunistically form a virtual antenna array (VAA) to accelerate information exchange resulting in safer transportation. Moving to such cooperative communication requires synchronization in order to realize the concept of the distributed coherence. In this paper, we propose a joint parameter estimation of multiple timing offset (MTO) and multiple carrier frequency offset (MCFO) for estimate-and-forward (EF) cooperative communication employing orthogonal frequency division multiplexing (OFDM). The estimation errors at the relays which contribute inter carrier interferences (ICI) are considered for mathematical analysis. The system model considers multiple antennas at the relays. An iterative algorithm based on expectation conditional maximization (ECM) is proposed for joint estimation of synchronization parameters over a quasi-static channel. Performance of the estimator is evaluated by means of mean square error (MSE) and bit error rate (BER). ECM estimator's performance is enhanced for multi-input multi-output (MIMO) configuration at the relays.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999971","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413611
R. Mishra, R. Pandey, N. Chaki, S. Choudhury
Assessing the basic parameters like received signal strength, packet delay, jitter, etc., for a network is a first step towards measuring the network performances. However, while selecting a network, one should consider multiple such attributes. In the existing literature, presence of more than one cellular network interface is typically not considered. Besides, the stability of the network is often not judged. Moreover, possible computational capabilities of the user equipments are totally ignored. Using the APP presented here, a holistic picture of network link quality and stability is assessed for both the interfaces. Link quality is assessed from the variation in the signal strength and bit error rate reported by the network. Similarly, stability is assessed using cell dwell time, number of cell transition and radio link changes over any interface. The results here exhibit that it is network instability which poses serious challenge rather than the equipment which is often blamed for underperformance.
{"title":"“NeSen” - a tool for measuring link quality and stability of heterogeneous cellular network","authors":"R. Mishra, R. Pandey, N. Chaki, S. Choudhury","doi":"10.1109/ANTS.2015.7413611","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413611","url":null,"abstract":"Assessing the basic parameters like received signal strength, packet delay, jitter, etc., for a network is a first step towards measuring the network performances. However, while selecting a network, one should consider multiple such attributes. In the existing literature, presence of more than one cellular network interface is typically not considered. Besides, the stability of the network is often not judged. Moreover, possible computational capabilities of the user equipments are totally ignored. Using the APP presented here, a holistic picture of network link quality and stability is assessed for both the interfaces. Link quality is assessed from the variation in the signal strength and bit error rate reported by the network. Similarly, stability is assessed using cell dwell time, number of cell transition and radio link changes over any interface. The results here exhibit that it is network instability which poses serious challenge rather than the equipment which is often blamed for underperformance.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115654718","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
扫码关注我们
求助内容：
应助结果提醒方式：