Proceedings of the Second International Mobile Satellite Conference (IMSC 1990)

Presented here are the proceedings of the Second International Mobile Satellite Conference (IMSC), held June 17-20, 1990 in Ottawa, Canada. Topics covered include future mobile satellite communications concepts, aeronautical applications, modulation and coding, propagation and experimental systems, mobile terminal equipment, network architecture and control, regulatory and policy considerations, vehicle antennas, and speech compression

Aeronautical Engineering: A continuing bibliography, supplement 124

This bibliography, lists 450 reports, articles, and other documents introduced into the NASA scientific and technical information system in June 1980

Swarm intelligence techniques for optimization and management tasks insensor networks

The main contributions of this thesis are located in the domain of wireless sensor netorks. More in detail, we introduce energyaware algorithms and protocols in the context of the following topics: self-synchronized duty-cycling in networks with energy harvesting capabilities, distributed graph coloring and minimum energy broadcasting with realistic antennas. In the following, we review the research conducted in each case. We propose a self-synchronized duty-cycling mechanism for sensor networks. This mechanism is based on the working and resting phases of natural ant colonies, which show self-synchronized activity phases. The main goal of duty-cycling methods is to save energy by efficiently alternating between different states. In the case at hand, we considered two different states: the sleep state, where communications are not possible and energy consumption is low; and the active state, where communication result in a higher energy consumption. In order to test the model, we conducted an extensive experimentation with synchronous simulations on mobile networks and static networks, and also considering asynchronous networks. Later, we extended this work by assuming a broader point of view and including a comprehensive study of the parameters. In addition, thanks to a collaboration with the Technical University of Braunschweig, we were able to test our algorithm in the real sensor network simulator Shawn (http://shawn.sf.net). The second part of this thesis is devoted to the desynchronization of wireless sensor nodes and its application to the distributed graph coloring problem. In particular, our research is inspired by the calling behavior of Japanese tree frogs, whose males use their calls to attract females. Interestingly, as female frogs are only able to correctly localize the male frogs when their calls are not too close in time, groups of males that are located nearby each other desynchronize their calls. Based on a model of this behavior from the literature, we propose a novel algorithm with applications to the field of sensor networks. More in detail, we analyzed the ability of the algorithm to desynchronize neighboring nodes. Furthermore, we considered extensions of the original model, hereby improving its desynchronization capabilities.To illustrate the potential benefits of desynchronized networks, we then focused on distributed graph coloring. Later, we analyzed the algorithm more extensively and show its performance on a larger set of benchmark instances. The classical minimum energy broadcast (MEB) problem in wireless ad hoc networks, which is well-studied in the scientific literature, considers an antenna model that allows the adjustment of the transmission power to any desired real value from zero up to the maximum transmission power level. However, when specifically considering sensor networks, a look at the currently available hardware shows that this antenna model is not very realistic. In this work we re-formulate the MEB problem for an antenna model that is realistic for sensor networks. In this antenna model transmission power levels are chosen from a finite set of possible ones. A further contribution concerns the adaptation of an ant colony optimization algorithm --currently being the state of the art for the classical MEB problem-- to the more realistic problem version, the so-called minimum energy broadcast problem with realistic antennas (MEBRA). The obtained results show that the advantage of ant colony optimization over classical heuristics even grows when the number of possible transmission power levels decreases. Finally we build a distributed version of the algorithm, which also compares quite favorably against centralized heuristics from the literature.Las principles contribuciones de esta tesis se encuentran en el domino de las redes de sensores inalámbricas. Más en detalle, introducimos algoritmos y protocolos que intentan minimizar el consumo energético para los siguientes problemas: gestión autosincronizada de encendido y apagado de sensores con capacidad para obtener energía del ambiente, coloreado de grafos distribuido y broadcasting de consumo mínimo en entornos con antenas reales. En primer lugar, proponemos un sistema capaz de autosincronizar los ciclos de encendido y apagado de los nodos de una red de sensores. El mecanismo está basado en las fases de trabajo y reposo de las colonias de hormigas tal y como estas pueden observarse en la naturaleza, es decir, con fases de actividad autosincronizadas. El principal objectivo de este tipo de técnicas es ahorrar energía gracias a alternar estados de forma eficiente. En este caso en concreto, consideramos dos estados diferentes: el estado dormido, en el que los nodos no pueden comunicarse y el consumo energético es bajo; y el estado activo, en el que las comunicaciones propician un consumo energético elevado. Con el objetivo de probar el modelo, se ha llevado a cabo una extensa experimentación que incluye tanto simulaciones síncronas en redes móviles y estáticas, como simulaciones en redes asíncronas. Además, este trabajo se extendió asumiendo un punto de vista más amplio e incluyendo un detallado estudio de los parámetros del algoritmo. Finalmente, gracias a la colaboración con la Technical University of Braunschweig, tuvimos la oportunidad de probar el mecanismo en el simulador realista de redes de sensores, Shawn (http://shawn.sf.net). La segunda parte de esta tesis está dedicada a la desincronización de nodos en redes de sensores y a su aplicación al problema del coloreado de grafos de forma distribuida. En particular, nuestra investigación está inspirada por el canto de las ranas de árbol japonesas, cuyos machos utilizan su canto para atraer a las hembras. Resulta interesante que debido a que las hembras solo son capaces de localizar las ranas macho cuando sus cantos no están demasiado cerca en el tiempo, los grupos de machos que se hallan en una misma región desincronizan sus cantos. Basado en un modelo de este comportamiento que se encuentra en la literatura, proponemos un nuevo algoritmo con aplicaciones al campo de las redes de sensores. Más en detalle, analizamos la habilidad del algoritmo para desincronizar nodos vecinos. Además, consideramos extensiones del modelo original, mejorando su capacidad de desincronización. Para ilustrar los potenciales beneficios de las redes desincronizadas, nos centramos en el problema del coloreado de grafos distribuido que tiene relación con diferentes tareas habituales en redes de sensores. El clásico problema del broadcasting de consumo mínimo en redes ad hoc ha sido bien estudiado en la literatura. El problema considera un modelo de antena que permite transmitir a cualquier potencia elegida (hasta un máximo establecido por el dispositivo). Sin embargo, cuando se trabaja de forma específica con redes de sensores, un vistazo al hardware actualmente disponible muestra que este modelo de antena no es demasiado realista. En este trabajo reformulamos el problema para el modelo de antena más habitual en redes de sensores. En este modelo, los niveles de potencia de transmisión se eligen de un conjunto finito de posibilidades. La siguiente contribución consiste en en la adaptación de un algoritmo de optimización por colonias de hormigas a la versión más realista del problema, también conocida como broadcasting de consumo mínimo con antenas realistas. Los resultados obtenidos muestran que la ventaja de este método sobre heurísticas clásicas incluso crece cuando el número de posibles potencias de transmisión decrece. Además, se ha presentado una versión distribuida del algoritmo, que también se compara de forma bastante favorable contra las heurísticas centralizadas conocidas

Intelligent Circuits and Systems

ICICS-2020 is the third conference initiated by the School of Electronics and Electrical Engineering at Lovely Professional University that explored recent innovations of researchers working for the development of smart and green technologies in the fields of Energy, Electronics, Communications, Computers, and Control. ICICS provides innovators to identify new opportunities for the social and economic benefits of society.　 This conference bridges the gap between academics and R&D institutions, social visionaries, and experts from all strata of society to present their ongoing research activities and foster research relations between them. It provides opportunities for the exchange of new ideas, applications, and experiences in the field of smart technologies and finding global partners for future collaboration. The ICICS-2020 was conducted in two broad categories, Intelligent Circuits & Intelligent Systems and Emerging Technologies in Electrical Engineering

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

Electric Commuter Multicopter

This document describes the design, analysis, and overall goals of the Electric Commuter Multicopter (ECM) Senior Project. It was presented by Bob Addis and Bill Burner to the senior mechanical engineering class of 2015 at Cal Poly, San Luis Obispo. The progress and development of the project are described in detail and to an extent that an individual or group with similar aspirations can construct their own multicopter or expand upon this one. The goal of this project is to create an Ultralight, as defined by FAA Part 103, commuter multicopter vehicle capable of transporting an individual to and from home, work, or school with the potential of becoming a safe, reliable, and efficient alternative to automobiles. The text contains a background of the project and description of the specific design criteria used to define the function and applicability of the aircraft. Available options of flight, such as planes, autogyros, and helicopters are identified as well as particular components that would be beneficial in ECM’s design. Additionally, the main competitor and reference for the multicopter’s success is the Evolo VC1 because it is currently the sole ultralight manned multicopter. The document moves through the steps used to develop a final theoretical model of the craft. These steps range from preliminary research to detailed analysis and part drawings. This design of ECM is a 12-propeller aerial vehicle with a traditional quadcopter layout encompassing 4, 3-propeller clusters in a 12’ x 12’ square area. All 3 propellers in a cluster operate synchronously, acting as one. Each carbon fiber propeller is mounted to a JM1S in-runner motor manufactured by Joby Motors, which has a continuous power of 8.2 kW and a constant efficiency of 85%. These motors are powered by 14s LiPo battery packs, and the number of batteries per motor depends on the end-vehicle-weight, so the number of batteries and flight time is tentative. The aerial vehicle’s structural materials comprises of carbon fiber and 4130 Chromoly steel. There are three components made of carbon fiber: the main arms, motor spars, and propeller rings. The 52” main arms and 22” motor spars are made of unidirectional carbon fiber with a layup schedule of three 0° plies and two 45° plies, surrounding an additional 0° ply in the center. The 52” main arms extend outward from the center mount to the arm mounts. The motor spars extend outward from the arm mounts to the motor mounts, which hold the motor and propeller assembly. The propeller rings are made from a biaxially braided carbon fiber tape with fibers arranged in a +/- 25° configuration. For building the propeller rings, West System’s 105 Resin with their 206 hardener will be used. The center mount, arm mounts, motor mounts, rings mounts, all brackets and plates are made out of 4130 Chromoly steel. This is based off the premises that the vehicle will experience a significant number of cycles and that steel is a highly reliable material. In addition, lighter metals, such as aluminum, cannot handle the loads for the desired application. Each mount is of circular geometry and fits concentrically into the carbon fiber arms. These steel to carbon fits will be rigidly attached by epoxying the overlapping surface area with 3M Scotch-Weld 2216 2-part epoxy. The control system of ECM comprises of a Saitek control interface with a Scherrer transmitter, linked via a CompuFly cable. The selected microcontroller is an OpenPilot GCS because it allows for 12 inputs, one input for each motor, and enables an engineer to configure the propeller layout with the built-in software. Along with the craft’s development, the structure of the team is outlined, providing insight for how tasks are delegated. Task delegation involves assigning individual and team roles with respect to management and finances, as well as approaches for accomplishing more technical tasks within the three main project subgroups: structure, propulsion, and controls. Additional attention is given to the financial limitations placed on this project. To account for the possibility of not reaching the funding goal for a full-scale prototype, two other options are presented. Results of any of the 3 options will be used to validate the feasibility of this project. However, the disadvantages and advantages of each option are outlined for the reader to realize their value. To conclude, the theoretical results for a twelve rotor, battery powered, manned multicopter indicate a total expected flight time approaching ten minutes. As such, it will not be until the energy density and weight of small-scale power supplies improve significantly that a vehicle capable of replacing the automobile will be possible. However, this is the first iteration of ECM, and the team believes this project can move forward with great momentum if a full scale prototype is built

NASA Tech Briefs, Summer 1978, Volume 3, No. 2

Topics covered include: NASA TU Services: Technology Utilization services that can assist you in learning about and applying NASA technology; New Product Ideas: A summary of selected innovations of value to manufacturers for the development of new products; Electronic Components and Circuits; Electronic Systems; Physical Sciences; Solar Energy; Materials; Life Sciences; Mechanics; Machinery; Fabrication Technology; Mathematics and Information Sciences