Thomas Lukaseder, Leonard Bradatsch, Benjamin Erb, F. Kargl
There are many high-speed TCP variants with different congestion control algorithms, which are designed for specific settings or use cases. Distinct features of these algorithms are meant to optimize different aspects of network performance, and the choice of TCP variant strongly influences application performance. However, setting up tests to help with the decision of which variant to use can be problematic, as many systems are not designed to deal with high bandwidths, such as 10 Gbps or more. This paper provides an overview of pitfalls and challenges of realistic network analysis to help in the decision making process.
{"title":"Setting Up a High-Speed TCP Benchmarking Environment - Lessons Learned","authors":"Thomas Lukaseder, Leonard Bradatsch, Benjamin Erb, F. Kargl","doi":"10.1109/LCN.2016.32","DOIUrl":"https://doi.org/10.1109/LCN.2016.32","url":null,"abstract":"There are many high-speed TCP variants with different congestion control algorithms, which are designed for specific settings or use cases. Distinct features of these algorithms are meant to optimize different aspects of network performance, and the choice of TCP variant strongly influences application performance. However, setting up tests to help with the decision of which variant to use can be problematic, as many systems are not designed to deal with high bandwidths, such as 10 Gbps or more. This paper provides an overview of pitfalls and challenges of realistic network analysis to help in the decision making process.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"40 1","pages":"160-163"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82849133","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}
Celio Trois, L. C. E. Bona, Marcos Didonet Del Fabro, M. Martinello
Scientific applications (SciApps) are broadly used in all science domains. For more accurate results, they have been increasingly demanding computational power and extremely agile networks. These applications are usually implemented using numerical methods presenting well-behaved patterns to exchange data across its computing nodes. This paper presents SpateN, a tool that exploits the spatial communication patterns of SciApps as the fundamental logic to drive the network programming. SpateN classifies the SciApps nodes communications and balances the elephant flows across the available network paths. As a proof of concept, we carried out a set of experiments in real testbeds, demonstrating that network programming may affect the performance of SciApps significantly. Also, a balanced flow allocation can speed up SciApps to near-optimal execution times.
{"title":"Carving Software-Defined Networks for Scientific Applications with SpateN","authors":"Celio Trois, L. C. E. Bona, Marcos Didonet Del Fabro, M. Martinello","doi":"10.1109/LCN.2016.42","DOIUrl":"https://doi.org/10.1109/LCN.2016.42","url":null,"abstract":"Scientific applications (SciApps) are broadly used in all science domains. For more accurate results, they have been increasingly demanding computational power and extremely agile networks. These applications are usually implemented using numerical methods presenting well-behaved patterns to exchange data across its computing nodes. This paper presents SpateN, a tool that exploits the spatial communication patterns of SciApps as the fundamental logic to drive the network programming. SpateN classifies the SciApps nodes communications and balances the elephant flows across the available network paths. As a proof of concept, we carried out a set of experiments in real testbeds, demonstrating that network programming may affect the performance of SciApps significantly. Also, a balanced flow allocation can speed up SciApps to near-optimal execution times.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"200-203"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89294195","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}
Joel Scheuner, Genc Mazlami, Dominik Schöni, Sebastian Stephan, A. D. Carli, T. Bocek, B. Stiller
WiFi-enabled devices broadcast a vast amount of data without being associated to any access points. To study and analyze this data, a generic passive WiFi tracking system called Probr was developed. Probr manages various types of WiFi capturing devices, collects captured WiFi traces, processes collected WiFi traces, and visualizes WiFi activities via its Web interface. Probr supports several on-line analysis use cases and is extensible with respect to custom storage solutions to fit further use cases. Thus, Probr is the first system of that kind known, enabling full device administration and provided completely as Open Source. A case study conducted demonstrates the capabilities of Probr for use cases such as room utilization estimation, indoor device localization, tracking a person's presence between multiple Probr-equipped locations, and analysis of device vendor preferences.
{"title":"Probr - A Generic and Passive WiFi Tracking System","authors":"Joel Scheuner, Genc Mazlami, Dominik Schöni, Sebastian Stephan, A. D. Carli, T. Bocek, B. Stiller","doi":"10.1109/LCN.2016.30","DOIUrl":"https://doi.org/10.1109/LCN.2016.30","url":null,"abstract":"WiFi-enabled devices broadcast a vast amount of data without being associated to any access points. To study and analyze this data, a generic passive WiFi tracking system called Probr was developed. Probr manages various types of WiFi capturing devices, collects captured WiFi traces, processes collected WiFi traces, and visualizes WiFi activities via its Web interface. Probr supports several on-line analysis use cases and is extensible with respect to custom storage solutions to fit further use cases. Thus, Probr is the first system of that kind known, enabling full device administration and provided completely as Open Source. A case study conducted demonstrates the capabilities of Probr for use cases such as room utilization estimation, indoor device localization, tracking a person's presence between multiple Probr-equipped locations, and analysis of device vendor preferences.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"52 1","pages":"495-502"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91136815","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}
Version Control Systems (VCS) are a valuable tool for software development and document management. Both client/server and distributed (Peer-to-Peer) models exist, with the latter (e.g., Git and Mercurial) becoming increasingly popular. Their distributed nature introduces complications, especially concerning security: it is hard to control the dissemination of contents stored in distributed VCS as they rely on replication of complete repositories to any involved user. We overcome this issue by designing and implementing a concept for cryptography-enforced access control which is transparent to the user. Use of field-tested schemes (end-to-end encryption, digital signatures) allows for strong security, while adoption of convergent encryption and content-defined chunking retains storage efficiency. The concept is seamlessly integrated into Mercurial-respecting its distributed storage concept-to ensure practical usability and compatibility to existing deployments.
{"title":"Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension","authors":"Michael Lass, Dominik Leibenger, Christoph Sorge","doi":"10.1109/LCN.2016.11","DOIUrl":"https://doi.org/10.1109/LCN.2016.11","url":null,"abstract":"Version Control Systems (VCS) are a valuable tool for software development and document management. Both client/server and distributed (Peer-to-Peer) models exist, with the latter (e.g., Git and Mercurial) becoming increasingly popular. Their distributed nature introduces complications, especially concerning security: it is hard to control the dissemination of contents stored in distributed VCS as they rely on replication of complete repositories to any involved user. We overcome this issue by designing and implementing a concept for cryptography-enforced access control which is transparent to the user. Use of field-tested schemes (end-to-end encryption, digital signatures) allows for strong security, while adoption of convergent encryption and content-defined chunking retains storage efficiency. The concept is seamlessly integrated into Mercurial-respecting its distributed storage concept-to ensure practical usability and compatibility to existing deployments.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78826964","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}
Adriana Fernández-Fernández, C. Cervelló-Pastor, Leonardo Ochoa-Aday
The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we present an energy-aware routing approach which minimizes the number of links used to satisfy a given traffic demand. Different from previous works, we optimize energy consumption in OpenFlow networks with in-band control traffic. To this end, we start formulating an optimization model that considers routing requirements for control and data plane communications. To reduce the complexity of our model in large-scale topologies, a heuristic algorithm is developed as well. Although it is not widely researched, except for quantitative and heuristic results, we also derive a simple and efficient algorithm for the best controller placement in terms of energy saving. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.
{"title":"Improved Energy-Aware Routing Algorithm in Software-Defined Networks","authors":"Adriana Fernández-Fernández, C. Cervelló-Pastor, Leonardo Ochoa-Aday","doi":"10.1109/LCN.2016.41","DOIUrl":"https://doi.org/10.1109/LCN.2016.41","url":null,"abstract":"The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we present an energy-aware routing approach which minimizes the number of links used to satisfy a given traffic demand. Different from previous works, we optimize energy consumption in OpenFlow networks with in-band control traffic. To this end, we start formulating an optimization model that considers routing requirements for control and data plane communications. To reduce the complexity of our model in large-scale topologies, a heuristic algorithm is developed as well. Although it is not widely researched, except for quantitative and heuristic results, we also derive a simple and efficient algorithm for the best controller placement in terms of energy saving. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"25 1","pages":"196-199"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84483243","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}
Wei Wang, Yi Sun, S. Uhlig, Gengfa Fang, Nanshu Wang, Zhongcheng Li
Resource isolation of the computation and storage in the cloud is relatively mature, but the network resource is still shared among tenants leading to variable and unpredictable network performance when bandwidth guarantees are not enforced. Currently most of the bandwidth guarantee approaches are based on the idea of single-path reservation without fully exploiting the multipath resource, which leads to poor network utilization. In this paper, we propose a multi-path bandwidth guarantee approach called MultiBand, which provides bandwidth guarantees by allocating bandwidth across multiple paths. We utilize label-based routing technique to explicitly control the packets' transmission paths, and design a MHTB rate limiter model to split and schedule the traffic over the multiple reserved paths. Besides, Our Multiband solution has the work-conserving property. We evaluated our approach through simulations with realistic topologies and typical traffic patterns. Our results show that MultiBand is able to provide multipath bandwidth guarantees and to achieve higher network utility and tenant throughput compared with those of current approaches.
{"title":"Multipath Bandwidth Guarantees for Multi-Tenant Cloud Networking","authors":"Wei Wang, Yi Sun, S. Uhlig, Gengfa Fang, Nanshu Wang, Zhongcheng Li","doi":"10.1109/LCN.2016.73","DOIUrl":"https://doi.org/10.1109/LCN.2016.73","url":null,"abstract":"Resource isolation of the computation and storage in the cloud is relatively mature, but the network resource is still shared among tenants leading to variable and unpredictable network performance when bandwidth guarantees are not enforced. Currently most of the bandwidth guarantee approaches are based on the idea of single-path reservation without fully exploiting the multipath resource, which leads to poor network utilization. In this paper, we propose a multi-path bandwidth guarantee approach called MultiBand, which provides bandwidth guarantees by allocating bandwidth across multiple paths. We utilize label-based routing technique to explicitly control the packets' transmission paths, and design a MHTB rate limiter model to split and schedule the traffic over the multiple reserved paths. Besides, Our Multiband solution has the work-conserving property. We evaluated our approach through simulations with realistic topologies and typical traffic patterns. Our results show that MultiBand is able to provide multipath bandwidth guarantees and to achieve higher network utility and tenant throughput compared with those of current approaches.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"79 1","pages":"442-450"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77666885","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}
Interactive and delay-sensitive applications constitute an important and growing part of the Internet. Today, low delays can only be achieved if there are no congested links along the path. At a bottleneck, the commonly used congestion control mechanisms induce high queuing delay and packet loss. Specialized congestion control mechanisms achieving a low queuing delay in an otherwise congested network exist. However, if their flows share a bottleneck with traditionally congestion controlled flows, they get suppressed or loose their low-delay property. This paper presents three approaches - Separate Paths, Separate Queues and Limited Queue - that enable coexistence of congestion control mechanisms that are optimized for different goals, e.g., interactive applications and bulk transfers. The measurement results show that concurrent operation of different congestion control mechanisms can be successfully implemented this way.
{"title":"Toward Coexistence of Different Congestion Control Mechanisms","authors":"Mario Hock, R. Bless, M. Zitterbart","doi":"10.1109/LCN.2016.94","DOIUrl":"https://doi.org/10.1109/LCN.2016.94","url":null,"abstract":"Interactive and delay-sensitive applications constitute an important and growing part of the Internet. Today, low delays can only be achieved if there are no congested links along the path. At a bottleneck, the commonly used congestion control mechanisms induce high queuing delay and packet loss. Specialized congestion control mechanisms achieving a low queuing delay in an otherwise congested network exist. However, if their flows share a bottleneck with traditionally congestion controlled flows, they get suppressed or loose their low-delay property. This paper presents three approaches - Separate Paths, Separate Queues and Limited Queue - that enable coexistence of congestion control mechanisms that are optimized for different goals, e.g., interactive applications and bulk transfers. The measurement results show that concurrent operation of different congestion control mechanisms can be successfully implemented this way.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"567-570"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90399416","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}
Chenxing Li, Zhen Chen, Wenxun Zheng, Yinjun Wu, Junwei Cao
Efficient retrieval of traffic archival data is a must-have technique to detect network attacks, such as APT(advanced persistent threat) attack. In order to take insight from Internet traffic, the bitmap index is increasingly used for efficiently querying over large datasets. However, a raw bitmap index leads to high space consumption and overhead on loading indexes. Various bitmap index compression algorithms are proposed to save storage while improving query efficiency. This paper proposes a new bitmap index compression algorithm called BAH (Byte Aligned Hybrid compression coding). An acceleration algorithm using SIMD is designed to increase the efficiency of AND operation over multiple compressed bitmaps. In all, BAH has a better compression ratio and faster intersection querying speed compared with several previous works such as WAH, PLWAH, COMPAX, Roaring etc. The theoretical analysis shows that the space required by BAH is no larger than 1.6 times the information entropy of the bitmap with density larger than 0.2%. In the experiments, BAH saves about 65% space and 60% space compared with WAH on two datasets. The experiments also demonstrate the query efficiency of BAH with the application in Internet Traffic and Web pages.
{"title":"BAH: A Bitmap Index Compression Algorithm for Fast Data Retrieval","authors":"Chenxing Li, Zhen Chen, Wenxun Zheng, Yinjun Wu, Junwei Cao","doi":"10.1109/LCN.2016.120","DOIUrl":"https://doi.org/10.1109/LCN.2016.120","url":null,"abstract":"Efficient retrieval of traffic archival data is a must-have technique to detect network attacks, such as APT(advanced persistent threat) attack. In order to take insight from Internet traffic, the bitmap index is increasingly used for efficiently querying over large datasets. However, a raw bitmap index leads to high space consumption and overhead on loading indexes. Various bitmap index compression algorithms are proposed to save storage while improving query efficiency. This paper proposes a new bitmap index compression algorithm called BAH (Byte Aligned Hybrid compression coding). An acceleration algorithm using SIMD is designed to increase the efficiency of AND operation over multiple compressed bitmaps. In all, BAH has a better compression ratio and faster intersection querying speed compared with several previous works such as WAH, PLWAH, COMPAX, Roaring etc. The theoretical analysis shows that the space required by BAH is no larger than 1.6 times the information entropy of the bitmap with density larger than 0.2%. In the experiments, BAH saves about 65% space and 60% space compared with WAH on two datasets. The experiments also demonstrate the query efficiency of BAH with the application in Internet Traffic and Web pages.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"40 1","pages":"697-705"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78582556","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}
Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.
{"title":"Maximum Likelihood Topology Maps for Wireless Sensor Networks Using an Automated Robot","authors":"Ashanie Gunathillake, A. Savkin, A. Jayasumana","doi":"10.1109/LCN.2016.62","DOIUrl":"https://doi.org/10.1109/LCN.2016.62","url":null,"abstract":"Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"339-347"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88637826","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}
We investigate the latency and network lifetime-aware clustering problem for data collection in a WSN (Wireless Sensor Network) with one base station and propose a novel approach. Our approach consists of a polynomial-time heuristic for constructing clusters, a polynomial-time heuristic and an ILP (Integer Linear Programming) algorithm for constructing a routing tree for inter-cluster communication. We have performed extensive simulations on the network instances of 200, 400, 600, 800 and 1000 sensor nodes with uniform and random distributions, and compared our approach with two state-of-the-art approaches, namely MR-LEACH and DSBCV. Our simulation results show that the average network lifetime improvements of our approach using the ILP algorithm for constructing a routing tree over MR-LEACH and DSBCV are 35% and 62%, respectively, and the performance of the heuristic for constructing a routing tree is comparable to that of the ILP algorithm.
{"title":"Latency and Lifetime-Aware Clustering and Routing in Wireless Sensor Networks","authors":"Chuanyao Nie, Hui Wu, Wenguang Zheng","doi":"10.1109/LCN.2016.33","DOIUrl":"https://doi.org/10.1109/LCN.2016.33","url":null,"abstract":"We investigate the latency and network lifetime-aware clustering problem for data collection in a WSN (Wireless Sensor Network) with one base station and propose a novel approach. Our approach consists of a polynomial-time heuristic for constructing clusters, a polynomial-time heuristic and an ILP (Integer Linear Programming) algorithm for constructing a routing tree for inter-cluster communication. We have performed extensive simulations on the network instances of 200, 400, 600, 800 and 1000 sensor nodes with uniform and random distributions, and compared our approach with two state-of-the-art approaches, namely MR-LEACH and DSBCV. Our simulation results show that the average network lifetime improvements of our approach using the ILP algorithm for constructing a routing tree over MR-LEACH and DSBCV are 35% and 62%, respectively, and the performance of the heuristic for constructing a routing tree is comparable to that of the ILP algorithm.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"65 1","pages":"164-167"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91330041","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
扫码关注我们
求助内容：
应助结果提醒方式：