Swarm intelligence via the internet of things and the phenomenological turn

Considering the current advancements in biometric sensors and other related technologies, as well as the use of bio-inspired models for AI improvements, we can infer that the swarm intelligence paradigm can be implemented in human daily spheres through the connectivity between user gadgets connected to the Internet of Things. This is a first step towards a real Ambient Intelligence, but also of a Global Intelligence. This unconscious (by the user) connectivity may alter the way by which we feel the world. Besides, with the arrival of new augmented ways of capturing and providing information or radical new ways of expanding our bodies (through synthetic biology or artificial prosthesis like brain-computer connections), we can be very close to a change which may radically affect our experience of ourselves and of the feeling of collectivity. We call it the techno-phenomenological turn. We show social implications, present challenges, and and open questions for the new kind of swarm intelligence-enhanced society, and provide the taxonomy of the field of study. We will also explore the possible roadmaps of this next possible situation

Empirical Study and Modeling of Vehicular Communications at Intersections in the 5 GHz Band

[EN] Event warnings are critical in the context of ITS, being dependent on reliable and low-delay delivery ofmessages to nearby vehicles. One of the main challenges to address in this context is intersection management. Since buildings will severely hinder signals in the 5GHz band, it becomes necessary to transmit at the exact moment a vehicle is at the center of an intersection to maximize delivery chances. However, GPS inaccuracy, among other problems, complicates the achievement of this goal. In this paper we study this problem by first analyzing different intersection types, studying the vehicular communications performance in each type of intersection through real scenario experiments. Obtained results show that intersection-related communications depend on the distances to the intersection and line-of-sight (LOS) conditions. Also, depending on the physical characteristics of intersections, the presented blockages introduce different degrees of hampering to message delivery. Based on the modeling of the different intersection types, we then study the expected success ratio when notifying events at intersections. In general, we find that effective propagation of messages at intersections is possible, even in urban canyons and despite GPS errors, as long as rooftop antennas are used to compensate for poor communication conditions.This work was partially supported by the “Ministerio de Economía y Competividad, Programa Estatal de Investigación, Desarollo e Innovación Orientada a los Retos de la Sociedad, Proyectos I+D+I 2014,” Spain, under Grants TEC2014-52690-R and BES-2015-075988.Hadiwardoyo, SA.; Tomás Domínguez, AE.; Hernández-Orallo, E.; Tavares De Araujo Cesariny Calafate, CM.; Cano, J.; Manzoni, P. (2017). Empirical Study and Modeling of Vehicular Communications at Intersections in the 5 GHz Band. Mobile Information Systems. (2861827):1-15. https://doi.org/10.1155/2017/2861827S1152861827Xiong, Z., Sheng, H., Rong, W., & Cooper, D. E. (2012). Intelligent transportation systems for smart cities: a progress review. Science China Information Sciences, 55(12), 2908-2914. doi:10.1007/s11432-012-4725-1Papadimitratos, P., La Fortelle, A., Evenssen, K., Brignolo, R., & Cosenza, S. (2009). Vehicular communication systems: Enabling technologies, applications, and future outlook on intelligent transportation. IEEE Communications Magazine, 47(11), 84-95. doi:10.1109/mcom.2009.5307471Grant-Muller, S., & Usher, M. (2014). Intelligent Transport Systems: The propensity for environmental and economic benefits. Technological Forecasting and Social Change, 82, 149-166. doi:10.1016/j.techfore.2013.06.010Ma, X., Chen, X., & Refai, H. H. (2009). Performance and Reliability of DSRC Vehicular Safety Communication: A Formal Analysis. EURASIP Journal on Wireless Communications and Networking, 2009(1). doi:10.1155/2009/969164Martinez, F. J., Toh, C.-K., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2010). A Street Broadcast Reduction Scheme (SBR) to Mitigate the Broadcast Storm Problem in VANETs. Wireless Personal Communications, 56(3), 559-572. doi:10.1007/s11277-010-9989-4Sanguesa, J. A., Fogue, M., Garrido, P., Martinez, F. J., Cano, J.-C., & Calafate, C. T. (2016). A Survey and Comparative Study of Broadcast Warning Message Dissemination Schemes for VANETs. Mobile Information Systems, 2016, 1-18. doi:10.1155/2016/8714142Sommer, C., Joerer, S., Segata, M., Tonguz, O. K., Cigno, R. L., & Dressler, F. (2015). How Shadowing Hurts Vehicular Communications and How Dynamic Beaconing Can Help. IEEE Transactions on Mobile Computing, 14(7), 1411-1421. doi:10.1109/tmc.2014.2362752Lin, J.-C., Lin, C.-S., Liang, C.-N., & Chen, B.-C. (2012). Wireless communication performance based on IEEE 802.11p R2V field trials. IEEE Communications Magazine, 50(5), 184-191. doi:10.1109/mcom.2012.6194401Gozalvez, J., Sepulcre, M., & Bauza, R. (2012). IEEE 802.11p vehicle to infrastructure communications in urban environments. IEEE Communications Magazine, 50(5), 176-183. doi:10.1109/mcom.2012.6194400Tornell, S. M., Patra, S., Calafate, C. T., Cano, J.-C., & Manzoni, P. (2015). GRCBox: Extending Smartphone Connectivity in Vehicular Networks. International Journal of Distributed Sensor Networks, 11(3), 478064. doi:10.1155/2015/478064Chou, L.-D., Yang, J.-Y., Hsieh, Y.-C., Chang, D.-C., & Tung, C.-F. (2011). Intersection-Based Routing Protocol for VANETs. Wireless Personal Communications, 60(1), 105-124. doi:10.1007/s11277-011-0257-zSaleet, H., Langar, R., Naik, K., Boutaba, R., Nayak, A., & Goel, N. (2011). Intersection-Based Geographical Routing Protocol for VANETs: A Proposal and Analysis. IEEE Transactions on Vehicular Technology, 60(9), 4560-4574. doi:10.1109/tvt.2011.2173510Guan, X., Huang, Y., Cai, Z., & Ohtsuki, T. (2015). Intersection-based forwarding protocol for vehicular ad hoc networks. Telecommunication Systems, 62(1), 67-76. doi:10.1007/s11235-015-9983-yKarney, C. F. F. (2011). Transverse Mercator with an accuracy of a few nanometers. Journal of Geodesy, 85(8), 475-485. doi:10.1007/s00190-011-0445-3Durgin, G., Rappaport, T. S., & Hao Xu. (1998). Measurements and models for radio path loss and penetration loss in and around homes and trees at 5.85 GHz. IEEE Transactions on Communications, 46(11), 1484-1496. doi:10.1109/26.729393Haklay, M., & Weber, P. (2008). OpenStreetMap: User-Generated Street Maps. IEEE Pervasive Computing, 7(4), 12-18. doi:10.1109/mprv.2008.8

