Using Triggers for Emulation of Opportunistic Networking

Opportunistic networks do not require the availability of an end-to-end path, but may instead take advantage of tem- porary connectivity opportunities. Opportunistic networks pose a challenge for network emulation as the traditional em- ulation setup where application/transport endpoints send/ receive packets from the network following a black box approach is no longer applicable. Instead opportunistic networking protocols and applications need to react to the dynamics of the underlying network beyond what is conveyed through the exchange of packets. In order to support emulation evaluations for such challenging applications we in this paper introduce the concept of emulation triggers that can emulate arbitrary cross-layer feedback and that are synchronized with the emulated scenario. The design and implementation of triggers in the KauNet emulator are described. The use of triggers in the context of opportunistic networking is brie y sketched

Emulating opportunistic networks with KauNet Triggers

In opportunistic networks the availability of an end-to-end path is no longer required. Instead opportunistic networks may take advantage of temporary connectivity opportunities. Opportunistic networks present a demanding environment for network emulation as the traditional emulation setup, where application/transport endpoints only send and receive packets from the network following a black box approach, is no longer applicable. Opportunistic networking protocols and applications additionally need to react to the dynamics of the underlying network beyond what is conveyed through the exchange of packets. In order to support IP-level emulation evaluations of applications and protocols that react to lower layer events, we have proposed the use of emulation triggers. Emulation triggers can emulate arbitrary cross-layer feedback and can be synchronized with other emulation effects. After introducing the design and implementation of triggers in the KauNet emulator, we describe the integration of triggers with the DTN2 reference implementation and illustrate how the functionality can be used to emulate a classical DTN data-mule scenario

Distributed Hybrid Simulation of the Internet of Things and Smart Territories

This paper deals with the use of hybrid simulation to build and compose heterogeneous simulation scenarios that can be proficiently exploited to model and represent the Internet of Things (IoT). Hybrid simulation is a methodology that combines multiple modalities of modeling/simulation. Complex scenarios are decomposed into simpler ones, each one being simulated through a specific simulation strategy. All these simulation building blocks are then synchronized and coordinated. This simulation methodology is an ideal one to represent IoT setups, which are usually very demanding, due to the heterogeneity of possible scenarios arising from the massive deployment of an enormous amount of sensors and devices. We present a use case concerned with the distributed simulation of smart territories, a novel view of decentralized geographical spaces that, thanks to the use of IoT, builds ICT services to manage resources in a way that is sustainable and not harmful to the environment. Three different simulation models are combined together, namely, an adaptive agent-based parallel and distributed simulator, an OMNeT++ based discrete event simulator and a script-language simulator based on MATLAB. Results from a performance analysis confirm the viability of using hybrid simulation to model complex IoT scenarios.Comment: arXiv admin note: substantial text overlap with arXiv:1605.0487

Implementation of cognitive radio networks to evaluate spectrum management strategies in real-time

