de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Schliessen
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Werk suchen
Biologically inspired methods for organizing distributed services on sensor networks / Tales Heimfarth. 2007
Inhalt
List of Figures
List of Tables
Introduction
System Software for Wireless Sensor Networks
Embedded System OS
Configurable Operating Systems
Sensor Network OS
Single Node Concerns
Group Concerns
Examples of OS
Middleware
Requirements
Relation to OS
Examples of Middlewares
Virtual Machine
Examples of Virtual Machines
Discussion
NanoOS Architecture
Motivation
System Overview
Applications Scenario
Requirements
NanoOS Approach
Hardware Platform
Software Components
Application
NanoOS Structure
Dynamic Mobile Services
Service Management
Distribution Methods
OS Network Organization
Organizing the Network in Clusters
Communication Link Model
Links in a Wireless Network
Link Quality Estimation
The Combined Link Metric
Discussion
Service Distribution
Introduction
Related Work
Global Distributed Scheduling
Migration of Service in WSN
Discussion
Problem Definition
Ant Based Service Distribution
Basic Heuristic
Extended Heuristic
Discussion
Self-Organizing Cluster Construction
Introduction
State of the Art - Clustering in Ad hoc Networks
Maximum Independent Set Approaches
Dominance Only Approaches
Multihop Clustering
Other Approaches
Discussion
Problem Definition
Problem Properties
Division of Labor and Task Allocation in Social Insects
Heuristics Basic Concepts
General Ideas
Clustering ``Quasi-Static'' Ad hoc Networks
Clusterhead Selection
Member Selection
Message Relay to Clusterhead
Enforce Phase
Clustering Dynamic Ad hoc Networks
General View
Clusterhead Management
Member Selection
Cluster Construction Process
Clustering Maintenance
Integrating Reference Point Group Mobility Model
Relation to Self-Organization Principles
Simulation and Results
Simulation Environment
Reference Methods for the Minimum Intracommunication-cost Clustering
Modeling as a Integer Linear Program
Genetic Algorithm
Basic Concepts
Representation of the Problem (Coding)
Crossover Operator
Mutation Operator
Fitness Function
Selection Operator
GA Behavior
``Quasi-Static'' Clustering Heuristic Simulation
Assumptions
Simulation Scenarios
Algorithms under Evaluation
Results
Service Distribution Simulation
Assumptions
Simulation Scenarios
Algorithms under Evaluation
Results
Discussion
Conclusion
Die detaillierte Suchanfrage erfordert aktiviertes Javascript.