Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758497
Dang-Hai Hoang, T. Strufe, Quang Duc Le, P. Bui, Thieu Nga Pham, Nguyet Thi Thai, Thuy Duong Le, Immanuel Schweizer
Hanoi city is currently dealing with rapidly increasing air pollution that result from variety of sources. The main cause of pollution is exhaust gas from traffic system with a very large number of private vehicles. In order to help the city's environment authorities monitor the level of air pollution, a wireless sensor network is currently under development to collect traffic pollution data measured by a number of gas sensors. This paper focuses on how to process pollution data and visualize level of pollution relying on available datasets collected from sensor network. The volume of data collected from each area of the city can be very large and dynamic due to the number of mobile sensors deployed in the same area at the same time and their measurement frequency. First, we present a method for processing raw data using calibration and data clustering techniques. Second, we describe how measurement datasets are visually represented on the city's online map on the basis of mathematical interpolation method that corresponding to characteristics of environmental data. And then we also use computer graphic technique to improve the visualization quality. Finally, this paper show the result of those methods with sample data collected from an urban district of Hanoi City on a website by which we do not only provide to viewer the actual level of pollution by position but also by time.
{"title":"Processing and visualizing traffic pollution data in Hanoi City from a wireless sensor network","authors":"Dang-Hai Hoang, T. Strufe, Quang Duc Le, P. Bui, Thieu Nga Pham, Nguyet Thi Thai, Thuy Duong Le, Immanuel Schweizer","doi":"10.1109/LCNW.2013.6758497","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758497","url":null,"abstract":"Hanoi city is currently dealing with rapidly increasing air pollution that result from variety of sources. The main cause of pollution is exhaust gas from traffic system with a very large number of private vehicles. In order to help the city's environment authorities monitor the level of air pollution, a wireless sensor network is currently under development to collect traffic pollution data measured by a number of gas sensors. This paper focuses on how to process pollution data and visualize level of pollution relying on available datasets collected from sensor network. The volume of data collected from each area of the city can be very large and dynamic due to the number of mobile sensors deployed in the same area at the same time and their measurement frequency. First, we present a method for processing raw data using calibration and data clustering techniques. Second, we describe how measurement datasets are visually represented on the city's online map on the basis of mathematical interpolation method that corresponding to characteristics of environmental data. And then we also use computer graphic technique to improve the visualization quality. Finally, this paper show the result of those methods with sample data collected from an urban district of Hanoi City on a website by which we do not only provide to viewer the actual level of pollution by position but also by time.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133647744","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758524
A. Alma'aitah, H. Hassanein, M. Ibnkahla
In RFID tag identification, tag-to-tag collisions pose a challenging problem to protocol designers. Currently the modulation silencing mechanism (MSM) has been proposed to overcome the time and power wasted on collision slots during tag identification. In MSM, the time of collision slots is reduced by the assistance of the continuous wave absence detection (CWAD) circuit. CWAD allows the tags to sense the reader's RF signal cutoff and terminate data modulation. In this paper, we propose an enhanced CWAD (ECWAD) design to reduce the time required for RF cutoff detection. The ECWAD circuit mitigates the tag-to-tag collision effects on both identification efficiency and throughput. ECWAD is a fast and low power sensing circuit that allows having shorter collision slots, faster tag identification, and limited voltage drop at the tag. When compared to the existing CWAD design, the proposed design detects the RF signal cutoff by the reader in less than 20% of that in CWAD and reduces the collision slot time by more than 32%.
{"title":"Rapid tag collision resolution using enhanced continuous wave absence detection","authors":"A. Alma'aitah, H. Hassanein, M. Ibnkahla","doi":"10.1109/LCNW.2013.6758524","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758524","url":null,"abstract":"In RFID tag identification, tag-to-tag collisions pose a challenging problem to protocol designers. Currently the modulation silencing mechanism (MSM) has been proposed to overcome the time and power wasted on collision slots during tag identification. In MSM, the time of collision slots is reduced by the assistance of the continuous wave absence detection (CWAD) circuit. CWAD allows the tags to sense the reader's RF signal cutoff and terminate data modulation. In this paper, we propose an enhanced CWAD (ECWAD) design to reduce the time required for RF cutoff detection. The ECWAD circuit mitigates the tag-to-tag collision effects on both identification efficiency and throughput. ECWAD is a fast and low power sensing circuit that allows having shorter collision slots, faster tag identification, and limited voltage drop at the tag. When compared to the existing CWAD design, the proposed design detects the RF signal cutoff by the reader in less than 20% of that in CWAD and reduces the collision slot time by more than 32%.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133787228","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758543
M. Iftikhar, M. Imran, Ghazi Al-Naymat, M. Alnuem, H. Mathkour
Solitary polling technique is not a better choice to get rid of multiple queuing problems for getting enhanced performance against single server. Enhanced and reliable performance upon multi queued traffic can be achieved through the utilization of right selection of joint polling schemes. The complexity of polling design is directly proportional to its performance. Exhaustive polling scheme is outperformed by limited service polling policy but under average load of traffic both contain same mean transfer delay. Several polling methods are the part of literature but the question of their optimal utilization in joint manners against multiple queue buffers is still open. In this paper, we build a complete analytical framework for mixed exhaustive and limited service polling model based on G/M/1 queuing system. We build the Markov chain and extract the closed form expressions of packet delay for multiple classes of self-similar traffic. We further experimentally implement four queues model with different arrangements of mixed polling schemes to conclude the most optimal joint polling model for modern 4G wireless network through analyzing the co-relation between delay and Hurst parameter.
{"title":"Performance analysis of mixed polling schemes with multiple classes of self-similar traffic input to build comprehensive SLAs","authors":"M. Iftikhar, M. Imran, Ghazi Al-Naymat, M. Alnuem, H. Mathkour","doi":"10.1109/LCNW.2013.6758543","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758543","url":null,"abstract":"Solitary polling technique is not a better choice to get rid of multiple queuing problems for getting enhanced performance against single server. Enhanced and reliable performance upon multi queued traffic can be achieved through the utilization of right selection of joint polling schemes. The complexity of polling design is directly proportional to its performance. Exhaustive polling scheme is outperformed by limited service polling policy but under average load of traffic both contain same mean transfer delay. Several polling methods are the part of literature but the question of their optimal utilization in joint manners against multiple queue buffers is still open. In this paper, we build a complete analytical framework for mixed exhaustive and limited service polling model based on G/M/1 queuing system. We build the Markov chain and extract the closed form expressions of packet delay for multiple classes of self-similar traffic. We further experimentally implement four queues model with different arrangements of mixed polling schemes to conclude the most optimal joint polling model for modern 4G wireless network through analyzing the co-relation between delay and Hurst parameter.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132377406","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758547
Lim Su Jin, S. Lee, Simon Boung-Yew Lau, E. Karuppiah
Network performance metrics such as available bandwidth and latency are essential to achieve good Quality of Service (QoS) in multimedia streaming. There are unique requirements in network performance metrics for media applications, such as audio conferencing, video streaming, video conferencing, and high-definition (HD) video conferencing. In this paper, we focus on conference call type suggestion based on link quality prediction. The link's quality is classified based on the available bandwidth and latency between two network nodes. We have implemented and compared two of the most popular supervised learning based classification methods, i.e. logistic regression and support vector machine (SVM). We have compared the performance of both methods and their suitability to apply in link quality prediction. The experimental results show that SVM outperforms logistic regression for binary and multiclass classification in terms of accuracy.
{"title":"Link quality prediction for multimedia streaming based on available bandwidth and latency","authors":"Lim Su Jin, S. Lee, Simon Boung-Yew Lau, E. Karuppiah","doi":"10.1109/LCNW.2013.6758547","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758547","url":null,"abstract":"Network performance metrics such as available bandwidth and latency are essential to achieve good Quality of Service (QoS) in multimedia streaming. There are unique requirements in network performance metrics for media applications, such as audio conferencing, video streaming, video conferencing, and high-definition (HD) video conferencing. In this paper, we focus on conference call type suggestion based on link quality prediction. The link's quality is classified based on the available bandwidth and latency between two network nodes. We have implemented and compared two of the most popular supervised learning based classification methods, i.e. logistic regression and support vector machine (SVM). We have compared the performance of both methods and their suitability to apply in link quality prediction. The experimental results show that SVM outperforms logistic regression for binary and multiclass classification in terms of accuracy.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125083737","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758505
N. Bergmann, J. Juergens, L. Hou, Yunlong Wang, Jarrod Trevathan
This work investigates whether a contactless, wireless underwater coupling could be developed for underwater sensor networks. This requires the wireless transmission of power from the sensor hub to the transducer module, and the two-way wireless data communication between hub and transducer. Results from a trial deployment of systems with conventional waterproof couplings show that these are a major shortcoming of existing systems. Experiments are conducted which demonstrate that a Zigbee transceiver, operating in the 2.4GHz band, can communicate with low error rates up to 40mm at low RF power (-25dBm) and up to 70mm at higher power (-3 dBm) in seawater. Ranges are slightly higher in fresh water. Inductive power transfer, using a split transformer design, can transmit low power, in the 50-100mW range with efficiency of approximately 50%, demonstrating that wireless sensor couplings are feasible.
{"title":"Wireless underwater power and data transfer","authors":"N. Bergmann, J. Juergens, L. Hou, Yunlong Wang, Jarrod Trevathan","doi":"10.1109/LCNW.2013.6758505","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758505","url":null,"abstract":"This work investigates whether a contactless, wireless underwater coupling could be developed for underwater sensor networks. This requires the wireless transmission of power from the sensor hub to the transducer module, and the two-way wireless data communication between hub and transducer. Results from a trial deployment of systems with conventional waterproof couplings show that these are a major shortcoming of existing systems. Experiments are conducted which demonstrate that a Zigbee transceiver, operating in the 2.4GHz band, can communicate with low error rates up to 40mm at low RF power (-25dBm) and up to 70mm at higher power (-3 dBm) in seawater. Ranges are slightly higher in fresh water. Inductive power transfer, using a split transformer design, can transmit low power, in the 50-100mW range with efficiency of approximately 50%, demonstrating that wireless sensor couplings are feasible.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128801105","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758532
D. Reinhardt, Christian Buchner, Niklas Leibecke
Mobile sensing applications leverage sensors embedded in today's mobile phones to gather both user-centric and environmental data in unprecedented quantity and quality. The collection of sensor readings annotated with time and location information may however endanger users' privacy, as they may reveal their routines and habits. Our paper investigates different factors that may foster user contributions to these applications despite the related privacy threats. In particular, we analyze the impact of demographics, incentives, and gathering conditions on both the importance and value of privacy by means of a questionnaire-based user study with 200 anonymous participants. Our results show that young participants already sharing information online are more susceptible to contribute to participatory sensing applications initiated by academic institutions for a mean monthly reward of 50 euros.
{"title":"What's the value of your privacy? Exploring factors that influence privacy-sensitive contributions to participatory sensing applications","authors":"D. Reinhardt, Christian Buchner, Niklas Leibecke","doi":"10.1109/LCNW.2013.6758532","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758532","url":null,"abstract":"Mobile sensing applications leverage sensors embedded in today's mobile phones to gather both user-centric and environmental data in unprecedented quantity and quality. The collection of sensor readings annotated with time and location information may however endanger users' privacy, as they may reveal their routines and habits. Our paper investigates different factors that may foster user contributions to these applications despite the related privacy threats. In particular, we analyze the impact of demographics, incentives, and gathering conditions on both the importance and value of privacy by means of a questionnaire-based user study with 200 anonymous participants. Our results show that young participants already sharing information online are more susceptible to contribute to participatory sensing applications initiated by academic institutions for a mean monthly reward of 50 euros.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122586481","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758508
Q. Tse, Weisheng Si, J. Taheri
Recent advances in communication technology has enabled vehicles to communicate with each other autonomously through the use of IEEE 802.11p protocol. Vehicle-to-vehicle communication regularly makes use of the broadcast mode transmissions, which are not often used prior to this application. Broadcast mode transmissions are more prone to frame loss from channel contention than unicasts due to its inability to adapt, and are unable to recover lost frames. This makes them very sensitive to channel congestion. In this paper, we first apply a variant of Bianchi et al.'s Markov model of the Distributed Coordination Function (DCF), to show that the observed inter-frame idle slots can be expressed as a probability distribution conditional on the number of saturated stations. It therefore follows that the probability distribution for the number of saturated stations can be estimated from inter-frame idle slots through Bayes Law. Second, we present a novel passive channel congestion estimation technique that observes the inter-frame idle slot counts in any given IEEE 802.11 network and uses a naïve Bayes classifier to estimate the current channel contention in terms of the number of concurrent saturated stations. This technique is evaluated using computer simulations, and is shown to produce more accurate estimates with faster convergence time than the existing technique of observing collision probability using channel busy status as a proxy.
{"title":"Estimating contention of IEEE 802.11 broadcasts based on inter-frame idle slots","authors":"Q. Tse, Weisheng Si, J. Taheri","doi":"10.1109/LCNW.2013.6758508","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758508","url":null,"abstract":"Recent advances in communication technology has enabled vehicles to communicate with each other autonomously through the use of IEEE 802.11p protocol. Vehicle-to-vehicle communication regularly makes use of the broadcast mode transmissions, which are not often used prior to this application. Broadcast mode transmissions are more prone to frame loss from channel contention than unicasts due to its inability to adapt, and are unable to recover lost frames. This makes them very sensitive to channel congestion. In this paper, we first apply a variant of Bianchi et al.'s Markov model of the Distributed Coordination Function (DCF), to show that the observed inter-frame idle slots can be expressed as a probability distribution conditional on the number of saturated stations. It therefore follows that the probability distribution for the number of saturated stations can be estimated from inter-frame idle slots through Bayes Law. Second, we present a novel passive channel congestion estimation technique that observes the inter-frame idle slot counts in any given IEEE 802.11 network and uses a naïve Bayes classifier to estimate the current channel contention in terms of the number of concurrent saturated stations. This technique is evaluated using computer simulations, and is shown to produce more accurate estimates with faster convergence time than the existing technique of observing collision probability using channel busy status as a proxy.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"2050 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129811332","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758507
Afraa Attiah, M. Akbaş, M. Chatterjee, D. Turgut
Energy efficiency is of utmost importance for wireless sensor networks deployed without any possibility of battery replenishments. Thus, design of energy efficient algorithms and protocols must consider resource constraints while maintaining the desired level of QoS. In this paper, we present EE-MAC, an Energy Efficient medium access control (MAC) protocol for distributed wireless sensor networks. EE-MAC achieves a low-duty-cycle and hence low energy consumption through optimized sleep intervals while transitioning between sleep and active states. We consider a weighted linear combination of delay and energy saving as the performance metrics and through extensive simulations, we observe reduced energy consumption at the cost of increased delay. EE-MAC also improves the delay performance for fixed number of nodes compared to S-MAC.
{"title":"EE-MAC: Energy efficient sensor MAC layer protocol","authors":"Afraa Attiah, M. Akbaş, M. Chatterjee, D. Turgut","doi":"10.1109/LCNW.2013.6758507","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758507","url":null,"abstract":"Energy efficiency is of utmost importance for wireless sensor networks deployed without any possibility of battery replenishments. Thus, design of energy efficient algorithms and protocols must consider resource constraints while maintaining the desired level of QoS. In this paper, we present EE-MAC, an Energy Efficient medium access control (MAC) protocol for distributed wireless sensor networks. EE-MAC achieves a low-duty-cycle and hence low energy consumption through optimized sleep intervals while transitioning between sleep and active states. We consider a weighted linear combination of delay and energy saving as the performance metrics and through extensive simulations, we observe reduced energy consumption at the cost of increased delay. EE-MAC also improves the delay performance for fixed number of nodes compared to S-MAC.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242677","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758515
Ismehene Chahbi, Dorra Ben Amara, A. Belghith
Route guidance systems become indispensable for car drivers because of its great convenience. To be efficient, these systems require optimal selection of the routes according to the preferences of drivers. In this paper, a novel route guidance algorithm is proposed for vehicular networks (VANETS). It uses the MVDR beamforming technique which can enhance coverage and reduce radio interference in wireless networks. The proposed algorithm aims to optimize coverage and connectivity of drivers to public hotspots while ensuring a reasonable total traversed distance. Performance results show that our algorithm outperforms the route guidance system using omnidirectionnal antennas and the shortest path algorithm.
{"title":"A novel route guidance algorithm using beamforming techniques for vehicular networks","authors":"Ismehene Chahbi, Dorra Ben Amara, A. Belghith","doi":"10.1109/LCNW.2013.6758515","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758515","url":null,"abstract":"Route guidance systems become indispensable for car drivers because of its great convenience. To be efficient, these systems require optimal selection of the routes according to the preferences of drivers. In this paper, a novel route guidance algorithm is proposed for vehicular networks (VANETS). It uses the MVDR beamforming technique which can enhance coverage and reduce radio interference in wireless networks. The proposed algorithm aims to optimize coverage and connectivity of drivers to public hotspots while ensuring a reasonable total traversed distance. Performance results show that our algorithm outperforms the route guidance system using omnidirectionnal antennas and the shortest path algorithm.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115781350","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 : 2013-10-01DOI: 10.1109/LCNW.2013.6758545
S. Zander, L. Andrew, G. Armitage, G. Huston
As of April 2013 almost 95% of the IPv4 address space has been allocated. Yet, the transition to IPv6 is still relatively slow. One reason could be existing “IPv4 reserves” - allocated but unused IPv4 addresses. Knowing how many addresses are actively used is important to predict a potential IPv4 address market, predict the IPv6 deployment time frame, and measure progressive exhaustion after the IPv4 space is fully allocated. Unfortunately, only a fraction of hosts respond to active probes, such as “ping”. We propose a capture-recapture method to estimate the actively used IPv4 addresses from multiple incomplete data sources, including “ping” censuses, network traces and server logs. We estimate that at least 950-1090 million IPv4 addresses are used, which is 36-41% of the publicly routed space. We analyse how the utilisation depends on various factors, such as region, country and allocation prefix length.
{"title":"Estimating IPv4 address space usage with capture-recapture","authors":"S. Zander, L. Andrew, G. Armitage, G. Huston","doi":"10.1109/LCNW.2013.6758545","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758545","url":null,"abstract":"As of April 2013 almost 95% of the IPv4 address space has been allocated. Yet, the transition to IPv6 is still relatively slow. One reason could be existing “IPv4 reserves” - allocated but unused IPv4 addresses. Knowing how many addresses are actively used is important to predict a potential IPv4 address market, predict the IPv6 deployment time frame, and measure progressive exhaustion after the IPv4 space is fully allocated. Unfortunately, only a fraction of hosts respond to active probes, such as “ping”. We propose a capture-recapture method to estimate the actively used IPv4 addresses from multiple incomplete data sources, including “ping” censuses, network traces and server logs. We estimate that at least 950-1090 million IPv4 addresses are used, which is 36-41% of the publicly routed space. We analyse how the utilisation depends on various factors, such as region, country and allocation prefix length.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112647","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
扫码关注我们
求助内容：
应助结果提醒方式：