Localization is a highly important topic in wireless sensor networks as well as in many Internet of Things applications. Many current localization algorithms are based on the Sequential Monte Carlo Localization method (MCL), the accuracy of which is bounded by the radio range. High computational complexity in the sampling step is another issue of these approaches. We present Tri-MCL which significantly improves on the accuracy of the Monte Carlo Localization algorithm. To do this, we leverage three different distance measurement algorithms based on range-free approaches. Using these, we estimate the distances between unknown nodes and anchor nodes to perform more fine-grained filtering of the particles as well as for weighting the particles in the final estimation step of the algorithm. Simulation results illustrate that the proposed algorithm achieves better accuracy than the MCL and SA-MCL algorithms. Furthermore, it also exhibits high efficiency in the sampling step.
{"title":"Tri-MCL: Synergistic Localization for Mobile Ad-Hoc and Wireless Sensor Networks","authors":"Arne Bochem, Yali Yuan, D. Hogrefe","doi":"10.1109/LCN.2016.61","DOIUrl":"https://doi.org/10.1109/LCN.2016.61","url":null,"abstract":"Localization is a highly important topic in wireless sensor networks as well as in many Internet of Things applications. Many current localization algorithms are based on the Sequential Monte Carlo Localization method (MCL), the accuracy of which is bounded by the radio range. High computational complexity in the sampling step is another issue of these approaches. We present Tri-MCL which significantly improves on the accuracy of the Monte Carlo Localization algorithm. To do this, we leverage three different distance measurement algorithms based on range-free approaches. Using these, we estimate the distances between unknown nodes and anchor nodes to perform more fine-grained filtering of the particles as well as for weighting the particles in the final estimation step of the algorithm. Simulation results illustrate that the proposed algorithm achieves better accuracy than the MCL and SA-MCL algorithms. Furthermore, it also exhibits high efficiency in the sampling step.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"58 1","pages":"333-338"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82018297","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}
In this work, we propose RAD, a RApid Deployment localization framework without human sampling. The basic idea of RAD is to automatically generate a fingerprint database through space partition, of which each cell is fingerprinted by its maximum influence APs. Based on this robust location indicator, fine-grained localization can be achieved by a discretized particle filter utilizing sensor data fusion. We devise techniques for CIVD-based field division, graph-based particle filter, EM-based individual character learning, and build a prototype that runs on commodity devices. Extensive experiments show that RAD provides a comparable performance to the state-of-the-art RSS-based methods while relieving it of prior human participation.
{"title":"Rapid Deployment Indoor Localization without Prior Human Participation","authors":"Han Xu, Zimu Zhou, Longfei Shangguan","doi":"10.1109/LCN.2016.89","DOIUrl":"https://doi.org/10.1109/LCN.2016.89","url":null,"abstract":"In this work, we propose RAD, a RApid Deployment localization framework without human sampling. The basic idea of RAD is to automatically generate a fingerprint database through space partition, of which each cell is fingerprinted by its maximum influence APs. Based on this robust location indicator, fine-grained localization can be achieved by a discretized particle filter utilizing sensor data fusion. We devise techniques for CIVD-based field division, graph-based particle filter, EM-based individual character learning, and build a prototype that runs on commodity devices. Extensive experiments show that RAD provides a comparable performance to the state-of-the-art RSS-based methods while relieving it of prior human participation.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"29 1","pages":"547-550"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81296447","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}
Chun-Hao Liao, Yuki Katsumata, Makoto Suzuki, H. Morikawa
Many works attributed the successful reception of concurrent transmission (CT) to the constructive interference. However, due to the inevitable carrier frequency offset (CFO) and the resulted beating effect, the claim of constructive interference is actually not valid. To clarify the reason behind the successful receptions under CT, we conduct extensive evaluations and identify the following findings. 1) We show that the IEEE 802.15.4 receivers survive the beating effect mainly because of the direct sequence spread spectrum (DSSS), while systems without the protection of DSSS are not applicable to CT. 2) We identify a counterintuitive phenomenon that the IEEE 802.15.4 receiver could survive only the beating results from large CFO, while performing poorly when CFO is small. 3) We demonstrate that, even if the receivers survive, CT links lead to little performance improvements compared to conventional signal transmission links from the SNR point of view.
{"title":"Revisiting the So-Called Constructive Interference in Concurrent Transmission","authors":"Chun-Hao Liao, Yuki Katsumata, Makoto Suzuki, H. Morikawa","doi":"10.1109/LCN.2016.56","DOIUrl":"https://doi.org/10.1109/LCN.2016.56","url":null,"abstract":"Many works attributed the successful reception of concurrent transmission (CT) to the constructive interference. However, due to the inevitable carrier frequency offset (CFO) and the resulted beating effect, the claim of constructive interference is actually not valid. To clarify the reason behind the successful receptions under CT, we conduct extensive evaluations and identify the following findings. 1) We show that the IEEE 802.15.4 receivers survive the beating effect mainly because of the direct sequence spread spectrum (DSSS), while systems without the protection of DSSS are not applicable to CT. 2) We identify a counterintuitive phenomenon that the IEEE 802.15.4 receiver could survive only the beating results from large CFO, while performing poorly when CFO is small. 3) We demonstrate that, even if the receivers survive, CT links lead to little performance improvements compared to conventional signal transmission links from the SNR point of view.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"58 1","pages":"280-288"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87659272","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}
Present data center (DC) network provisioning schemes primarily utilize conventional load-balancing technologies, offering individual application performance improvement. Diversity in application usage however, makes isolated application prioritization a performance caveat for users with varying application trends. The present paper proposes a user profiling approach to capture application trends based on generic flow measurements (NetFlow) and employs the extracted profiles to create DC traffic forwarding policies. The scheme allows operators to define a global profile and application hierarchy based on extracted profiles to prioritize traffic for individual user classes. The proposed design was tested by extracting user profiles from a realistic enterprise network, and further simulated to dynamically manage DC traffic using the software defined networking paradigm. Compared to conventional traffic management schemes, the frame delivery ratio and effective throughput of our design was significantly higher for high priority north-south user traffic as well as the inter-server east-west application traffic.
{"title":"User-Centric Network Provisioning in Software Defined Data Center Environment","authors":"Taimur Bakhshi, B. Ghita","doi":"10.1109/LCN.2016.57","DOIUrl":"https://doi.org/10.1109/LCN.2016.57","url":null,"abstract":"Present data center (DC) network provisioning schemes primarily utilize conventional load-balancing technologies, offering individual application performance improvement. Diversity in application usage however, makes isolated application prioritization a performance caveat for users with varying application trends. The present paper proposes a user profiling approach to capture application trends based on generic flow measurements (NetFlow) and employs the extracted profiles to create DC traffic forwarding policies. The scheme allows operators to define a global profile and application hierarchy based on extracted profiles to prioritize traffic for individual user classes. The proposed design was tested by extracting user profiles from a realistic enterprise network, and further simulated to dynamically manage DC traffic using the software defined networking paradigm. Compared to conventional traffic management schemes, the frame delivery ratio and effective throughput of our design was significantly higher for high priority north-south user traffic as well as the inter-server east-west application traffic.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"225 1","pages":"289-297"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85258809","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}
The control of excessive downloads by rogue users in organizational LANs is the subject of this work. Two mechanisms have been used in order to accomplish this. The first mechanism, is TCP rate control (TCR), it is a receiver-based flow control technique that can be used to effectively rate limit rogue users' flows, making more bandwidth available to regular users. The second mechanism, admission control reduces the bandwidth wastage due to users disconnecting out of impatience when user goodputs are low. Using simulation-based experiments, it has been demonstrated that the composite technique, exclusive TCP rate and admission control (xTRAC) provides seamless control of rogue users, while improving response times and goodput by upto 58% during overload. In this way regular users are incentivized and rogue users are penalized leading to long-term control of users.
{"title":"Organization-Level Control of Excessive Internet Downloads","authors":"Saad Y. Sait, H. Murthy, K. Sivalingam","doi":"10.1109/LCN.2016.38","DOIUrl":"https://doi.org/10.1109/LCN.2016.38","url":null,"abstract":"The control of excessive downloads by rogue users in organizational LANs is the subject of this work. Two mechanisms have been used in order to accomplish this. The first mechanism, is TCP rate control (TCR), it is a receiver-based flow control technique that can be used to effectively rate limit rogue users' flows, making more bandwidth available to regular users. The second mechanism, admission control reduces the bandwidth wastage due to users disconnecting out of impatience when user goodputs are low. Using simulation-based experiments, it has been demonstrated that the composite technique, exclusive TCP rate and admission control (xTRAC) provides seamless control of rogue users, while improving response times and goodput by upto 58% during overload. In this way regular users are incentivized and rogue users are penalized leading to long-term control of users.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"184-187"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91242585","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}
Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das
Real world large scale networks exhibit intrinsic community structure, with dense intra-community connectivity and sparse inter-community connectivity. Leveraging their community structure for parallelization of computational tasks and applications, is a significant step towards computational efficiency and application effectiveness. We propose a weighted depth-first-search graph partitioning algorithm for community formation that preserves the needed community dependency without any cycles. To comply with heterogeneity in community structure and size of the real world networks, we use a flexible limiting value for them. Further, our algorithm is a diversion from the existing modularity based algorithms. We evaluate our algorithm as the quality of the generated partitions, measured in terms of number of graph cuts.
{"title":"Graph Partitioning in Parallelization of Large Scale Networks","authors":"Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das","doi":"10.1109/LCN.2016.36","DOIUrl":"https://doi.org/10.1109/LCN.2016.36","url":null,"abstract":"Real world large scale networks exhibit intrinsic community structure, with dense intra-community connectivity and sparse inter-community connectivity. Leveraging their community structure for parallelization of computational tasks and applications, is a significant step towards computational efficiency and application effectiveness. We propose a weighted depth-first-search graph partitioning algorithm for community formation that preserves the needed community dependency without any cycles. To comply with heterogeneity in community structure and size of the real world networks, we use a flexible limiting value for them. Further, our algorithm is a diversion from the existing modularity based algorithms. We evaluate our algorithm as the quality of the generated partitions, measured in terms of number of graph cuts.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"176-179"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74926342","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}
Decentralized systems, such as overlay networks or content delivery networks, form a virtual network on top of a physical network leading to inefficiencies in handling network traffic as physical locations are not considered. Therefore, this work investigates, analyzes, and evaluates two feasible network locality metrics for decentralized systems to overcome such inefficiencies. Furthermore, those metrics to determine network locality have been implemented and evaluated within an international testbed. These metrics evaluated consider aspects of path stability and path symmetry. The evaluation performed did reveal that the stability and symmetry metrics provide accurate locality indication.
{"title":"Towards Path Quality Metrics for Overlay Networks","authors":"Andri Lareida, Daniel Meier, T. Bocek, B. Stiller","doi":"10.1109/LCN.2016.31","DOIUrl":"https://doi.org/10.1109/LCN.2016.31","url":null,"abstract":"Decentralized systems, such as overlay networks or content delivery networks, form a virtual network on top of a physical network leading to inefficiencies in handling network traffic as physical locations are not considered. Therefore, this work investigates, analyzes, and evaluates two feasible network locality metrics for decentralized systems to overcome such inefficiencies. Furthermore, those metrics to determine network locality have been implemented and evaluated within an international testbed. These metrics evaluated consider aspects of path stability and path symmetry. The evaluation performed did reveal that the stability and symmetry metrics provide accurate locality indication.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"97 1","pages":"156-159"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79214811","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}
Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser
Graph-based topology control adapts wireless topologies to achieve certain target graph structures. Wireless sensor networks seem well-suited for the expectations (in particular those on provided energy savings) raised by topology control. Nevertheless, topology control has never made the breakthrough in real-world deployments. This work explores the reasons for this, identifying five practical obstacles of today's topology control: (i) unrealistic assumptions, (ii) unsuitable graph structures, (iii) application agnosticism, (iv) unclear role in the stack, and (v) insufficient framework support. To address the latter obstacle, we provide a re-usable framework for the implementation and evaluation of topology control. Based on this framework, we conduct a testbed-based evaluation for two application scenarios and three topology control algorithms including a novel application-specific algorithm. Indeed, the identified obstacles hinder topology control from boosting the application. However, the achieved graph structures show the practical feasibility of topology control in principle.
{"title":"Topology Control in Wireless Sensor Networks: What Blocks the Breakthrough?","authors":"Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser","doi":"10.1109/LCN.2016.67","DOIUrl":"https://doi.org/10.1109/LCN.2016.67","url":null,"abstract":"Graph-based topology control adapts wireless topologies to achieve certain target graph structures. Wireless sensor networks seem well-suited for the expectations (in particular those on provided energy savings) raised by topology control. Nevertheless, topology control has never made the breakthrough in real-world deployments. This work explores the reasons for this, identifying five practical obstacles of today's topology control: (i) unrealistic assumptions, (ii) unsuitable graph structures, (iii) application agnosticism, (iv) unclear role in the stack, and (v) insufficient framework support. To address the latter obstacle, we provide a re-usable framework for the implementation and evaluation of topology control. Based on this framework, we conduct a testbed-based evaluation for two application scenarios and three topology control algorithms including a novel application-specific algorithm. Indeed, the identified obstacles hinder topology control from boosting the application. However, the achieved graph structures show the practical feasibility of topology control in principle.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"156 1","pages":"389-397"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79851801","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}
L. M. Silveira, Robert M. Oliveira, Moises Vidal Ribeiro, L. Vieira, M. Vieira, A. Vieira
Power line communication systems face several challenges which degrade data communication quality. To overcome such issues, we propose CodePLC, a network coding Power Line Communication MAC protocol. We use a single relay node to intermediate communication, storing, and forwarding linear combinations of data packets. We evaluate CodePLC performance through simulations of a common topology for a PLC system under a wide range of scenarios. In sum, our results show that in a broadcast like transmission, the use of network coding enhances overall system performance. When compared to a traditional PLC system, we have observed an average of 115% goodput increase. Moreover, our protocol reduces in 112% the average of network occupancy buffers. Finally, CodePLC reduces mean latency by four times.
{"title":"CodePLC: A Network Coding MAC Protocol for Power Line Communication","authors":"L. M. Silveira, Robert M. Oliveira, Moises Vidal Ribeiro, L. Vieira, M. Vieira, A. Vieira","doi":"10.1109/LCN.2016.112","DOIUrl":"https://doi.org/10.1109/LCN.2016.112","url":null,"abstract":"Power line communication systems face several challenges which degrade data communication quality. To overcome such issues, we propose CodePLC, a network coding Power Line Communication MAC protocol. We use a single relay node to intermediate communication, storing, and forwarding linear combinations of data packets. We evaluate CodePLC performance through simulations of a common topology for a PLC system under a wide range of scenarios. In sum, our results show that in a broadcast like transmission, the use of network coding enhances overall system performance. When compared to a traditional PLC system, we have observed an average of 115% goodput increase. Moreover, our protocol reduces in 112% the average of network occupancy buffers. Finally, CodePLC reduces mean latency by four times.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"20 1","pages":"643-646"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84022396","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}
In the Public Key infrastructure (PKI) model, digital certificates play a vital role in securing online communication. Communicating parties exchange and validate these certificates, the validation fails if a certificate has been revoked. In this paper we propose the Certificate Revocation Guard (CRG) to efficiently check certificate revocation while minimising bandwidth, latency and storage overheads. CRG is based on OCSP, which caches the status of certificates locally. CRG could be installed on the user's machine, at the organisational proxy or even at the ISP level. Compared to a naive approach (where a client checks the revocation status of all certificates in the chain on every request), CRG decreases the bandwidth overheads and network latencies by 95%. Using CRG incurs 69% lower storage overheads compared to the CRL method. Our results demonstrate the effectiveness of our approach to improve certificate revocation.
{"title":"Certificate Revocation Guard (CRG): An Efficient Mechanism for Checking Certificate Revocation","authors":"Qinwen Hu, M. R. Asghar, N. Brownlee","doi":"10.1109/LCN.2016.84","DOIUrl":"https://doi.org/10.1109/LCN.2016.84","url":null,"abstract":"In the Public Key infrastructure (PKI) model, digital certificates play a vital role in securing online communication. Communicating parties exchange and validate these certificates, the validation fails if a certificate has been revoked. In this paper we propose the Certificate Revocation Guard (CRG) to efficiently check certificate revocation while minimising bandwidth, latency and storage overheads. CRG is based on OCSP, which caches the status of certificates locally. CRG could be installed on the user's machine, at the organisational proxy or even at the ISP level. Compared to a naive approach (where a client checks the revocation status of all certificates in the chain on every request), CRG decreases the bandwidth overheads and network latencies by 95%. Using CRG incurs 69% lower storage overheads compared to the CRL method. Our results demonstrate the effectiveness of our approach to improve certificate revocation.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"139 1","pages":"527-530"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85887796","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
扫码关注我们
求助内容：
应助结果提醒方式：