Pub Date : 2012-04-03DOI: 10.1109/NCC.2012.6176752
V. Lalitha, N. Prakash, G. Kamath, P. V. Kumar
An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.
{"title":"On t-designs and bounds relating query complexity to error resilience in locally correctable codes","authors":"V. Lalitha, N. Prakash, G. Kamath, P. V. Kumar","doi":"10.1109/NCC.2012.6176752","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176752","url":null,"abstract":"An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981084","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176741
V. Sukumaran, U. Mukherji
We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.
{"title":"Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection","authors":"V. Sukumaran, U. Mukherji","doi":"10.1109/NCC.2012.6176741","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176741","url":null,"abstract":"We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545630","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176782
B. Sameer, R. D. Koilpillai, P. MuraliKrishna
An overview of the unique challenges in underwater acoustic (UWA) communication in ocean environment is presented. The UWA channel is compared with conventional RF channels. Several design considerations applicable to the physical layer design of a UWA communication system is described based on field measurements. The unique problems in synchronization under high Doppler are described highlighting the key differences in the way Doppler affects the RF and UWA channels. A novel timing synchronization mechanism has been introduced in this study which caters for both the sampling skew offset and the Doppler shift between the transmitter and the receiver.
{"title":"Underwater acoustic communications: Design considerations at the physical layer based on field trials","authors":"B. Sameer, R. D. Koilpillai, P. MuraliKrishna","doi":"10.1109/NCC.2012.6176782","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176782","url":null,"abstract":"An overview of the unique challenges in underwater acoustic (UWA) communication in ocean environment is presented. The UWA channel is compared with conventional RF channels. Several design considerations applicable to the physical layer design of a UWA communication system is described based on field measurements. The unique problems in synchronization under high Doppler are described highlighting the key differences in the way Doppler affects the RF and UWA channels. A novel timing synchronization mechanism has been introduced in this study which caters for both the sampling skew offset and the Doppler shift between the transmitter and the receiver.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133803781","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176740
R. G. Brunet, H. Murthy
Automatic Speech Recognition (ASR) systems account for wide variability in the acoustic signal through large amounts of training data. From a linguistic point of view, the acoustic variability is a consequence of pronunciation variation. It is apparent that neither (i) any two speakers utter the same words exactly the same way nor (ii) an individual can repeat the same words with acoustic identity. Hence ASR systems usually rely on multiple-pronunciation lexicons to match an acoustic sequence with a lexical unit. In this study, we have adopted a data-driven approach to generate pronunciation variants at syllable level. Group-Delay (GD) segmentation algorithm is used to acquire acoustic cue about syllable boundaries, which are validated by a vowel-onset point (VOP) detection algorithm. Manual transcriptions of GD syllable segments are done to produce new pronunciation variants. Results on the TIMIT database show that some pronunciations are exclusive for a particular dialect.
{"title":"Pronunciation variation across different dialects for English: A syllable-centric approach","authors":"R. G. Brunet, H. Murthy","doi":"10.1109/NCC.2012.6176740","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176740","url":null,"abstract":"Automatic Speech Recognition (ASR) systems account for wide variability in the acoustic signal through large amounts of training data. From a linguistic point of view, the acoustic variability is a consequence of pronunciation variation. It is apparent that neither (i) any two speakers utter the same words exactly the same way nor (ii) an individual can repeat the same words with acoustic identity. Hence ASR systems usually rely on multiple-pronunciation lexicons to match an acoustic sequence with a lexical unit. In this study, we have adopted a data-driven approach to generate pronunciation variants at syllable level. Group-Delay (GD) segmentation algorithm is used to acquire acoustic cue about syllable boundaries, which are validated by a vowel-onset point (VOP) detection algorithm. Manual transcriptions of GD syllable segments are done to produce new pronunciation variants. Results on the TIMIT database show that some pronunciations are exclusive for a particular dialect.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126996810","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176903
S. Baghel, K. Keshav, V. R. Manepalli
Present day smartphones like iPhone and Andriod based phones have lead to explosive growth in traffic over cellular networks. The growth has occurred both in volume and diversity in terms of traffic characteristics. Among the different types of traffic, there is prominent increase in background type of data due to popularity of applications like Facebook, Skype, Email clients etc which keeps exchanging data with corresponding server, even when the user is not actively using the application. In order to save power consumption of smart phones and for optimal allocation of resources to deserving phones in network by minimum possible signaling traffic, 3GPP LTE specifications have defined mechanisms like connected mode DRX (Discontinuous Reception) which offers two stage of sleep in form of long & short DRX. Since such diverse type of applications are running in smartphone, this work attempts to investigate traffic characteristics of popular applications in Andriod based smartphones. Due to various reasons, such applications, keep consuming precious bandwidth and battery even when not in active use. Main emphasis is thus provided to study the characteristic of these applications when they are running without user intervention. Since, the diverse range of data characteristics is assumed to be causing drain in User Equipment (UE) battery and overhead in NW signaling, we expect that this investigation would help in developing appropriate new power saving mechanisms in future releases of cellular networks.
{"title":"An investigation into traffic analysis for diverse data applications on smartphones","authors":"S. Baghel, K. Keshav, V. R. Manepalli","doi":"10.1109/NCC.2012.6176903","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176903","url":null,"abstract":"Present day smartphones like iPhone and Andriod based phones have lead to explosive growth in traffic over cellular networks. The growth has occurred both in volume and diversity in terms of traffic characteristics. Among the different types of traffic, there is prominent increase in background type of data due to popularity of applications like Facebook, Skype, Email clients etc which keeps exchanging data with corresponding server, even when the user is not actively using the application. In order to save power consumption of smart phones and for optimal allocation of resources to deserving phones in network by minimum possible signaling traffic, 3GPP LTE specifications have defined mechanisms like connected mode DRX (Discontinuous Reception) which offers two stage of sleep in form of long & short DRX. Since such diverse type of applications are running in smartphone, this work attempts to investigate traffic characteristics of popular applications in Andriod based smartphones. Due to various reasons, such applications, keep consuming precious bandwidth and battery even when not in active use. Main emphasis is thus provided to study the characteristic of these applications when they are running without user intervention. Since, the diverse range of data characteristics is assumed to be causing drain in User Equipment (UE) battery and overhead in NW signaling, we expect that this investigation would help in developing appropriate new power saving mechanisms in future releases of cellular networks.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122097730","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176769
D. Packiaraj, M. Ramesh, A. T. Kalghatgi, K. Vinoy
Analysis of a microstrip line with a symmetrically located aperture in its ground plane is reported in this paper. The solution is based on conformal mapping technique. Conformal mapping has been used to determine the characteristic impedance and effective permittivity of the line. The accuracy of results is within 5% error. An low pass filter has been designed based on the electrical parameters obtained using the proposed method.
{"title":"Analysis of modified microstrip line and its application","authors":"D. Packiaraj, M. Ramesh, A. T. Kalghatgi, K. Vinoy","doi":"10.1109/NCC.2012.6176769","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176769","url":null,"abstract":"Analysis of a microstrip line with a symmetrically located aperture in its ground plane is reported in this paper. The solution is based on conformal mapping technique. Conformal mapping has been used to determine the characteristic impedance and effective permittivity of the line. The accuracy of results is within 5% error. An low pass filter has been designed based on the electrical parameters obtained using the proposed method.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130331224","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176787
S. Kalamkar, A. Banerjee, A. Roychowdhury
Cooperation among multiple secondary users improves the cognitive radio sensing system performance, but the presence of malicious secondary users may severely degrade the same. In this paper, we study the detection and elimination of such malicious users in a cooperative sensing system using Dixon's outlier test and compare its performance with Grubb's test and boxplot test. We have shown using receiver operating characteristics curves that Dixon's test outperforms Grubb's test and boxplot test for the case of a single malicious user. We also illustrate the limitations of Dixon's test for several malicious users using an example of two malicious users in a cooperative spectrum sensing setting for cognitive radio.
{"title":"Malicious user suppression for cooperative spectrum sensing in cognitive radio networks using Dixon's outlier detection method","authors":"S. Kalamkar, A. Banerjee, A. Roychowdhury","doi":"10.1109/NCC.2012.6176787","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176787","url":null,"abstract":"Cooperation among multiple secondary users improves the cognitive radio sensing system performance, but the presence of malicious secondary users may severely degrade the same. In this paper, we study the detection and elimination of such malicious users in a cooperative sensing system using Dixon's outlier test and compare its performance with Grubb's test and boxplot test. We have shown using receiver operating characteristics curves that Dixon's test outperforms Grubb's test and boxplot test for the case of a single malicious user. We also illustrate the limitations of Dixon's test for several malicious users using an example of two malicious users in a cooperative spectrum sensing setting for cognitive radio.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130364625","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176796
M. Kamalapriya, V. Thilagavathi
Visible defects in Night Vision (NVD) Device images can act as visual distractions and may be large enough to mask critical information of normal night vision operations. In this paper we present a new method for detection of visual defects which will in turn help in the evaluation of Micro Channel Plate used in image intensifiers. The proposed method adopts a hybrid scheme using Circular Hough Transform and Shape classifier with Connected Component Analysis. The statistical and geometrical properties over a connected region of boundaries are explored for the purpose of defect detection. The performance is evaluated based on the noise withstanding capability of the algorithm.
{"title":"Automatic detection of visual defects in image intensifiers","authors":"M. Kamalapriya, V. Thilagavathi","doi":"10.1109/NCC.2012.6176796","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176796","url":null,"abstract":"Visible defects in Night Vision (NVD) Device images can act as visual distractions and may be large enough to mask critical information of normal night vision operations. In this paper we present a new method for detection of visual defects which will in turn help in the evaluation of Micro Channel Plate used in image intensifiers. The proposed method adopts a hybrid scheme using Circular Hough Transform and Shape classifier with Connected Component Analysis. The statistical and geometrical properties over a connected region of boundaries are explored for the purpose of defect detection. The performance is evaluated based on the noise withstanding capability of the algorithm.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703791","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176745
V. Prashanth, T. V. Prabhakar, K. Prakruthi, H. Jamadagni
We investigate the queue stability in Energy Harvesting Sensor (EHS) nodes under indoor conditions wherein solar energy equipped EHS nodes are deployed for intrusion detection. We implement two policies, namely Throughput Optimal and Greedy and test the conditions under which they ensure queue stability. Energy and Data are injected following a distribution. An important observation is the use of “mean harvested energy” in proposed policies. Presently it does not seem practical to use this term, but works well when nodes have a priori knowledge of its value. Our results indicate that exponential arrival of data and energy offers maximum stability under these stressful conditions.
{"title":"Queue stability measurements for Energy Harvesting Sensor nodes","authors":"V. Prashanth, T. V. Prabhakar, K. Prakruthi, H. Jamadagni","doi":"10.1109/NCC.2012.6176745","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176745","url":null,"abstract":"We investigate the queue stability in Energy Harvesting Sensor (EHS) nodes under indoor conditions wherein solar energy equipped EHS nodes are deployed for intrusion detection. We implement two policies, namely Throughput Optimal and Greedy and test the conditions under which they ensure queue stability. Energy and Data are injected following a distribution. An important observation is the use of “mean harvested energy” in proposed policies. Presently it does not seem practical to use this term, but works well when nodes have a priori knowledge of its value. Our results indicate that exponential arrival of data and energy offers maximum stability under these stressful conditions.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129465398","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176804
A. Kumar, P. G. Namboothiri, S. Deshpande, S. Vidhyadharan, K. Sivalingam, S. S. Murty
This paper presents the throughput results obtained from a Wireless Sensor Network testbed, with single and multiple sources in different network deployments and routing architectures. The experimental testbed deployed at IIT Madras consisted of commercially available Crossbow TelosB and MicaZ nodes and a custom-built sensor node based on the DigiNet Xbee chip, with all nodes implementing the Zigbee standard. The networks were deployed in uniform grid topologies in three different deployments with up to 228 nodes. The main aim of the experiments is to analyze the throughput and packet delivery ratio observed with single and multiple sources. The experimental results show that delivery ratio reduces with increase in data rate due to collisions and help characterise the network capacity limits.
{"title":"Testbed based throughput analysis in a Wireless Sensor Network","authors":"A. Kumar, P. G. Namboothiri, S. Deshpande, S. Vidhyadharan, K. Sivalingam, S. S. Murty","doi":"10.1109/NCC.2012.6176804","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176804","url":null,"abstract":"This paper presents the throughput results obtained from a Wireless Sensor Network testbed, with single and multiple sources in different network deployments and routing architectures. The experimental testbed deployed at IIT Madras consisted of commercially available Crossbow TelosB and MicaZ nodes and a custom-built sensor node based on the DigiNet Xbee chip, with all nodes implementing the Zigbee standard. The networks were deployed in uniform grid topologies in three different deployments with up to 228 nodes. The main aim of the experiments is to analyze the throughput and packet delivery ratio observed with single and multiple sources. The experimental results show that delivery ratio reduces with increase in data rate due to collisions and help characterise the network capacity limits.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124622323","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
扫码关注我们
求助内容：
应助结果提醒方式：