Formation Control Algorithms With Limited or No Communication

Formation control refers to a collective behaviour of multi-agent systems where individual agents come together to form a pattern, often geometric. These formations can enable multi-agent systems to function more effectively in a broad range of applications. Many formation control algorithms require centralized decision making, communication between agents or a centralized decision maker and other factors that increase per-agent cost and reduce the robustness and scalability of multi-agent systems. To this end, we introduce two algorithms that operate using local decision making and limited or no communication. The first algorithm is a communication-free and index-free algorithm based on polar indicator distributions. The second is a progressive assignment algorithm using limited, situated communication that deterministically assigns agents a position in the objective formation along a convex spiral directed path graph. We also present an extension of the second algorithm for 3-dimensional formation definitions. The first algorithm is demonstrated in a physical experiment using ground-based agents while the second one is simulated using micro air vehicles (MAVs) in a physics-based simulator

Mobile ad hoc networks in transportation data collection and dissemination

The field of transportation is rapidly changing with new opportunities for systems solutions and emerging technologies. The global economic impact of congestion and accidents are significant. Improved means are needed to solve them. Combined with the increasing numbers of vehicles on the road, the net economic impact is measured in the many billions of dollars. Promising methodologies explored in this thesis include the use of the Internet of Things (IoT) and Mobile Ad Hoc Networks (MANET). Interconnecting vehicles using Dedicated Short Range Communication technology (DSRC) brings many benefits. Integrating DSRC into roadway vehicles offers the promise of reducing the problems of congestion and accidents; however, it comes with risks such as loss of connectivity due to power outages as well as controlling and managing loading in such networks. Energy consumption of vehicle communication equipment is a crucial factor in high availability sensor networks. Sending critical emergency messaged through linked vehicles requires that there always be energy and communication reserves. Two algorithms are described. The first controls energy consumption to guarantee an energy reserve for sending alert signals. The second exploits Long Term Evolution (LTE) to guarantee a reliable communication path

Survivability Analysis of the Iridium Low Earth Orbit Satellite Network

This thesis evaluates the survivability of the proposed Iridium Low Earth Orbit (LEO) Satellite Network. In addition to the complete Iridium constellation, three degraded Iridium constellations are analyzed. This analysis occurs via the use of simulation models, which are developed to use three dynamic routing algorithms over three loading levels. The Iridium network models use a common set of operating assumptions and system environments. The constellation survivability was determined by comparing packet rejection rates, hop\u27 counts, and average end to end delay performance between the various network scenarios. It was concluded that, based on the established scenarios, the proposed Iridium constellation was highly survivable. Even with only 45 percent of its satellites functioning (modeled with 36 failed Iridium satellites), the average packet delays were never greater than 178 milliseconds (msec), well within the real time packet delivery constraint of 400 msec. As a result, while additional research is necessary, Iridium has demonstrated the network robustness that is required within the military communications environment

Mobile ad hoc networks for intelligent systems

Advances in wireless technology and portable computing along with demands for high user mobility have provided a major promotion toward the development of ad hoc networks. Mobile ad hoc networks feature dynamic topology, self-organization, limited bandwidth and battery power of a node. They do not rely on specialized routers for path discovery and traffic routing. Research on ad hoc networks has been extensively investigated in the past few years and related work has focused on many of the layers of the communications architecture. This research intends to investigate applications of MANET for intelligent systems, including intelligent transportation system (ITS), sensor network and mobile intelligent robot network, and propose some approaches to topology management, link layer multiple access and routing algorithms. Their performance is evaluated by theoretical analysis and off-the-shelf simulation tools. Most current research on ad hoc networks assumes the availability of IEEE 802.11. However, the RTS/CTS protocol of 802.11 still leads to packet collision which in turn decreases the network throughput and lifetime. For sensor networks, sensors are mostly battery operated. Hence, resolving packet collision may improve network lifetime by saving valuable power. Using space and network diversity combination, this work proposes a new packet separation approach to packet collision caused by masked nodes. Inter-vehicle communication is a key component of ITS and it is also called vehicular ad hoc network. VANET has many features different from regular MANETs in terms of mobility, network size and connectivity. Given rapid topology changes and network partitioning, this work studies how to organize the numerous vehicular nodes and establish message paths between any pair of vehicular nodes if they are not apart too far away. In urban areas, the inter-vehicle communication has different requirements and constraints than highway environments. The proposed position-based routing strategy for VANETs utilizes the traffic pattern in city environments. Packets are forwarded based on traffic lights timing sequence and the moving direction of relaying vehicles. A multicast protocol is also introduced to visualize the real time road traffic with customized scale. Only vehicles related to a source node\u27s planned trajectory will reply the query packet. The visualized real time traffic information therefore helps the driver make better decision in route planning when traffic congestion happens. Nowadays robots become more and more powerful and intelligent. They can take part in operations in a cooperative manner which makes distributed control necessary. Ad hoc robot communication network is still fresh field for researchers working on networking technology. This work investigates some key issues in robot ad hoc network and evaluate the challenges while establishing robot ad hoc networks

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Performance Analysis of Dynamic Routing Protocols in a Low Earth Orbit Satellite Data Network

