This document provides a detailed proposal for a research project on LANdroids, which are small autonomous robots that could establish and maintain wireless mesh networks to maximize connectivity and network longevity. The proposal outlines four main technical goals: 1) Identifying exploitable features of indoor radio environments through experiments and data collection. 2) Developing self-forming, self-healing network protocols that are energy aware. 3) Learning combined optimization techniques that operate in real and signal space. 4) Understanding the system architecture that maximizes performance at low cost. The proposal describes the benefits of exploiting radio structures to improve connectivity, challenges in modeling indoor radio environments, and approaches involving radio analysis, gradient-based control, feature learning, and system-level
IRJET- DOE to Minimize the Energy Consumption of RPL Routing Protocol in IoT ...IRJET Journal
This document discusses minimizing the energy consumption of the RPL routing protocol in IoT networks to support green wireless communication. It first uses the Taguchi method to determine that network size is the most influential factor on energy consumption. It then simulates RPL under different network sizes (10-50 nodes) and mobility scenarios. The results show that energy consumption decreases by 22.11% and throughput increases by 2.82% for smaller networks compared to larger networks. Therefore, optimizing network size can help reduce energy usage and carbon footprint to achieve more sustainable green wireless communication.
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...IJCNCJournal
One of the critical design problems in Wireless Sensor Networks (WSNs) is the Relay Node Placement
(RNP) problem. Inefficient deployment of RNs would have adverse effects on the overall performance and
energy efficiency of WSNs. The RNP problem is a typical example of an NP-hard optimization problem
which can be addressed using metaheuristics with multi-objective formulation. In this paper, we aimed to
provide an efficient optimization approach considering the unconstrained deployment of energy-harvesting
RNs into a pre-established stationary WSN. The optimization was carried out for three different objectives:
energy consumption, network coverage, and deployment cost. This was approached using a novel
optimization approach based on the integration of the Particle Swarm Optimization (PSO) algorithm and a
greedy technique. In the optimization process, the greedy algorithm is an essential component to provide
effective guidance during PSO convergence. It supports the PSO algorithm with the required information
to efficiently alleviate the complexity of the PSO search space and locate RNs in the spots of critical
significance. The evaluation of the proposed greedy-based PSO algorithm was carried out with different
WSN scenarios of varying complexity levels. A comparison was established with two PSO variants: the
classical PSO and a PSO hybridized with the pattern search optimizer. The experimental results
demonstrated the significance of the greedy algorithm in enhancing the optimization process for all the
considered PSO variants. The results also showed how the solution quality and time efficiency were
considerably improved by the proposed optimization approach. Such improvements were achieved using a
simple integration technique without adding to the complexity of the system and introducing additional
optimization stages. This was more evident in the RNP scenarios of considerably large search spaces, even
with highly complex and challenging setups.
This document reviews the Security and QoS Aware Dynamic Clustering (SQADC) Routing protocol for cognitive radio networks (CRNs). It first discusses existing routing protocols for CRNs and identifies gaps, including that most focus on improving quality of service but few address security issues. It then outlines the objectives of designing a new routing protocol to achieve a tradeoff between QoS performance and security performance for CRNs. The proposed SQADC protocol will use dynamic clustering based on ant colony optimization for cluster head selection and re-clustering to optimize spectrum allocation and quality of service while introducing a lightweight trust-based mechanism for detecting malicious nodes.
Bit Error Rate Analysis in WiMAX Communication at Vehicular Speeds using mod...IJMER
At high vehicular speeds, rapid changes in surrounding environments, cause severe fading at
the receiver, resulting a drastic fall in throughput and unless any proactive measure is taken to combat
this problem, throughput becomes insufficient to support many applications, particularly those with
multimedia contents. Bit Error Rate (BER) estimation is an integral part of any proactive measure and
recent studies suggest that Nakagami-m model performs better for modelling channel fading in wireless
communications at high vehicular speeds. No work has been reported in literature that estimates BER
at high vehicular speeds in WiMAX communication using Nakagami-m model. In this thesis, we develop
and present an analytical model to estimate BER in WiMAX at vehicular speeds using Nakagami-m
fading model. The proposed model is adaptive and can be used with resource management schemes
designed for fixed, nomadic, and mobile WiMAX communications.
Dynamic resource allocation for opportunistic software-defined IoT networks: s...IJECEIAES
This document proposes a dynamic resource allocation algorithm for opportunistic software-defined IoT networks using a stochastic optimization framework. It formulates the problem as a two-stage binary linear stochastic program that aims to maximize network throughput while selecting transmission powers to minimize total power consumption under uncertain interference and traffic demands. Due to interference being a continuous random variable correlated over time, the algorithm instead solves a suboptimal sampling problem exploiting interference correlation. It periodically runs over time to adapt to changing channel and interference conditions, significantly increasing simultaneous IoT transmissions and achieved throughput compared to typical algorithms.
EFFICIENT APPROACH FOR DESIGNING A PROTOCOL FOR IMPROVING THE CAPACITY OF ADH...IJCI JOURNAL
In Adhoc Network, prime issues which affects the deployment, design and performance of an Adhoc
Wireless System are Routing, MAC Scheme, TCP, Multicasting, Energy management, Pricing Scheme &
self-organization, Security & Deployment consideration. Routing protocols are designed in such a way that
it should have improvement of throughput and minimum loss of packets. Another aspect is efficient
management of energy and the requirement of protracted connectivity of the network. The routing
algorithm designed for this network should monitor the energy of the node and route the packet
accordingly. Adhoc Network in general has many limitations such as bandwidth, memory and
computational power. In Adhoc Network there are frequent path break due to mobility. Also time
synchronization is difficult & consumes more Bandwidth. Bandwidth reservations requires complex
Medium Access Control protocol. In this field the work of quantitative and qualitative metrics analysis has
been done. The analysis of protocol performance for improving the capacity of adhoc network using
probabilistic approaches of the network is yet to be proposed. Our probabilistic approach will cover
analysis of various computational parameters for different mobility structures. In our proposed method we
have distributed mobile nodes using Pareto distribution & formulated various energy models using
regression statistic.
IRJET- DOE to Minimize the Energy Consumption of RPL Routing Protocol in IoT ...IRJET Journal
This document discusses minimizing the energy consumption of the RPL routing protocol in IoT networks to support green wireless communication. It first uses the Taguchi method to determine that network size is the most influential factor on energy consumption. It then simulates RPL under different network sizes (10-50 nodes) and mobility scenarios. The results show that energy consumption decreases by 22.11% and throughput increases by 2.82% for smaller networks compared to larger networks. Therefore, optimizing network size can help reduce energy usage and carbon footprint to achieve more sustainable green wireless communication.
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...IJCNCJournal
One of the critical design problems in Wireless Sensor Networks (WSNs) is the Relay Node Placement
(RNP) problem. Inefficient deployment of RNs would have adverse effects on the overall performance and
energy efficiency of WSNs. The RNP problem is a typical example of an NP-hard optimization problem
which can be addressed using metaheuristics with multi-objective formulation. In this paper, we aimed to
provide an efficient optimization approach considering the unconstrained deployment of energy-harvesting
RNs into a pre-established stationary WSN. The optimization was carried out for three different objectives:
energy consumption, network coverage, and deployment cost. This was approached using a novel
optimization approach based on the integration of the Particle Swarm Optimization (PSO) algorithm and a
greedy technique. In the optimization process, the greedy algorithm is an essential component to provide
effective guidance during PSO convergence. It supports the PSO algorithm with the required information
to efficiently alleviate the complexity of the PSO search space and locate RNs in the spots of critical
significance. The evaluation of the proposed greedy-based PSO algorithm was carried out with different
WSN scenarios of varying complexity levels. A comparison was established with two PSO variants: the
classical PSO and a PSO hybridized with the pattern search optimizer. The experimental results
demonstrated the significance of the greedy algorithm in enhancing the optimization process for all the
considered PSO variants. The results also showed how the solution quality and time efficiency were
considerably improved by the proposed optimization approach. Such improvements were achieved using a
simple integration technique without adding to the complexity of the system and introducing additional
optimization stages. This was more evident in the RNP scenarios of considerably large search spaces, even
with highly complex and challenging setups.
This document reviews the Security and QoS Aware Dynamic Clustering (SQADC) Routing protocol for cognitive radio networks (CRNs). It first discusses existing routing protocols for CRNs and identifies gaps, including that most focus on improving quality of service but few address security issues. It then outlines the objectives of designing a new routing protocol to achieve a tradeoff between QoS performance and security performance for CRNs. The proposed SQADC protocol will use dynamic clustering based on ant colony optimization for cluster head selection and re-clustering to optimize spectrum allocation and quality of service while introducing a lightweight trust-based mechanism for detecting malicious nodes.
Bit Error Rate Analysis in WiMAX Communication at Vehicular Speeds using mod...IJMER
At high vehicular speeds, rapid changes in surrounding environments, cause severe fading at
the receiver, resulting a drastic fall in throughput and unless any proactive measure is taken to combat
this problem, throughput becomes insufficient to support many applications, particularly those with
multimedia contents. Bit Error Rate (BER) estimation is an integral part of any proactive measure and
recent studies suggest that Nakagami-m model performs better for modelling channel fading in wireless
communications at high vehicular speeds. No work has been reported in literature that estimates BER
at high vehicular speeds in WiMAX communication using Nakagami-m model. In this thesis, we develop
and present an analytical model to estimate BER in WiMAX at vehicular speeds using Nakagami-m
fading model. The proposed model is adaptive and can be used with resource management schemes
designed for fixed, nomadic, and mobile WiMAX communications.
Dynamic resource allocation for opportunistic software-defined IoT networks: s...IJECEIAES
This document proposes a dynamic resource allocation algorithm for opportunistic software-defined IoT networks using a stochastic optimization framework. It formulates the problem as a two-stage binary linear stochastic program that aims to maximize network throughput while selecting transmission powers to minimize total power consumption under uncertain interference and traffic demands. Due to interference being a continuous random variable correlated over time, the algorithm instead solves a suboptimal sampling problem exploiting interference correlation. It periodically runs over time to adapt to changing channel and interference conditions, significantly increasing simultaneous IoT transmissions and achieved throughput compared to typical algorithms.
EFFICIENT APPROACH FOR DESIGNING A PROTOCOL FOR IMPROVING THE CAPACITY OF ADH...IJCI JOURNAL
In Adhoc Network, prime issues which affects the deployment, design and performance of an Adhoc
Wireless System are Routing, MAC Scheme, TCP, Multicasting, Energy management, Pricing Scheme &
self-organization, Security & Deployment consideration. Routing protocols are designed in such a way that
it should have improvement of throughput and minimum loss of packets. Another aspect is efficient
management of energy and the requirement of protracted connectivity of the network. The routing
algorithm designed for this network should monitor the energy of the node and route the packet
accordingly. Adhoc Network in general has many limitations such as bandwidth, memory and
computational power. In Adhoc Network there are frequent path break due to mobility. Also time
synchronization is difficult & consumes more Bandwidth. Bandwidth reservations requires complex
Medium Access Control protocol. In this field the work of quantitative and qualitative metrics analysis has
been done. The analysis of protocol performance for improving the capacity of adhoc network using
probabilistic approaches of the network is yet to be proposed. Our probabilistic approach will cover
analysis of various computational parameters for different mobility structures. In our proposed method we
have distributed mobile nodes using Pareto distribution & formulated various energy models using
regression statistic.
This document discusses propagation models for simulating wireless networks in NS-3. It provides an overview of NS-3 and describes several propagation models that are implemented in NS-3, including Friis, Log Distance, Jakes, Nakagami, and COST-231 Walfisch Ikegami models. These models predict path loss and fading to simulate wireless channel effects. The document also discusses next generation networks and the need for accurate propagation models to simulate their performance.
Richard Del Rosario Laca has over 7 years of experience as a telecom engineer with expertise in network planning, project management, implementation, operations, and documentation for voice and data services. He has technical skills in transmission devices, tools, software, and WAN technologies. His professional experience includes roles in transmission engineering, service provisioning support, facilities planning, technical support, and RF engineering. He holds certifications in ECE, CCNA, and JNCIA.
Creating The Future Economically-Viable Networks_JAN17Emre Yilmaz
1) The document discusses the need for new radio network systems to meet increasing data traffic demands and diversifying connection needs in the future.
2) A key challenge is ensuring the economic viability of these new systems for network operators, as costs per megabyte have decreased. Any new system must prioritize cost reductions.
3) The author proposes several approaches to reduce network costs, such as using intelligent optimization to reduce energy usage, redesigning network architecture to centralize equipment, and employing a multi-tiered network structure using different spectrum bands.
IRJET - Performance Evaluation of QoS by Enhanced ACO in Hybrid Protocols in ...IRJET Journal
This document discusses performance evaluation of quality of service (QoS) in mobile ad hoc networks (MANETs) using an enhanced ant colony optimization (ACO) approach combined with hybrid routing protocols. It first provides background on MANETs and challenges related to their dynamic topology and limited resources. It then discusses using ACO, which is based on how ants deposit and follow pheromone trails, to continuously update path pheromone values based on parameters like residual signal strength, energy, and hop count to select optimal routes. The objective is to improve QoS satisfaction for tactical communications requiring multimedia data transfer with good quality. The document reviews several existing approaches that aim to improve QoS in MANETs and
Scheduling wireless virtual networks functionsredpel dot com
This document discusses scheduling virtual network functions (VNFs) in wireless networks. It formalizes the problem of placing VNFs requested by mobile virtual network operators in a radio access network as an integer linear programming problem. It then proposes a heuristic called Wireless Network Embedding (WiNE) to solve the VNF placement problem. The goal is to ensure performance isolation between different network slices while efficiently utilizing resources. A proof-of-concept implementation of a management framework for enterprise WLANs is also presented.
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Extended Bandwidth Optimized and Energy Efficient Dynamic Source Routing Prot...IJECEIAES
The document proposes an extension to the Dynamic Source Routing (DSR) protocol to make it more bandwidth and energy efficient for mobile ad-hoc networks. The extended protocol uses mobile agents to carry route request packets during the route discovery process. This allows the agents to search node route caches without using bandwidth, working in a disconnected manner. Simulation results show that the modified DSR protocol has higher packet delivery ratio, throughput, and lower overall energy consumption compared to the traditional DSR protocol.
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
This study examines the performance and power characteristics of 4G LTE networks compared to 3G and WiFi networks through local experiments and analysis of a publicly deployed Android app called 4GTest. The researchers develop the first empirically derived comprehensive power model of a commercial LTE network and apply it to analyze 5 months of usage data from 20 smartphone users. Their results show that LTE has significantly higher throughput than 3G and WiFi but is less power efficient, especially for small data transfers. They also investigate the impact of various LTE configuration parameters on energy usage.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
Efficient P2P data dissemination in integrated optical and wireless networks ...TELKOMNIKA JOURNAL
The Quality of Service (QoS) resource consumption is always the tricky problem and also
the on-going issue in the access network of mobile wireless part because of its dynamic nature of network
wireless transmissions. It is very critical for the infrastructure-less wireless mobile ad hoc network that is
distributed while interconnects in a peer-to-peer manner. Toward resolve the problem, Taguchi method
optimization of mobile ad hoc routing (AODVUU) is applied in integrated optical and wireless networks
called the adLMMHOWAN. Practically, this technique was carry out using OMNeT++ software by building
a simulation based optimization through design of experiment. Its QoS network performance is examined
based on packet delivery ratio (PDR) metric and packet loss probabilities (PLP) metric that consider
the scenario of variation number of nodes. During the performing stage with random mobile connectivity
based on improvement in optimized front-end wireless domain of AODVUU routing, the result is performing
better when compared with previous study called the oRia scheme with the improvement of 14.1% PDR
and 43.3% PLP in this convergence of heterogeneous optical wireless network.
Power Optimization in MIMO-CN with MANETIOSR Journals
This document summarizes research on power optimization in MIMO cooperative networks (MIMO-CN) with mobile ad hoc networks (MANETs). It discusses using cooperative diversity to improve total network channel capacity by decoding signals from both the direct and relayed paths. The research analyzes the optimal power allocation structure between the source and multiple relays. It also examines different relaying strategies like amplify-forward and decode-forward. The goal is to understand the structural properties and maximize the end-to-end achievable rate of multi-relay MIMO-CN systems while considering per-node power constraints.
Design and development of handover simulator model in 5G cellular network IJECEIAES
In the modern era of technology, the high speed internet is the most important part of human life. The current available network is reckoned to be slow in speed and not be up to snuff for data transmission regarding business applications. The objective of handover mechanism is to reassign the current session handle by internet gadget. The globe needs the next generation high mobility and throughput performance based internet model. This research paper explains the proposed method of design and development for handover based 5G cellular network. In comparison to the traditional method, we propose to control the handovers between base-stations using a concentric method. The channel simulator is applied over the range of the frequencies from 500 MHz to 150 GHz and radio frequency for the 700 MHz bandwidth. The performance of the simulation system is calculated on the basis of handover preparation and completion time regarding base station as well as number of users. From this experiment we achieve the 7.08 ms handover preparation time and 9.98 ms handover completion time. The author recommended the minimum handover completion time, perform the high speed for 5G cellular networks.
IMPROVED PROPAGATION MODELS FOR LTE PATH LOSS PREDICTION IN URBAN & SUBURBAN ...ijwmn
To maximize the benefits of LTE cellular networks, careful and proper planning is needed. This requires the use of accurate propagation models to quantify the path loss required for base station deployment. Deployed LTE networks in Ghana can barely meet the desired 100Mbps throughput leading to customer dissatisfaction. Network operators rely on transmission planning tools designed for generalized environments that come with already embedded propagation models suited to other environments. A challenge therefore to Ghanaian transmission Network planners will be choosing an accurate and precise propagation model that best suits the Ghanaian environment. Given this, extensive LTE path loss measurements at 800MHz and 2600MHz were taken in selected urban and suburban environments in Ghana and compared with 6 commonly used propagation models. Improved versions of the Ericson, SUI, and ECC-33 developed in this study predict more precisely the path loss in Ghanaian environments compared with commonly used propagation models.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
This curriculum vitae summarizes Paul D. Skalski's educational and professional background. He received his Ph.D. in Communication from Michigan State University in 2004, and is currently an Assistant Professor in the School of Communication at Cleveland State University. His research focuses on new media technologies, presence, and media effects. He has authored or co-authored over 20 peer-reviewed journal articles and book chapters.
The document describes several graduate level computer science courses offered at the university, including courses on professional communication, programming, algorithms, data structures, operating systems, and software engineering. Key courses cover computer science fundamentals like programming in C/C++ and Java, discrete structures, algorithm analysis, and automata theory. The courses provide students with knowledge and skills in core computer science topics as well as practical skills in programming, software engineering, and systems.
This document discusses propagation models for simulating wireless networks in NS-3. It provides an overview of NS-3 and describes several propagation models that are implemented in NS-3, including Friis, Log Distance, Jakes, Nakagami, and COST-231 Walfisch Ikegami models. These models predict path loss and fading to simulate wireless channel effects. The document also discusses next generation networks and the need for accurate propagation models to simulate their performance.
Richard Del Rosario Laca has over 7 years of experience as a telecom engineer with expertise in network planning, project management, implementation, operations, and documentation for voice and data services. He has technical skills in transmission devices, tools, software, and WAN technologies. His professional experience includes roles in transmission engineering, service provisioning support, facilities planning, technical support, and RF engineering. He holds certifications in ECE, CCNA, and JNCIA.
Creating The Future Economically-Viable Networks_JAN17Emre Yilmaz
1) The document discusses the need for new radio network systems to meet increasing data traffic demands and diversifying connection needs in the future.
2) A key challenge is ensuring the economic viability of these new systems for network operators, as costs per megabyte have decreased. Any new system must prioritize cost reductions.
3) The author proposes several approaches to reduce network costs, such as using intelligent optimization to reduce energy usage, redesigning network architecture to centralize equipment, and employing a multi-tiered network structure using different spectrum bands.
IRJET - Performance Evaluation of QoS by Enhanced ACO in Hybrid Protocols in ...IRJET Journal
This document discusses performance evaluation of quality of service (QoS) in mobile ad hoc networks (MANETs) using an enhanced ant colony optimization (ACO) approach combined with hybrid routing protocols. It first provides background on MANETs and challenges related to their dynamic topology and limited resources. It then discusses using ACO, which is based on how ants deposit and follow pheromone trails, to continuously update path pheromone values based on parameters like residual signal strength, energy, and hop count to select optimal routes. The objective is to improve QoS satisfaction for tactical communications requiring multimedia data transfer with good quality. The document reviews several existing approaches that aim to improve QoS in MANETs and
Scheduling wireless virtual networks functionsredpel dot com
This document discusses scheduling virtual network functions (VNFs) in wireless networks. It formalizes the problem of placing VNFs requested by mobile virtual network operators in a radio access network as an integer linear programming problem. It then proposes a heuristic called Wireless Network Embedding (WiNE) to solve the VNF placement problem. The goal is to ensure performance isolation between different network slices while efficiently utilizing resources. A proof-of-concept implementation of a management framework for enterprise WLANs is also presented.
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Extended Bandwidth Optimized and Energy Efficient Dynamic Source Routing Prot...IJECEIAES
The document proposes an extension to the Dynamic Source Routing (DSR) protocol to make it more bandwidth and energy efficient for mobile ad-hoc networks. The extended protocol uses mobile agents to carry route request packets during the route discovery process. This allows the agents to search node route caches without using bandwidth, working in a disconnected manner. Simulation results show that the modified DSR protocol has higher packet delivery ratio, throughput, and lower overall energy consumption compared to the traditional DSR protocol.
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
This study examines the performance and power characteristics of 4G LTE networks compared to 3G and WiFi networks through local experiments and analysis of a publicly deployed Android app called 4GTest. The researchers develop the first empirically derived comprehensive power model of a commercial LTE network and apply it to analyze 5 months of usage data from 20 smartphone users. Their results show that LTE has significantly higher throughput than 3G and WiFi but is less power efficient, especially for small data transfers. They also investigate the impact of various LTE configuration parameters on energy usage.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
Efficient P2P data dissemination in integrated optical and wireless networks ...TELKOMNIKA JOURNAL
The Quality of Service (QoS) resource consumption is always the tricky problem and also
the on-going issue in the access network of mobile wireless part because of its dynamic nature of network
wireless transmissions. It is very critical for the infrastructure-less wireless mobile ad hoc network that is
distributed while interconnects in a peer-to-peer manner. Toward resolve the problem, Taguchi method
optimization of mobile ad hoc routing (AODVUU) is applied in integrated optical and wireless networks
called the adLMMHOWAN. Practically, this technique was carry out using OMNeT++ software by building
a simulation based optimization through design of experiment. Its QoS network performance is examined
based on packet delivery ratio (PDR) metric and packet loss probabilities (PLP) metric that consider
the scenario of variation number of nodes. During the performing stage with random mobile connectivity
based on improvement in optimized front-end wireless domain of AODVUU routing, the result is performing
better when compared with previous study called the oRia scheme with the improvement of 14.1% PDR
and 43.3% PLP in this convergence of heterogeneous optical wireless network.
Power Optimization in MIMO-CN with MANETIOSR Journals
This document summarizes research on power optimization in MIMO cooperative networks (MIMO-CN) with mobile ad hoc networks (MANETs). It discusses using cooperative diversity to improve total network channel capacity by decoding signals from both the direct and relayed paths. The research analyzes the optimal power allocation structure between the source and multiple relays. It also examines different relaying strategies like amplify-forward and decode-forward. The goal is to understand the structural properties and maximize the end-to-end achievable rate of multi-relay MIMO-CN systems while considering per-node power constraints.
Design and development of handover simulator model in 5G cellular network IJECEIAES
In the modern era of technology, the high speed internet is the most important part of human life. The current available network is reckoned to be slow in speed and not be up to snuff for data transmission regarding business applications. The objective of handover mechanism is to reassign the current session handle by internet gadget. The globe needs the next generation high mobility and throughput performance based internet model. This research paper explains the proposed method of design and development for handover based 5G cellular network. In comparison to the traditional method, we propose to control the handovers between base-stations using a concentric method. The channel simulator is applied over the range of the frequencies from 500 MHz to 150 GHz and radio frequency for the 700 MHz bandwidth. The performance of the simulation system is calculated on the basis of handover preparation and completion time regarding base station as well as number of users. From this experiment we achieve the 7.08 ms handover preparation time and 9.98 ms handover completion time. The author recommended the minimum handover completion time, perform the high speed for 5G cellular networks.
IMPROVED PROPAGATION MODELS FOR LTE PATH LOSS PREDICTION IN URBAN & SUBURBAN ...ijwmn
To maximize the benefits of LTE cellular networks, careful and proper planning is needed. This requires the use of accurate propagation models to quantify the path loss required for base station deployment. Deployed LTE networks in Ghana can barely meet the desired 100Mbps throughput leading to customer dissatisfaction. Network operators rely on transmission planning tools designed for generalized environments that come with already embedded propagation models suited to other environments. A challenge therefore to Ghanaian transmission Network planners will be choosing an accurate and precise propagation model that best suits the Ghanaian environment. Given this, extensive LTE path loss measurements at 800MHz and 2600MHz were taken in selected urban and suburban environments in Ghana and compared with 6 commonly used propagation models. Improved versions of the Ericson, SUI, and ECC-33 developed in this study predict more precisely the path loss in Ghanaian environments compared with commonly used propagation models.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
This curriculum vitae summarizes Paul D. Skalski's educational and professional background. He received his Ph.D. in Communication from Michigan State University in 2004, and is currently an Assistant Professor in the School of Communication at Cleveland State University. His research focuses on new media technologies, presence, and media effects. He has authored or co-authored over 20 peer-reviewed journal articles and book chapters.
The document describes several graduate level computer science courses offered at the university, including courses on professional communication, programming, algorithms, data structures, operating systems, and software engineering. Key courses cover computer science fundamentals like programming in C/C++ and Java, discrete structures, algorithm analysis, and automata theory. The courses provide students with knowledge and skills in core computer science topics as well as practical skills in programming, software engineering, and systems.
Algoritmos Genéticos aplicados em Machine Learningbutest
The document discusses using genetic algorithms to control a robot. It proposes representing the robot's behaviors as chromosomes and using a genetic algorithm to evolve effective behaviors over generations. The behaviors are evaluated based on their ability to navigate toward a target location while avoiding obstacles. Testing in different simulated environments showed that a genetic algorithm could evolve behaviors that guide the robot along near-optimal paths to reach its target.
"An adaptive modular approach to the mining of sensor network ...butest
This document summarizes an adaptive modular approach for mining sensor network data using machine learning techniques. It presents a two-layer architecture that uses an online compression algorithm (PCA) in the first layer to reduce data dimensionality and an adaptive lazy learning algorithm (KNN) in the second layer for prediction and regression tasks. Simulation results on a wave propagation dataset show the approach can handle non-stationarities like concept drift, sensor failures and network changes in an efficient and adaptive manner.
This document discusses linking, referencing, and plagiarism. It defines plagiarism as copying or closely paraphrasing from other sources without proper citation. Examples of plagiarism include copying text word-for-word or piecing together text from multiple sources only with linking sentences. The document also defines a hyperlink as a reference to a document that the reader can directly follow, and defines a reference as a mention or direction to another source for purposes of information or testimony. It provides definitions of "reference" from an online dictionary.
Building the Master Image in Microsoft System Center Virtual ...butest
This document discusses creating master images in Microsoft System Center Virtual Machine Manager 2008. It begins by describing the library in SCVMM which contains resources like ISO images, VHD images, scripts, and templates. It then discusses the self-service portal which allows users to create, manage, and move virtual machines. The remainder of the document focuses on creating master images, including why they are useful to have, factors to consider like agents and antivirus software, and demoing the process of creating master images in SCVMM.
The document discusses predicting the cis/trans configuration of peptidyl prolyl residues in proteins using machine learning algorithms. Two algorithms, Naive Bayes classifier and Support Vector Machine (SVM), were tested on datasets containing protein structural information from the Protein Data Bank. The optimal performance was achieved using SVM with a polynomial kernel and incorporating secondary structure information, which resulted in an accuracy of 67% and correlation coefficient of 0.34. Incorporating secondary structure information and using a larger window size improved prediction performance compared to only using sequence information.
This document provides information about the CSC 448/548 - Machine Learning course offered at South Dakota School of Mines and Technology in Fall 2007. It outlines the instructor details, class schedule, catalog description, textbook, topics to be covered, course goals and outcomes, grading criteria, attendance policy, and other policies. The course will introduce students to machine learning algorithms and have them implement assignments using the Weka machine learning tool to apply what they learn to datasets. Evaluation will be based on homework, exams, class activities, and a final project involving implementing and comparing machine learning algorithms on a dataset.
Suleyman Serdar Kozat is a research staff member at IBM researching speech technologies. He has a PhD from the University of Illinois in electrical engineering, with a focus on digital signal processing. He has published numerous papers in signal processing and machine learning and holds several patents. He seeks full-time positions applying machine learning and signal processing to problems such as speech recognition.
Mining Regional Knowledge in Spatial Datasetbutest
The document outlines a domain-driven framework for clustering spatial data using plug-in fitness functions. It describes a clustering algorithm called MOSAIC that supports plug-in fitness functions and can approximate arbitrary cluster shapes. Several case studies applying this framework to problems in various domains are presented, including co-location pattern mining, multi-objective clustering, and change analysis of spatial data patterns over time. The framework allows domain experts to define customized fitness functions tailored to their specific needs.
SVMlight is an implementation of Support Vector Machines (SVMs) that can be used for classification, regression, and preference ranking problems. It has efficient memory usage and can handle large datasets. The source code and binaries can be downloaded for various operating systems. SVMlight consists of a learning module (svm_learn) that trains models from input data, and a classification module (svm_classify) that applies trained models to make predictions on new data. The svm_learn module is called with options to specify the problem type, tradeoff parameter, and other settings. Models are saved for use by svm_classify.
The document provides background information on the Health Volunteers Organization (HVO), a non-governmental organization in Vietnam. It summarizes the organization's mission to improve community health through volunteerism and its vision to become a leading social work organization in Vietnam's health sector. It then outlines the organization's recent projects providing medical services in Vietnam, Cambodia, and Laos, and its current programs in overseas training, internships, recruiting, audiology equipment, and medical checkups. Finally, it lists the organization's sponsors and partners.
The document provides an overview of decision trees and machine learning techniques. It discusses how decision trees can be used to classify data and extract patterns, describes the ID3 algorithm for building decision trees using information gain, and notes some extensions to ID3 like C4.5 which allow continuous values and pruning of trees.
This document summarizes research using machine learning algorithms to design artificial histone acetyltransferases (HATs) with improved stability and activity. The target protein is Tetrahymena GCN5 (tGCN5), a HAT. Experimental data showed increased stability but decreased activity when incorporating unnatural amino acids. The researchers identified 11 potential mutants and used machine learning approaches like active learning to select variants for further investigation, with the goal of optimizing tGCN5 function.
Signal Classification and Identification for Cognitive Radio: A ReviewIRJET Journal
This document provides a literature review of signal classification and identification techniques for cognitive radio. It summarizes 13 research papers on topics related to signal classification, modulation classification, spectrum sensing, and the use of machine learning algorithms for cognitive radio applications. The papers evaluated techniques like energy detection, cyclostationary feature detection, statistical signal processing methods, and supervised/unsupervised machine learning algorithms. They found that machine learning generally provides better performance than traditional signal processing techniques, and that techniques like cooperative spectrum sensing can improve detection accuracy in cognitive radio networks.
IRJET- A Survey on Swarm Optimization Technique in Wireless Sensor NetworkIRJET Journal
This document discusses optimization techniques for wireless sensor networks to improve energy efficiency and extend network lifetime. It summarizes swarm optimization techniques like ant colony optimization, particle swarm optimization, and genetic algorithms. The key points are:
1) Wireless sensor networks are constrained by limited battery power of nodes, so routing protocols need to efficiently manage energy usage.
2) Clustering is a common technique where sensor nodes send data to cluster heads which then forward to the base station, reducing energy spent on long-distance transmissions.
3) Swarm optimization techniques like ant colony optimization, particle swarm optimization, and genetic algorithms can be applied to clustering algorithms to further improve energy efficiency and extend network lifetime.
Analysis and assessment software for multi-user collaborative cognitive radi...IJECEIAES
Computer simulations are without a doubt a useful methodology that allows to explore research queries and develop prototypes at lower costs and timeframes than those required in hardware processes. The simulation tools used in cognitive radio networks (CRN) are undergoing an active process. Currently, there is no stable simulator that enables to characterize every element of the cognitive cycle and the available tools are a framework for discrete-event software. This work presents the spectral mobility simulator in CRN called “App MultiColl-DCRN”, developed with MATLAB’s app designer. In contrast with other frameworks, the simulator uses real spectral occupancy data and simultaneously analyzes features regarding spectral mobility, decision-making, multi-user access, collaborative scenarios and decentralized architectures. Performance metrics include bandwidth, throughput level, number of failed handoffs, number of total handoffs, number of handoffs with interference, number of anticipated handoffs and number of perfect handoffs. The assessment of the simulator involves three scenarios: the first and second scenarios present a collaborative structure using the multi-criteria optimization and compromise solution (VIKOR) decision-making model and the naïve Bayes prediction technique respectively. The third scenario presents a multi-user structure and uses simple additive weighting (SAW) as a decision-making technique. The present development represents a contribution in the cognitive radio network field since there is currently no software with the same features.
Sensor Data Aggregation using a Cross Layer Framework for Smart City Applicat...IRJET Journal
This document proposes a cross-layer commit protocol for sensor data aggregation in smart cities. It implements query-based data aggregation using the network and application layers. The application layer initiates queries that are sent to sensor nodes. Nodes that can provide the requested data reply to form clusters. The node with the highest residual energy and closest average distance to members is selected as cluster head. As cluster head, it collects and aggregates data from members and sends it to the sink node. This approach reduces energy consumption compared to other data aggregation methods. A prototype was created to test the protocol for applications like garbage monitoring and weather sensing.
This document discusses the challenges facing next-generation networks. It describes how current networks are struggling to handle the exponential growth in data usage and number of users. Next-generation networks aim to address this by improving network capabilities. However, developing these advanced networks presents challenges such as maintaining energy efficiency, addressing environmental impacts, and dealing with security and software issues. Specific challenges mentioned include utilizing spectrum efficiently using technologies like cognitive radio, reducing carbon emissions, and handling problems associated with software-defined networking.
Cross Layering using Reinforcement Learning in Cognitive Radio-based Industri...IJCNCJournal
The coupling of multiple protocol layers for a Cognitive Radio-based Industrial Internet of Ad-hoc Sensor Network, enables better interaction, coordination, and joint optimization of different protocols in achieving remarkable performance improvements. In this paper, network, and medium access control (MAC) layer functionalities are cross-layered by developing the joint strategy of routing and effective spectrum sensing and Dynamic Channel Selection (DCS) using the Reinforcement Learning (RL) algorithm. In an industrial ad-hoc scenario, the network layer utilizes the sensed spectrum and selected channel by MAC layer for next-hop routing. MAC layer utilizes the lowest known transmission delay of a channel for a single hop as computed by the network layer, which improves the MAC channel selection operation. The applied RLbased technique (Q learning) enables the CR Secondary Users (SUs) to sense, learn, and make the optimal decision on their environment of operations. The proposed RLCLD schemes improve the SU network performance up to 30% as compared to conventional methods.
CROSS LAYERING USING REINFORCEMENT LEARNING IN COGNITIVE RADIO-BASED INDUSTRI...IJCNCJournal
The coupling of multiple protocol layers for a Cognitive Radio-based Industrial Internet of Ad-hoc Sensor
Network, enables better interaction, coordination, and joint optimization of different protocols in achieving
remarkable performance improvements. In this paper, network, and medium access control (MAC) layer
functionalities are cross-layered by developing the joint strategy of routing and effective spectrum sensing
and Dynamic Channel Selection (DCS) using the Reinforcement Learning (RL) algorithm. In an industrial
ad-hoc scenario, the network layer utilizes the sensed spectrum and selected channel by MAC layer for
next-hop routing. MAC layer utilizes the lowest known transmission delay of a channel for a single hop as
computed by the network layer, which improves the MAC channel selection operation. The applied RLbased technique (Q learning) enables the CR Secondary Users (SUs) to sense, learn, and make the optimal
decision on their environment of operations. The proposed RLCLD schemes improve the SU network
performance up to 30% as compared to conventional methods.
Cognitive radio promises to revolutionize wireless communication and spectrum management. It allows unlicensed users to opportunistically access licensed spectrum bands when the licensed users are not actively using it. This helps solve the problem of spectrum scarcity by improving utilization efficiency. However, realizing cognitive radio faces many technical, economic and legal challenges. Key challenges include developing sensing techniques to avoid interference, establishing spectrum sharing protocols, and reforming policies to allow dynamic spectrum access while protecting licensed users. Overcoming these challenges could provide benefits like ubiquitous connectivity and new wireless applications.
This document provides an overview of cognitive radio and discusses some of the key challenges in deploying cognitive radio networks. It defines cognitive radio as a radio that can be aware of its environment and change its transmission or reception parameters accordingly. The document outlines some of the core capabilities needed for cognitive radios, including flexibility, sensing, learning, and adaptability. It also discusses advantages of cognitive radio like efficient spectrum utilization. Some challenges of deploying cognitive radio networks include developing robust spectrum sensing techniques, designing flexible hardware, addressing legal and security issues, and establishing economic models for spectrum sharing.
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...IRJET Journal
This document proposes a system to optimize routing and prevent denial of service attacks in wireless networks. It aims to detect distributed denial of service (DDoS) attacks using a classifier system called CS_DDoS that classifies packets as malicious or normal. Malicious packets will be blocked and their IP addresses blacklisted. It also aims to use a hybrid optimization system (HOS) for efficient, quality routing to increase network lifetime and user communication. The system is designed to differentiate between genuine and malicious traffic, transfer data via alternative paths if attacks are detected, and balance network load for stable data transfer while improving packet delivery and throughput.
GaruaGeo: Global Scale Data Aggregation in Hybrid Edge and Cloud Computing En...Otávio Carvalho
Research work published on the 9th International Conference on Cloud Computing and Services Science (CLOSER 2019) held at Heraklion, Crete.
The combination of Edge Computing devices and Cloud Computing resources brings the best of both worlds: Data aggregation closer to the source and scalable resources to grow the network on demand. However, the ability to leverage each time more powerful edge nodes to decentralize data processing and aggregation is still a significant challenge for both industry and academia. In this work, we extend the Garua platform to analyze the impact of a model for data aggregation in a global scale smart grid application dataset. The platform is extended to support global data aggregators that are placed nearly to the Edge nodes where data is being collected. This way, it is possible to aggregate data not only at the edge of the network but also pre-process data at nearby geographic areas, before sending data to be aggregated globally by global centralization nodes. The results of this work show that the implemented testbed application, through the usage of edge node aggregation, data aggregators geographically distributed and messaging windows, can achieve collection rates above 400 million measurements per second.
A Review of Sensor Node in Wireless Sensor Networksijtsrd
Wireless Sensor Networks WSNs are collection of tiny sensor nodes capable of sensing, processing and broadcasting data correlated to some occurrence in the network area. The sensor nodes have severe limitation, such as bandwidth, short communication range, limited CPU processing facility, memory and energy. Enhancing the lifetime of wireless sensors network and efficient utilizations of bandwidth are essential for the proliferation of wireless sensor network in different applications. We provide an in depth study of applying wireless sensor networks WSNs to real world habitat monitoring. A set of system design requirements were developed that cover the hardware design of the nodes, the sensor network software, protective enclosures, and system architecture to meet the requirements of biologists. Although researchers anticipate some challenges arising in real world deployments of WSNs, many problems can only be discovered through experience. We present a set of experiences from a four month long deployment on a remote island. We analyze the environmental and node health data to evaluate system performance. The close integration of WSNs with their environment provides environmental data at densities previously impossible. We show that the sensor data is also useful for predicting system operation and network failures. Based on over one million data readings, we analyze the node and network design and develop network reliability profiles and failure models. Jobanputra Paresh Ashokkumar | Prof. Arun Jhapate ""A Review of Sensor Node in Wireless Sensor Networks"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23620.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23620/a-review-of-sensor-node-in-wireless-sensor-networks/jobanputra-paresh-ashokkumar
An Efficient Machine Learning Optimization Model for Route Establishment Mech...IJCNCJournal
Internet of Things (IoT) provides interconnection of various wireless communication devices, which offers both ubiquitous accessibility of devices and in-built intelligence capacity. IoT offers interaction with devices and provides sufficient capability advantages of networking and socialization with consideration of intermediate devices. RPL (Routing Protocol for low-power and Lossy Networks) is an attractive model for effective routing techniques in the wireless medium. The increase in demand for wireless systems in terms of energy, reliability, stability, and scale routing IPv6 over 6L0WPAN is being adopted. This research developed an optimized machine learning model (WOABC) routing protocol for route establishment in IoT networks. The constructed RPL routing protocol incorporates an optimization approach for the identification of the best and worst routes in the network. The proposed WOABC evaluates the routing path for data transmission between nodes through optimization techniques for effective route establishment. The optimization of routes is performed with whale optimization techniques. The developed whale optimization technique is incorporated in machine learning networks. Also, the proposed WOABC utilizes an optimization membership function for the identification of the optimal path in the network. The performance of the proposed WOABC is compared with existing techniques such as RPL and Speed – IoT. The comparative analysis showed that the performance of the proposed WOABC is ~3% increased throughput. The performance of the proposed WOABC is significant compared with the existing RPL routing protocol.
AN EFFICIENT MACHINE LEARNING OPTIMIZATION MODEL FOR ROUTE ESTABLISHMENT MECH...IJCNCJournal
Internet of Things (IoT) provides interconnection of various wireless communication devices, which offers
both ubiquitous accessibility of devices and in-built intelligence capacity. IoT offers interaction with
devices and provides sufficient capability advantages of networking and socialization with consideration of
intermediate devices. RPL (Routing Protocol for low-power and Lossy Networks) is an attractive model for
effective routing techniques in the wireless medium. The increase in demand for wireless systems in terms
of energy, reliability, stability, and scale routing IPv6 over 6L0WPAN is being adopted. This research
developed an optimized machine learning model (WOABC) routing protocol for route establishment in IoT
networks. The constructed RPL routing protocol incorporates an optimization approach for the
identification of the best and worst routes in the network. The proposed WOABC evaluates the routing path
for data transmission between nodes through optimization techniques for effective route establishment. The
optimization of routes is performed with whale optimization techniques. The developed whale optimization
technique is incorporated in machine learning networks. Also, the proposed WOABC utilizes an
optimization membership function for the identification of the optimal path in the network. The
performance of the proposed WOABC is compared with existing techniques such as RPL and Speed – IoT.
The comparative analysis showed that the performance of the proposed WOABC is ~3% increased
throughput. The performance of the proposed WOABC is significant compared with the existing RPL
routing protocol.
Digital_Notes___UNIT_5___EC8702___AD_HOC_AND__WIRELESS_SENSOR__NETWORKS.pdf.pdfMathavan N
This document provides an overview of sensor node hardware platforms and programming challenges. It discusses the main components of a basic sensor node, including the controller, memory, sensors/actuators, communication, and power supply. It describes three categories of sensor node hardware: augmented general-purpose computers, dedicated embedded sensor nodes like the Berkeley Motes, and system-on-chip nodes. It then focuses on the Berkeley Motes, outlining their architecture including dual CPU design, memory, radio communication, and energy consumption of components. The document emphasizes that programming for resource-constrained sensor node hardware presents challenges in optimizing for small memory footprints.
This document discusses load balancing in 5G networks through offloading traffic between LTE and Wi-Fi networks. It describes the COHERENT architectural framework, which uses network graphs and two main control components - the Central Controller and Coordinator (C3) and Real-Time Controller (RTC) - to manage resource allocation and control tasks like traffic steering and load balancing across heterogeneous networks. Specifically, it focuses on a load balancing use case where traffic is offloaded from overloaded LTE networks to Wi-Fi networks to improve resource utilization and system performance.
Ppt on smart small cell with hybrid beamforming for 5 gBhaskar Gurana
This document proposes a smart small cell concept using hybrid beamforming to enhance network capacity for 5G. It discusses requirements for 5G including high data rates and connections. Hybrid beamforming combines analog and digital beamforming to reduce complexity. The document describes a testbed using SDR and antenna array to implement 3D hybrid beamforming in small cells. System simulations using a 3D ray tracing tool show gains over LTE networks. Evaluation results examined link and system performances, and the conclusion is the smart small cell can support 5G networks based on SDR testbed and simulation results.
The document describes a robust and trusted routing scheme (RTS) for IoT-based mobile wireless mesh networks. The RTS aims to improve network reliability and security. It consists of two main techniques: (1) a network infrastructure using multi-hop connectivity between mesh clients, routers and gateways; and (2) secure and trusted data routing between devices using RSA cryptography with public/private keys. The RTS allows for self-configuration, coverage expansion, and recovery from failures while preventing various security attacks.
Abstract— Self-Organizing Networks (SON) is a collection of functions to the radio and network components to interact among
themselves to configure, tune, optimize and healing of cellular system in real time. It is considered to be a necessity in future mobile
networks and operations, due to the increased cost pressure and minimizing trend of human intervention. This paper describes scope,
architecture of reference model, evaluations on the use of some of the most important SON components. We also included the application
of a revolutionary algorithm; genetic algorithm. The application of this algorithm in telecommunication network optimization has presented
and shown with the effective choice of some important parameter values involved in optimization and the implementation strategies.
Nowadays mobile networks are getting more complex to configure, optimize and maintain. SON functions will perform to give cost savings
and performance benefits from the very beginning of a network deployment to its life-cycle.
This research proposes developing an improved artificial bee colony (ABC) algorithm to optimize routing and deployment in highly dynamic self-organizing wireless sensor networks. The modified ABC algorithm will factor in energy usage and other metrics to match the characteristics of wireless sensor network functioning. It will include fully automated self-organizing modules for deployment and routing controlled by a central processor. The system is intended to aid in developing distributed sensor networks for applications that require broad monitoring over time, space, and context with rapid self-organization. It will be simulated and evaluated using Network Simulator 2.
Este documento analiza el modelo de negocio de YouTube. Explica que YouTube y otros sitios de video online representan un nuevo modelo de negocio para contenidos audiovisuales debido al cambio en los hábitos de consumo causado por las nuevas tecnologías. Describe cómo YouTube aprovecha la participación de los usuarios para mejorar continuamente y atraer una audiencia diferente a la de los medios tradicionales.
The defense was successful in portraying Michael Jackson favorably to the jury in several ways:
1) They dressed Jackson in ornate costumes that conveyed images of purity, innocence, and humility.
2) Jackson was shown entering the courtroom as if on a red carpet, emphasizing his celebrity status.
3) Jackson appeared vulnerable, childlike, and in declining health during the trial, eliciting sympathy from jurors.
4) Defense attorney Tom Mesereau effectively presented a coherent narrative of Jackson as a victim and portrayed Neverland as a place of refuge, undermining the prosecution's arguments.
Michael Jackson was born in 1958 in Gary, Indiana and rose to fame in the 1960s as the lead singer of The Jackson 5, topping music charts in the 1970s. As a solo artist in the 1980s, his album Thriller broke music records. In the 1990s and 2000s, Jackson faced several legal issues related to child abuse allegations while continuing to release music. He married Lisa Marie Presley and Debbie Rowe and had two children before his death in 2009.
Popular Reading Last Updated April 1, 2010 Adams, Lorraine The ...butest
This document appears to be a list of popular books from various authors. It includes over 150 book titles across many genres such as fiction, non-fiction, memoirs, and novels. The books cover a wide range of topics from politics to cooking to autobiographies.
The prosecution lost the Michael Jackson trial due to several key mistakes and weaknesses in their case:
1) The lead prosecutor, Thomas Sneddon, was too personally invested in the case against Jackson, having pursued him for over a decade without success.
2) Sneddon's opening statement was disorganized and weak, failing to effectively outline the prosecution's case.
3) The accuser's mother was not credible and damaged the prosecution's case through her erratic testimony, history of lies and con artist behavior.
4) Many prosecution witnesses were not credible due to prior lawsuits against Jackson, debts owed to him, or having been fired by him. Several witnesses even took the Fifth Amendment.
Here are three examples of public relations from around the world:
1. The UK government's "Be Clear on Cancer" campaign which aims to raise awareness of cancer symptoms and encourage early diagnosis.
2. Samsung's global brand marketing and sponsorship activities which aim to increase brand awareness and favorability of Samsung products worldwide.
3. The Brazilian government's efforts to improve its international image and relations with other countries through strategic communication and diplomacy.
The three most important functions of public relations are:
1. Media relations because the media is how most organizations reach their key audiences. Strong media relationships are crucial.
2. Writing, because written communication is at the core of public relations and how most information is
Michael Jackson Please Wait... provides biographical information about Michael Jackson including his birthdate, birthplace, parents, height, interests, idols, favorite foods, films, and more. It discusses his background, career highlights including influential albums like Thriller, and films he appeared in such as The Wiz and Moonwalker. The document contains photos and details about Jackson's life and illustrious music career.
The MYnstrel Free Press Volume 2: Economic Struggles, Meet Jazzbutest
The document discusses the process of manufacturing celebrity and its negative byproducts. It argues that celebrities are rarely the best in their individual pursuits like singing, dancing, etc. but become famous due to being products of a system controlled by wealthy elites. This system stifles opportunities for worthy artists and creates feudalism. The document also asserts that manufactured celebrities should not be viewed as role models due to behaviors like drug abuse and narcissism that result from the celebrity-making process.
Michael Jackson was a child star who rose to fame with the Jackson 5 in the late 1960s and early 1970s. As a solo artist in the 1970s and 1980s, he had immense commercial success with albums like Off the Wall, Thriller, and Bad, which featured hit singles and groundbreaking music videos. However, his career and public image were plagued by controversies related to allegations of child sexual abuse in the 1990s and 2000s. He continued recording and performing but faced ongoing media scrutiny into his private life until his death in 2009.
Social Networks: Twitter Facebook SL - Slide 1butest
The document discusses using social networking tools like Twitter and Facebook in K-12 education. Twitter allows students and teachers to share short updates and can be used to give parents a window into classroom activities. Facebook allows targeted advertising that could be used to promote educational activities. Both tools could help facilitate communication between schools and communities if used properly while managing privacy and security concerns.
Facebook has over 300 million active users who log on daily, and allows brands to create public profile pages to interact with users. Pages are for brands and organizations only, while groups can be made by any user about any topic. Pages do not show admin names and have no limits on fans, while groups display admin names and are limited to 5,000 members. Content on pages should aim to provoke action from subscribers and establish a regular posting schedule using a conversational tone.
Executive Summary Hare Chevrolet is a General Motors dealership ...butest
Hare Chevrolet is a car dealership located in Noblesville, Indiana that has successfully used social media platforms like Twitter, Facebook, and YouTube to create a positive brand image. They invest significant time interacting directly with customers online to foster a sense of community rather than overtly advertising. As a result, Hare Chevrolet has built a large, engaged audience on social media and serves as a model for how brands can use online presences strategically.
Welcome to the Dougherty County Public Library's Facebook and ...butest
This document provides instructions for signing up for Facebook and Twitter accounts. It outlines the sign up process for both platforms, including filling out forms with name, email, password and other details. It describes how the platforms will then search for friends and suggest people to connect with. It also explains how to search for and follow the Dougherty County Public Library page on both Facebook and Twitter once signed up. The document concludes by thanking participants and providing a contact for any additional questions.
Paragon Software announces the release of Paragon NTFS for Mac OS X 8.0, which provides full read and write access to NTFS partitions on Macs. It is the fastest NTFS driver on the market, achieving speeds comparable to native Mac file systems. Paragon NTFS for Mac 8.0 fully supports the latest Mac OS X Snow Leopard operating system in 64-bit mode and allows easy transfer of files between Windows and Mac partitions without additional hardware or software.
This document provides compatibility information for Olympus digital products used with Macintosh OS X. It lists various digital cameras, photo printers, voice recorders, and accessories along with their connection type and any notes on compatibility. Some products require booting into OS 9.1 for software compatibility or do not support devices that need a serial port. Drivers and software are available for download from Olympus and other websites for many products to enable use with OS X.
To use printers managed by the university's Information Technology Services (ITS), students and faculty must install the ITS Remote Printing software on their Mac OS X computer. This allows them to add network printers, log in with their ITS account credentials, and print documents while being charged per page to funds in their pre-paid ITS account. The document provides step-by-step instructions for installing the software, adding a network printer, and printing to that printer from any internet connection on or off campus. It also explains the pay-in-advance printing payment system and how to check printing charges.
The document provides an overview of the Mac OS X user interface for beginners, including descriptions of the desktop, login screen, desktop elements like the dock and hard disk, and how to perform common tasks like opening files and folders. It also addresses frequently asked questions for Windows users switching to Mac OS X, such as where documents are stored, how to save or find documents, and what the equivalent of the C: drive is in Mac OS X. The document concludes with sections on file management tasks like creating and deleting folders, organizing files within applications, using Spotlight search, and an overview of the Dashboard feature.
This document provides a checklist for securing Mac OS X version 10.5, focusing on hardening the operating system, securing user accounts and administrator accounts, enabling file encryption and permissions, implementing intrusion detection, and maintaining password security. It describes the Unix infrastructure and security framework that Mac OS X is built on, leveraging open source software and following the Common Data Security Architecture model. The checklist can be used to audit a system or harden it against security threats.
This document summarizes a course on web design that was piloted in the summer of 2003. The course was a 3 credit course that met 4 times a week for lectures and labs. It covered topics such as XHTML, CSS, JavaScript, Photoshop, and building a basic website. 18 students from various majors enrolled. Student and instructor evaluations found the course to be very successful overall, though some improvements were suggested like ensuring proper software and pairing programming/non-programming students. The document also discusses implications of incorporating web design material into existing computer science curriculums.
1. Table of Contents:
I. Detailed Proposal Information......................................................................................................2
A. Innovative Claims...................................................................................................................2
B. Proposal Summary..................................................................................................................3
C. Research Objectives................................................................................................................4
D. Technical Approach and Evaluation.......................................................................................6
E. Statement of Work.................................................................................................................22
F. Schedule Graphic...................................................................................................................25
G. Teaming and Tasking............................................................................................................26
H. Project Management and Interaction Plan............................................................................27
I. Deliveries Description............................................................................................................28
J. Technology Transition and Technology Transfer Targets Plans...........................................29
K. Personnel and Qualifications................................................................................................30
L. Facilities................................................................................................................................35
M. Cost Summaries....................................................................................................................36
N. Organizational Conflict of Interest Affirmations and Disclosure.........................................38
O. Intellectual Property..............................................................................................................38
P. Human Use............................................................................................................................38
Q. Movie and Slides...................................................................................................................38
1
2. I. Detailed Proposal Information
A. Innovative Claims
Mobile wireless networks operating indoors face a bewildering shifting radio environment
that must be adapted to in order to provide robust communications. Heretofore network choices
have consisted of radio and network parameters. Small robots open the possibility of network
nodes that proactively move and sense in the real environment to improve the radio environment.
Robot motion expends high energy and so must be used parsimoniously in order to conserve en-
ergy for network communication. The fundamental questions become: 1) How do we operate in
the real space to optimize in radio space? and 2) How can we exploit networking, mobility, and
sensing to maximize network longevity? Machine learning and distributed control techniques of-
fer powerful tools to connect the actions, sensing, and goal space.
Dynamically redeploying nodes to meet network needs offers a powerful new dimension to
optimize network performance. In the LANdroids scenario small autonomous robots operate in
unknown indoor environments in order to self configure a network that provides long-lived con-
nectivity between mobile end users and a gateway. Our approach has two main elements: 1)
combined learning and control strategies to manage network connectivity in new and complex
environments; 2) identifying the critical energy tradeoffs at both design and operational stages.
The proposal addresses four important innovations in controlled mobility for wireless networks:
Network Radio Optimization: The strength of indoor radio links can be increased through
relatively small movements. However, the LANdroid must relay and so signals must be opti-
mized as a network and not for individual links. Our approach to network radio optimization
identifies spatial features, such as hallway corners, that yield robust improvements to network
performance. These features will be identified through detailed radio surveys and analysis. Exist-
ing radio technologies (e.g. 802.11n MIMO and directional antennas) will be assessed for their
system benefits.
Model Free Multivariate Extremum Seeking: Control theoretic approaches applied direct-
ly in signal space can optimize signals as a network. Our model-free approaches are robust to en-
vironmental changes, simple to apply, and provide basic optimization behaviors.
Learning Spatial Features and Optimal Control Strategies: Learning provides a means
to identify useful spatial features in new environments. We apply our experience in reinforce-
ment learning to optimally combine across feature-based and gradient-based optimization.
System Energy Management Optimization: Network longevity is a function of energy
spent on mobility, sensors, processing, transmission, and network overhead. We apply optimiza-
tion over all network resources to exploit these tradeoffs in a unified framework. System design
issues such as which sensors are most effective, where to do computing, and implicit sharing of
battery energy are addressed. Special attention will be paid to resolving the role of robot vision.
The University of Colorado (CU) has had a focused research effort over the past several
years to address these problems. Our interdisciplinary team has produced theoretical foundations
and practical algorithm implementations outlined in numerous publications that places us in a
unique position to implement viable solutions through each of the above innovations.
2
3. B. Proposal Summary
Main goals: The goal of LANdroids is to establish and maintain network connectivity while
maximizing network longevity. Our proposal has four technical goals: to identify exploitable fea-
tures of the radio environment (Page 8); to develop robust self-forming, self-healing, self-opti-
mizing, and energy aware network protocols (Page 9); to learn combined optimization tech-
niques that operate in real and signal space (Page 10); and to understand the system architecture
that will maximize performance at low cost (Page 16).
Tangible benefits: In rich, complex radio environments, the radio structure provides an op-
portunity to improve connectivity and increase network longevity. This research will enable
small robots to autonomously establish and maintain mesh coverage, extend network reach, dy-
namically adapt to network changes, and maximize network longevity (Page 6).
Critical technical barriers: Current radio models are insufficient for predicting indoor ra-
dio performance. Radio analysis focuses on link connectivity rather than network connectivity.
Battery constrained devices can not simply increase power indefinitely to maintain connectivity.
Current mesh networks can not exploit controlled node mobility. Research in controlled mobility
optimizes in real space and requires expensive localization techniques such as GPS. Simple robot
controllers do not work robustly in dynamic or cluttered environments. The LANdroid robot
must be low cost.
Main elements: We will experimentally evaluate the indoor radio environment to identify
exploitable radio and key spatial features (Page 8). We will design gradient-based methods for
connecting mobility in real space to network goals (Page 10). Robots will learn to find the key
spatial features (Page 12). Learning will optimally combine gradient and feature based control
(Page 13). Robot vision will be examined for its overall benefit to the system (Page 14). Robust
network coordination, resource management, and routing protocols will enable a system ap-
proach to sharing network energy resources (Page 9). System-level analysis will identify the ben-
efits of specific architecture and hardware designs (Page 16).
Summary of approach: Our network approach to radio analysis will yield better tools for
predicting network performance. The control approach will draw on our extensive robotics con-
trol experience to combine goals defined in spaces other than real space. Unlike previous work,
we select features and control strategies based on successful experience guided by human opera-
tors. The system approach to architecture and hardware design will better explore the perfor-
mance tradeoffs within the robot cost constraints.
Expected results: The results will be four-fold: 1) a better characterization of the ex-
ploitable features of the indoor environment including collected measurement data sets; 2) a
LANdroid system architecture that defines the most useful sensors, types of antennas, and pro-
cessing model; 3) a modular software library that will implement the proposed learning and con-
trol algorithms; and 4) communication protocol implementations for the mesh networking and
interface between robot hardware and control software.
Evaluation plan: The LANdroid program, as designed, has a rigorous performance-based
evaluation done four times per year throughout the program. This is a uniquely objective and ap-
propriate evaluation scheme in which we look forward to participate. This will be augmented by
an internal CU evaluation test bed based on our extensive wireless network test bed and field ex-
perience.
Cost: Year 1: (12 mo.) $999,749., Year 2: (12 mo.) $999,489., Year 3: (12 mo.) $999,979
3
4. C. Research Objectives
C.1 Problem Description:
The research objectives of this proposal are 1) to identify the system architecture, hardware,
and strategies which can best exploit the indoor and urban radio environment and 2) to develop a
robot learning and control framework that meets the network goals of connectivity and longevity
in a complex dynamic environment.
C.2 Research Goals
Radio Environment Characterization: It is not well understood what radio optimizations
are possible in a dynamic cluttered indoor environment. The LANdroid antennas are electro-
magnetically shorted by the close proximity to the ground and inefficient. Small movements may
be able to improve signal strength but these may be short-lived, hard to track, and better captured
by other means such as diversity or MIMO. A key insight is that the primary purpose of the
LANdroid is to relay. It is not enough for the signal strength to be better for a single LANdroid
neighbor. Therefore, the LANdroid must make a joint optimization of the signal strengths of all
its neighbors. We will perform a measurement survey in an indoor environment to evaluate the
nature of signals near the ground and the stability of small scale improvements. We will identify
and characterize the spatial features which are likely points of good signal. We will study the roll
of different antenna types in exploiting the radio environment for the benefit of the LANdroid
system.
LANdroid System Hardware: The LANdroid System consists of the gateways, LANdroid
robots, and edge nodes. The radios on the war fighter and the gateway have unique capabilities
that can be exploited for improved system performance. For instance, the gateway is expected to
be vehicle mounted and well powered, while the war fighter can add intelligence to LANdroid
drop decisions and provide the necessary mobility. These radios are generally better positioned at
higher elevation than the LANdroid on the ground. Even among LANdroids, some may have bet-
ter positions or more information about the system state. The different node types can have a va-
riety of radio, sensor, or processor hardware which can improve its performance. We will per-
form system analysis to assess the cost, performance, and energy tradeoffs for these components
within the LANdroid system. Special attention will be paid to the role of antennas and video
cameras since they may be critical to good performance. This analysis will provide guidance to
the LANdroid robot development.
System Energy Model: The control software requires a detailed power model in order to
make rational decisions between different actions. The model needs to consider both power con-
sumption and stored energy of individual nodes and the system as a whole. This model will be
the basis of analysis, planning, and optimization described below. This model will also enable
specific analysis of hardware components and their role in the LANdroid system.
Decentralized, Model-Free, Gradient-based, Motion Optimization in Signal Space: The
robot needs basic behaviors to connect actions in real space to network goals in signal space.
Control theoretic approaches applied directly in signal space can optimize signals as a network.
4
5. In a complex environment fewer a priori assumptions are generally better. Our model-free ap-
proaches are robust to environmental changes, simple to apply, and provide basic optimization
behaviors. The control techniques will be modified to operate directly on performance gradients
since, ultimately, the network cares about performance measures such as throughput and latency
rather than signal strength.
Learning Spatial Features: To take advantage of spatial features (such as hallway corners),
the robot must be able to efficiently identify them in the environment. However, these features
are generally complex concepts and can appear in many forms. Human operators will present de-
sirable spatial features to the robot so that it can learn to identify these features. Offline learning
will be performed in the laboratory, while online learning will be used in the field to adapt the
representation of the features to the local environment. Initially this identification will be on a
single robot basis, but distributed methods will be developed to enable enhanced identification at
lower energy costs.
Learning Optimal Control Strategies: The robot has a large number of options it can per-
form at any given time ranging from sensing, communicating, to moving. The CU team has al-
ready developed successful learning-based control strategies for the DARPA LAGR project.
These will be adapted to the LANdroids environment. Initially the learning will be guided by a
human operator. The goal will be to optimally combine gradient and spatial feature based control
techniques.
Vision-Based Cost Estimation (VCE): Video is potentially very useful in the LANdroid
system. It will enable more energy efficient path planning since it can avoid obstacles and dead
ends. Video can identify spatial features at a distance without movement. Video provides a more
stable reference frame. However high frame rate and resolution video is expensive in power.
Therefore we will modify existing algorithms that can use reduced capability video. Video will
also be used to enhance network situational awareness whereby robots can visually estimate rela-
tive positions and track future paths by watching other robots or the warfighter.
Network Protocols: Ad hoc networks enable the LANdroid system to provide extended
connectivity. While many ad hoc protocols exist, none of them explicitly include controlled mo-
bility as a network primitive. Further, the routing must consider other network resources such as
energy at each node. The network must also efficiently and robustly enable the cooperation and
sharing of network resources. A key problem will be protocols for finding other nodes when the
network is disconnected. The research will initially focus on connectivity as the primary network
goal. However, other quality of service measures will also be considered.
C.3 Expected Impact
This proposed project will improve our insights into how to tie radio space goals tightly with
robot mobility. If successful, it will solve open problems in how to use mobility to enable net-
work self configuration, dynamic tethering, intelligent relaying around obstacles, self healing and
self optimization while extending network longevity. We will deliver a set of modular software
libraries which implement the technology described above. These libraries will constitute the
first integrated controlled mobility wireless network implementation.
5
6. D. Technical Approach and Evaluation
Our approach is based on optimizing the overall LANdroid system. The LANdroid system
consists of three major components which each contribute to the overall goals of network con-
nectivity and longevity as shown below.
Gateway LANdroid Edge node (Warfighter)
Comm end point and relay Comm relay Comm end point and relay
Permanent asset Reusable/disposable Permanent asset
Cost $10k Cost $0.1k Cost $1k
Features
Energy rich Energy constrained Energy constrained
Computing rich Computing constrained Computing constrained
Mobility exogenous to comm Comm controls mobility Mobility exogenous to comm
Can have multiple radios Can have multiple radios Can have multiple radios
Can have multiple antennas Can have multiple antennas Can have multiple antennas
• Participate in LANdroid sys- • Participate in LANdroid sys- • Participate in LANdroid sys-
tem protocols tem protocols tem protocols
Roles
• Bridge to other networks • Can self-sacrifice for connec- • Initialize LANdroid
• Support network functions tivity and network longevity
The main evaluation tasks center on self-configuration, tethering, intelligent relaying, self-
healing, self-optimization, and intelligent power management. We describe at a high-level our
vision for each of these and provide details in the following section.
Self-configuration: There are three separate problems here. The first is given a set of con-
nected nodes, how best to connect edge nodes to the gateway. This is the basic problem of ad hoc
networking. Standard MANET protocols will form the basis of our solution. However, these pro-
tocols will be augmented to include power, mobility, learning, and sensing resource management
as noted below.
The second problem is given a disconnected set of nodes, how do they find each other to
form a connected network. We will investigate a number of strategies such as high-power bea-
cons and coding that will extend range and help nodes find the presence of other nodes as well as
systematic search algorithms. Note that the gateway can support higher power radios, and more
sophisticated antennas that can potentially provide deeper (but only one way) signal penetration.
In addition to these radio solutions, the LANdroid will search and reason over likely physical lo-
cations that will be better connectivity locations (e.g. hallway intersections or doorways).
The third problem is how to signal to the warfighter when to drop a LANdroid. Here a coop-
erative solution will form between the warfighter radio and the carried LANdroid. The warfight-
er radio will monitor its network connectivity to the gateway. As the connection degrades, an es-
timate will be made of the path back to recent points of good connectivity. When the signal has
degraded sufficiently, the LANdroid will signal to be dropped. The dropped LANdroid is closer
to the ground and has worse signal and may be disconnected. It proceeds back toward the last
good connectivity point using the protocol for disconnected nodes but with a prior distribution on
the best search path. Note that the drop decision is not simply a signal strength threshold. A teth-
ered LANdroid following a warfighter may signal it is turning a corner and about to solve the
weak link, removing the need to drop. Or, a warfighter in a room to room search may have a pat-
tern of fluctuating signals that warrants weighing signals over a longer period.
6
7. Tethering: Tethering encompasses all of the network morphing and stretching needed to
provide connectivity to edge nodes. We envision tethering that is proactive and reactive. In reac-
tive tethering, when an edge node signal starts to degrade, the network might first choose to in-
crease transmitter power. If the signal continues to degrade, LANdroids will perform a gradient-
based distributed optimization to improve the edge node connectivity.
Proactive tethering considers the problem of multiple LANdroids in close proximity. Based
on traffic, remaining energy, and other factors, the LANdroids will spread out in order to in-
crease the physical area encompassed by the connected network. The spreading will be guided
by signal gradients and the physical environment. This will help to connect disconnected nodes
and to avoid network disruptions as warfighters move through an area.
Intelligent relaying: Intelligent relaying requires decisions on how traffic is routed and how
the LANdroid relays choose to position themselves. Traffic routing will use energy aware algo-
rithms that can load balance rather than use simple shortest path. Since LANdroid movement is
relatively expensive in terms of battery energy compared to computing, communication, and
sensing; the LANdroid must be parsimonious in its movement choices and consider carefully
where it stops. We will use learning mechanisms to identify key spatial features such as hallway
corners which are likely to serve as good relay points now and in the future. The same mecha-
nisms will be used to make predictions whether the expected energy cost of a move now will
likely be rewarded with less future energy cost or better connectivity.
Self-healing: The network must adapt to changes that are external or internal to the network.
Internal changes include new sources of traffic that cause congestion; or network elements that
fail. External changes include new sources of interference or changes to the environment such as
a door that closes. These problems are addressed first by adaptive networking protocols to route
around points of congestion, interference, or failed nodes. Then learning techniques identify
when such changes warrant repositioning of the network. The actual movement can be guided by
gradient techniques. Some changes are predictable (e.g. a node running out of power) and if
needed the network can proactively respond to the upcoming change.
Self-optimization: The LANdroid network operates in an environment that varies over
space and time. The problem is determining which optimizations over space are stable enough
over time to warrant spending energy to seek out. Edge nodes are mobile and the signal strengths
are highly dynamic. However, many LANdroid nodes will be stationary and so become stable
points to optimize around. Cooperative protocols will share information about the environment.
For instance, reinforced concrete has high penetration loss, while wood frame construction has
significantly less. Nodes that can cooperatively identify the construction can adjust their gradient
and node placement algorithms. In reinforced concrete positioning at doorways and corners is
critical while in wood frame distributing more uniformly is optimal. Antenna technologies may
provide significant gains in this environment. For instance, a high-gain antenna can reduce multi-
path and increase effective signal strength. We will survey the current state of available antenna
types from a system perspective to understand which are most useful for the LANdroids sce-
nario.
Intelligent power management: The LANdroid system has many opportunities to trade be-
tween sensing, communication, processing, and movement in order to conserve network energy.
We will study these tradeoffs within the cost constraints of the gateway, LANdroid, and edge
nodes. For instance, our initial hypothesis is that a video camera will be a key energy saving
component. It will enable more energy efficient path planning since it can avoid obstacles and
dead ends. Video can identify spatial features at a distance without movement. Video provides a
7
8. more stable reference frame. For instance, if a node suddenly becomes isolated, it can use video
references of past locations to backtrack even when no radio signal is present or after dead reck-
oning has been lost because it was kicked. These benefits must be weighed against video’s cost
and energy drain. Similarly, other radio, antenna, sensor, and processing tradeoffs will be stud-
ied.
Energy will be managed as a system. LANdroids can altruistically spend power on commu-
nication, movement, processing, and sensing in order to preserve critical nodes’ energy. Routing
can avoid using critical nodes. Nodes can move to make the critical node’s communication easi-
er. Computing can be offloaded to other nodes or sent to the processing and energy rich gateway.
D.1 Technical Approach
The technical details outlined below reflect our experiences in radio frequency environ-
ments, wireless network implementation, controlled mobility in networking, distributed coopera-
tive control, and robotic navigation. These technical approaches represent years of research, im-
plementation, and testing in real environments by the PIs. As such, our proposed solution does
not represent fundamental research, but rather the application of sound and tested approaches to
the LANdroid system.
Radio Environment Characterization: It is not well understood what radio optimizations
are possible in a dynamic cluttered indoor environment. Radio signals are well known to vary by
tens of dB over both small (~ one wavelength) and large distances. Small movements may be
able to improve signal strength but these may be short-lived, hard to track, and better captured by
other means such as diversity or MIMO. Large scale movements are known to provide signifi-
cant improvements. Some of these may be more critical to network connectivity (e.g. a relay
point around a corner) while others may be more ephemeral (e.g. a better location within a
room). This characterization is needed for reliable planning and optimization. A key insight is
that the primary purpose of the LANdroid is to relay. It is not enough for the signal strength to be
better for a single LANdroid neighbor. Therefore, the LANdroid must make a joint optimization
of the signal strengths of all its neighbors.
There are a number of challenges for a small robot located close to ground. At 2.45GHz, the
wavelength is large, and the robot is electrically small as well as electrically close to the perfect
or imperfect ground, resulting in a low-gain antenna with possibly low impedance. Unconven-
tional antennas will need to be investigated from a system standpoint, along with ways to miti-
gate heavy multipath effects. An example is a combination of four corner-cube loaded monopole
antennas (used often in the millimeter-wave region due to their simplicity, e.g, [Gro89]), with
four beams of the radiation pattern pointing roughly 40 deg from the horizontal plane, and with a
local common ground which makes the antenna relatively insensitive to the surface properties.
The four elements can enable spatial and polarization diversity and a combined monopole-loop
or frame antenna feeding the corner-cube reflector can enable in addition field diversity [Jak94].
A relevant figure of merit is the level of independence of the different diversity levels, which
will affect the diversity combining, as shown, e.g. in [PoP02, ZRP05]. Several such antennas
which satisfy the robot space constraints will be investigated in terms of the influence of their
combined radiation patterns on the network system optimization.
To characterize the environment we will rely on both empirical measurements combined
with analysis. We will place dense grids of radio nodes in a space and simultaneously measure
variations in the environment between different node pairs over time to capture the network val-
ue of different locations and their temporal stability. This data will feed measurement-based sim-
8
9. ulations of network performance.
One challenge with small robots 100
Both at 1 meter
is that they are close to the ground. One on the floor
The figure at the right shows that ra- Both on the floor
Throughput (Mbps)
dios at one meter above the floor have C
o
C
o
significantly better reach and can 10 r r
n n
maintain greater than 10Mbps around e e
r r
one hallway corner and greater than 1
Mbps around two hallway corners. 1Mbps
However, placing either or both on the 1
1 2 3 4 5 6 7
floor causes the rate to drop below 1 Location
Mbps at the first corner and communi- Figure 1: Throughput vs. locations along a hallway
cation ceased around the second cor- between an 802.11n MIMO AP and laptop.
ner. One goal will be to understand
whether simple modifications to antennas will improve this situation. However, a more critical
question is the role of the antenna in the larger network optimization problem:
• Multiple directional antennas pointing in different directions indicate the angle of arrival. This
aids navigation and gradient following. In the indoor multipath envi-
ronment, following the strongest signal may lead to dead ends as
shown at right. The second strongest direction can indicate alterna-
tive paths that would assist navigation.
• Directional antennas improve connectivity without expending more
power. They reduce interference and increase SNR. Potentially
avoiding the need to move the robot. Tethered LANdroid
• Small-scale radio effects can be explored without movement. Multi- follows signal
gradient into closet
ple antennas provide diversity against fading and react at electronic
switching speeds compared to robot motion speeds.
We emphasize that the goal of this work is to ensure that system considerations are incorpo-
rated into the antenna design. The antenna technologies discussed here are all COTS and are not
in themselves a focus of the research.
Along the same lines we consider other radio enhancements that can be leveraged to save
power. Performance can be improved by changing channels. Different channels will observe dif-
ferent multipath fading and can avoid interference and jamming. Simple RF measurement de-
vices can be built into the robot that allow it to efficiently survey the spectrum and find channels
that have less noise, interference, or jamming.
Energy Aware Ad Hoc Routing: The energy cost to deliver a packet across a network de-
pends on the route the packet follows and the power it is transmitted along the way. For typical
IEEE 802.11 interfaces, the dissipated energy is not a strong function of transmit power and is in
fact dominated by the majority of the time that the interface is idle awaiting reception. This sug-
gests two directions for research. First, saving energy in the transmitter will best be achieved
through shutting down the interface as often as possible. We will explore simple protocols such
as shutting down interfaces when the channel is idle (say for 10msec) but waking up at synchro-
nized periodic intervals (say every 100msec) to send, relay, and receive traffic as long as there is
network activity. This will enable the delay target of less than 500msec to be met while provid-
ing a significant potential for energy savings.
Second, we observe that the transmit power can be greatly increased at little energy cost.
9
10. This added power can facilitate range and connectivity. In our indoor experiments (using the
same setup as in Figure 1) we compared many recent 802.11 COTS antenna technologies (e.g.
MIMO, beam steering, etc.). The longest range was always an ordinary 802.11b card combined
with a 1 W amplifier. In other words, raw transmit power is a useful dimension to explore.
The goal here is to create a radio with variable transmit powers that might be able to go in
steps from a few mW to up to more than 1W. The high end would be useful initially since an
unattached node could beacon at high power to find other nodes. This is orders of magnitude
more efficient than the robot trying to search through movement to find other nodes. For instance
sending one 3W beacon packet every second would require less than 10mW power on average
and is likely to find other nodes in seconds. Mobile searches would require much higher power
to drive the motors and take much longer. High power transmission interferes over a large area,
overloads the front end of nearby nodes, and quickly drains the battery. Thus the transmitters
should send at lower power whenever possible. We have designed ad hoc routing protocols that
include mechanisms for nodes to estimate the minimum power needed to close a link that we will
apply to the LANdroid scenario [DBB02].
Maximizing network lifetime can be facilitated
through network wide routing decisions. Simply using
transmitter power as a metric and choosing minimum
power paths does not maximize network lifetime. Traffic
can get funneled through nodes with the best connectivity
causing their batteries to quickly drain. We use a concept
of maximum flow life curve [BrG01,BGZ01] to balance
energy drains and effectively treat battery energy as a
network resource. The figure at the right shows the traf-
fic flow carried in a network over time (averaged over 100 network instances). The maximum
flow life curve approach (MFLC) is able to increase network longevity by 50% (at 90% remain-
ing flow) compared to minimizing the power cost of each route (MC).
Decentralized, Model-Free, Gradient-based, Motion Optimization in Signal Space: De-
centralized model-free, gradient-based, motion optimization in signal space will be implemented
using modifications of multivariable extremum seeking algorithms developed by the PIs for lin-
ear communication networks of unmanned aircraft [DiF07]. This approach brings a number of
features that are ideally suited for LANDroid mobility control including:
• Decentralization: Decentralized control schemes are characterized by local decision making in
which a given agent selects its action based only on information it has gathered from its own
sensors and data shared by its “neighbors”. The agent has no knowledge of the global state of
the network or explicit global goals. However, through these local interactions group behavior
emerges that achieves desirable global performance objectives. The main advantages of de-
centralized control schemes are their scalability and robustness to node or network failures.
• Model-Free: Multivariable extremum seeking (MES) [ArK02] controllers are adaptive, model
free controllers designed to drive the set point of a dynamic system to an optimal, but unpre-
dictable location defined by a performance function that is only known to have an extremum.
Thus, the system can adapt to robot mobility limitations and the radio propagation environ-
ment without explicitly modeling them and the mapping from signal space to physical space
is implicitly considered.
• Gradient-Based: In order to find an extremum point in the unmodeled system, MES algo-
rithms follow gradients in order to improve performance. This local control approach elimi-
10
11. nates the need to search
large regions of the envi-
ronment, reducing costly
power loss due to mobility.
• Spatially Distributed: Net-
work coverage tasks such
as self-configuration, self-
optimization, self-healing,
and tethering can all be
achieved through local Figure 2. a.) Self-configuration of a single LANDroid between
source and destination. b)Self-optimization of LANDroid chain.
control only. That is, local
interaction rules can be designed that lead to optimal global behavior. This ability results from
the spatially distributed structure of the problem in which gradients of the global objective
can be determined locally as functions of the state of an agent and its neighbors only (i.e with
no global information).
Multivariable extremum seeking (MES) [ArK02] controllers are adaptive, model free con-
trollers designed to drive the set point of a dynamic system to an optimal, but unpredictable loca-
tion defined by a performance function that is only known to have an extremum point. The MES
algorithm developed by the PIs [DiF07] differs from standard MES algorithms in that the re-
quired external dither signal is provided by periodic motion of the robot about some center point
and we add an external ‘virtual plant’. The MES approach developed by the PIs is a variation of
the algorithm given in [ArK02] and therefore stability and performance results can be taken and
applied. Recent work by [KZA07] has extended the ES framework to nonlinear models that can
capture the guidance level behavior of the LANDroid robots, reduce the required excitation (i.e.
mobility), and eliminate the need for any positioning information.
A key MES framework strength is that a model of the environment and dynamical system is
not needed. Thus, the approach can be applied directly in signal space in order to optimize the re-
ceived signal strength. The PIs have developed this framework specifically to optimize capacity
in linear communication networks of unmanned aircraft using received signal strength only
[DiF07]. Figure 2 shows simulation results using the MES framework to self-optimize a linear
relay network. Since the MES control law is adaptive and model free, the self-configuration,
self-healing, self-optimization, and tethering task behaviors occur as needed. In fact, the network
has no explicit knowledge of which of these tasks
is being performed. The decentralized control
laws continually seek to improve the network in
response to the (unmodeled) environment. Figure
3 shows example data collected using a similar
approach indoors.
The MES approach developed by the PIs can
be applied to any gradient-based decentralized
control scheme for which a local function can be
measured that has the same (local) gradient as the
global objective. This includes the large body of
work currently devoted to the synthesis of simple
interaction rules that result in desired group-wide,
Figure 3. Signal strength versus time using
global behaviors such as distributed macrosen-
the gradient ascent approach indoors.
11
12. sors, coverage control, and robot swarming. For example, robot swarming algorithms are based
on potential energy functions of relative range and the gradient of the potential leads to velocity
control inputs. This gradient information is not available when the robots only have relative
range sensors (e.g. can only measure signal strength). The MES framework estimates the gradi-
ent information while ascending (or descending) it.
In addition to applying the MES framework to existing coverage control and robot swarming
algorithms, we will develop new variations that specifically address the LANDroid environment.
For example, swarming and coverage control algorithms are designed to react instantaneously to
changes in the network. This process uses considerable power as transient responses must settle
out of the network. In the LANDroid scenario we need to consider the nature of the warfighter’s
decision-making and movement processes. For example, a warfighter may briefly explore a new
room before proceeding onward. A LANDroid network tethered to the warfighter should not en-
ter that room only to vacate it moments later. Thus, adding nonlinear elements such as hysteresis
to the virtual force fields that drive the LANDroid will improve the overall performance (e.g.
power usage) of the system.
Finally, the model-free, gradient-based approach complements the feature-based approach to
motion planning. In particular, the MES approach only finds local extrema and can get caught
behind obstacles or dead-zones in the radio propagation environment. Key research questions
pursued during this project will be the appropriate balance between the two approaches and de-
veloping the ability to recognize when a switch from one method to the other must occur.
Learning: Machine Learning and Statistical algorithms will play two roles in the proposed
work. First, they will be used to learn Spatial Features, online as the LANdroids are deployed,
and offline during test deployments designed to emulate a real deployment. The online learning
is required because no constructed test environment can account for all environment types an ac-
tual deployment of LANdroids will encounter. Second, they will be used to learn optimal control
strategies in sensor space, Spatial Feature Space and Signal Gradient Space. Both of these roles
of Machine Learning have their foundation in actual deployments under the DARPA LAGR pro-
gram and the NSF “Human-to-Robot Skill Transfer” grant.
Learning Spatial Features: The Colorado Team has a significant history of using sensor
data to learn such concepts as traversibility and non-traversibility in unstructured outdoor envi-
ronments [GMO07, PMG07]. We propose to use these same techniques to learn relevant Spatial
Features about the environment. These techniques are density based classifiers that have the fol-
lowing properties: 1) No assumption is made on the number of classes (Spatial Features) that
will need to be learned for successful wireless communication; 2) Learning data only becomes
available in small subsets (i.e. the unrealistic assumption that all necessary learning data is avail-
able at once is not made); 3) The features used for each Spatial Class may differ, and a formal
framework for feature selection is used [Str06]; finally, 4) The learned models can predict when
they are applicable to a particular LANdroid deployment, and therefore should be used. This im-
plies that the LANdroid robot will know when it doesn’t know, and can be directed to appropri-
ately act to learn what is necessary. Learning these models involves the use of dot products, Sin-
gular Valued Decomposition (in low dimensional state space), and histogram building, while the
application of these models requires passing the results of dot products through histograms.
These operations are computationally efficient, allowing online learning with limited CPU pow-
er, making the learning framework ideal for the LANdroid project.
For offline learning, the mapping of sensor readings to Spatial Features will be learned as
follows. Examples of such Spatial Features as doorways, corners and walls, will be “shown” to
12
13. the robot by placing it near them. A classifier (of the type discussed above) will then be built for
each Spatial Feature. This learning will take place in environments that mimic those that the
LANdroids will eventually be deployed in. Note that the Spatial Features that will actually be
useful, and therefore be learned, is an open question that this proposal is intended to address. In
essence we will learn only about the Spatial Features that help the robot optimize its ability to
find optimal locations for wireless transmission (see Learning Optimal Control Strategies dis-
cussed below).
For online learning during an actual LANdroids deployment, the Spatial Features will be
learned as necessary. For example, if a soldier runs through something that the robot thinks is a
wall, the robot can take a sensor reading of the area, and classify it as a doorway. Thus it learns
the concept of doorways in the current deployment environment. Similarly, if the robot runs into
a wall (or corner) when its models “believe” the path is clear, the robot can backup and build a
classifier of the wall (or corner), allowing it to better optimize paths towards areas of better wire-
less conditions, using less battery life. Once again, the concept of wall or corner can be learned
with respect to the current environment. Similarly, other relevant Spatial Feature concepts can be
learned during a deployment.
Finally, the Spatial Features models are small (about 1 KB each), allowing them to be shared
by all LANdroids during a deployment, with minimal load to wireless communication.
Learning Optimal Control Strategies: Two types of learning paradigms will be explored
to learn optimal control strategies from Sensor Space, Spatial Feature Space and Signal Gradient
Space readings. The first is a Reinforcement Learning (based on the Markov Decision Process
framework) approach that members of the Colorado Team have developed in the past [GKU03,
GrU01a, GrU01b, GrU00, GrU04]. The second is a new framework for learning fast, intelligent
motion planning using available sensors [ORG07]. This second framework, referred to as Cost
Function Learning, combines domain specific learning of cost functions from available data with
fast A* search [RBB07].
The Reinforcement Learning approach involves probabilistic reasoning on whether the robot
should follow the Signal Gradient, choose paths based on Spatial Features, or combine both of
these inputs. We will develop a set of standard behaviors such as “go towards wall”, “go towards
room center”, “find room corner”, “follow soldier”, “move in the direction the soldier came
from”, “follow signal gradient”, “backtrack current motion”, “randomized motion”, as well as
combinations of these behaviors. A policy gradient Reinforcement Learning framework will be
used to switch between these behaviors based on sensor observations [GrU04]. The key to this
approach is that learning is both fast and efficient, requiring relatively few test deployments to
achieve locally optimal policies. In addition, we will investigate the possibility of making the
state space sufficiently compact, allowing us to investigate the use of standard Value Function
Reinforcement Learning and Dynamic Programming solutions [SuB98]. These algorithms all re-
quire a reinforcement signal from the environment to learn optimal behavior transitions policies,
the choice of which can greatly influence the quality of the final control policies learned. We
propose to investigate a variety of different reinforcement signals [GrU01b], including combina-
tions of battery life length and average wireless signal strength.
The Cost Function Learning approach involves learning to combine all sensor information
into a single cost map that, when A* is used, produce optimal behavior with respect to maintain-
ing wireless signal strength and prolonging battery life. The cost function mappings will be
learned in test settings by having a human operator demonstrate “optimal” control strategies
[RBB07]. These strategies will be determined by experimentation, having the human operator
13
14. move the robot in various ways and only learn the cost function mappings that produce the best
results. In this framework, the human becomes key in influencing which types of Sensor Space,
Spatial Feature Space and Signal Gradient Space readings are relevant, not by choosing them di-
rectly, but by executing robot actions that are near optimal and allowing a learning algorithm to
determine how to combine these readings into a cost function that will achieve near optimal
robot behavior autonomously.
Vision-based Cost Estimation: We propose adding one or more camera devices to the
robot platform to facilitate safe and efficient navigation through the environment. We argue that
for the proposed robot configuration, sensing and associated calculation has a much lower draw
on battery resources than robot motion. Using Computer Vision to identify the constraints of the
physical environment and restrict planned motions to those which are safe and have high poten-
tial payoff make the cost of added devices worthwhile. Sophisticated camera modules designed
for the cell phone market provide high sensitivity and resolution and operate at 150-250mW
while capturing 30 fps. Since we expect to work at relatively low image resolutions, cameras
which satisfy our requirements are available for $5-10 per module.
In the simplest case adding one camera will allow the robot to choose motions which avoid
obstacles and allow identification of environment features (doorways, corridor junctions) which
potentially improve the LANdroid’s ability to relay signals. More cameras provide views in mul-
tiple directions which could allow the robot to track the warfighter as s/he moves on after drop,
as well as analyzing more of the environment without the need to rotate the robot. Depending on
the mounting configuration multiple cameras allow us to reconstruct the shape of the environ-
ment without any robot motion, using sparse or dense features. As part of our work we plan to
explore the space of camera configurations and Vision-based measurements to identify the costs
and benefits of each. Essentially we want to identify which measurements of the space will best
allow us to achieve the LANdroid objectives of maintaining coverage and preserving battery life.
Cameras will be mounted on the robot platform in a variety of configurations for evaluation
of cost/performance tradeoffs. There will always be at least one forward facing camera, addition-
al cameras may form stereo pairs or panoramic rigs. In all cases cameras will be strongly cali-
brated providing both intrinsic parameters (focal length, principal point, skew) and the extrinsic
transformation from camera to robot coordinate frame.
In general the goal for a LANdroid is to find its optimal pose with respect to signal strength
and then carry on with the real mission of providing reliable communications. For the most part
we expect the sensory processing to be in a sleep mode. The question then is when do we need to
activate the vision system? Naturally at drop the LANdroid must seek out the local optimum for
signal coverage, and if a neighboring node in the mesh is added or fails the robot must adjust to
the changes in the signal profile. Any time robot motion may be required we anticipate sensing
first. Another possibility is for the vision system to provide some level of situation awareness, by
periodically capturing frames to identify changes or motion in the environment. Although not
specifically part of the LANdroid mandate, the availability of distributed cameras with commu-
nication capacity could provide information about other warfighters in the area, fire, falling de-
bris or other hazards.
The first task of the vision system is to provide information about the immediate environ-
ment to guide robot motion. Work on localization for indoor navigation has frequently exploited
depth calculation through stereo [MaS87,MuL00] or structure and motion calculations [BoP95]
to identify free space and obstacles for mapping and navigation. For our evaluations, single cam-
eras or panoramic configurations with limited overlap allow computing sparse or dense scene
14
15. structure through tracking scene motion as the robot moves. Stereo configurations can compute
sparse or dense depth information through correspondence and triangulation, before and during
robot motion. The purpose of reconstructing the shape of the environment is to provide informa-
tion about the hard physical constraints present, so we can combine them with signal strength in-
formation to determine the optimal feasible pose for the robot.
We hypothesize several vision-based calculations which will provide information on robot
poses which optimize signal strength thus reducing the search space. The first is to track the war-
fghter after robot drop. Since we are propagating the signal to the warfighter, the direction of de-
parture provides information about the probable location of the next LANdroid in the mesh. An-
other possibility is that certain features in the environment can be exploited with the expectation
of improving mesh coverage. First we want to locate doorways and corridor junctions along the
trajectory of the warfighter where positioning the robot may improve transmission. Another po-
tential improvement in signal strength can be obtained by moving to an interior corner.
We assume that the robot rapidly achieves a ready state when dropped. After drop we esti-
mate gross heading of the warfighter in order to approximate the direction of next node/LAN-
droid in the chain. Observing the warfighter turn a corner or pass through a doorway gives infor-
mation about the space as well as potential information for optimizing pose. Extensive work on
identifying and tracking people exists in the literature [SBF03, LuT01], particularly in the con-
text of identifying pedestrians for automated driving [Lom01]. In the simplest scenario differ-
encing techniques allow us to identify changing regions as the warfighter moves, and simple
blob tracking should suffice to approximate his gross heading. Reasoning about where and when
the person tracker fails will help identify important doorways and turns in corridors.
Historically many indoor navigation systems have used doorways and corridor geometry to
localize and map the environment [DeK02, KoP95, KrB88]. Typically these systems use edge-
based representations where particular configurations of linked edge segments are identified as
doorways based on viewing constraints. We will provide edge structures as well as color and
texture information from the hypothesized region to learn a door detector. Identifying junctions
in corridors is somewhat less well defined, but we will use the same process for learning a junc-
tion detector.
Identifying internal corners where walls meet requires examining dense depth information
and determining plane intersections consistent with wall intersections. The structured nature of
indoor environments allows us to also test a sparse edge-based approach which exploits classic
blocks world edge configuration constraints [Rob65] along with edge-based structure and motion
calculations to hypothesize corners. Again we pass our image-based evidence to the Machine
Learning framework to generate a more robust room corner detector.
Finally there are a number of techniques that could be used to help determine the relative
position of LANdroids in the mesh. Cameras could be used to visually identify signals from oth-
er robots, for example an LED flashing, assuming the robots have lines of sight between them. If
the robots share a common visual space they can locate and communicate common visual land-
marks and compute their position based on the relative viewpoint, for example by exchanging
SIFT features [SLL02] and computing relative pose based on triangulation.
Another space for evaluating cost tradeoffs for vision is the computational load based on the
resolution and complexity of detection and extraction calculations performed. In general we an-
ticipate using low resolution (120x160 pixel) images to reduce computational load. Another pos-
sibility is to apply calculations to smaller regions of interest at higher resolution. For example we
might only reconstruct dense stereo for image regions on or near the ground plane rather than the
15
16. entire image. The calculations we anticipate include edge and corner detection, image differenc-
ing, blob finding and tracking, and image correspondence.
Energy Reduction Through Integrated System Design: One of the primary challenges
facing the Landroids project is making the most efficient use of the available energy while deliv-
ering reliable data forwarding. This entails conserving energy at every stage of movement, detec-
tion and data processing. During motion phases, the majority of the system power will be used to
power the drive train and the majority of the system energy can be saved by efficient planning
and suppressing robot motion that is not useful, as described in other portions of the proposal.
During non-motion phases, the majority of energy will be used for transmissions and relay-
ing communication or, during idle periods, in determining when to actively engage in communi-
cation. Despite these different “phases” an integrated design avoids micro-optimizing the power
budget of a single component at the cost of overall performance or power budgets.
Reducing Energy During Planning Phases: During the planning phase, the LANdroid
needs to make the most use of computation and sensors to reduce movement. Computation costs
can be controlled by using dynamic voltage scaling (DVS) to reduce CPU costs. Depending on
the particular component, voltage scaling can reduce the power needed by a processor such as
the Intel PXA 255 by a factor of 6 [SRH05] by switching the CPU speed from 400Mhz to
100Mhz and reducing the voltage from 1.3V to 1V. Most work on DVS has demonstrated that it
is difficult to extract energy savings from DVS. Our experience [GLF00] has been that automat-
ed voltage scaling methods perform poorly for applications considered in isolation; others
[FlM02] have shown that capturing application interactions improves automated power control if
deadlines can be inferred or provided. However, sensing applications, such as trying to locate an
adjacent access point are more concerned with reducing power since the mission time can not
usually be decreased by faster computation. In this application domain, we think the individual
applications can provide sufficient information to allow automated control with out attempting to
estimate the computing demands of the system.
Sensors can reduce system energy by reducing the need to move. As described, vision based
sensing can be used for semantic analysis and gradient control methods can follow localized en-
ergy. RF sensing can be improved by a combination of protocols, directional antennas and a
broad spectrum RF sensing. We plan on using our experience with the SoftMAC [NFD05] flexi-
ble MAC layer control to provide more accurate protocol layers for direct control of the MAC
layer. For example, using SoftMAC, we can selectively enable enhanced forward error correc-
tion (FEC) to improve the channel condition; we can also use the SoftMAC drivers to retrieve
partially corrupted frames, improving the channel measurement accuracy. The directional anten-
nas provide gross angle of arrival (AOA) information, allowing gradient based methods to im-
prove accuracy – more importantly, directional antennas also increase throughput and decrease
communication costs. While “higher level” tools such as SoftMAC allow us to extract useful sig-
nal strength information from an existing 802.11 radio, those radios still face limitations – they
are power hungry and have limited ability to find “idle” channels. Packets that have significant
corruption (e.g. in the Physical Layer Converge Protocol, or PCLP), can not be interpreted by the
radio; most existing radios have poor interfaces for signal measurements, limiting the ability of
radios to assess the “true channel”. We plan on using spectrum measurement systems to provide
an alternate, lower power sensing method for the LANdroid platforms; an example of a COTS
solution is the WiSPY2.4 device, which can scan the entire 2.4Ghz band in 383Khz “steps” to
measure noise and signal strength.
16
17. time
Figure 4- Sample RF Energy From Inexpensive Signal Detector
freq
For example, Figure 4 shows an experiment conducted in a concrete walled courtyard; a
transmitter (blue square, upper left) was transmitting an 802.11g stream to the receiver (red box,
bottom right). The diagram to the right shows a “waterfall” plot of the received signal strength at
the receiver as it switches between four antenna states (performed by manually rotating the an-
tenna). The spectrum analyzer is clearly able to provide information for gradient-based RF find-
ing, and it can examine a broader band more rapidly than the 802.11g radio. However, it can not
identity what signals mean – i.e. what data is actually packets from adjacent LANdroids. Howev-
er, just as the 802.11g radio has poor abilities to rapidly scan the network to find “idle channels”,
both the radio and spectrum analyzer have their advantages when used cooperatively. We have
made extensive use of combined spectrum sensing and radio use in developing cognitive radio
control algorithms and mesh networking systems with directional antennas that have been evalu-
ated using SoftMAC and the WiSPY devices [WSD07, SDH06, BAY07].
Reducing Energy During Communi-
cation Phases: The single largest energy
consumer during communication phases is
the use of the underlying radio and the MAC
and PHY processing for that radio; consider-
able variation occurs between different RF
chipsets, but many factors are independent of
the chipset. The graph in Figure 5 shows the
time needed to transmit a data frame of vary-
ing sizes at different data rates. This mea-
sured data shows two things – there’s consid- Figure 5 - Transmission Time For Different
erable overhead for small packets and when a 8
802.11g Data Rates
high quality link is in place, the amount of
transmitted data is not important. The time to transmit any packet is approximately 1.49ms at the
lowest data rate, 1.19ms at the highest 802.11b data rate and 0.227ms at the 54Mb/s data rate.
During transmission, both the sender and receiver radios are operating, consuming considerable
power. If we assume that the primary task of the LANdroid relays will be to relay voice traffic,
we can see that system level decisions should guide power optimization – at 11Mb/s or 54Mb/s,
the transmission time for a VOIP packet is largely independent of the underlying codec; at
1Mb/s, transmission time can vary from 1.9ms for an 8kb/s G.729 codec to 3.0ms for a 64kb/s
G.711 code. At times, it may be useful to trade the costs of transcoding streams against in-
creased radio use.
This data also shows the necessity of increasing the link quality using directional antennas,
17
18. which improve gain and reduce air time, or through mobility and transmission power increases.
18
19. D.2 Comparison with Current Technology
The decentralized model-free, gradient-based, motion optimization technique developed by
the PIs overlaps with several state-of-the-art control techniques. Multivariable extremum seeking
control has been applied to a variety of applications [ArK02], but never to teams of autonomous
robots. Current work on MES has applied the approach to the control of a single nonholonomic
vehicle with no position information [ZAG07]. The approached proposed by the PIs uses local
position information obtained by odometry and enables coordination between vehicles. Likewise,
the concepts of swarming, distributed sensing, and coverage control have been studied extensive-
ly in the context of physical space (see [IEE07] for an overview of recent results). These results
all assume relative position and models of the interaction environment are known. Our approach
extends all of these results to cases when positions (in any space) and models are not known.
Controlling node mobility for communication has been considered by other researchers. The
value of controlling mobility to increase connectivity was shown in [LiR00, BRS03, BaR04, CN-
S01]. These generally consider outdoor networks or idealized communication models that do not
capture the tight interaction between robot navigation and network optimization. In [SBR04] a
protocol was analyzed that guided end users to better locations that improve their communication
quality. This requires significant end-user interaction that is not desired here. Using network in-
formation to update node locations was specifically considered in [GLM04]. The nodes move on
long time scales (1-5 min) and are not sufficiently dynamic for LANdroids. All of these refer-
ences fail to properly consider the energy cost of mobility relative to increasing transmitter pow-
er or other means of improving network performance. They also ignore the mobility planning
and assume (usually implicitly) some localization technique such as a GPS.
Data ferrying for delay tolerant networks (DTN) was considered in [MAZ04,SRJ03,ZhA03].
Ferrying exploits or controls mobility in order to deliver messages in disconnected networks and
is similar to epidemic routing and similar models [VaB00,Win00] that rely on mobility to diffuse
messages across nodes eventually reaching the intended recipient. While this does not satisfy the
LANdroid low-latency connectivity goal several concepts are relevant. Throwboxes described in
[ZCA06] are network relays that are placed at important traffic intersections to act as store and
forward devices that increase network throughput. The approach to identifying these intersec-
tions may be useful in positioning LANdroid relays. In [ZAZ04] the authors consider the broader
problem of how DTN nodes signal their communication needs in a disconnected network. Such a
protocol may inform the need to initially self-organize LANdroid nodes.
The Learning Spatial Features approach proposed here is related to concept drift, where the
characteristics of a class change over time [WiK96, KoM05, HeL92]. The approach requires the
use of multiple models, and the goal is to make future predictions by choosing between models
based on the latest labeled data. However, these methods do not offer a formal approach to ques-
tions such as which models to apply to the unlabeled current sample, or when to add new models
or discard old ones. Thrun’s [Thr96] work also directly addresses a similar problem, as well as
online learning as discussed in [Thr96]. However, none of these methods can directly predict
when an unlabeled input is beyond the scope of the current model set, and more learning must be
done. Furthermore, there has been a recent issue of the Journal of Field Robotics (co-edited by
the CO-PIs) that has addressed similar learning problems [MuG06]. Related Reinforcement
Learning work can be found in [SBP04].
19
20. D.3 Evaluation/Experimentation Plans and Metrics
University of Colorado’s operator interface for the DARPA LAGR program left (robotics),
and for the ad hoc UAV and ground node network (AUGNet) right (WiFi networking).
D.3.1 Operator Control System
Our past experience with test bed environments has shown that it is important to have a test
management plane[JBD05,BDJ05]. The management plane provides the ability to issue com-
mands (e.g. to start an experiment), monitor ongoing progress (e.g. node location and network
activity summaries), and collect detailed network statistics. The figure above shows a sampling
of interfaces that we have developed. We have been able to design “in-band” systems that share
the network under test for network monitoring with minimal impact. For detailed monitoring the
data can be held at nodes and collected after a test is finished using monitoring protocols that we
have developed. Our previous work used GPS to monitor node locations but this can not be used
in the indoor environment. We will test both out of band video systems located in the ceiling and
an existing UWB indoor localization system acquired under a previous contract. It is important
to note that we are only using localization information to determine when and why the developed
systems run into problems; they are not used to guide the decisions of the LANdroid system.
D.3.2 Test Bed Environment
Our combined research groups have considerable experience with a variety of robots, as in-
dicated in the Facilities section. We have an existing collection of 12 Roomba systems outfitted
with a custom radio and control system that can
be used in this project; we have also budgeted
equipment for additional Roomba Create compo-
nents and embedded computers. Robots will be
instrumented to monitor power usage. This will
enable us to test the effect of different robot hard-
ware and software strategies in short experiments
without having to test until the entire battery is
drained.
We will use various testbed environments.
Day-to-day testing and evaluation will occur in re-
search labs in the Department of Electrical and
Computer Engineering and in Computer Science.
20
21. These large labs have already been used for robotics experiments, and have a variety of construc-
tion types. In addition, we will use the Center for Innovation and Creativity (CINC); this large
facility is a former manufacturing facility converted to University use. The floor plan is shown in
the picture above. That diagram shows the location of existing directional phase array antennas
in the large building and the variety of room shapes and sizes available. Each of these facilities
has existing 802.11 wireless networks, providing the benefit of background interference; we also
have access to an interference free location at a local warehouse.
D.3.3 Simulation Environment
For rapid algorithms development we will modify an existing network simulator that incor-
porates detailed radio models and controlled mobility. Open source programs such as ns2 only
provide predefined mobility paths that can not be modified during the simulation. Further, the
standard propagation models are weak. We have modified OpNet to incorporate controlled mo-
bility and more accurate propagation models. The radio performance will incorporate measure-
ment data between location pairs to provide a simple, but, accurate radio model. The simulator
will require further development to incorporate our system power models and sensor interac-
tions.
We believe that relatively simple power models will be sufficient for the majority of the
work; the radio components have non-varying power levels, the power demands of the RAM and
FLASH components are constant and power models for statically scheduled microprocessors,
such as the PXA 255, are accurate and have been well studied [GiGr00].
One challenge will be to provide a simplified or abstracted power model that can be used in
on-line decision making; various learning algorithms will need to be able to assess the benefit of
trading one resource (e.g. radio) against another (e.g. specific computation). Again, the project
team has considerable experience in these tasks.
D.3.4 Metrics
In addition to the five program-wide metrics (Coverage, Longevity, Throughput/Latency,
Convergence Time, and Message Overhead) we also consider three additional metrics. The first
is Dynamic Antenna Gain. This measures the ability of the robot to find positions that provide
gain to a specific test point. It is measured as a dB gain in received signal strength relative to the
local median signal strength in the vicinity of the robot. The second is Plan Energy. This mea-
sures the total energy (movement, processing, and communication) to achieve a specific goal.
Goals can be to move to a specific position in a cluttered environment or to find a local minimum
of signal gradient. This will be used to compare different hardware and software strategies for
robot operation and is at a finer grain then Longevity. The third is Reach. This measures the
maximum distance a test point can communicate with the gateway for a given number of robots
within a given environment. This is designed to be a better measure of tethering performance.
Convergence Time appears to require further clarification. We propose that it is the time
past an event until a minimum percentage of test points can communicate (as defined in Cover-
age) with the gateway. Since this may never happen, convergence time is augmented by Conver-
gence Probability which is the fraction of the attempts that the system converges on to a mini-
mum Coverage percentage.
21
22. E. Statement of Work
The overall goals of the University of Colorado LANdroid Team have been outlined in Sec-
tion C. Broadly, we plan to integrate multiple sensor, communication, and system measurements
in order to control the network and robot so that connectivity and network longevity are maxi-
mized. We have divided the problem into nine components: RF Analysis; LANdroid System
Hardware; System Power Models; Decentralized, Model-Free, Gradient-based, Motion Opti-
mization in Signal Space; Learning Spatial Features; Learning Optimal Control; Vision Based
Cost Estimation; Network Protocols; and System Software Development and Evaluation. A de-
tailed breakdown of these components into their constituent tasks is provided below. For each
task, we indicate which PI (and their associated graduate students) is responsible for the task and
in which phase the task will be completed. At a high level, the three phases of this work are to 1)
identify the technologies that will best constitute the LANdroid system and provide design
guidelines to the LANdroid hardware teams; 2) integrate these technologies into a coherent con-
trol system; and 3) integrate the control software with the hardware platform. The tasks are tied
to the Milestones which are described at the end of this section and deliverables in Section I.
However, the tasks will generally encompass the entire phase(s) indicated. Variations will be in-
dicated in the schedule graphic.
RF Analysis (RFA): Each task will support Deliverable 1 (RF Analysis document).
Task 1: (P1, Grunwald) Survey signal strengths using dense measurement networks, compar-
ing different signal strength measurement techniques (WiFi card vs. WiSpy).
Task 2: (P1, Popovic) Characterize the role of the antenna, including form-factor, directional-
ity, and multiple antennas in near-to-ground indoor/urban environments.
Task 3: (P1, Brown) Identify and characterize spatial features that are desirable in signal
space.
LANdroid System Hardware (LSH): Each task will support Deliverable 2 (LANdroid System
Hardware Recommendation document).
Task 4:(P1, Grunwald) Analyze tradeoffs in costs, energy requirements, and system perfor-
mance for sensors, 802.11 chipset, and processor on gateway, LANdroid, and edge node.
Task 5:(P1, Mulligan) Analyze tradeoffs in number and capability of video cameras.
Task 6:(P1, Popovic) Analyze tradeoffs in number and capability of antenna.
System Energy Models (SEM):
Task 7:(P1, Grunwald) Develop generic energy models communication, sensor, robot, and
processing sub-systems. Supports Deliverable 2 and Milestone 6.
Task 8:(P1, Grunwald) Characterize the added network longevity vs. cost of different subsys-
tem choices. Supports Deliverable 2.
Task 9:(P3, Grunwald) Integrate final hardware design into energy model. Supports Mile-
stone 9.
Gradient-Based Motion Optimization in Signal Space (GMO):
Task 10:(P1, Frew) Determine most efficient signal dithering method for determining gradi-
ent. Provides input to Deliverable 1.
Task 11:(P1, Frew) Design and implement basic gradient-based robot deployment algorithm.
22
23. Supports Milestone 1.
Task 12:(P2, Frew) Design and implement gradient-based robot tethering algorithm. Supports
Milestone 5.
Task 13:(P3, Frew) Design and implement gradient-based methods that search in perfor-
mance space (e.g. power or throughput). Supports Milestone 8.
Learning Spatial Features (LSF):
Task 14:(P1, Grudic) Investigate many types of spatial features rated by humans for their net-
work utility. The resulting features will be evaluated in an offline machine learning
paradigm. Supports Milestone 4.
Task 15:(P2,P3, Grudic) Design and implement online machine learning to optimize the
learned spatial feature concepts. Supports Milestone 7.
Task 16:(P3, Grudic) Develop distributed spatial feature detection between LANdroid nodes.
Supports Milestone 7.
Learning Optimal Control (LOC):
Task 17:(P1, Grudic) Adapt LAGR path planning code to the LANdroid environment. Sup-
ports Milestone 2.
Task 18:(P2, Grudic) Investigate methods for the LANdroid to learn from human operater
demonstrated control strategies. Supports Milestone 4.
Task 19:(P3, Grudic) Design and implement a reinforcement learning controller that dynami-
cally determines standard control behaviors and combines signal and spatial optimization.
Supports Milestone 7.
Vision-Based Cost Estimation (VCE):
Task 20:(P1, Mulligan) Implement and refine algorithms for compute and power limited vi-
sion to support path planning and spatial feature identification. Supports Milestone 2.
Task 21:(P2, Mulligan) Design and implement methods for estimating relative pose among
LANdroids and situational awareness. Identify environmental precepts that facilitate LAN-
droid function. Supports Milestone 5.
Task 22:(P3, Mulligan) Design and implement Warfighter tracking algorithm. Supports Mile-
stone 7.
Network Protocols (NP):
Task 23:(P1, Brown) Select and adapt MANET protocol implementation to LANdroid robot.
Supports Milestone 1.
Task 24:(P1, Brown) Implement protocol for connecting disconnected nodes. Supports Mile-
stone 2.
Task 25:(P2, Grunwald) Implement resource management protocol that enables LANdroids
to share resource state information, manage resources, and interface with its own re-
sources. Supports Milestone 6.
Task 26:(P2, Brown) Implement energy aware routing protocol that considers the larger set
of LANdroid resources and node states. Supports Milestone 6.
Task 27:(P3, Grunwald) Implement quality of service aware routing protocols for meeting
throughput, latency, or longevity targets of end nodes. Supports Milestone 8
23
24. System Software Development and Evaluation (SDE):
Task 28:(P1, Mulligan) Design and implement operator control system (OCS) for managing
LANDroid testing. Supports Milestone 1.
Task 29:(P2, Brown) Develop evaluation test bed for understanding LANdroid system behav-
ior in complex environments. Includes both simulation, hardware in the loop, and full
hardware environments. Supports Milestone 4.
Task 30:(P2, Frew) Design control software to robot interface. Supports Milestone 9.
Task 31:(P3, Mulligan) Implement software modules on LANdroid robot hardware. Supports
Deliverable 9.
Milestone 1: 10 LANdroids can self-configure when initially connected to provide connectivity
to static test points in an open space on a single floor.
Milestone 2: 10 LANdroids can self-configure when initially disconnected to provide connectiv-
ity to static test points in an open space on a single floor. The network self heals after node
death.
Milestone 3: Operator control software can operate multiple LANdroid robots and collect situa-
tional awareness and monitoring data.
Milestone 4: 15 LANdroids can self-configure (whether initially connected or not) to provide
connectivity to test points across two floors with static obstacles.
Milestone 5: The network maintains connectivity to mobile test points (tethering).
Milestone 6: Network energy is managed as a network resource.
Milestone 7: 50 LANdroids can self-configure (whether initially connected or not) to provide
connectivity to heterogeneous test points across 3+ floors of dynamic obstacles and RF inter-
ference. The network maintains connectivity to mobile test points (tethering). Energy is man-
aged as a network resource.
Milestone 8: Edge nodes can specify network objectives (e.g. longevity or throughput).
Milestone 9: All control software ported to LANdroid robot hardware.
24
25. F. Schedule Graphic
LANDroids
Phase 1 Phase 2 Phase 3
Year 07 2008 2009 2010
Month Dec Jan Feb Mar Apr MayJun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr MayJun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr MayJun Jul Aug Sep Oct Nov
T1 RFA: RF survey
T2 RFA: Charaterize Antenna Role
T3 RFA: Identify Spatial features
T4 LSH: Hardware tradeoffs
T5 LSH: Video tradeoffs
T6 LSH: Antenna tradeoffs
T7 SEM: Generic Energy Model
T8 SEM: Network Longevity vs. Cost Model
T9 SEM: LANdroid specific energy model
T10 GMO: Signal Dithering
T11 GMO: Signal Gradient Following
T12 GMO: Gradient-based tethering
T13 GMO: Performance Gradient Following
T14 LSF: Offline Spatial Feature Learning
T15 LSF: Online Spatial Feature Learning
T16 LSF: Distributed Spatial Feature Identification
T17 LOC: Adapt LAGR Code
T18 LOC: Learning Strategies from humans
T19 LOC: Reinforcement Learning Controller
T20 VCE: Power-limited robot vision
T21 VCE: Network pose and situation
T22 VCE: Warfighter tracking
T23 NP: MANET selection
T24 NP: Connecting disconnected nodes.
T25 NP: Resource Management Protocol
T26 NP: Energy aware routing
T27 NP: Quality of service aware routing
T28 SDE: Operator Control System
T29 SDE: Evaluation Testbed
T30 SDE: Control Software to Robot interface Spec
T31 SDE: Software on LANDroid robot hardware
Evaluations
Milestones
M1 M2 M3 M4 M5 M6 M7 M8 M9
25
26. G. Teaming and Tasking
To be successful the proposal requires a confluence of knowledge and capabilities in RF
propagation, wireless protocols, robotics, and machine learning. The team has these capabilities
along with key cross-disciplinary capabilities that ensure a smooth and productive interaction:
Tim Brown (PI): 18 years experience in Wireless Systems, Machine Learning, and Network-
ing
Eric Frew: 11 Years Experience in Design and Implementation of Control Systems for
Autonomous Robotic Networks
Greg Grudic: 13 Years Experience in Learning Algorithm Development and Robotics Re-
search.
Dirk Grunwald: 20 years experience in computer systems design, evaluation and develop-
ment
Jane Mulligan: 12 Years Experience in Implementation of Robotic Control Systems and
Real-Time Stereo and Vision Algorithms.
Zoya Popovic: 22 years experience in microwave circuit and antenna modeling, design and
characterization.
In addition the proposal will be supported by a dedicated System Integrator whose task will
be to lead the LANdroid system evaluation. In summary, the team has a depth of capabilities in
each of the key areas as shown below.
Team Capabilites
Wireless Machine
RF propagation Robotics
protocols Learning
Popovic Mulligan
Grunwald Grudic
Brown Frew
Brown Brown
Grunwald Grudic
Each of the six faculty will be responsible for the tasks assigned to them in the Statement of
Work section. In addition, the PI is the technical point-of-contact and responsible for the overall
coordination of the project, periodic reporting, and financial management.
This project will be placed in and managed through the Department of Electrical and Computer
Engineering. The ECE Department is headed by Prof. Mike Lightner who is a full-time faculty
member. Therefore, the PI, Prof. Brown will report to Prof. Lightner for program support, report-
ing, and oversight. The departments report to the Dean of the College of Engineering and
Applied Sciences, Prof. Robert H. Davis.
26
27. H. Project Management and Interaction Plan
The entire team is collocated in the Engineering Center building at the University of Col-
orado. Weekly team meetings will track progress and provide forward planning. Meetings will
include faculty and students who will discuss project management as well as research findings.
We will develop an internal CU LANdroid Wiki to facilitate technical discussion further and
document progress. This Wiki will also be integrated with version control for all robot and net-
work control software. All software, test bed monitoring, data measurements, technical reports,
and papers will be archived on a server that will be backed up nightly.
Monthly full-scale exercises will evaluate LANdroid progress and program needs.
27
28. I. Deliveries Description
There are no Proprietary Claims. Technical data and computer software will be furnished to
the Government with Unlimited Rights.
Deliverable 1: RF Analysis document. Based on our measurements and analysis, this describes
the potential for exploiting the RF environment and cost-effective techniques that are best suited
for this exploitation.
Deliverable 2: LANdroid System Hardware Recommendation document: Based on our systems
level analysis of choices in sensors, radios, and computation; we will provide cost-benefit analy-
sis of the potential hardware components in the LANdroid System.
Deliverable 3: Documentation of all software modules.
Deliverable 4: Documentation of all LANdroid system evaluations.
Deliverable 5: Documentation of the final complete software system.
Deliverable 6: Control software written for the final LANdroid hardware platform.
28
29. J. Technology Transition and Technology Transfer Targets Plans
The development of self-organizing robotic network nodes has immediate and obvious ap-
plications in a number of fields. These include:
1. Public Safety. A network that can dynamically adapt and optimize performance with minimal
intervention would improve current police, fire, and medical communications in urban indoor
environments.
2. LANcraft. In outdoor environments, wireless nodes mounted in unmanned aircraft can pro-
vide optimized mobile networks over large areas. LANcraft can operate independently or can
interoperate with LANdriod networks adding another dimension.
3. Consumer Deployments. Automatically identifying wireless access point locations to provide
coverage can simplify deploying building networks. The converged locations of a LANdroid
network would indicate where access points should be installed.
With no additional investment, the algorithms developed for this application could be appli-
cable to many other uses for the DOD and public safety markets. The algorithms would have ob-
vious potential for performing Future Combat Systems (FCS) or Joint Robotics Program (JRP)
missions. The development of learning behaviors would directly benefit and potentially feed the
FCS Autonomous Navigation System (ANS) program which will be applicable to all unmanned
FCS operations. The network optimization algorithms can also support the DARPA next genera-
tion (XG), wireless network after next (WNaN), wireless adaptable network node (WANN) and
WNaN adaptive network development (WAND) programs which focus on expanding low-cost
radio capabilities. The team is working on several of these projects. This research has potential
spin-offs in local companies such as Cardinal Peak, Louisville CO, which is currently funded by
the NSF to study mobile robot relays to optimize video backhaul for public safety.
Using existing sensors and added payloads, the LANdroid could assume additional roles
such as distributed surveillance (audio, video, vibration) to support the urban indoor war fighter.
With some adaptation, the technology logic can be inverted to communication disruption. Using
many of the LANdroids techniques, mobile indoor electronic countermeasure networks could
jam, eavesdrop, or localize emitters.
Results will be published in public forums in order to disseminate and promote the transfer
of this technology.
29
30. K. Personnel and Qualifications
Dr. Timothy X Brown, Associate Professor
• 18 years experience in Wireless Systems, Machine Learning, and Networking.
• Technical Program Committee for ACM International Symposium on Mobile Ad Hoc Net-
working (MobiHoc) 2004, 2007.
• Member National Research Council Committee on Using Information Technology to Enhance
Disaster Management, 2005–2007.
• Sub-contractor on Phase 3 of DARPA XG program.
• Ph. D, Electrical Engineering, California Institute of Technology.
• Dr. Brown’s Ph.D. thesis topic was a neural network framework for solving switching net-
work design problems. Between 1990 and 1992 he worked in an advanced computing archi-
tectures group at the Jet Propulsion Laboratory where he developed novel neural network
ASIC designs. Between 1992 and 1995 he was a member of technical staff at Bell Communi-
cations Research where he developed machine learning techniques for network control. Since
1995 he has been a Professor in Electrical and Computer Engineering at the University of
Colorado, Boulder. He has published research papers in machine learning, wireless systems,
and networking. Dr. Brown’s work in machine learning includes statistical function approxi-
mation of rare events; and adaptation in network and wireless communication systems using
Markov Decision Process formulations solved with reinforcement learning. His work in wire-
less systems and networking includes wireless user mobility models; analysis of random cel-
lular deployments; energy aware ad hoc routing protocols; delay tolerant network routing; and
adaptive network resource allocation. To support the wireless research he has developed a
large-scale outdoor wireless test bed that incorporates real-time monitoring and visualization
of network performance down to the packet level. His current research is on controlled mobil-
ity in ad hoc networks, especially on small unmanned aircraft. His published ad hoc network-
ing protocols (including variants of DSR, AODV, and DTN) have all been implemented on
handheld or small single board computers deployed in indoor, outdoor, vehicular, and/or aeri-
al networks.
Dr. Eric W. Frew, Assistant Professor
• 11 Years Experience in Design and Implementation of Control Systems for Autonomous
Robotic Networks.
• PI of AFOSR Project titled “An Integrated Framework for Controlled Mobility in Ad Hoc
Networks”
• Member of the Research and Engineering Center for Unmanned Vehicles (RECUV) at the
University of Colorado.
• PhD, Department of Aeronautics and Astronautics, Stanford University
• Dr. Frew’s research efforts focus on the exploitation of controlled mobility for integrating
communication into multi-objective control, optimal distributed sensing by teams of au-
30
31. tonomous vehicles, and self-directed collaborative navigation of unmanned aircraft. Prior to
joining the CU Boulder faculty, he was a postdoctoral researcher at the UC Berkeley Center
for Collaborative Control of Unmanned Vehicles (C3UV) from June 2003 through July 2004
where he oversaw the development and flight demonstrations of a fleet of three intelligent
aerial platforms. Prior to that, he worked with unmanned ground vehicles and the Humming-
bird autonomous helicopter at the Stanford University Aerospace Robotics Lab. Dr. Frew has
been involved with successful Air Force STTR/SBIRs and current funding comes from the
Air Force Office of Scientific Research, USAF Materiel Command, and Raytheon IIS.
Dr. Greg Grudic, Assistant Professor
• 13 Years Experience in Learning Algorithm Development and Robotics Research.
• Co-organizer with Mulligan of the 2005 NIPS workshop on Machine Learning Based
Robotics in Unstructured Environments
• (http://www.cs.colorado.edu/janem/NipsMLR.html).
• Co-editor with Mulligan of the 2006 Journal of Field Robotics Special Issue on Machine
Learning Based Robotics (http://www.journalfieldrobotics.org/index.html).
• PI in Phase 2 of the DARPA LAGR program.
• PhD, Electrical and Computer Engineering, University of British Columbia
• Dr. Grudic’s Ph.D. thesis topic was on nonparametric learning from examples in very high di-
mensional state spaces, which produced a machine learning framework for end-to-end learn-
ing of robot navigation tasks. Between 1998 and 2001 he was a Post Doctoral Fellow at the
GRASP lab at the University of Pennsylvania. Since2001 he has been an assistant professor in
the Computer Science department at the University of Colorado at Boulder. He has published
research papers in both Machine Learning and Robotics. As part of his ongoing research in
human-to-robot skill transfer and end-to-end learning of robot tasks, his current research focus
is on probabilistic regression and classification, clustering, semi-supervised learning, outlier
detection, and low dimensional nonlinear manifold representations of robot sensory space. Dr.
Grudic’s research in machine learning includes papers on classification, regression, semi-su-
pervised classification, clustering, outlier detection and reinforcement learning. His research
in robotics includes published papers on end-to-end learning of task driven mobile robot navi-
gation tasks, reinforcement learning for mobile robot navigation, and inverse kinematics for
high degree of freedom robot manipulators.
Dr. Dirk Grunwald, Associate Professor
• More than 20 years experience in computer systems design, evaluation and development
• Contributor to DARPA-sponsored book on power aware computing
• Participant in winning DARPA WANN hardware design team with M/A-COM
• Broad experience in computer systems, including all aspects of the LANDROID platform
• Ph.D. Computer Science, University of Illinois Urbana-Champaign
• Dirk Grunwald is an Associate Professor at the University of Colorado, Boulder. Dr. Grun-
31