Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks最新文献

Analysis of Underwater Target Detection Probability by Using Autonomous Underwater Vehicles 自主水下航行器水下目标探测概率分析

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132729

Peng Sun, A. Boukerche

{"title":"Analysis of Underwater Target Detection Probability by Using Autonomous Underwater Vehicles","authors":"Peng Sun, A. Boukerche","doi":"10.1145/3132114.3132729","DOIUrl":"https://doi.org/10.1145/3132114.3132729","url":null,"abstract":"Due to the trend of under-ocean exploration, realtime monitoring or long-term surveillance of the under-ocean environment, e.g., real-time monitoring for under-ocean oil drilling, is imperative. Underwater wireless sensor networks could provide an optimal option, and have recently attracted intensive attention from researchers. Nevertheless, terrestrial wireless sensor networks (WSNs) have been well investigated and solved by many approaches that rely on the electromagnetic/optical transmission techniques. Deploying an applicable underwater wireless sensor network is still a big challenge. Due to critical conditions of the underwater environment (e.g., high pressure, high salinity, limited energy etc), the cost of the underwater sensor is significant. The dense sensor deployment is not applicable in the underwater condition. Therefore, Autonomous Underwater Vehicle (AUV) becomes an alternative option for implementing underwater surveillance and target detection. In this article, we present a framework to theoretically analyze the target detection probability in the underwater environment by using AUVs. The experimental results further verify our theoretical results.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114953820","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}

引用次数: 5

Reactive Routing Protocol for Event Reporting in Mobile-Sink Wireless Sensor Networks 移动-汇聚无线传感器网络中事件报告的响应路由协议

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132116

Catalina Aranzazu Suescun, M. Cardei

引用次数: 5

An Efficient Source Anonymity Technique based on Exponential Distribution against a Global Adversary Model using Fake Injections 基于指数分布的假注入对抗全局攻击模型的高效源匿名技术

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132120

Anas Bushnag, Abdelshakour A. Abuzneid, A. Mahmood

{"title":"An Efficient Source Anonymity Technique based on Exponential Distribution against a Global Adversary Model using Fake Injections","authors":"Anas Bushnag, Abdelshakour A. Abuzneid, A. Mahmood","doi":"10.1145/3132114.3132120","DOIUrl":"https://doi.org/10.1145/3132114.3132120","url":null,"abstract":"The security of Wireless Sensor Networks (WSNs) is vital in several applications such as the tracking and monitoring of endangered species such as pandas in a national park or soldiers in a battlefield. This kind of applications requires the anonymity of the source, known as Source Location Privacy (SLP). The main aim is to prevent an adversary from tracing back a real event to the originator by analyzing the network traffic. Previous techniques have achieved high anonymity such as Dummy Uniform Distribution (DUD), Dummy Adaptive Distribution (DAD) and Controlled Dummy Adaptive Distribution (CAD). However, these techniques increase the overall overhead of the network. To overcome this shortcoming, a new technique is presented: Exponential Dummy Adaptive Distribution (EDAD). In this technique, an exponential distribution is used instead of the uniform distribution to reduce the overhead without sacrificing the anonymity of the source. The exponential distribution improves the lifetime of the network since it decreases the number of transmitted packets within the network. It is straightforward and easy to implement because it has only one parameter λ that controls the transmitting rate of the network nodes. The conducted adversary model is global, which has a full view of the network and is able to perform sophisticated attacks such as rate monitoring and time correlation. The simulation results show that the proposed technique provides less overhead and high anonymity with reasonable delay and delivery ratio. Three different analysis models are developed to confirm the validation of our technique. These models are visualization model, a neural network model, and a steganography model.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132116915","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}

引用次数: 4

Distributed Coordinate-free Boundary Nodes Identification in Wireless Sensor Networks 无线传感器网络中分布式无坐标边界节点识别

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132122

Linna Wei, Yuanxia Shen

{"title":"Distributed Coordinate-free Boundary Nodes Identification in Wireless Sensor Networks","authors":"Linna Wei, Yuanxia Shen","doi":"10.1145/3132114.3132122","DOIUrl":"https://doi.org/10.1145/3132114.3132122","url":null,"abstract":"In a wireless sensor network (WSN), coverage holes may appear due to sensor random deployment or node failure. They may restrain the network from providing comprehensive and quality data for end users. In order to heal the coverage holes, the network first needs to localize them and the main idea is to find the boundary nodes on them. Although the problem of identifying the boundary nodes in WSNs has been intensively studied, most of them accomplished the work by using the coordinates of sensors. However, due to the comparatively expansive cost for equipping sensors with localization devices such as GPSs, coordinates are often unavailable in low-budget networks. Existing coordinate-free algorithms often perform their works in evenly distributed sensor networks with relatively high node density. Therefore, how to complete the task without assistance of coordinates still faces difficulties in general networks. In this paper, we present a distributed algorithm to distinguish the boundary nodes from inner ones in a network according to their 1-hop neighbors. In our approach, a sensor first finds out if there is a Hamiltonian circle in the neighborhood of it. Then, it analyzes characteristics of the circle to decide if the circle is located beside or around, based on techniques of neighborhood triangulation and point in triangle test without coordinates. Simulation results show the performance effectiveness of our method in identifying boundary nodes in networks with random and uneven sensor deployment, especially in the ones with small scattered coverage holes.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115138097","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}

引用次数: 2

Heuristic and Meta-Heuristic Approaches for Energy-Efficient Coverage-Preserving Protocols in Wireless Sensor Networks 无线传感器网络中节能保覆盖协议的启发式和元启发式方法

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132119

A. Tretyakova, F. Seredyński, F. Guinand

{"title":"Heuristic and Meta-Heuristic Approaches for Energy-Efficient Coverage-Preserving Protocols in Wireless Sensor Networks","authors":"A. Tretyakova, F. Seredyński, F. Guinand","doi":"10.1145/3132114.3132119","DOIUrl":"https://doi.org/10.1145/3132114.3132119","url":null,"abstract":"Monitoring some sites using a wireless sensor network (WSN) may be hampered by the difficulty of recharging or renewing the batteries of the sensing devices. Mechanisms aiming at improving the energy usage at any moment while fulfilling the application requirements are thus key for maximizing the lifetime of such networks. Among the different methods for achieving such a goal, we focus on energy management methods based on duty-cycling allowing the sensors to switch between two modes: a high-energy mode (active) and a low-energy mode (sleep). In this paper we propose two new scheduling heuristics for addressing the problem of maximizing the lifetime of a WSN under the constraint of coverage of a subset of fixed targets. The first one is a stochastic greedy algorithm and the second one is based on applying Simulated Annealing (SA). Both heuristics use a specific knowledge about the problem. Experimental results show that while both algorithms perform well, greedy algorithm is preferable for small and medium sizes networks, and SA algorithm has competitive advantages for larger networks.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125210221","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}

引用次数: 8

Location-based Mechanism for Positioning of a Mobile Relay 基于位置的移动中继定位机制

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132115

Filip Lemic, A. Behboodi, V. Handziski, A. Zubow, R. Mathar, A. Wolisz

{"title":"Location-based Mechanism for Positioning of a Mobile Relay","authors":"Filip Lemic, A. Behboodi, V. Handziski, A. Zubow, R. Mathar, A. Wolisz","doi":"10.1145/3132114.3132115","DOIUrl":"https://doi.org/10.1145/3132114.3132115","url":null,"abstract":"Leveraging a relay for communication is a promising approach for improving throughput, coverage, and energy efficiency in wireless networks. A mobile relay that is capable of positioning itself at different locations opens the possibility for dynamic optimization of the path quality between the source and the nomadic destination. How to optimally position the mobile relay in order to maximize the path quality, however, remains a challenging task. Under the assumption that the physical location information of the devices are either known or can be estimated, we propose a mechanism for positioning of the mobile relay with the aim of maximizing the SNR between the source and the destination. The proposed mechanism takes into account the practically unavoidable inaccuracies of estimated locations, as well as the propagation characteristics of a served environment. Using WiFi as an example technology, we experimentally evaluate the proposed mechanism in a complex indoor environment with the support of a specifically designed testbed infrastructure. For relatively small localization errors, our results show less than 4 dB difference between the measured SNR at optimal locations and the SNR at locations yielded by the proposed mechanism. Our results also illustrate how the quality of the paths created by the proposed positioning mechanism degrades in the face of increasing localization errors.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124990828","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}

引用次数: 6

An Empirical Characterization of Internet Round-Trip Times 互联网往返时间的实证表征

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132123

Daniel S. F. Alves, K. Obraczka

引用次数: 2

Mitigating Selective Jamming Attacks in Smart Meter Data Collection using Moving Target Defense 利用移动目标防御减轻智能电表数据采集中的选择性干扰攻击

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132127

Ramazan Algin, H. Tan, K. Akkaya

{"title":"Mitigating Selective Jamming Attacks in Smart Meter Data Collection using Moving Target Defense","authors":"Ramazan Algin, H. Tan, K. Akkaya","doi":"10.1145/3132114.3132127","DOIUrl":"https://doi.org/10.1145/3132114.3132127","url":null,"abstract":"In Advanced Metering Infrastructure (AMI) networks, power data collections from smart meters are static. Due to such static nature, attackers may predict the transmission behavior of the smart meters which can be used to launch selective jamming attacks that can block the transmissions. To avoid such attack scenarios and increase the resilience of the AMI networks, in this paper, we propose dynamic data reporting schedules for smart meters based on the idea of moving target defense (MTD) paradigm. The idea behind MTD-based schedules is to randomize the transmission times so that the attackers will not be able to guess these schedules. Specifically, we assign a time slot for each smart meter and in each round we shuffle the slots with Fisher-Yates shuffle algorithm that has been shown to provide secure randomness. We also take into account the periodicity of the data transmissions that may be needed by the utility company. With the proposed approach, a smart meter is guaranteed to send its data at a different time slot in each round. We implemented the proposed approach in ns-3 using IEEE 802.11s wireless mesh standard as the communication infrastructure. Simulation results showed that our protocol can secure the network from the selective jamming attacks without sacrificing performance by providing similar or even better performance for collection time, packet delivery ratio and end-to-end delay compared to previously proposed protocols.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"503 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115886738","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}

引用次数: 11

Mobile Matrix: A Multihop Address Allocation and Any-to-Any Routing in Mobile 6LoWPAN 移动矩阵:移动6LoWPAN中的多跳地址分配和任意到任意路由

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3132126

B. P. Santos, Olga Goussevskaia, L. Vieira, M. Vieira, A. Loureiro

{"title":"Mobile Matrix: A Multihop Address Allocation and Any-to-Any Routing in Mobile 6LoWPAN","authors":"B. P. Santos, Olga Goussevskaia, L. Vieira, M. Vieira, A. Loureiro","doi":"10.1145/3132114.3132126","DOIUrl":"https://doi.org/10.1145/3132114.3132126","url":null,"abstract":"In this work, we present Mobile Matrix, a routing protocol for 6LoWPAN that uses hierarchical IPv6 address allocation to perform any-to-any routing and mobility management without changing a node's IPv6 address. In this way, device mobility is transparent to the application level. The protocol has low memory footprint, adjustable control message overhead and achieves optimal routing path distortion. Moreover, it does not rely on any particular hardware for mobility detection, such as an accelerometer. Instead, it provides a passive mechanism to detect that a device has moved. We present analytic proofs for the computational complexity and efficiency of Mobile Matrix, as well as an evaluation of the protocol through simulations. Finally, we propose a new mobility model, to which we refer as cyclical random waypoint mobility model, that we use to simulate mobility scenarios, where communication is carried out in environments with limited mobility, such as 6LoWPANs deployed in office buildings, university campuses, concert halls or sports stadiums. Results show that μMatrix deliveries 3x times more packets than RPL for top-down traffic over high mobility scenario.","PeriodicalId":194043,"journal":{"name":"Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134302954","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}

引用次数: 2

Network Coding for 5G Network and D2D Communication 5G网络与D2D通信的网络编码

Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks Pub Date : 2017-11-21 DOI: 10.1145/3132114.3143696

L. Vieira, M. Vieira

引用次数: 7