Modern warfare is placing an increasing reliance on global communications. Currently under development are several Low Earth Orbit (LEO) satellite systems that propose to deliver voice and data traffic to subscribers anywhere on the globe. However, very little is known about the performance of conventional routing protocols under orbital conditions where the topology changes on a scale of minutes rather than days. This thesis compares two routing protocols in a LEO environment. One (Extended Bellman-Ford) is a conventional terrestrial routing protocol, while the other (Darting) is a new protocol which has been proposed as suitable for use in LEO networks. These protocols are compared via computer simulation in two of the proposed LEO systems (Globalstar and Iridium), under various traffic intensities. Comparative measures of packet delay, convergence speed, and protocol overhead are made It was found both protocols were roughly equivalent in end-to-end delay characteristics, though the Darting protocol had a much higher overhead load and demonstrated higher instability at network update periods. For example, while steady state end-to-end delays were within a few milliseconds, in one case Darting showed an increase of 764% in convergence time over Extended Bellman-Ford with an increase of 149% in overhead. Over all cases, Darting required an average of 72.1% more overhead than Extended Bellman-Ford to perform the same work. Darting was handicapped by its strong correlation between data traffic and protocol overhead. Modifications to reduce this overhead would result in much closer performance

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed

Routing, Localization And Positioning Protocols For Wireless Sensor And Actor Networks

Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events. This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication. We also present a multi-hop localization approach for enriching the information collected from the river with the estimated locations of mobile sensor nodes without using positioning adapters. As an extension to this application, we model the movements of sensor nodes by a subsurface meandering current mobility model with random surface motion. Then we adapt the introduced routing and network organization methods to model a complete primate monitoring system. A novel spatial cut-off preferential attachment model and iii center of mass concept are developed according to the characteristics of the primate groups. We also present a role determination algorithm for primates, which uses the collection of spatial-temporal relationships. We apply a similar approach to human social networks to tackle the problem of automatic generation and organization of social networks by analyzing and assessing interaction data. The introduced routing and localization protocols in this dissertation are also extended with a novel three dimensional actor positioning strategy inspired by the molecular geometry. Extensive simulations are conducted in OPNET simulation tool for the performance evaluation of the proposed protocol

Dynamic mission planning for communication control in multiple unmanned aircraft teams

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 147-160).As autonomous technologies continue to progress, teams of multiple unmanned aerial vehicles will play an increasingly important role in civilian and military applications. A multi-UAV system relies on communications to operate. Failure to communicate remotely sensed mission data to the base may render the system ineffective, and the inability to exchange command and control messages can lead to system failures. This thesis presents a unique method to control communications through distributed mission planning to engage under-utilized UAVs to serve as communication relays and to ensure that the network supports mission tasks. The distributed algorithm uses task assignment information, including task location and proposed execution time, to predict the network topology and plan support using relays. By explicitly coupling task assignment and relay creation processes the team is able to optimize the use of agents to address the needs of dynamic complex missions. The framework is designed to consider realistic network communication dynamics including path loss, stochastic fading, and information routing. The planning strategy is shown to ensure agents support both data-rate and interconnectivity bit-error- rate requirements during task execution. In addition, a method is provided for UAVs to estimate the network performance during times of uncertainty, adjust their plans to acceptable levels of risk, and adapt the planning behavior to changes in the communication environment. The system performance is verified through multiple experiments conducted in simulation. Finally, the work developed is implemented in outdoor flight testing with a team of up to four UAVs to demonstrate real-time capability and robustness to imperfections in the environment. The results validate the proposed framework, but highlight some of the challenges these systems face when operating in outdoor uncontrolled environments.by Andrew N. Kopeikin.S.M