{"title":"Coverage preservation in energy harvesting wireless sensor networks for rare events","authors":"David C. Harrison, Winston K.G. Seah, R. Rayudu","doi":"10.1109/LCN.2015.7366301","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366301","url":null,"abstract":"Wireless sensor networks for rarely occurring geospatial events must minimally maintain constant sensing coverage to ensure detection wherever and whenever such events occur. This paper proposes an Equitable Sleep Coverage Algorithm for Rare Geospatial Occurrences (ESCARGO) for timely event notification where the network must also maintain connectivity at all times regardless of the significant energy cost of doing so. This non time-synchronized, fully distributed duty-cycling algorithm is shown to significantly extend the operational lifetime of battery powered rare event sensing networks with an optimised, low node density, non-random deployment scheme without compromising detection probability or notification delay. The algorithm is further shown to facilitate potentially indefinite coverage maintenance in sensor networks powered by small form factor solar panels without relying on charging efficiencies beyond the capabilities of existing technology.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124065408","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}
{"title":"Tracemax: A novel single packet IP traceback strategy for data-flow analysis","authors":"Peter Hillmann, F. Tietze, G. Rodosek","doi":"10.1109/LCN.2015.7366300","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366300","url":null,"abstract":"The identification of the exact path that packets are routed on in the network is quite a challenge. This paper presents a novel, efficient traceback strategy named Tracemax in context of a defense system against distributed denial of service (DDoS) attacks. A single packet can be directly traced over many more hops than the current existing techniques allow. In combination with a defense system it differentiates between multiple connections. It aims to letting non-malicious connections pass while bad ones get thwarted. The novel concept allows detailed analyses of the traffic and the transmission path through the network. The strategy can effectively reduce the effect of common bandwidth and resource consumption attacks, foster early warning and prevention as well as higher the availability of the network services for the wanted customers.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132862930","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}
{"title":"Towards exploring the benefits of scope-flooding in Information-Centric Networks","authors":"Andriana Ioannou, S. Weber","doi":"10.1109/LCN.2015.7366304","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366304","url":null,"abstract":"Approaches to Information-Centric Networking (ICN) employ caches within a network to reduce transfers of information from a source to consumers. Copies of content within a network may be exploited through the use of a forwarding mechanism. Scope-flooding is a forwarding strategy based on the distribution of requests through flooding. The scope of the flooding is defined through a scope-value which prevents network-wide flooding. In this paper, we investigate the impact of scope-flooding forwarding against Shortest-Path Routing (SPR) using a number of on-path caching policies. Our results show that scope-flooding does not always benefit the performance of a caching policy, as stated so far. We conclude by discussing a number of features that may be adopted to enhance the performance of scope-flooding.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296393","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}
{"title":"The (in)security of Topology Discovery in Software Defined Networks","authors":"Talal Alharbi, M. Portmann, Farzaneh Pakzad","doi":"10.1109/LCN.2015.7366363","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366363","url":null,"abstract":"Topology Discovery is an essential service in Software Defined Networks (SDN). Most SDN controllers use a de-facto standard topology discovery mechanism based on Open-Flow to identify active links in the network. This paper discusses the security, or rather lack thereof, of the current SDN topology discovery mechanism, and its vulnerability to link spoofing attacks. The feasibility and impact of the attacks are verified and demonstrated via experiments. The paper presents and evaluates a countermeasure based on HMAC authentication.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"130 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123749688","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}
{"title":"Joint optimization of content replication and Traffic Engineering in ICN","authors":"Zhenyang Feng, Mingwei Xu, Yuan Yang, Qi Li, Yu Wang, Qing Li, B. Ohlman, Meng Chen","doi":"10.1109/LCN.2015.7366283","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366283","url":null,"abstract":"In the current IP networks, content replication and inter-domain Traffic Engineering (TE) are manipulated by different entities with respective objectives, and work at different layers as well. In Information-Centric Networking (ICN), however, they can both be administered by Internet Service Providers (ISPs) and work at the same network layer. In this paper, we present our study of jointly optimizing content replication and inter-domain TE in ICN, which aims at maximizing the profit of inter-domain traffic for an ISP while constrained by the limits of link bandwidth and the availability of contents. Results show that our algorithms can increase the ISP's profit by 66% and reduce the link utilization by 23% on average, which are near-optimal and with much less running time.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728470","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}
{"title":"Mobile data collection using multi-channel network coding in wireless sensor networks","authors":"M. Abdulaziz, R. Simon","doi":"10.1109/LCN.2015.7366307","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366307","url":null,"abstract":"By reducing the need to perform multi-hop routing over long communication paths, the use of mobile data gathering devices in highly distributed wireless sensor networks (WSNs) can both save energy and cut down on the number of nodes that need to be deployed. However, reliable data deliver to mobile devices remains a challenging problem, especially in WSN environments that have a high bit error rate. This paper presents Multi-channel network Coding Clustering (MuCC) for mobile data gathering within challenging wireless environments. MuCC is novel in its usage of both multi-channel and network coding techniques to improve both throughput and reliability. We have evaluated MuCC against a similar cluster-based protocol for mobile data gathering, and found that it delivers superior performance in terms of latency, reliability and energy saving.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121603858","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}
{"title":"A partial-decentralized coflow scheduling scheme in data center networks","authors":"Shuli Zhang, Yan Zhang, Ding Tang, Zhen Xu, Jingguo Ge, Zhijun Zhao","doi":"10.1109/LCN.2015.7366346","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366346","url":null,"abstract":"In this paper, we propose CGM-PS, a partial-decentralized, un-starving, work-conservative, and preemptive coflow scheduling scheme to shorten the Coflow Completion Time (CCT) for TCP flows in data center networks (DCNs). In CGMPS, we propose both inter- and intra- coflow scheduling policies. In inter-coflow scheduling, we present P-SEBF, which adopts a connected-graph model based novel concept Partialcoflow, to achieve approximate SEBF scheduling in a partial-decentralized manner. In intra-coflow scheduling, we present FP-MDFS to give flow-level priorities and appropriate rates to TCP flows for finishing the coflows as quick as possible without wasting network capacities in a decentralized manner. Trace-based simulation results show that, among existing coflow scheduling schemes, CGM-PS can achieve the minimal CCTs both on average and in the 90th percentile. In brief, CGM-PS only brings about similar scheduling overhead with the decentralized schemes, while it can achieve the CCT performance even better than the near optimal centralized scheme.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115209642","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}
Md Tanvir Ishtaique ul Huque, Guillaume Jourjon, V. Gramoli
{"title":"Revisiting the controller placement problem","authors":"Md Tanvir Ishtaique ul Huque, Guillaume Jourjon, V. Gramoli","doi":"10.1109/LCN.2015.7366350","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366350","url":null,"abstract":"The controller placement problem (CPP) is one of the key challenges of software defined networks to increase performance. Given the locations of switches, CPP consists of choosing the controller locations that minimize the latency between switches and controllers. In its current form, however, CPP assumes a fixed traffic and no existing solutions adapt the placement to the load. In this paper, we introduce the dynamic controller placement problem that consists of (i) determining the locations of controller modules to bound communication latencies, and of (ii) determining the number of controllers per module to support the load. We propose, LiDy, a solution that combines a controller placement algorithm with a dynamic flow management algorithm. We evaluate the latency and the controller utilization of LiDy on sparse and dense regions. Our results show that, in all settings, LiDy achieves a higher utilization than the most recent controller placement solution.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129243020","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, Géza Kulcsár, Immanuel Schweizer, Gergely Varró, Andy Schürr, M. Mühlhäuser
{"title":"Topology control with application constraints","authors":"Michael Stein, Géza Kulcsár, Immanuel Schweizer, Gergely Varró, Andy Schürr, M. Mühlhäuser","doi":"10.1109/LCN.2015.7366313","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366313","url":null,"abstract":"Numerous topology control algorithms for wireless sensor networks exist. Typically, these algorithms optimize general network metrics like the transmission range of sensors. Being of general nature, they suit application-specific requirements insufficiently; e.g., application-specific communication patterns may favor links that the general algorithm will remove. We suggest a new research focus called application-specific topology control and propose a methodic approach for which we provide a first exploration. First, application-specific communication patterns are expressed as overlay graphs. Then, application-specific requirements are specified as constraints on this overlay. Next follows the core of the method, geared toward deriving application-specific topology control algorithms. Applying the method to a data collection application with a many-to-one communication pattern, we propose two topology control algorithms. In a simulation study, we evaluate these algorithms against the existing algorithm kTC and a shortest path tree, showing that the method allows trading off general network optimization against application-specific optimization.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127095882","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}
{"title":"Characterizing performance and fairness of big data transfer protocols on long-haul networks","authors":"Se-young Yu, N. Brownlee, Aniket Mahanti","doi":"10.1109/LCN.2015.7366309","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366309","url":null,"abstract":"This paper presents a characterization study of big data transfer protocols on a long-haul network. We analyzed the performance and fairness of three well-known open-source protocols, namely, GridFTP, FDT, and UDT. Using a real-world 10 Gb/s network link between New Zealand and Sweden, we studied data transfer rates (in terms of goodput) and fairness (in terms of impact on round trip time) of the protocols. We performed extensive experiments using single and multiple data flows to comprehend how these protocols behave in real-world situations. We found that GridFTP has the fastest data transfer rates when using a single flow. UDT suffered from poor performance due to implementation issues. A small buffer size limited FDT's performance, however, this drawback can be overcome by using multiple flows in lieu of fairness.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351616","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}