Efficient quality of service‐aware packet chunking scheme for machine‐to‐machine cloud services

With the recent advances in machine-to-machine(M2M) communications, huge numbers of devices have become connected and massive amounts of traffic are exchanged. M2M applications typically generate small packets, which can profoundly affect the network performance. Namely, even if the packet arrival rate at the router is lower than the link bandwidth, bits per second(BPS), it can exceed the router forwarding capacity, which indicates the maximum number of forwarded packets per second(PPS). This will cause the decrease in the network throughput. Therefore, eliminating the PPS limitation by chunking small packets will enable M2M cloud services to spread further. This paper proposes new packet-chunking schemes aimed at meeting both application requirements and improving achievable router throughput. In our schemes, multiple buffers, each of which accommodates packets classified based on their delay requirement, are installed in parallel. Herein, we report on analysis of the theoretically performance of these schemes, which enabled us to derive some important features. We also propose a scheme whereby a single chunking buffer and parallel multiple buffers were arranged in tandem. Through our simulation and numerical results, we determined that these schemes provide excellent performance in reducing the number of outgoing packets from the router while meeting various delay requirements.The 2nd IEEE International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era (IEEE HPCA 2016),March 12, 2016, Barcelona, Spai

Advanced Technologies for Device-to-device Communications Underlaying Cellular Networks

The past few years have seen a major change in cellular networks, as explosive growth in data demands requires more and more network capacity and backhaul capability. New wireless technologies have been proposed to tackle these challenges. One of the emerging technologies is device-to-device (D2D) communications. It enables two cellular user equip- ment (UEs) in proximity to communicate with each other directly reusing cellular radio resources. In this case, D2D is able to of oad data traf c from central base stations (BSs) and signi cantly improve the spectrum ef ciency of a cellular network, and thus is one of the key technologies for the next generation cellular systems. Radio resource management (RRM) for D2D communications and how to effectively exploit the potential bene ts of D2D are two paramount challenges to D2D communications underlaying cellular networks. In this thesis, we focus on four problems related to these two challenges. In Chapter 2, we utilise the mixed integer non-linear programming (MINLP) to model and solve the RRM optimisation problems for D2D communications. Firstly we consider the RRM optimisation problem for D2D communications underlaying the single carrier frequency division multiple access (SC-FDMA) system and devise a heuristic sub- optimal solution to it. Then we propose an optimised RRM mechanism for multi-hop D2D communications with network coding (NC). NC has been proven as an ef cient technique to improve the throughput of ad-hoc networks and thus we apply it to multi-hop D2D communications. We devise an optimal solution to the RRM optimisation problem for multi-hop D2D communications with NC. In Chapter 3, we investigate how the location of the D2D transmitter in a cell may affect the RRM mechanism and the performance of D2D communications. We propose two optimised location-based RRM mechanisms for D2D, which maximise the throughput and the energy ef ciency of D2D, respectively. We show that, by considering the location information of the D2D transmitter, the MINLP problem of RRM for D2D communications can be transformed into a convex optimisation problem, which can be ef ciently solved by the method of Lagrangian multipliers. In Chapter 4, we propose a D2D-based P2P le sharing system, which is called Iunius. The Iunius system features: 1) a wireless P2P protocol based on Bittorrent protocol in the application layer; 2) a simple centralised routing mechanism for multi-hop D2D communications; 3) an interference cancellation technique for conventional cellular (CC) uplink communications; and 4) a radio resource management scheme to mitigate the interference between CC and D2D communications that share the cellular uplink radio resources while maximising the throughput of D2D communications. We show that with the properly designed application layer protocol and the optimised RRM for D2D communications, Iunius can signi cantly improve the quality of experience (QoE) of users and of oad local traf c from the base station. In Chapter 5, we combine LTE-unlicensed with D2D communications. We utilise LTE-unlicensed to enable the operation of D2D in unlicensed bands. We show that not only can this improve the throughput of D2D communications, but also allow D2D to work in the cell central area, which normally regarded as a “forbidden area” for D2D in existing works. We achieve these results mainly through numerical optimisation and simulations. We utilise a wide range of numerical optimisation theories in our works. Instead of utilising the general numerical optimisation algorithms to solve the optimisation problems, we modify them to be suitable for the speci c problems, thereby reducing the computational complexity. Finally, we evaluate our proposed algorithms and systems through sophisticated numer- ical simulations. We have developed a complete system-level simulation framework for D2D communications and we open-source it in Github: https://github.com/mathwuyue/py- wireless-sys-sim

Challenges in Cybersecurity and Privacy - the European Research Landscape

