Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098671
Suiming Guo, Liang Chen, Guoqiang Zhang, D. Chiu
We study the problem of managing high intradatacenter traffic in a chunk-based public cloud storage service. The high traffic volume is introduced by aggregating very large files from multiple chunk servers in a single edge server. We measure a commercial cloud storage service system, and observe that peak traffic volume overwhelms the network interface cards (NICs) significantly. In the scenario of delivering content based on Smart Home network, it can be expected the file downloading service could be delay-insensitive. Thus, we propose “Batching Smooth intra-datacenter Traffic” (BST) scheme to reduce the peak load to a specified upper bound by batching and delaying users' requests. We resort to a mathematical model to understand the necessity of batching strategy. To evaluate BST's effects, we implement trace-driven simulations with different scheduling policies. In the commercial cloud storage service system, we show that BST is capable of keeping the upper bound to approximately 75% of the original peak traffic by trading off an average delay of 8 minutes.
{"title":"Batching for Smart Home: Leveraging delay-insensitive workload in cloud storage","authors":"Suiming Guo, Liang Chen, Guoqiang Zhang, D. Chiu","doi":"10.1109/COMSNETS.2015.7098671","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098671","url":null,"abstract":"We study the problem of managing high intradatacenter traffic in a chunk-based public cloud storage service. The high traffic volume is introduced by aggregating very large files from multiple chunk servers in a single edge server. We measure a commercial cloud storage service system, and observe that peak traffic volume overwhelms the network interface cards (NICs) significantly. In the scenario of delivering content based on Smart Home network, it can be expected the file downloading service could be delay-insensitive. Thus, we propose “Batching Smooth intra-datacenter Traffic” (BST) scheme to reduce the peak load to a specified upper bound by batching and delaying users' requests. We resort to a mathematical model to understand the necessity of batching strategy. To evaluate BST's effects, we implement trace-driven simulations with different scheduling policies. In the commercial cloud storage service system, we show that BST is capable of keeping the upper bound to approximately 75% of the original peak traffic by trading off an average delay of 8 minutes.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129538352","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098678
M. DeepakP., C. K. Ali
DFT spread OFDMA popularly known as Single carrier frequency division multiple access (SCFDMA) is an emerging wireless standard and has received considerable attention because of its ability to incorporate advantages of single carrier modulation with OFDMA. Even though SCFDMA has low peak to average power ratio (PAPR) and resistance to frequency nulls of the channel, it inherits some drawbacks from OFDMA. Frequency synchronization between transmitter and receiver in mobile environment and resulting performance degradation is one such issue especially in uplink communication. After the standardization of SCFDMA as uplink standard for LTE, frequency synchronization is an active area of research. In this paper SCFDMA system is analysed in the presence of CFO and the results of analysis is utilized in framing an efficient representation to the multidimensional frequency synchronization problem as effective ICI matrix and a method to jointly compensate effective ICI matrix and equalize the channel is proposed based on minimum mean square error criterion and its performance is compared with the existing schemes.
{"title":"Effective ICI matrix and its compensation in SCFDMA communication system","authors":"M. DeepakP., C. K. Ali","doi":"10.1109/COMSNETS.2015.7098678","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098678","url":null,"abstract":"DFT spread OFDMA popularly known as Single carrier frequency division multiple access (SCFDMA) is an emerging wireless standard and has received considerable attention because of its ability to incorporate advantages of single carrier modulation with OFDMA. Even though SCFDMA has low peak to average power ratio (PAPR) and resistance to frequency nulls of the channel, it inherits some drawbacks from OFDMA. Frequency synchronization between transmitter and receiver in mobile environment and resulting performance degradation is one such issue especially in uplink communication. After the standardization of SCFDMA as uplink standard for LTE, frequency synchronization is an active area of research. In this paper SCFDMA system is analysed in the presence of CFO and the results of analysis is utilized in framing an efficient representation to the multidimensional frequency synchronization problem as effective ICI matrix and a method to jointly compensate effective ICI matrix and equalize the channel is proposed based on minimum mean square error criterion and its performance is compared with the existing schemes.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129677747","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098730
Rakesh U. Chavan, M. Belur, D. Chakraborty, D. Manjunath
We develop a new model for traffic with on roads with multiple lanes but where the vehicles do not quite adhere to a lane discipline. To study the system the dynamics is split along two independent directions-the y-axis representing the direction of motion and and the x-axis representhe the lateral or the direction perpendicular to the direction of motion. Different influence graphs are used to model the interaction between the vehicles in these two directions. The model allows more than one `layer' ahead to influence the dynamics of a car thus allowing for mutliple cars in its visible range to affect its motion. The stability of the dynamical system models are analyzed. Conditions are provided under which all cars can converge to constant spacing. The spacing will refer to distance among cars in two levels along the direction of motion and between the cars in the same level.
{"title":"On the stability and formations in ad hoc multilane vehicular traffic","authors":"Rakesh U. Chavan, M. Belur, D. Chakraborty, D. Manjunath","doi":"10.1109/COMSNETS.2015.7098730","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098730","url":null,"abstract":"We develop a new model for traffic with on roads with multiple lanes but where the vehicles do not quite adhere to a lane discipline. To study the system the dynamics is split along two independent directions-the y-axis representing the direction of motion and and the x-axis representhe the lateral or the direction perpendicular to the direction of motion. Different influence graphs are used to model the interaction between the vehicles in these two directions. The model allows more than one `layer' ahead to influence the dynamics of a car thus allowing for mutliple cars in its visible range to affect its motion. The stability of the dynamical system models are analyzed. Conditions are provided under which all cars can converge to constant spacing. The spacing will refer to distance among cars in two levels along the direction of motion and between the cars in the same level.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368573","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098699
M. R. Rao, J. Kuri, T. V. Prabhakar
Demand Response is under implementation throughout the globe by many utilities to incorporate the end user as an active player in reducing supply-demand imbalances. Day-ahead pricing is provided as an option to schedule electric loads so as to take advantage of time-varying prices. However, user convenience is also a factor that must be taken into account, as users may be willing to forego some savings to reduce inconvenience. We formulate an optimal scheduling problem considering both aspects. As the search space is exponentially large, we propose two greedy algorithms to find good schedules. To assess performance, we obtain the optimal schedule via Markov Chain Monte Carlo (MCMC) based simulations. We apply the framework to two case studies; one study uses appliance energy profiles obtained by actual measurements using the Joule Jotter, a device designed and developed in-house. Results indicate that the proposed algorithms perform very well, achieving performance within 10% of the optimal.
{"title":"Towards optimal load management with day ahead pricing","authors":"M. R. Rao, J. Kuri, T. V. Prabhakar","doi":"10.1109/COMSNETS.2015.7098699","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098699","url":null,"abstract":"Demand Response is under implementation throughout the globe by many utilities to incorporate the end user as an active player in reducing supply-demand imbalances. Day-ahead pricing is provided as an option to schedule electric loads so as to take advantage of time-varying prices. However, user convenience is also a factor that must be taken into account, as users may be willing to forego some savings to reduce inconvenience. We formulate an optimal scheduling problem considering both aspects. As the search space is exponentially large, we propose two greedy algorithms to find good schedules. To assess performance, we obtain the optimal schedule via Markov Chain Monte Carlo (MCMC) based simulations. We apply the framework to two case studies; one study uses appliance energy profiles obtained by actual measurements using the Joule Jotter, a device designed and developed in-house. Results indicate that the proposed algorithms perform very well, achieving performance within 10% of the optimal.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122947970","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098679
Anjitha Viswanath, V. Jain, Subrat Kar
Atmospheric turbulence causes severe degradation in the performance of free space optical (FSO) communication links. Among the various techniques used to mitigate the effect of turbulence, aperture averaging is one of the simplest. We experimentally investigate the effect of aperture averaging on the performance of FSO communication links for different intensity modulation (IM) schemes namely on-off keying (OOK), pulse position modulation (64-PPM) and differential pulse position modulation (64-DPPM). Atmospheric turbulence is artificially generated within an optical turbulence generator (OTG) chamber and for the above mentioned IM schemes beam variance measurements are carried out for different temperature induced turbulence conditions. The value of beam variance is used to determine the refractive index structure parameter and hence the Rytov variance. Finally, the bit error rate (BER) in presence of aperture averaging for the above modulation schemes is calculated. It is observed that the PPM scheme is a power efficient modulation scheme with lower error rate in comparison to DPPM and OOK schemes with its highly peaked pulses encountering the effect of turbulence effectively. Also, the link performance improves with aperture averaging for all the modulation schemes with the improvement more pronounced in the case PPM scheme. Thus PPM becomes the preferred modulation scheme in designing a FSO communication link.
{"title":"Experimental evaluation of the effect of aperture averaging technique on the performance of free space optical communication link for different intensity modulation schemes","authors":"Anjitha Viswanath, V. Jain, Subrat Kar","doi":"10.1109/COMSNETS.2015.7098679","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098679","url":null,"abstract":"Atmospheric turbulence causes severe degradation in the performance of free space optical (FSO) communication links. Among the various techniques used to mitigate the effect of turbulence, aperture averaging is one of the simplest. We experimentally investigate the effect of aperture averaging on the performance of FSO communication links for different intensity modulation (IM) schemes namely on-off keying (OOK), pulse position modulation (64-PPM) and differential pulse position modulation (64-DPPM). Atmospheric turbulence is artificially generated within an optical turbulence generator (OTG) chamber and for the above mentioned IM schemes beam variance measurements are carried out for different temperature induced turbulence conditions. The value of beam variance is used to determine the refractive index structure parameter and hence the Rytov variance. Finally, the bit error rate (BER) in presence of aperture averaging for the above modulation schemes is calculated. It is observed that the PPM scheme is a power efficient modulation scheme with lower error rate in comparison to DPPM and OOK schemes with its highly peaked pulses encountering the effect of turbulence effectively. Also, the link performance improves with aperture averaging for all the modulation schemes with the improvement more pronounced in the case PPM scheme. Thus PPM becomes the preferred modulation scheme in designing a FSO communication link.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927618","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098675
Yan Shi, S. Biswas
Detecting access to video streaming websites is the first step for an organization to regulate unwanted accesses to such sites by its employees. Adversaries often adopt circumvention techniques using proxy servers and Virtual Private Networks (VPNs) in order to avoid such detection. This paper presents a traffic analysis based technique that can detect such tunneled traffic at an organization's firewall using signatures found in traffic amount and timing in targeted video traffic. We present the detection results on the traffic data for several popular video streaming sites. Additional results are presented to validate the detection framework when detecting access to video streaming sites from a wide range of clients with a classifier trained with traffic data collected from a limited number of clients. The results show that the classifier works in both cases. It detects same-client traffic with high true positive rate, while it detects traffic from an unknown client with lower true positive rate but very low false positive rate. The results validate the effectiveness of traffic analysis based detection of video streaming sites.
{"title":"Detecting tunneled video streams using traffic analysis","authors":"Yan Shi, S. Biswas","doi":"10.1109/COMSNETS.2015.7098675","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098675","url":null,"abstract":"Detecting access to video streaming websites is the first step for an organization to regulate unwanted accesses to such sites by its employees. Adversaries often adopt circumvention techniques using proxy servers and Virtual Private Networks (VPNs) in order to avoid such detection. This paper presents a traffic analysis based technique that can detect such tunneled traffic at an organization's firewall using signatures found in traffic amount and timing in targeted video traffic. We present the detection results on the traffic data for several popular video streaming sites. Additional results are presented to validate the detection framework when detecting access to video streaming sites from a wide range of clients with a classifier trained with traffic data collected from a limited number of clients. The results show that the classifier works in both cases. It detects same-client traffic with high true positive rate, while it detects traffic from an unknown client with lower true positive rate but very low false positive rate. The results validate the effectiveness of traffic analysis based detection of video streaming sites.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130148883","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098716
A. Adil, Venkataramana Badarla, A. Plappally, R. Bhandari, Poonam Chand Sankhla
Today, Information and Communication Technology (ICT) is ubiquitous. It has touched almost all spheres concerning human survival, growth and development. Agriculture is no exception to it. This paper presents the research initiatives towards improving irrigation efficiency through affordable ICT solutions. It presents experimental results of studies related to improving irrigation efficiency in Semi arid zones in India, using commercially available ICT solutions. It compares between simple microirrigation and microirrigation with ICT (irrigation on demand) and establishes that by using ICT in agriculture, we can increase the irrigation efficiencies by a considerable amount. The paper also presents the development of indigenous wireless sensor node and gateway made from open source hardware and software components. The efforts in this regard show, while maintaining comparable performance, a significant reduction in the cost of wireless sensor devices, when compared to commercially available wireless sensor devices, is achieved.
{"title":"Development of affordable ICT solutions for water conservation in agriculture","authors":"A. Adil, Venkataramana Badarla, A. Plappally, R. Bhandari, Poonam Chand Sankhla","doi":"10.1109/COMSNETS.2015.7098716","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098716","url":null,"abstract":"Today, Information and Communication Technology (ICT) is ubiquitous. It has touched almost all spheres concerning human survival, growth and development. Agriculture is no exception to it. This paper presents the research initiatives towards improving irrigation efficiency through affordable ICT solutions. It presents experimental results of studies related to improving irrigation efficiency in Semi arid zones in India, using commercially available ICT solutions. It compares between simple microirrigation and microirrigation with ICT (irrigation on demand) and establishes that by using ICT in agriculture, we can increase the irrigation efficiencies by a considerable amount. The paper also presents the development of indigenous wireless sensor node and gateway made from open source hardware and software components. The efforts in this regard show, while maintaining comparable performance, a significant reduction in the cost of wireless sensor devices, when compared to commercially available wireless sensor devices, is achieved.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115843422","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098710
Chandrashekar Kuyyamudi, S. Sinha
Most social networks exhibit the meso-scale feature of modular organization, i.e., occurrence of communities whose members are more likely to be connected to each other than to members of other communities. In this paper, we look at how the existence of modules in the contact structure of a population affects its adoption of an innovation that is characterized by a given perceived advantage. For this we consider both theoretical models of modular networks as well as the empirical social network of a village in Karnataka. We first use a network generalization of the well-known Bass model of diffusion, which is a variant of the SI compartmental model of contagion propagation, on the empirical network and on an ensemble of degree-preserved randomized surrogates. By comparing the dynamics of the diffusion process in these networks, we see that the modular organization reduces the speed of adoption in the population. However, as there are limitations of the diffusion model, we have also considered an alternative dynamical process based on spin-spin interaction that is inspired by statistical physics. Here, individuals try to coordinate their action with that of neighbors on the contact network, while having randomly distributed thresholds (that measures their inrinsic resistance to adoption). By varying the external field, which is a measure of the perceived advantage of the innovation we observe transitions of the population to a state of complete adoption. While the model network with community organization shows that the occurrence of modularity increases the critical value of perceived advantage at which the transition happens, surprisingly we see that in the empirical network the process of adoption can occur faster than in the corresponding degree-preserved randomized surrogate. We show that by reducing the inter-modular connectivity of the empirical network, the process can indeed be made slower than the corresponding randomized networks. Our results underline the critical importance of modular organization in social networks in affecting the process of adoption of innovation in society.
{"title":"Contagion, coordination and communities: Diffusion of innovations on social networks with modular organization","authors":"Chandrashekar Kuyyamudi, S. Sinha","doi":"10.1109/COMSNETS.2015.7098710","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098710","url":null,"abstract":"Most social networks exhibit the meso-scale feature of modular organization, i.e., occurrence of communities whose members are more likely to be connected to each other than to members of other communities. In this paper, we look at how the existence of modules in the contact structure of a population affects its adoption of an innovation that is characterized by a given perceived advantage. For this we consider both theoretical models of modular networks as well as the empirical social network of a village in Karnataka. We first use a network generalization of the well-known Bass model of diffusion, which is a variant of the SI compartmental model of contagion propagation, on the empirical network and on an ensemble of degree-preserved randomized surrogates. By comparing the dynamics of the diffusion process in these networks, we see that the modular organization reduces the speed of adoption in the population. However, as there are limitations of the diffusion model, we have also considered an alternative dynamical process based on spin-spin interaction that is inspired by statistical physics. Here, individuals try to coordinate their action with that of neighbors on the contact network, while having randomly distributed thresholds (that measures their inrinsic resistance to adoption). By varying the external field, which is a measure of the perceived advantage of the innovation we observe transitions of the population to a state of complete adoption. While the model network with community organization shows that the occurrence of modularity increases the critical value of perceived advantage at which the transition happens, surprisingly we see that in the empirical network the process of adoption can occur faster than in the corresponding degree-preserved randomized surrogate. We show that by reducing the inter-modular connectivity of the empirical network, the process can indeed be made slower than the corresponding randomized networks. Our results underline the critical importance of modular organization in social networks in affecting the process of adoption of innovation in society.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128125968","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098666
Vijay Gabale, Ashish Chiplunkar
The use of wireless multi-hop networks for disaster recovery systems and local area services is becoming a reality. However, cost-effective deployments of such networks still remain unfulfilled. In this work, we identify two important and previously unexplored deployment planning problems for such (wireless) multi-hop networks. The goal of these problems is to establish cost-optimized multi-hop paths between end-user devices by setting up infrastructure nodes at appropriate locations. A subtle and important practical constraint, which we call as the device-routing constraint, in choosing such paths requires that no end-user device becomes an intermediate node on any path. With cost on network edges as well as network nodes, this problem of choosing appropriate locations is in contrast to the traditional mesh network planning, backbone routing, or facility location problems. We show that the problem is NP-hard, and that the network planning algorithms in prior work are inapplicable for networking planning with the device-routing constraint. We then present Host-Bypass, the first approximation algorithm for these problem with provable performance bound on cost. Host-Bypass has polynomial running time and our simulation study shows that Host-Bypass performs 30% better than a heuristic from a well-known algorithm in prior work.
{"title":"Approximating deployment costs for (wireless) multi-hop networks","authors":"Vijay Gabale, Ashish Chiplunkar","doi":"10.1109/COMSNETS.2015.7098666","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098666","url":null,"abstract":"The use of wireless multi-hop networks for disaster recovery systems and local area services is becoming a reality. However, cost-effective deployments of such networks still remain unfulfilled. In this work, we identify two important and previously unexplored deployment planning problems for such (wireless) multi-hop networks. The goal of these problems is to establish cost-optimized multi-hop paths between end-user devices by setting up infrastructure nodes at appropriate locations. A subtle and important practical constraint, which we call as the device-routing constraint, in choosing such paths requires that no end-user device becomes an intermediate node on any path. With cost on network edges as well as network nodes, this problem of choosing appropriate locations is in contrast to the traditional mesh network planning, backbone routing, or facility location problems. We show that the problem is NP-hard, and that the network planning algorithms in prior work are inapplicable for networking planning with the device-routing constraint. We then present Host-Bypass, the first approximation algorithm for these problem with provable performance bound on cost. Host-Bypass has polynomial running time and our simulation study shows that Host-Bypass performs 30% better than a heuristic from a well-known algorithm in prior work.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130975178","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098672
Parikshit Sharma, D. Chakraborty, S. Mittal
Crowded musical concerts (and open densely crowded environments in general) pose significant hurdles to people trying to navigate to their family and friends. Calls get frequently dropped due to crowd spikes and loud noise makes cellular voice communication cumbersome. Low visibility in such dense environments render traditional navigation solutions ineffective. Global Positioning System (GPS) and Pedestrian Dead Reckoning (PDR) based systems are known to be error prone and inefficient for such micro-navigation scenarios. Incorrect and delayed position fixes result in high convergence time and frequent oscillating about the route to the destination, leading to a frustrating user experience, specially in dense crowd. To address the dual issue of convergence and user experience we propose CANOE - a novel tunnel based navigation methodology which allows users the flexibility of using their own sense to wade through crowd, while concurrently using best effort opportunistic position fixes to constrain drifts. It also reduces the dependency of constantly looking at the phone for position updates and route information. Extensive simulation results show that our algorithm can achieve 2-4x improvement in convergence time and reduced oscillations under different crowd scenarios as compared to state-of-the-art approaches. We also conduct live experiments with a crowd of 22 people and 15 smartphones and find that CANOE can contain location drifts within 1-2m in signal degraded environments where PDR location drifts range around 6-7m for short walks of 25m.
{"title":"CANOE: Opportunistic calibration assisted micro navigation in dense open environments","authors":"Parikshit Sharma, D. Chakraborty, S. Mittal","doi":"10.1109/COMSNETS.2015.7098672","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098672","url":null,"abstract":"Crowded musical concerts (and open densely crowded environments in general) pose significant hurdles to people trying to navigate to their family and friends. Calls get frequently dropped due to crowd spikes and loud noise makes cellular voice communication cumbersome. Low visibility in such dense environments render traditional navigation solutions ineffective. Global Positioning System (GPS) and Pedestrian Dead Reckoning (PDR) based systems are known to be error prone and inefficient for such micro-navigation scenarios. Incorrect and delayed position fixes result in high convergence time and frequent oscillating about the route to the destination, leading to a frustrating user experience, specially in dense crowd. To address the dual issue of convergence and user experience we propose CANOE - a novel tunnel based navigation methodology which allows users the flexibility of using their own sense to wade through crowd, while concurrently using best effort opportunistic position fixes to constrain drifts. It also reduces the dependency of constantly looking at the phone for position updates and route information. Extensive simulation results show that our algorithm can achieve 2-4x improvement in convergence time and reduced oscillations under different crowd scenarios as compared to state-of-the-art approaches. We also conduct live experiments with a crowd of 22 people and 15 smartphones and find that CANOE can contain location drifts within 1-2m in signal degraded environments where PDR location drifts range around 6-7m for short walks of 25m.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600014","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
扫码关注我们
求助内容：
应助结果提醒方式：