Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876179
Paulo Alexandre Regis, S. Bhunia, S. Sengupta
In this paper, we present a novel approach to assign paths to data streams in a mission-centric heterogeneous wireless mesh network where nodes have multi-channel radio interfaces. Different than conventional packet-switching routing, our approach assigns the paths using a link utility based on sub-topologies of non-orthogonal frequencies. We use a graph coloring algorithm to calculate the utility of each link. We then propose two path assignment strategies: (i) single path, where each data stream traverse a unique path, and (ii) split-path, where the flows can be divided into multiple paths. Results show no best strategy fits all scenarios. Instead, in different situations, different algorithms are better suited.
{"title":"Enhancing performance and longevity of multi-radio multi-channel hetnets through dynamic path-assignment","authors":"Paulo Alexandre Regis, S. Bhunia, S. Sengupta","doi":"10.1109/ICCNC.2017.7876179","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876179","url":null,"abstract":"In this paper, we present a novel approach to assign paths to data streams in a mission-centric heterogeneous wireless mesh network where nodes have multi-channel radio interfaces. Different than conventional packet-switching routing, our approach assigns the paths using a link utility based on sub-topologies of non-orthogonal frequencies. We use a graph coloring algorithm to calculate the utility of each link. We then propose two path assignment strategies: (i) single path, where each data stream traverse a unique path, and (ii) split-path, where the flows can be divided into multiple paths. Results show no best strategy fits all scenarios. Instead, in different situations, different algorithms are better suited.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129372449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876276
Yuichi Miyaji, H. Uehara
In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.
{"title":"Neighbor discovery utilizing in-band full duplex in wireless clique networks","authors":"Yuichi Miyaji, H. Uehara","doi":"10.1109/ICCNC.2017.7876276","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876276","url":null,"abstract":"In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128946666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876166
M. Shahabinejad, M. Ardakani, M. Khabbazian
A linear block code with dimension k and length n is called a locally repairable code (LRC) with locality r if it can retrieve any coded symbol by at most r other coded symbols. LRCs have been recently proposed and used in practice in distributed storage systems such as Windows Azure Storage and Facebook HDFS-RAID. Theoretical bounds on the maximum locality of LRCs have been established, and optimal LRCs that achieve the obtained bound have been designed. Average locality of LRCs (r̅) is directly proportional to the costly repair bandwidth, disk I/O, and number of nodes involved in a repair process of a missing data block. There is a gap in the literature establishing the theoretical bounds on r̅. As an initial attempt to fill this gap, in this paper, we establish a lower bound on r̅ for the same code parameters used by Facebook HDFS-RAID. We also present a code that achieves the obtained bound. Comparing with the LRC used in Facebook HDFS-RAID, our proposed LRC improves the average locality by 22.5% without sacrificing the rate and minimum distance of the code.
{"title":"An erasure code with reduced average locality for distributed storage systems","authors":"M. Shahabinejad, M. Ardakani, M. Khabbazian","doi":"10.1109/ICCNC.2017.7876166","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876166","url":null,"abstract":"A linear block code with dimension k and length n is called a locally repairable code (LRC) with locality r if it can retrieve any coded symbol by at most r other coded symbols. LRCs have been recently proposed and used in practice in distributed storage systems such as Windows Azure Storage and Facebook HDFS-RAID. Theoretical bounds on the maximum locality of LRCs have been established, and optimal LRCs that achieve the obtained bound have been designed. Average locality of LRCs (r̅) is directly proportional to the costly repair bandwidth, disk I/O, and number of nodes involved in a repair process of a missing data block. There is a gap in the literature establishing the theoretical bounds on r̅. As an initial attempt to fill this gap, in this paper, we establish a lower bound on r̅ for the same code parameters used by Facebook HDFS-RAID. We also present a code that achieves the obtained bound. Comparing with the LRC used in Facebook HDFS-RAID, our proposed LRC improves the average locality by 22.5% without sacrificing the rate and minimum distance of the code.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876223
M. Rahmes, Richard Clouse, Jay Virts, George Yakimovicz, Bernard Rees, W. Talbert
We present an approach to increase likelihood that an automated reasoning system will make the best decisions for a system and sensor resource manager (SSRM) with limited resources. The introduction of automated game theory to mission planning allows for a modular architecture and scalable approach across a range of platforms and facilitates rapid integration of new modes and technology. Game theory enhances a multi-objective management system, enabling it to intelligently coordinate and optimally achieve disparate mission objectives of a converged system. Our solution may also save money by offering a Pareto efficient process for mission plan validation, which reduces time needed to validate scenarios. An area of significant contribution in our work is our new genetic linear optimization, which is an innovative, developmental extension of our efforts comparing genetic algorithms with linear programming. We show results in receiver-operating characteristic (ROC) curves and compare the performance. We also quantify the performance improvement across all combinations of decisions or players in a linear program. We further enhance decision making by combining the best parts of multiple solutions. Our design provides insight into the most important or optimal weights for degrees of freedom and can be used to efficiently tune those weights. We also discuss tradeoffs for improving processing time with a sensitivity analysis.
{"title":"Cognitive mission planning and system orchestration","authors":"M. Rahmes, Richard Clouse, Jay Virts, George Yakimovicz, Bernard Rees, W. Talbert","doi":"10.1109/ICCNC.2017.7876223","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876223","url":null,"abstract":"We present an approach to increase likelihood that an automated reasoning system will make the best decisions for a system and sensor resource manager (SSRM) with limited resources. The introduction of automated game theory to mission planning allows for a modular architecture and scalable approach across a range of platforms and facilitates rapid integration of new modes and technology. Game theory enhances a multi-objective management system, enabling it to intelligently coordinate and optimally achieve disparate mission objectives of a converged system. Our solution may also save money by offering a Pareto efficient process for mission plan validation, which reduces time needed to validate scenarios. An area of significant contribution in our work is our new genetic linear optimization, which is an innovative, developmental extension of our efforts comparing genetic algorithms with linear programming. We show results in receiver-operating characteristic (ROC) curves and compare the performance. We also quantify the performance improvement across all combinations of decisions or players in a linear program. We further enhance decision making by combining the best parts of multiple solutions. Our design provides insight into the most important or optimal weights for degrees of freedom and can be used to efficiently tune those weights. We also discuss tradeoffs for improving processing time with a sensitivity analysis.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876253
Tobias Amft, Kalman Graffi
In the past decades, various concepts of peer-to-peer (P2P) systems have been realized in desktop applications for stationary PCs. Last recent years show that computers have evolved to handy devices which can be used nearly everywhere, not only at home. For this reason, location-based services which allow to associate peers in a network with geographical positions, e.g. to track a device in emergency cases, become interesting. In this paper, we introduce LobSter, a lightweight location-based service over unmodified DHTs like Chord [24], Kademlia [14] and Pastry [21] which supports the mobility of peers. Our evaluation compares LobSter to related work in stationary situations and gives insights about the general limits of distributed location-based services in mobile environments.
{"title":"Moving peers in distributed, location-based peer-to-peer overlays","authors":"Tobias Amft, Kalman Graffi","doi":"10.1109/ICCNC.2017.7876253","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876253","url":null,"abstract":"In the past decades, various concepts of peer-to-peer (P2P) systems have been realized in desktop applications for stationary PCs. Last recent years show that computers have evolved to handy devices which can be used nearly everywhere, not only at home. For this reason, location-based services which allow to associate peers in a network with geographical positions, e.g. to track a device in emergency cases, become interesting. In this paper, we introduce LobSter, a lightweight location-based service over unmodified DHTs like Chord [24], Kademlia [14] and Pastry [21] which supports the mobility of peers. Our evaluation compares LobSter to related work in stationary situations and gives insights about the general limits of distributed location-based services in mobile environments.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876168
Yukio Ogawa, G. Hasegawa, M. Murata
Cloud bursting temporarily expands the capacity of cloud-based service hosted in a private data center by renting public data center capacity when the demand for capacity spikes. This paper presents a cloud bursting approach based on long- and short-term predictions of requests to a business-critical web system to determine the optimal resources of the system deployed over private and public data centers. In a private data center, a dedicated pool of virtual machines (VMs) is assigned to the web system on the basis of one-week predictions. Moreover, in both private and public data centers, VMs are activated on the basis of one-hour predictions. We formulated a problem that includes the total cost and response time constraints and conducted numerical simulations. The results indicate that our approach is tolerant of prediction errors. Even if the website receives bursty requests and one-hour predictions include a mean absolute percentage error (MAPE) of 0.2, the total cost decreases to a half the current cost while 95% of response time is kept below 0.15 s.
{"title":"Cloud bursting approach based on predicting requests for business-critical web systems","authors":"Yukio Ogawa, G. Hasegawa, M. Murata","doi":"10.1109/ICCNC.2017.7876168","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876168","url":null,"abstract":"Cloud bursting temporarily expands the capacity of cloud-based service hosted in a private data center by renting public data center capacity when the demand for capacity spikes. This paper presents a cloud bursting approach based on long- and short-term predictions of requests to a business-critical web system to determine the optimal resources of the system deployed over private and public data centers. In a private data center, a dedicated pool of virtual machines (VMs) is assigned to the web system on the basis of one-week predictions. Moreover, in both private and public data centers, VMs are activated on the basis of one-hour predictions. We formulated a problem that includes the total cost and response time constraints and conducted numerical simulations. The results indicate that our approach is tolerant of prediction errors. Even if the website receives bursty requests and one-hour predictions include a mean absolute percentage error (MAPE) of 0.2, the total cost decreases to a half the current cost while 95% of response time is kept below 0.15 s.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114384361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876201
Yantian Hou, Ming Li, K. Zeng
In multi-hop wireless networks (MWNs), interference and connectivity are two key factors that affect end-to-end network throughput. Traditional omni-directional antennas and directional antennas either generate significant interference or provide poor network connectivity. Reconfigurable antenna (RA) is an emerging antenna technology that can agilely switch among many different antenna states including radiation patterns, so as to suppress interference and maintain high connectivity at the same time. In this work, we systematically exploit the pattern diversity and fast reconfigurability of RAs to enhance the throughput of MWNs. We first propose a novel link-layer model that captures the dynamic relations between antenna pattern, link coverage and interference. Based on our model, a throughput optimization framework is proposed by jointly considering pattern selection and link scheduling. Our problem is formulated as a mixed integer non-linear programming problem. The superiority of reconfigurable antennas compared with traditional omni-directional and directional antennas is both theoretically proven, and validated through extensive simulations.
{"title":"Throughput optimization in multi-hop wireless networks with reconfigurable antennas","authors":"Yantian Hou, Ming Li, K. Zeng","doi":"10.1109/ICCNC.2017.7876201","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876201","url":null,"abstract":"In multi-hop wireless networks (MWNs), interference and connectivity are two key factors that affect end-to-end network throughput. Traditional omni-directional antennas and directional antennas either generate significant interference or provide poor network connectivity. Reconfigurable antenna (RA) is an emerging antenna technology that can agilely switch among many different antenna states including radiation patterns, so as to suppress interference and maintain high connectivity at the same time. In this work, we systematically exploit the pattern diversity and fast reconfigurability of RAs to enhance the throughput of MWNs. We first propose a novel link-layer model that captures the dynamic relations between antenna pattern, link coverage and interference. Based on our model, a throughput optimization framework is proposed by jointly considering pattern selection and link scheduling. Our problem is formulated as a mixed integer non-linear programming problem. The superiority of reconfigurable antennas compared with traditional omni-directional and directional antennas is both theoretically proven, and validated through extensive simulations.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876183
Jiayin Wang, Teng Wang, Zhengyu Yang, Ying Mao, N. Mi, B. Sheng
Big data processing frameworks such as Hadoop [1] are now widely adopted, however the security issues in large scale systems have not been well studied yet. Unlike prior work on data privacy and protection, this paper investigates a potential attack from a compromised internal node against the overall system performance. We develop an effective attack launched from the compromised node that can significantly degrade the data processing performance of the cluster without being detected and blacklisted for job execution, also present a mitigation scheme that protects a Hadoop system from such attack. The results of experiments show that this attack greatly slows down the job executions in the native Hadoop system even with some basic defense mechanisms, however, our mitigation schem can keep the whole cluster running efficiently under such attack.
{"title":"SEINA: A stealthy and effective internal attack in Hadoop systems","authors":"Jiayin Wang, Teng Wang, Zhengyu Yang, Ying Mao, N. Mi, B. Sheng","doi":"10.1109/ICCNC.2017.7876183","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876183","url":null,"abstract":"Big data processing frameworks such as Hadoop [1] are now widely adopted, however the security issues in large scale systems have not been well studied yet. Unlike prior work on data privacy and protection, this paper investigates a potential attack from a compromised internal node against the overall system performance. We develop an effective attack launched from the compromised node that can significantly degrade the data processing performance of the cluster without being detected and blacklisted for job execution, also present a mitigation scheme that protects a Hadoop system from such attack. The results of experiments show that this attack greatly slows down the job executions in the native Hadoop system even with some basic defense mechanisms, however, our mitigation schem can keep the whole cluster running efficiently under such attack.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876269
Shuo-Han Chen, Chi-Heng Lee, Tseng-Yi Chen, H. Wei, T. Hsu, W. Shih
A Wireless Sensor Network (WSN) uses a larger number of low-power sensor nodes to gather environmental information which is then wirelessly forwarded to a base station. However, sensor nodes have very limited communication ranges. Thus, relay nodes are required to ensure reliable connectivity throughout the WSN. On the other hand, relay nodes are typically more sophisticated and expensive than sensor nodes. Therefore, deployment strategies should seek to minimize the number of required relay nodes, a problem referred to as the Steiner Tree Problem with Minimum Number of Steiner Points (SMT-MSP), which has been shown to be NP-hard. This paper analyzes and improves the 3-star approximation algorithm by reducing the time complexity from O(n3) to O(nlogn) with the identical performance ratio. Experiments are conducted to verify the correctness of the proposed algorithm.
{"title":"Analysis and improvement of the 3-star algorithm for the STP-MSP problem in Wireless Sensor Networks","authors":"Shuo-Han Chen, Chi-Heng Lee, Tseng-Yi Chen, H. Wei, T. Hsu, W. Shih","doi":"10.1109/ICCNC.2017.7876269","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876269","url":null,"abstract":"A Wireless Sensor Network (WSN) uses a larger number of low-power sensor nodes to gather environmental information which is then wirelessly forwarded to a base station. However, sensor nodes have very limited communication ranges. Thus, relay nodes are required to ensure reliable connectivity throughout the WSN. On the other hand, relay nodes are typically more sophisticated and expensive than sensor nodes. Therefore, deployment strategies should seek to minimize the number of required relay nodes, a problem referred to as the Steiner Tree Problem with Minimum Number of Steiner Points (SMT-MSP), which has been shown to be NP-hard. This paper analyzes and improves the 3-star approximation algorithm by reducing the time complexity from O(n3) to O(nlogn) with the identical performance ratio. Experiments are conducted to verify the correctness of the proposed algorithm.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117111610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876214
Jen-Yi Pan, Shengfu Ma
Millions of apps cover all aspects of our lives and make smartphones success. Advertisers financially support developers but also collect users' privacy. Several ad blocking apps help users to eliminate advertisement by filtering or redirection for certain targets whose list is maintained by a third party, and some of them require root permission. We develop an advertisement removal program with the technique of reverse engineering, which can effectively patch the advertising code, even obfuscated by other tools. The proposed method takes no overhead at runtime, and requires neither root permission nor list updating. This study also gives a different perspective on tailoring behavior of Android applications.
{"title":"Advertisement removal of Android applications by reverse engineering","authors":"Jen-Yi Pan, Shengfu Ma","doi":"10.1109/ICCNC.2017.7876214","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876214","url":null,"abstract":"Millions of apps cover all aspects of our lives and make smartphones success. Advertisers financially support developers but also collect users' privacy. Several ad blocking apps help users to eliminate advertisement by filtering or redirection for certain targets whose list is maintained by a third party, and some of them require root permission. We develop an advertisement removal program with the technique of reverse engineering, which can effectively patch the advertising code, even obfuscated by other tools. The proposed method takes no overhead at runtime, and requires neither root permission nor list updating. This study also gives a different perspective on tailoring behavior of Android applications.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117213232","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
扫码关注我们
求助内容：
应助结果提醒方式：