Cybersecurity and Privacy issues are becoming an important barrier for a trusted and dependable global digital society development. Cyber-criminals are continuously shifting their cyber-attacks specially against cyber-physical systems and IoT, since they present additional vulnerabilities due to their constrained capabilities, their unattended nature and the usage of potential untrustworthiness components. Likewise, identity-theft, fraud, personal data leakages, and other related cyber-crimes are continuously evolving, causing important damages and privacy problems for European citizens in both virtual and physical scenarios. In this context, new holistic approaches, methodologies, techniques and tools are needed to cope with those issues, and mitigate cyberattacks, by employing novel cyber-situational awareness frameworks, risk analysis and modeling, threat intelligent systems, cyber-threat information sharing methods, advanced big-data analysis techniques as well as exploiting the benefits from latest technologies such as SDN/NFV and Cloud systems. In addition, novel privacy-preserving techniques, and crypto-privacy mechanisms, identity and eID management systems, trust services, and recommendations are needed to protect citizens’ privacy while keeping usability levels. The European Commission is addressing the challenge through different means, including the Horizon 2020 Research and Innovation program, thereby financing innovative projects that can cope with the increasing cyberthreat landscape. This book introduces several cybersecurity and privacy research challenges and how they are being addressed in the scope of 15 European research projects. Each chapter is dedicated to a different funded European Research project, which aims to cope with digital security and privacy aspects, risks, threats and cybersecurity issues from a different perspective. Each chapter includes the project’s overviews and objectives, the particular challenges they are covering, research achievements on security and privacy, as well as the techniques, outcomes, and evaluations accomplished in the scope of the EU project. The book is the result of a collaborative effort among relative ongoing European Research projects in the field of privacy and security as well as related cybersecurity fields, and it is intended to explain how these projects meet the main cybersecurity and privacy challenges faced in Europe. Namely, the EU projects analyzed in the book are: ANASTACIA, SAINT, YAKSHA, FORTIKA, CYBECO, SISSDEN, CIPSEC, CS-AWARE. RED-Alert, Truessec.eu. ARIES, LIGHTest, CREDENTIAL, FutureTrust, LEPS. Challenges in Cybersecurity and Privacy - the European Research Landscape is ideal for personnel in computer/communication industries as well as academic staff and master/research students in computer science and communications networks interested in learning about cyber-security and privacy aspects

Challenges in Cybersecurity and Privacy - the European Research Landscape

Cybersecurity and Privacy issues are becoming an important barrier for a trusted and dependable global digital society development. Cyber-criminals are continuously shifting their cyber-attacks specially against cyber-physical systems and IoT, since they present additional vulnerabilities due to their constrained capabilities, their unattended nature and the usage of potential untrustworthiness components. Likewise, identity-theft, fraud, personal data leakages, and other related cyber-crimes are continuously evolving, causing important damages and privacy problems for European citizens in both virtual and physical scenarios. In this context, new holistic approaches, methodologies, techniques and tools are needed to cope with those issues, and mitigate cyberattacks, by employing novel cyber-situational awareness frameworks, risk analysis and modeling, threat intelligent systems, cyber-threat information sharing methods, advanced big-data analysis techniques as well as exploiting the benefits from latest technologies such as SDN/NFV and Cloud systems. In addition, novel privacy-preserving techniques, and crypto-privacy mechanisms, identity and eID management systems, trust services, and recommendations are needed to protect citizens’ privacy while keeping usability levels. The European Commission is addressing the challenge through different means, including the Horizon 2020 Research and Innovation program, thereby financing innovative projects that can cope with the increasing cyberthreat landscape. This book introduces several cybersecurity and privacy research challenges and how they are being addressed in the scope of 15 European research projects. Each chapter is dedicated to a different funded European Research project, which aims to cope with digital security and privacy aspects, risks, threats and cybersecurity issues from a different perspective. Each chapter includes the project’s overviews and objectives, the particular challenges they are covering, research achievements on security and privacy, as well as the techniques, outcomes, and evaluations accomplished in the scope of the EU project. The book is the result of a collaborative effort among relative ongoing European Research projects in the field of privacy and security as well as related cybersecurity fields, and it is intended to explain how these projects meet the main cybersecurity and privacy challenges faced in Europe. Namely, the EU projects analyzed in the book are: ANASTACIA, SAINT, YAKSHA, FORTIKA, CYBECO, SISSDEN, CIPSEC, CS-AWARE. RED-Alert, Truessec.eu. ARIES, LIGHTest, CREDENTIAL, FutureTrust, LEPS. Challenges in Cybersecurity and Privacy - the European Research Landscape is ideal for personnel in computer/communication industries as well as academic staff and master/research students in computer science and communications networks interested in learning about cyber-security and privacy aspects

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

CACIC 2015 : XXI Congreso Argentino de Ciencias de la Computación. Libro de actas

Actas del XXI Congreso Argentino de Ciencias de la Computación (CACIC 2015), realizado en Sede UNNOBA Junín, del 5 al 9 de octubre de 2015.Red de Universidades con Carreras en Informática (RedUNCI