{"title":"A novel Paradigm for Access Control Trust in IoT Applications: A Distributed Cross-Communication Approach","authors":"Muath A. Obaidat, Joseph Brown, A. Hayajneh","doi":"10.23919/WMNC53478.2021.9618899","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9618899","url":null,"abstract":"How to best secure communications between IoT devices remains a challenging research area. However, the heterodox nature of individual IoT devices and its limited capabilities demand a more centralized, authority-derivative nature of SSL/TLS for the IoT ecosystem. While a number of experimental protocols have been proposed, many of these techniques are either derivative of SSL/TLS on some layer, or lack either enough ubiquity to be widely applied to a live ecosystem, or verifiable results. This paper proposes a distributed system for securing end-to-end cross-device communications; Access Control Trust A Distributed Cross-Communication scheme (ACT-DCC) using a localized web of self-determinate nodes in a network. As opposed to distributed systems, which typically rely on blockchain or centrally signed certificates, the proposed scheme instead operates on an iterative, decentralized method, which combines pathfinding techniques alongside an algorithmic interpretation of hash-chaining and ledger-based storage. An initial network device carries an original key, which is naturally spread to additional connected devices on the same network in a distributed, web-like fashion. As more devices join the distributed network, the strength of the network grows exponentially through the volume of edge devices available in the web. The proposed scheme shows significant improvement as compared to other cross-device communication schemes, and encourages better-individualized decentralization, and less locally stored data.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392535","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":"Managing Programmable Low-End Wireless Networks through Distributed SDN Controllers","authors":"André Scheibe, L. Gaspary, Weverton Cordeiro","doi":"10.23919/WMNC53478.2021.9618890","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9618890","url":null,"abstract":"Low Power Wide Area Network (LPWAN) have recently attracted attention as a potential alternative to power affordable internet access to remote communities and help bridge the digital divide. Nevertheless, realizing the full potential of LPWAN devices as an alternative to bring remote communities to the internet requires addressing two technical challenges. The first one is making LPWAN devices suitable for exchange of data flows running under standard protocols like TCP/IP. The second one is devising a fully distributed management approach tailored for a network composed of autonomous LPWAN devices that are reachable only through unstable and unreliable wireless links. We addressed the first challenge in a prior work, with a conceptual solution for programmable low-end devices, i.e., LPWAN devices whose behavior can be redefined using programming languages for the data plane like P4. In this paper, we address the second challenge by presenting an algorithmic approach for SDN-based distributed management for programmable low-end networks. In summary, we consider that each programmable low-end device in a community network is autonomous and has its independent SDN controller. For coordinated management, they use control messages transmitted over unreliable and constrained links (up to 300 kbps), hence the need for a lightweight and fault-tolerant management approach. We experiment our SDN-based distributed approach with LTP (Lightweight Tunnel Protocol), a proof-of-concept protocol written in P4 for powering programmable low-end networks. We provide evidence, through a series of experiments, that our algorithmic approach for fully distributed SDN-based management is capable of maintaining stable network connectivity despite running over unstable and unreliable links.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115959604","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":"Offloading computing tasks beyond the edge: A data-driven analysis","authors":"S. Khizar, M. Amorim, V. Conan","doi":"10.23919/WMNC53478.2021.9619152","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9619152","url":null,"abstract":"Mobile devices have always been left out of the network infrastructure due to their limited capacities. However, it turns out that they are becoming more and more sophisticated and, above all, increasingly numerous. Given their ubiquity, they offer untapped resources to extend the computing capacity of the MEC (multi-access edge computing). Nevertheless, such resources vary over time due to the dynamics of the network. In this paper, we investigate how the mobility of nodes impacts the task offloading process. To this end, we use traces of actual user equipment (UE) mobility from a cellular operator. We also quantify the impact of task duration and completion delay. Our results show that mobile nodes' offloading potential beyond the edge is significant, even for short delays.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130615406","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":"Subneting Software Defined Wireless Sensor Networks to Support Mobility","authors":"Ahmed Nader al-Dulaimy, Hannes Frey","doi":"10.23919/WMNC53478.2021.9619110","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9619110","url":null,"abstract":"Mobility in wireless sensor networks plays a significant role in many applications, especially for the internet of things (IoT) and industrial production workflow. However, managing the mobility of nodes in such networks is often problematic mainly because of the dynamics of industrial environments combined with the limitation of the node's resources. Since software-defined networking is a powerful technique to support today's networks' manageability and scalability, both wireless sensor networks and software-defined networks combined are gaining significant interest in research and industry. In this paper, we introduce an approach to handle the mobility and disconnectivity of the sensor nodes in a software-defined network. This approach takes advantage of splitting the network into sub-networks by its address based on subnetting wireless sensor networks (Sub-WSN) and keeping the network topology up to date in the controller by exchanging periodical hello messages. We treat all the nodes in the network as mini controllers and implement an application into the controllers to hand over nodes between the subnets. We evaluated the proposed approach by using Cooja simulator in Contiki. The simulation result yields substantial low control messages, handover time, and latency in handling dynamic networks against a state of the art approach.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129371490","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}
John Kanwar, N. Finne, N. Tsiftes, J. Eriksson, T. Voigt, Zhitao He, C. Åhlund, S. Saguna
{"title":"JamSense: Interference and Jamming Classification for Low-power Wireless Networks","authors":"John Kanwar, N. Finne, N. Tsiftes, J. Eriksson, T. Voigt, Zhitao He, C. Åhlund, S. Saguna","doi":"10.23919/WMNC53478.2021.9619007","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9619007","url":null,"abstract":"Low-power wireless networks transmit at low output power and are hence susceptible to cross-technology interference. The latter may cause packet loss which may waste scarce energy resources by requiring the retransmission of packets. Jamming attacks are even more harmful than cross-technology interference in that they may totally prevent packet reception and hence disturb or even disrupt applications. Therefore, it is important to recognize such jamming attacks. In this paper, we present JamSense. JamSense extends SpeckSense, a system that is able to detect multiple sources of interference, with the ability to classify jamming attacks. As SpeckSense, JamSense runs on resource-constrained nodes. Our experimental evaluation on real hardware shows that JamSense is able to identify jamming attacks with high accuracy while not classifying Bluetooth or WiFi interference as jamming attacks.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124767622","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}
Frank Loh, Dominique Bau, Johannes Zink, A. Wolff, T. Hossfeld
{"title":"Robust Gateway Placement for Scalable LoRaWAN","authors":"Frank Loh, Dominique Bau, Johannes Zink, A. Wolff, T. Hossfeld","doi":"10.23919/WMNC53478.2021.9618988","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9618988","url":null,"abstract":"Many exciting applications are currently emerging due to the use of technology from the Internet of Things (IoT) in Smart Cities. In recent years, Long Range Wide Area Networks (LoRaWANs) have become one of the main technologies in this field due to long distance coverage, low power consumption sensors, and economic reasons. So far, LoRaWANs have been planned and deployed mainly with the aim of minimizing the number of gateways, while still providing coverage in a geographic area. Packet collisions and future traffic have not been considered. In contrast, we present a gateway placement strategy that is robust against an increase in the number of sensors and in the network load. To this end, we modify an existing local search algorithm for a geometric set cover problem such that it takes the capacities of gateways into account. If we set these capacities below the maximum, the network can accommodate additional sensors in the future. Moreover, our algorithm can extend the initial placement once the capacities are exhausted.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129795228","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":"Efficient Data Collection using Aerial Mobile Sinks for Delay Tolerant Wireless Sensor Networks","authors":"Djibrilla Incha Adamou, V. Vèque, Alexandre Mouradian, Sahar Hoteit, Lynda Zitoune","doi":"10.23919/WMNC53478.2021.9618998","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9618998","url":null,"abstract":"To overcome the lack of connectivity for collecting data in large white areas, we propose to provide long-range communication between aircraft and sensors on land. Our study is based on the use of commercial flights, with aircraft acting as mobile sinks, to collect data as they fly over an area of interest where sub-sinks are disseminated. Using relay nodes, the data can be collected even if the sensors are not located in the aircraft corridors. We investigate the feasibility of such a scheme by efficiently placing relay nodes to connect sources to sub-sinks which are covered by aerial corridors. The sources reach sub-sinks using a shortest path routing algorithm that reduces delays and balances the load among the sub-sinks. Simulation results and comparisons with well-known algorithms show the effectiveness of our algorithms which improve load-balancing by considering the throughput, the buffer capacity and the sub-sinks position.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857697","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":"Welcome message from the chairs","authors":"","doi":"10.23919/wmnc53478.2021.9619087","DOIUrl":"https://doi.org/10.23919/wmnc53478.2021.9619087","url":null,"abstract":"","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130524912","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":"Key-Activation Multiple Access (KAMA)","authors":"Dylan Cirimelli-Low, J. Garcia-Luna-Aceves","doi":"10.23919/WMNC53478.2021.9619064","DOIUrl":"https://doi.org/10.23919/WMNC53478.2021.9619064","url":null,"abstract":"KAMA is introduced and analyzed. KAMA organizes the channel into a sequence of equal time slots and uses a distributed election algorithm to determine which of the known nodes have the priority to transmit during each time slot. KAMA eliminates the need for special signaling packets or the use of special time slots dedicated for signaling packets by means of transmission keys. A node that is unknown to its neighbors can compete for transmission to become known in a subset of time slots in each frame. This subset is defined by a transmission key that maps its identifier to a pattern of on and off time slots in each frame. The performance of KAMA is analyzed analytically and by simulation. KAMA is shown to be more efficient than NAMA, TDMA, CSMA, and CSMA/CA.","PeriodicalId":219167,"journal":{"name":"2021 13th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121703112","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}