Address Space Layout Randomization Next Generation

[EN] Systems that are built using low-power computationally-weak devices, which force developers to favor performance over security; which jointly with its high connectivity, continuous and autonomous operation makes those devices specially appealing to attackers. ASLR (Address Space Layout Randomization) is one of the most effective mitigation techniques against remote code execution attacks, but when it is implemented in a practical system its effectiveness is jeopardized by multiple constraints: the size of the virtual memory space, the potential fragmentation problems, compatibility limitations, etc. As a result, most ASLR implementations (specially in 32-bits) fail to provide the necessary protection. In this paper we propose a taxonomy of all ASLR elements, which categorizes the entropy in three dimensions: (1) how, (2) when and (3) what; and includes novel forms of entropy. Based on this taxonomy we have created, ASLRA, an advanced statistical analysis tool to assess the effectiveness of any ASLR implementation. Our analysis show that all ASLR implementations suffer from several weaknesses, 32-bit systems provide a poor ASLR, and OS X has a broken ASLR in both 32- and 64-bit systems. This is jeopardizing not only servers and end users devices as smartphones but also the whole IoT ecosystem. To overcome all these issues, we present ASLR-NG, a novel ASLR that provides the maximum possible absolute entropy and removes all correlation attacks making ASLR-NG the best solution for both 32- and 64-bit systems. We implemented ASLR-NG in the Linux kernel 4.15. The comparative evaluation shows that ASLR-NG overcomes PaX, Linux and OS X implementations, providing strong protection to prevent attackers from abusing weak ASLRs.Marco-Gisbert, H.; Ripoll-Ripoll, I. (2019). Address Space Layout Randomization Next Generation. Applied Sciences. 9(14):1-25. https://doi.org/10.3390/app9142928S125914Aga, M. T., & Austin, T. (2019). Smokestack: Thwarting DOP Attacks with Runtime Stack Layout Randomization. 2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). doi:10.1109/cgo.2019.8661202Object Size Checking to Prevent (Some) Buffer Overflows (GCC FORTIFY) http://gcc.gnu.org/ml/gcc-patches/2004-09/msg02055.htmlShahriar, H., & Zulkernine, M. (2012). Mitigating program security vulnerabilities. ACM Computing Surveys, 44(3), 1-46. doi:10.1145/2187671.2187673Carlier, M., Steenhaut, K., & Braeken, A. (2019). Symmetric-Key-Based Security for Multicast Communication in Wireless Sensor Networks. Computers, 8(1), 27. doi:10.3390/computers8010027Choudhary, J., Balasubramanian, P., Varghese, D., Singh, D., & Maskell, D. (2019). Generalized Majority Voter Design Method for N-Modular Redundant Systems Used in Mission- and Safety-Critical Applications. Computers, 8(1), 10. doi:10.3390/computers8010010Shacham, H., Page, M., Pfaff, B., Goh, E.-J., Modadugu, N., & Boneh, D. (2004). On the effectiveness of address-space randomization. Proceedings of the 11th ACM conference on Computer and communications security - CCS ’04. doi:10.1145/1030083.1030124Marco-Gisbert, H., & Ripoll, I. (2013). Preventing Brute Force Attacks Against Stack Canary Protection on Networking Servers. 2013 IEEE 12th International Symposium on Network Computing and Applications. doi:10.1109/nca.2013.12Friginal, J., de Andres, D., Ruiz, J.-C., & Gil, P. (2010). Attack Injection to Support the Evaluation of Ad Hoc Networks. 2010 29th IEEE Symposium on Reliable Distributed Systems. doi:10.1109/srds.2010.11Jun Xu, Kalbarczyk, Z., & Iyer, R. K. (s. f.). Transparent runtime randomization for security. 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings. doi:10.1109/reldis.2003.1238076Zhan, X., Zheng, T., & Gao, S. (2014). Defending ROP Attacks Using Basic Block Level Randomization. 2014 IEEE Eighth International Conference on Software Security and Reliability-Companion. doi:10.1109/sere-c.2014.28Iyer, V., Kanitkar, A., Dasgupta, P., & Srinivasan, R. (2010). Preventing Overflow Attacks by Memory Randomization. 2010 IEEE 21st International Symposium on Software Reliability Engineering. doi:10.1109/issre.2010.22Van der Veen, V., dutt-Sharma, N., Cavallaro, L., & Bos, H. (2012). Memory Errors: The Past, the Present, and the Future. Lecture Notes in Computer Science, 86-106. doi:10.1007/978-3-642-33338-5_5PaX Address Space Layout Randomization (ASLR) http://pax.grsecurity.net/docs/aslr.txtKernel Address Space Layout Randomization https://lwn.net/Articles/569635Rahman, M. A., & Asyhari, A. T. (2019). The Emergence of Internet of Things (IoT): Connecting Anything, Anywhere. Computers, 8(2), 40. doi:10.3390/computers8020040Bojinov, H., Boneh, D., Cannings, R., & Malchev, I. (2011). Address space randomization for mobile devices. Proceedings of the fourth ACM conference on Wireless network security - WiSec ’11. doi:10.1145/1998412.1998434Hiser, J., Nguyen-Tuong, A., Co, M., Hall, M., & Davidson, J. W. (2012). ILR: Where’d My Gadgets Go? 2012 IEEE Symposium on Security and Privacy. doi:10.1109/sp.2012.39Xu, H., & Chapin, S. J. (2009). Address-space layout randomization using code islands. Journal of Computer Security, 17(3), 331-362. doi:10.3233/jcs-2009-0322Wartell, R., Mohan, V., Hamlen, K. W., & Lin, Z. (2012). Binary stirring. Proceedings of the 2012 ACM conference on Computer and communications security - CCS ’12. doi:10.1145/2382196.2382216Growable Maps Removal https://lwn.net/Articles/294001/Silent Stack-Heap Collision under GNU/Linux https://gcc.gnu.org/ml/gcc-help/2014-07/msg00076.htmlAMD Bulldozer Linux ASLR Weakness: Reducing Entropy by 87.5% http://hmarco.org/bugs/AMD-Bulldozer-linux-ASLR-weakness-reducing-mmaped-files-by-eight.htmlCVE-2015-1593—Linux ASLR Integer Overflow: Reducing Stack Entropy by Four http://hmarco.org/bugs/linux-ASLR-integer-overflow.htmlLinux ASLR Mmap Weakness: Reducing Entropy by Half http://hmarco.org/bugs/linux-ASLR-reducing-mmap-by-half.htmlLESNE, A. (2014). Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics. Mathematical Structures in Computer Science, 24(3). doi:10.1017/s0960129512000783Scraps of Notes on Remote Stack Overflow Exploitation http://www.phrack.org/issues.html?issue=67&id=13#articleUchenick, G. M., & Vanfleet, W. M. (2005). Multiple independent levels of safety and security: high assurance architecture for MSLS/MLS. MILCOM 2005 - 2005 IEEE Military Communications Conference. doi:10.1109/milcom.2005.1605749Lee, B., Lu, L., Wang, T., Kim, T., & Lee, W. (2014). From Zygote to Morula: Fortifying Weakened ASLR on Android. 2014 IEEE Symposium on Security and Privacy. doi:10.1109/sp.2014.34The Heartbleed Bug http://heartbleed.co