This paper illustrates a Universal Software Radio Peripheral (USRP)-based real-time testbed that is able to evaluate different spectrum management solutions that exploit the Cognitive Radio (CR) paradigm. The main objective of this testbed is to provide an accurate and realistic platform by which the performance of innovative spectrum management solutions for a wide set of scenarios and use cases in the context of Opportunistic Networks (ONs) and Cognitive Radio Networks (CRNs) can be entirely validated and assessed before their implementation in real systems. Real-time platforms are essential to carry out significant studies and to accurately assess the performance of innovative solutions before their implementation in the real world. This work provides a comprehensive description of the testbed, highlighting many interesting implementation details and illustrating its applicability for different studies that rely on the CR paradigm. Then, a particular application in a realistic Digital Home (DH) scenario is also illustrated, which allows demonstrating the effectiveness of the real-time testbed and assessing its practicality in terms of user-perceived end-to-end Quality of Experience (QoE) in a realistic environment.Peer ReviewedPostprint (author's final draft

Content Discovery in Mobile Networks Using thePublish and Subscribe Paradigm

Articolo presentato alla riunione annuale dell'Associazione Gruppo Telecomunicazioni e Tecnologie dell'Informazione (GTTI) 200

Keep Your Nice Friends Close, but Your Rich Friends Closer -- Computation Offloading Using NFC

The increasing complexity of smartphone applications and services necessitate high battery consumption but the growth of smartphones' battery capacity is not keeping pace with these increasing power demands. To overcome this problem, researchers gave birth to the Mobile Cloud Computing (MCC) research area. In this paper we advance on previous ideas, by proposing and implementing the first known Near Field Communication (NFC)-based computation offloading framework. This research is motivated by the advantages of NFC's short distance communication, with its better security, and its low battery consumption. We design a new NFC communication protocol that overcomes the limitations of the default protocol; removing the need for constant user interaction, the one-way communication restraint, and the limit on low data size transfer. We present experimental results of the energy consumption and the time duration of two computationally intensive representative applications: (i) RSA key generation and encryption, and (ii) gaming/puzzles. We show that when the helper device is more powerful than the device offloading the computations, the execution time of the tasks is reduced. Finally, we show that devices that offload application parts considerably reduce their energy consumption due to the low-power NFC interface and the benefits of offloading.Comment: 9 pages, 4 tables, 13 figure

Information-centric communication in mobile and wireless networks

Information-centric networking (ICN) is a new communication paradigm that has been proposed to cope with drawbacks of host-based communication protocols, namely scalability and security. In this thesis, we base our work on Named Data Networking (NDN), which is a popular ICN architecture, and investigate NDN in the context of wireless and mobile ad hoc networks. In a first part, we focus on NDN efficiency (and potential improvements) in wireless environments by investigating NDN in wireless one-hop communication, i.e., without any routing protocols. A basic requirement to initiate informationcentric communication is the knowledge of existing and available content names. Therefore, we develop three opportunistic content discovery algorithms and evaluate them in diverse scenarios for different node densities and content distributions. After content names are known, requesters can retrieve content opportunistically from any neighbor node that provides the content. However, in case of short contact times to content sources, content retrieval may be disrupted. Therefore, we develop a requester application that keeps meta information of disrupted content retrievals and enables resume operations when a new content source has been found. Besides message efficiency, we also evaluate power consumption of information-centric broadcast and unicast communication. Based on our findings, we develop two mechanisms to increase efficiency of information-centric wireless one-hop communication. The first approach called Dynamic Unicast (DU) avoids broadcast communication whenever possible since broadcast transmissions result in more duplicate Data transmissions, lower data rates and higher energy consumption on mobile nodes, which are not interested in overheard Data, compared to unicast communication. Hence, DU uses broadcast communication only until a content source has been found and then retrieves content directly via unicast from the same source. The second approach called RC-NDN targets efficiency of wireless broadcast communication by reducing the number of duplicate Data transmissions. In particular, RC-NDN is a Data encoding scheme for content sources that increases diversity in wireless broadcast transmissions such that multiple concurrent requesters can profit from each others’ (overheard) message transmissions. If requesters and content sources are not in one-hop distance to each other, requests need to be forwarded via multi-hop routing. Therefore, in a second part of this thesis, we investigate information-centric wireless multi-hop communication. First, we consider multi-hop broadcast communication in the context of rather static community networks. We introduce the concept of preferred forwarders, which relay Interest messages slightly faster than non-preferred forwarders to reduce redundant duplicate message transmissions. While this approach works well in static networks, the performance may degrade in mobile networks if preferred forwarders may regularly move away. Thus, to enable routing in mobile ad hoc networks, we extend DU for multi-hop communication. Compared to one-hop communication, multi-hop DU requires efficient path update mechanisms (since multi-hop paths may expire quickly) and new forwarding strategies to maintain NDN benefits (request aggregation and caching) such that only a few messages need to be transmitted over the entire end-to-end path even in case of multiple concurrent requesters. To perform quick retransmission in case of collisions or other transmission errors, we implement and evaluate retransmission timers from related work and compare them to CCNTimer, which is a new algorithm that enables shorter content retrieval times in information-centric wireless multi-hop communication. Yet, in case of intermittent connectivity between requesters and content sources, multi-hop routing protocols may not work because they require continuous end-to-end paths. Therefore, we present agent-based content retrieval (ACR) for delay-tolerant networks. In ACR, requester nodes can delegate content retrieval to mobile agent nodes, which move closer to content sources, can retrieve content and return it to requesters. Thus, ACR exploits the mobility of agent nodes to retrieve content from remote locations. To enable delay-tolerant communication via agents, retrieved content needs to be stored persistently such that requesters can verify its authenticity via original publisher signatures. To achieve this, we develop a persistent caching concept that maintains received popular content in repositories and deletes unpopular content if free space is required. Since our persistent caching concept can complement regular short-term caching in the content store, it can also be used for network caching to store popular delay-tolerant content at edge routers (to reduce network traffic and improve network performance) while real-time traffic can still be maintained and served from the content store

이기종 IoT 기기간 협력을 통한 네트워크 성능 향상

학위논문(박사) -- 서울대학교대학원 : 공과대학 전기·정보공학부, 2022. 8. 박세웅.The Internet of Things (IoT) has become a daily life by pioneering applications in various fields. In this dissertation, we consider increasing transmission data rate with energy efficiency, extending transmission coverage with low power, and improving reliability in congested frequency bands as three challenges to expanding IoT applications. We address two issues to overcome these challenges. First, we design a layered network system with a new structure that combines Bluetooth Low Energy (BLE) and Wi-Fi networks in a multi-hop network. Based on the system, we propose methods to increase data rate with energy efficiency and extend transmission coverage in a low-power situation. We implement the proposed system in the Linux kernel and evaluate the performance through an indoor testbed. As a result, we confirmed that the proposed system supports high data traffic and reduces average power consumption in the testbed compared to the existing single BLE/Wi-Fi ad-hoc network in a multi-hop situation. Second, we tackle the adaptive frequency hopping (AFH) problem of BLE through cross-technology communication (CTC) and channel weighting. We design the AFH scheme that weights the channels used by BLE devices with improving reliability in the congested bands of both Wi-Fi and BLE devices. We evaluate the proposed scheme through prototype experiments and simulations, confirming that the proposed scheme increases the packet reception rate of BLE in the congested ISM band compared to the existing AFH algorithm.사물인터넷은 현재 다양한 영역에서 application을 개척하여 생활화되어 왔다. 이 학위 논문에서는 사물인터넷의 응용 사례 확장을 위해 에너지 효율적인 전송 속도 향상, 저전력 상황에서의 전송 범위 확장, 혼잡한 대역에서의 신뢰성 향상을 새로운 도전 과제로 삼고, 이러한 도전 과제를 극복할 두 가지 주제를 다룬다. 첫째, 다중 홉 네트워크 상황에서의 블루투스 저전력과 Wi-Fi 네트워크를 결합 한 새로운 구조의 계층적 네트워크 시스템을 설계하고 이에 기반한 에너지 효율적인 전송 속도 향상 및 저전력 상황에서의 전송 범위확장을 제안한다. 제안된 시스템은 Linux 커널에 구현하여 실내 테스트베드를 통해 성능을 평가한다. 결과적으로 제안 한 기법이 다중 홉 상황에서 기존 블루투스 저전력/Wi-Fi 단일 ad-hoc 네트워크와 비교하여 높은 데이터 트래픽을 지원하며, 테스트베드에서의 평균 전력 소비를 줄 이는 것을 확인한다. 둘째, Cross-technology Communication (CTC)과 채널 가중치를 통한 블루투스 저전력의 Adaptive Frequency Hopping (AFH) 문제를 해결한다. 최종적으로 블루투스 저전력 기기가 사용하는 채널에 가중치를 두는 AFH 기법을 설계하여 Wi-Fi 와 블루투스 저전력 기기가 모두 혼잡한 대역에서의 신뢰성을 향상한다. 프로토타입 실험과 시뮬레이션을 통해 제안한 기법이 기존의 AFH 기법과 비교하여 혼잡한 ISM 대역에서 블루투스 저전력의 패킷 수신율을 증가시키는 것을 확인한다.1 Introduction 1 1.1 Motivation 1 1.2 Contributions and Outline 2 2 Wi-BLE: On Cooperative Operation of Wi-Fi and Bluetooth Low Energy under IPv6 4 2.1 Introduction 4 2.2 Related Work 7 2.2.1 Multihop Connectivity for Wi-Fi or BLE 7 2.2.2 Multi-radio Operation 11 2.3 System Overview 13 2.3.1 Control Plane 13 2.3.2 Data Plane 16 2.3.3 Overall Procedure 16 2.4 MABLE: AODV Routing over BLE 17 2.4.1 BLE Channel Utilization 17 2.4.2 Joint Establishment of Route and Connection 20 2.4.3 Link Quality Metric for BLE Data Channels 22 2.4.4 Bi-directional Route Error Propagation 25 2.5 Wi-BLE: Wi-Fi Ad-hoc over BLE 27 2.5.1 Radio Selection 27 2.5.2 Routing and Radio Wake-up for Wi-Fi 30 2.6 Evaluation 32 2.6.1 BLE Routing 33 2.6.2 Wi-Fi Routing over BLE 35 2.6.3 Radio Selection 38 2.7 Summary 40 3 WBC-AFH: Direct Wi-Fi to BLE Communication based AFH 41 3.1 Introduction 41 3.2 Background 45 3.2.1 Frequency hopping in BLE 45 3.2.2 Cross Technology Communication 47 3.3 Proposed AFH 49 3.3.1 CTC based informing 50 3.3.2 Weighted channel select 51 3.3.3 Hopping set size optimization 52 3.3.4 WBC-AFH 54 3.4 Evaluation 57 3.4.1 Setup 57 3.4.2 Robustness 60 3.4.3 Reliability 61 3.5 Future Work 65 3.6 Summary 66 4 Conclusion 67박

HINT - from opportunistic network characterization to application development

Delay Tolerant Networks are currently a promising alternative to infrastructure-based networks, but they have not seen a wide deployment so far. There are several ways to evaluate the performance of such networks: field trials, theoretical models, simulation, emulation or replaying contact datasets. Each one has its advantages and drawbacks in terms of material cost, realism, required time or ability to manage real nodes. However, none of them effectively addresses the needs of application developers. In this thesis, we will focus on emulation. In a first part, we will deal with possible inputs for such a system. We first propose an analytical model to predict the drop ratio in a network where nodes have a one-packet buffer. Then, taking inspiration from trace scaling approaches from the literature, we study the hypotheses and assumptions taken for real traces statistical analyses, showing their impact on the obtained probability distributions and observed network performance metrics. We then extend this study to the whole life cycle of real traces, by considering data collection, filtering and scaling. In a second part, we propose a possible architecture for a hybrid DTN emulator, using both real nodes as smartphones and virtual nodes. The main advantage here is to be able to evaluate real applications, including preexisting ones, in a DTN context, doing so as transparently as possible. We identify the limitations of existing approaches, which helps us build a list of specifications for our system. Then, we propose a system called HINT which matches these specifications. HINT is validated, and applied to the study of some examples