Pub Date : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218644
Zongjian He, Jiannong Cao, Xuefeng Liu
The potential of crowdsourcing for complex problem solving has been revealed by smartphones. Nowadays, vehicles have also been increasingly adopted as participants in crowd-sourcing applications. Different from smartphones, vehicles have the distinct advantage of predictable mobility, which brings new insight into improving the crowdsourcing quality. Unfortunately, utilizing the predictable mobility in participant recruitment poses a new challenge of considering not only current location but also the future trajectories of participants. Therefore, existing participant recruitment algorithms that only use the current location may not perform well. In this paper, based on the predicted trajectory, we present a new participant recruitment strategy for vehicle-based crowdsourcing. This strategy guarantees that the system can perform well using the currently recruited participants for a period of time in the future. The participant recruitment problem is proven to be NP-complete, and we propose two algorithms, a greedy approximation and a genetic algorithm, to find the solution for different application scenarios. The performance of our algorithms is demonstrated with traffic trace dataset. The results show that our algorithms outperform some existing approaches in terms of the crowdsourcing quality.
{"title":"High quality participant recruitment in vehicle-based crowdsourcing using predictable mobility","authors":"Zongjian He, Jiannong Cao, Xuefeng Liu","doi":"10.1109/INFOCOM.2015.7218644","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218644","url":null,"abstract":"The potential of crowdsourcing for complex problem solving has been revealed by smartphones. Nowadays, vehicles have also been increasingly adopted as participants in crowd-sourcing applications. Different from smartphones, vehicles have the distinct advantage of predictable mobility, which brings new insight into improving the crowdsourcing quality. Unfortunately, utilizing the predictable mobility in participant recruitment poses a new challenge of considering not only current location but also the future trajectories of participants. Therefore, existing participant recruitment algorithms that only use the current location may not perform well. In this paper, based on the predicted trajectory, we present a new participant recruitment strategy for vehicle-based crowdsourcing. This strategy guarantees that the system can perform well using the currently recruited participants for a period of time in the future. The participant recruitment problem is proven to be NP-complete, and we propose two algorithms, a greedy approximation and a genetic algorithm, to find the solution for different application scenarios. The performance of our algorithms is demonstrated with traffic trace dataset. The results show that our algorithms outperform some existing approaches in terms of the crowdsourcing quality.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131122790","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218441
Xu Zhang, Jeffrey Knockel, Jedidiah R. Crandall
We present an Internet measurement technique for finding machines that are hidden behind firewalls. That is, if a firewall prevents outside IP addresses from sending packets to an internal protected machine that is only accessible on the local network, our technique can still find the machine. We employ a novel TCP/IP side channel technique to achieve this. The technique uses side channels in “zombie” machines to learn information about the network from the perspective of a zombie. Unlike previous TCP/IP side channel techniques, our technique does not require a high packet rate and does not cause denial-of-service. We also make no assumptions about globally incrementing IPIDs, as do idle scans. This paper addresses two key questions about our technique: how many machines are there on the Internet that are hidden behind firewalls, and how common is ingress filtering that prevents our scan by not allowing spoofed IP packets into the network. We answer both of these questions, respectively, by finding 1,296 hidden machines and measuring that only 23.9% of our candidate zombie machines are on networks that perform ingress filtering.
{"title":"Original SYN: Finding machines hidden behind firewalls","authors":"Xu Zhang, Jeffrey Knockel, Jedidiah R. Crandall","doi":"10.1109/INFOCOM.2015.7218441","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218441","url":null,"abstract":"We present an Internet measurement technique for finding machines that are hidden behind firewalls. That is, if a firewall prevents outside IP addresses from sending packets to an internal protected machine that is only accessible on the local network, our technique can still find the machine. We employ a novel TCP/IP side channel technique to achieve this. The technique uses side channels in “zombie” machines to learn information about the network from the perspective of a zombie. Unlike previous TCP/IP side channel techniques, our technique does not require a high packet rate and does not cause denial-of-service. We also make no assumptions about globally incrementing IPIDs, as do idle scans. This paper addresses two key questions about our technique: how many machines are there on the Internet that are hidden behind firewalls, and how common is ingress filtering that prevents our scan by not allowing spoofed IP packets into the network. We answer both of these questions, respectively, by finding 1,296 hidden machines and measuring that only 23.9% of our candidate zombie machines are on networks that perform ingress filtering.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114379025","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218661
Philipp H. Kindt, Daniel Yunge, Mathias Gopp, S. Chakraborty
Bluetooth Low Energy is a time-slotted wireless protocol aimed towards low power communication for battery-driven devices. As a power-management capability, whenever there is less data to send, the slave is allowed to remain in a low power mode during a given number of time-slots in a row. However, since the master does not know the exact sleep behavior of the slave, it has to wake-up at every time-slot and repeat its packets until the slave is awake. As a result, applications with variable throughput lead to many energy-consuming idle-slots at the master. In such applications, usually the connection parameters are chosen considering the worst case at design time and remain constant during operation. In this paper, we propose a novel power-management framework for BLE. Rather than skipping slots at the slave side, the proposed system updates the interval between two consecutive time-slots during runtime by applying online algorithms. To avoid data-loss or high delays, the framework guarantees that constraints on latency are met and buffers never overflow. Energy measurements of three different test-cases show that up to 42 percent of the energy consumption of a BLE master can be saved with our power management system.
{"title":"Adaptive online power-management for Bluetooth Low Energy","authors":"Philipp H. Kindt, Daniel Yunge, Mathias Gopp, S. Chakraborty","doi":"10.1109/INFOCOM.2015.7218661","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218661","url":null,"abstract":"Bluetooth Low Energy is a time-slotted wireless protocol aimed towards low power communication for battery-driven devices. As a power-management capability, whenever there is less data to send, the slave is allowed to remain in a low power mode during a given number of time-slots in a row. However, since the master does not know the exact sleep behavior of the slave, it has to wake-up at every time-slot and repeat its packets until the slave is awake. As a result, applications with variable throughput lead to many energy-consuming idle-slots at the master. In such applications, usually the connection parameters are chosen considering the worst case at design time and remain constant during operation. In this paper, we propose a novel power-management framework for BLE. Rather than skipping slots at the slave side, the proposed system updates the interval between two consecutive time-slots during runtime by applying online algorithms. To avoid data-loss or high delays, the framework guarantees that constraints on latency are met and buffers never overflow. Energy measurements of three different test-cases show that up to 42 percent of the energy consumption of a BLE master can be saved with our power management system.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114918564","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218385
Jing Gao, Jianzhong Li, Zhipeng Cai, Hong Gao
Event monitoring is a popular task carried out by Wireless Sensor Networks (WSNs). A composite event involves multiple properties requiring different types of sensors to monitor. Considering the costs of different deployment of heterogeneous sensors and the total budget for a monitored region, this paper investigates the composite event coverage problem with the purpose of optimizing coverage quality subjecting to the constraint of not exceeding the total budget. This is a novel coverage problem which is different from the traditional ones where deployment costs of sensors, total budget and composite events are not considered. Two exact algorithms are proposed whose time complexities are O(nk) and O(nk-1) respectively in the worst case, and a (1 - e-1)-approximate algorithm are designed. The simulation results indicate the efficiency and effectiveness of the proposed algorithms.
{"title":"Composite event coverage in wireless sensor networks with heterogeneous sensors","authors":"Jing Gao, Jianzhong Li, Zhipeng Cai, Hong Gao","doi":"10.1109/INFOCOM.2015.7218385","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218385","url":null,"abstract":"Event monitoring is a popular task carried out by Wireless Sensor Networks (WSNs). A composite event involves multiple properties requiring different types of sensors to monitor. Considering the costs of different deployment of heterogeneous sensors and the total budget for a monitored region, this paper investigates the composite event coverage problem with the purpose of optimizing coverage quality subjecting to the constraint of not exceeding the total budget. This is a novel coverage problem which is different from the traditional ones where deployment costs of sensors, total budget and composite events are not considered. Two exact algorithms are proposed whose time complexities are O(nk) and O(nk-1) respectively in the worst case, and a (1 - e-1)-approximate algorithm are designed. The simulation results indicate the efficiency and effectiveness of the proposed algorithms.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288888","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218370
Philipp H. Kindt, Han Jing, N. Peters, S. Chakraborty
Reducing the energy consumption to the minimum is a crucial design requirement for all body area sensor networks. Sensors deployed on the human body, especially at the limbs often move along different positions. Usually, the transmit power is set to a sufficiently high value to achieve reliable transmission for the constellation with highest attenuation. For periodic movements, data transmission can be carried out at the position of the lowest path loss between the sender and the receiver, provided this position can be reliably identified. We propose a novel framework that predicts this position using acceleration data and the received signal strength. By learning a correlation between these signals, accurate predictions can be performed and up to 24.7% of the power spent by a Bluetooth Low Energy module for the transmission of a packet can be saved while still achieving the same packet error rate as with sending using the higher transmit power.
{"title":"ExPerio — Exploiting periodicity for opportunistic energy-efficient data transmission","authors":"Philipp H. Kindt, Han Jing, N. Peters, S. Chakraborty","doi":"10.1109/INFOCOM.2015.7218370","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218370","url":null,"abstract":"Reducing the energy consumption to the minimum is a crucial design requirement for all body area sensor networks. Sensors deployed on the human body, especially at the limbs often move along different positions. Usually, the transmit power is set to a sufficiently high value to achieve reliable transmission for the constellation with highest attenuation. For periodic movements, data transmission can be carried out at the position of the lowest path loss between the sender and the receiver, provided this position can be reliably identified. We propose a novel framework that predicts this position using acceleration data and the received signal strength. By learning a correlation between these signals, accurate predictions can be performed and up to 24.7% of the power spent by a Bluetooth Low Energy module for the transmission of a packet can be saved while still achieving the same packet error rate as with sending using the higher transmit power.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610883","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218517
Xin Li, Chen Qian
Network functions are widely deployed in modern networks, providing various network services ranging from intrusion detection to HTTP caching. Various virtual network function instances can be consolidated into one physical middlebox. Depending on the type of services, packet processing for different flows consumes different hardware resources in the middlebox. Previous solutions of multi-resource packet scheduling suffer from high computational complexity and memory cost for packet buffering and scheduling, especially when the number of flows is large. In this paper, we design a novel low-complexity and space-efficient packet scheduling algorithm called Myopia, which supports multi-resource environments such as network function virtualization. Myopia is developed based upon the fact that most Internet traffic is contributed by a small fraction of elephant flows. Myopia schedules elephant flows with precise control and treats mice flows using FIFO, to achieve simplicity of packet buffering and scheduling. We will demonstrate, via theoretical analysis, prototype implementation, and simulations, that Myopia achieves multi-resource fairness at low cost with short packet delay.
{"title":"Low-complexity multi-resource packet scheduling for network function virtualization","authors":"Xin Li, Chen Qian","doi":"10.1109/INFOCOM.2015.7218517","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218517","url":null,"abstract":"Network functions are widely deployed in modern networks, providing various network services ranging from intrusion detection to HTTP caching. Various virtual network function instances can be consolidated into one physical middlebox. Depending on the type of services, packet processing for different flows consumes different hardware resources in the middlebox. Previous solutions of multi-resource packet scheduling suffer from high computational complexity and memory cost for packet buffering and scheduling, especially when the number of flows is large. In this paper, we design a novel low-complexity and space-efficient packet scheduling algorithm called Myopia, which supports multi-resource environments such as network function virtualization. Myopia is developed based upon the fact that most Internet traffic is contributed by a small fraction of elephant flows. Myopia schedules elephant flows with precise control and treats mice flows using FIFO, to achieve simplicity of packet buffering and scheduling. We will demonstrate, via theoretical analysis, prototype implementation, and simulations, that Myopia achieves multi-resource fairness at low cost with short packet delay.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133081641","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218608
Yanchao Zhao, Wenzhong Li, Jie Wu, Sanglu Lu
Conflict graph has been widely used for wireless network optimization in dealing with the issues of channel assignment, spectrum allocation, links scheduling and etc. Despite its simplicity, the traditional conflict graph suffers from two drawbacks. On one hand, it is a rough representation of the interference condition, which is inaccurate and will cause suboptimal results for wireless network optimization. On the other hand, it only defines the interference between two entities, which neglects the accumulative effect of small amount interference. In this paper, we propose the model of quantized conflict graph (QCG) to tackle the above issues. The properties, usage and construction methods of QCG are explored. We show that in its matrix form, a QCG owns the properties of low-rank and high-similarity. These properties give birth to three complementary QCG estimation strategies, namely low-rank approximation approach, similarity based approach, and comprehensive approach, to construct the QCG efficiently and accurately from partial interference measurement results. We further explore the potential of QCG for wireless network optimization by applying QCG in minimizing the total network interference. Extensive experiments using real collected wireless network are conducted to evaluate the system performance, which confirm the efficiency of the proposed algorithms.
{"title":"Quantized conflict graphs for wireless network optimization","authors":"Yanchao Zhao, Wenzhong Li, Jie Wu, Sanglu Lu","doi":"10.1109/INFOCOM.2015.7218608","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218608","url":null,"abstract":"Conflict graph has been widely used for wireless network optimization in dealing with the issues of channel assignment, spectrum allocation, links scheduling and etc. Despite its simplicity, the traditional conflict graph suffers from two drawbacks. On one hand, it is a rough representation of the interference condition, which is inaccurate and will cause suboptimal results for wireless network optimization. On the other hand, it only defines the interference between two entities, which neglects the accumulative effect of small amount interference. In this paper, we propose the model of quantized conflict graph (QCG) to tackle the above issues. The properties, usage and construction methods of QCG are explored. We show that in its matrix form, a QCG owns the properties of low-rank and high-similarity. These properties give birth to three complementary QCG estimation strategies, namely low-rank approximation approach, similarity based approach, and comprehensive approach, to construct the QCG efficiently and accurately from partial interference measurement results. We further explore the potential of QCG for wireless network optimization by applying QCG in minimizing the total network interference. Extensive experiments using real collected wireless network are conducted to evaluate the system performance, which confirm the efficiency of the proposed algorithms.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220893","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218399
Hao Zhou, Yusheng Ji, Xiaoyan Wang, Bao-hua Zhao
Interference management is one of the most important issues in the heterogeneous cellular networks (HetNet) with macro and pico cells. The enhanced inter cell interference coordination (eICIC) has been proposed to protect downlink pico cell transmissions by mitigating interference from neighboring macro cells. The adaptive eICIC configuration problem is studied in this paper to adjust the parameters including the ratio of Almost Blank Subframes (ABS) and the bias of cell range expansion (RE). We formulate the problem as a general form consensus problem with regularization, and solve the problem by providing an efficient distributed optimization framework. Our algorithm is based on the alternating direction method of multipliers (ADMM) in which the solutions to local subproblems on each macro cell and pico cell are coordinated to find a solution to the global problem for the whole network. We also propose the dynamic programming based algorithms to solve the local subproblems on macro cell or pico cell. The simulation results demonstrate the efficiency of the proposed algorithm compared with existing approaches, and verify the convergence properties of the proposed algorithm.
干扰管理是宏微异构蜂窝网络(HetNet)中最重要的问题之一。增强小区间干扰协调(enhanced inter cell interference coordination, eICIC)通过减轻相邻宏小区的干扰来保护下行微小区传输。本文研究了自适应eICIC配置问题，以调整包括几乎空白子帧(ABS)比率和小区范围扩展(RE)偏差在内的参数。我们将该问题表述为正则化的一般形式一致性问题，并通过提供一个高效的分布式优化框架来解决该问题。该算法基于交替方向乘法器(ADMM)，通过协调各宏单元和微单元上的局部子问题的解来寻找整个网络的全局问题的解。我们还提出了基于动态规划的算法来解决宏单元或微单元上的局部子问题。仿真结果证明了该算法与现有算法的有效性，并验证了该算法的收敛性。
{"title":"ADMM based algorithm for eICIC configuration in heterogeneous cellular networks","authors":"Hao Zhou, Yusheng Ji, Xiaoyan Wang, Bao-hua Zhao","doi":"10.1109/INFOCOM.2015.7218399","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218399","url":null,"abstract":"Interference management is one of the most important issues in the heterogeneous cellular networks (HetNet) with macro and pico cells. The enhanced inter cell interference coordination (eICIC) has been proposed to protect downlink pico cell transmissions by mitigating interference from neighboring macro cells. The adaptive eICIC configuration problem is studied in this paper to adjust the parameters including the ratio of Almost Blank Subframes (ABS) and the bias of cell range expansion (RE). We formulate the problem as a general form consensus problem with regularization, and solve the problem by providing an efficient distributed optimization framework. Our algorithm is based on the alternating direction method of multipliers (ADMM) in which the solutions to local subproblems on each macro cell and pico cell are coordinated to find a solution to the global problem for the whole network. We also propose the dynamic programming based algorithms to solve the local subproblems on macro cell or pico cell. The simulation results demonstrate the efficiency of the proposed algorithm compared with existing approaches, and verify the convergence properties of the proposed algorithm.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096819","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218439
Hao Cai, T. Wolf
Neighbor discovery is a crucial first step in configuring and managing a wireless network. Most existing studies on neighbor discovery are based on broadcast algorithms, where nodes send 1-way messages without getting response from their neighbors. However, when directional antennas are used, the ability to coordinate with a neighbor is crucial for later communication between nodes, which requires handshake-based (at least 2-way) protocols. In this paper, we provide a detailed analysis of neighbor discovery protocols with 2-way communication when using directional antennas. Based on this analysis, we present the design of a randomized 2-way neighbor discovery algorithm that uses a selective feedback. Our result shows that a node needs Θ(n2/k) time to discover its n neighbors with k antenna sectors, which yields a significant performance improvement over pure randomized algorithms. We also extend our schemes to practical cases, where the number of neighbors is unknown, and show a factor of no more than 4/3 slowdown in performance.
{"title":"On 2-way neighbor discovery in wireless networks with directional antennas","authors":"Hao Cai, T. Wolf","doi":"10.1109/INFOCOM.2015.7218439","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218439","url":null,"abstract":"Neighbor discovery is a crucial first step in configuring and managing a wireless network. Most existing studies on neighbor discovery are based on broadcast algorithms, where nodes send 1-way messages without getting response from their neighbors. However, when directional antennas are used, the ability to coordinate with a neighbor is crucial for later communication between nodes, which requires handshake-based (at least 2-way) protocols. In this paper, we provide a detailed analysis of neighbor discovery protocols with 2-way communication when using directional antennas. Based on this analysis, we present the design of a randomized 2-way neighbor discovery algorithm that uses a selective feedback. Our result shows that a node needs Θ(n2/k) time to discover its n neighbors with k antenna sectors, which yields a significant performance improvement over pure randomized algorithms. We also extend our schemes to practical cases, where the number of neighbors is unknown, and show a factor of no more than 4/3 slowdown in performance.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125760625","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 : 2015-08-24DOI: 10.1109/INFOCOM.2015.7218623
Subhankar Mishra, Xiang Li, Alan Kuhnle, M. Thai, Jungtaek Seo
Smart Grid addresses the problem of existing power grid's increasing complexity, growing demand and requirement for greater reliability, through two-way communication and automated residential load control among others. These features also makes the Smart Grid a target for a number of cyber attacks. In the paper, we study the problem of rate alteration attack (RAA) through fabrication of price messages which induces changes in load profiles of individual users and eventually causes major alteration in the load profile of the entire network. Combining with cascading failure, it ends up with a highly damaging attack. We prove that the problem is NP-Complete and provide its inapproximability. We devise two approaches for the problem, former deals with maximizing failure of lines with the given resource and then extending the effect with cascading failure while the later takes cascading potential into account while choosing the lines to fail. To get more insight into the impact of RAA, we also extend our algorithms to maximize number of node failures. Empirical results on both IEEE Bus data and real network help us evaluate our approaches under various settings of grid parameters.
{"title":"Rate alteration attacks in smart grid","authors":"Subhankar Mishra, Xiang Li, Alan Kuhnle, M. Thai, Jungtaek Seo","doi":"10.1109/INFOCOM.2015.7218623","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218623","url":null,"abstract":"Smart Grid addresses the problem of existing power grid's increasing complexity, growing demand and requirement for greater reliability, through two-way communication and automated residential load control among others. These features also makes the Smart Grid a target for a number of cyber attacks. In the paper, we study the problem of rate alteration attack (RAA) through fabrication of price messages which induces changes in load profiles of individual users and eventually causes major alteration in the load profile of the entire network. Combining with cascading failure, it ends up with a highly damaging attack. We prove that the problem is NP-Complete and provide its inapproximability. We devise two approaches for the problem, former deals with maximizing failure of lines with the given resource and then extending the effect with cascading failure while the later takes cascading potential into account while choosing the lines to fail. To get more insight into the impact of RAA, we also extend our algorithms to maximize number of node failures. Empirical results on both IEEE Bus data and real network help us evaluate our approaches under various settings of grid parameters.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125536524","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
扫码关注我们
求助内容：
应助结果提醒方式：