Strategies for improving the sustainability of data centers via energy mix, energy conservation, and circular energy

Information and communication technologies (ICT) are increasingly permeating our daily life and we ever more commit our data to the cloud. Events like the COVID-19 pandemic put an exceptional burden upon ICT. This involves increasing implementation and use of data centers, which increased energy use and environmental impact. The scope of this work is to summarize the present situation on data centers as to environmental impact and opportunities for improvement. First, we introduce the topic, presenting estimated energy use and emissions. Then, we review proposed strategies for energy efficiency and conservation in data centers. Energy uses pertain to power distribution, ICT, and non-ICT equipment (e.g., cooling). Existing and prospected strategies and initiatives in these sectors are identified. Among key elements are innovative cooling techniques, natural resources, automation, low-power electronics, and equipment with extended thermal limits. Research perspectives are identified and estimates of improvement opportunities are mentioned. Finally, we present an overview on existing metrics, regulatory framework, and bodies concerned

Explainable and Resource-Efficient Stream Processing Through Provenance and Scheduling

In our era of big data, information is captured at unprecedented volumes and velocities, with technologies such as Cyber-Physical Systems making quick decisions based on the processing of streaming, unbounded datasets. In such scenarios, it can be beneficial to process the data in an online manner, using the stream processing paradigm implemented by Stream Processing Engines (SPEs). While SPEs enable high-throughput, low-latency analysis, they are faced with challenges connected to evolving deployment scenarios, like the increasing use of heterogeneous, resource-constrained edge devices together with cloud resources and the increasing user expectations for usability, control, and resource-efficiency, on par with features provided by traditional databases.This thesis tackles open challenges regarding making stream processing more user-friendly, customizable, and resource-efficient. The first part outlines our work, providing high-level background information, descriptions of the research problems, and our contributions. The second part presents our three state-of-the-art frameworks for explainable data streaming using data provenance, which can help users of streaming queries to identify important data points, explain unexpected behaviors, and aid query understanding and debugging. (A) GeneaLog provides backward provenance allowing users to identify the inputs that contributed to the generation of each output of a streaming query. (B) Ananke is the first framework to provide a duplicate-free graph of live forward provenance, enabling easy bidirectional tracing of input-output relationships in streaming queries and identifying data points that have finished contributing to results. (C) Erebus is the first framework that allows users to define expectations about the results of a streaming query, validating whether these expectations are met or providing explanations in the form of why-not provenance otherwise. The third part presents techniques for execution efficiency through custom scheduling, introducing our state-of-the-art scheduling frameworks that control resource allocation and achieve user-defined performance goals. (D) Haren is an SPE-agnostic user-level scheduler that can efficiently enforce user-defined scheduling policies. (E) Lachesis is a standalone scheduling middleware that requires no changes to SPEs but, instead, directly guides the scheduling decisions of the underlying Operating System. Our extensive evaluations using real-world SPEs and workloads show that our work significantly improves over the state-of-the-art while introducing only small performance overheads

Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming

Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. In this context, the challenges are to show thatthe algorithm is correct, regardless of computational, or communication delaysand to show bounds on the usage of communication.We are especially interested the behaviour after transient faults and underthe existence of Byzantine nodes.This thesis discusses fundamental communication models for distributed algorithms. These models are implementing abstract communication methods. First, we address medium access control for a wireless medium with guaranteeson the communication delay. We discuss time division multiple access(TDMA) protocols for ad-hoc networks and we introduce an algorithm that creates aTDMA schedule without using external references for localisation, or time. We justify our algorithm by experimental results.The second topic is the emulation of shared memory on message passingnetworks. Both, shared memory and message passing are basic interprocessorcommunication models for distributed algorithms. We are providing a way ofemulating shared memory on top of an existing message passing network underthe presence of data corruption and stop-failed nodes. Additionally, we ensurethe privacy of the data that is stored in the shared memory. The third topic looks into streaming algorithms and optimisation. We study the problem of sorting a stream ofvehicles on a highway with severallanes so that each vehicle reaches its target lane. We look into optimality interms of minimising the number of move operations, as well as, minimising the length of the output stream. We present an exact algorithm for the case oftwo lanes and show that NP-Hardness for a increasing number of lanes