Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive... more Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive and Embedded Software (MOMPES 2008) Message from the Organizers _____ vi Committees _____vii Regular Papers Session on Modelling Approaches Towards a Model-Based Approach ...
Jean Bézivin, INRIA & U Nantes (FR) Siobhán Clarke, Trinity College Dublin (IE) Jörg Desel, KU Ei... more Jean Bézivin, INRIA & U Nantes (FR) Siobhán Clarke, Trinity College Dublin (IE) Jörg Desel, KU Eichstätt-Ingolstadt (DE) Dov Dori, Technion (IL) João M. Fernandes, UMinho (PT) Robert France, Colorado SU (US) António A. Frohlich, UF Santa Catarina (BR) Lídia Fuentes, U Málaga (ES) Hassan Gomaa, George Mason U (US) Luís Gomes, UN Lisboa (PT) David Harel, Weizmann (IL) Mike Hinchey, NASA (US) Jens B. Jørgensen, U Aarhus (DK) Ridha Khedri, McMaster U (CA) Péricles Loucopoulos, Loughborough U (UK) Ricardo J. Machado, UMinho (PT) Dirk ...
Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive... more Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive and Embedded Software (MOMPES 2008) Message from the Organizers _____ vi Committees _____vii Regular Papers Session on Modelling Approaches Towards a Model-Based Approach ...
"Industrial Ethernet is gradually becoming pervasive in the automation field. EtherCAT is one suc... more "Industrial Ethernet is gradually becoming pervasive in the automation field. EtherCAT is one such technology, combining high real-time performance with a rich functionality set. Besides that, EtherCAT offers short cycle times, accurate time synchronization, redundancy and high data throughput. Most EtherCAT applications are in the 500-1000us domain. There are only few EtherCAT master implementations in the sub-100 or sub-50us range for high-performance applications. This paper presents EtherCAT based distributed controller which is capable of less than 30us cycle times and was implemented on P2020 processor. Total HW and SW overhead per cycle is 9.4us with additional jitter of 5us. Achieved preciseness of the distributed time is below 20ns. The stack was designed to be also reused on different platforms.
"
This paper presents a simulation tool integration framework which aims to integrate tools from va... more This paper presents a simulation tool integration framework which aims to integrate tools from various research fields in order to provide a seamless design flow for distributed systems with Emergent Self-Organization (ESO). ESO is a decentralized dynamic process with many favorable properties which makes it attractive for large scale distributed systems. However, ESO has a "non-linear" and "random" nature requiring expertise and tools from various research fields. Instead of extending every simulator and modeling framework to contain some of the required tools we propose a tool integration framework consisting of a repository of ESO design tools together with an integration infrastructure. The tools can be immediately used, thus significantly reducing development time and helping to fully explore the potential of ESO. Moreover, these tools can be created by experts on various aspects of ESO and seamlessly used in any relevant application domain. We demonstrate the usefulness of the proposed framework by showing how it can be used to improve an existing self-organizing data collection algorithm for Wireless Sensor Networks.
Nature has provided an elegant solution for the routing problem millions of years ago, when ant c... more Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing, finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.
ABSTRACT Nowadays, a range of applications and systems are emerging that consist of hundreds or t... more ABSTRACT Nowadays, a range of applications and systems are emerging that consist of hundreds or thousands of computing devices, which are available at low cost but severely limited in their resources. A proper orchestration of these elements can yield a powerful system, which performs complex tasks, while staying simple and making efficient use of its resources. Designing such systems is a challenging task. The classical approach is to develop them in an ad hoc manner, which does not fully leverage the potential of these systems and is far from what can be achieved. There are methodologies which try to overcome this challenge but they do not address essential issues. Moreover, most of them do not provide a design environment to support the design process. In this paper, we propose a new methodology and design environment for systematic construction of emergent behavior in large-scale distributed embedded systems which address issues at both micro- and macroscopic layer. Our approach and simulator were successfully used to design emergent clustering and data collection in large scale wireless sensor networks.
Massively Distributed Embedded Systems (MDES) such as Wireless Sensor Networks (WSN) are gaining ... more Massively Distributed Embedded Systems (MDES) such as Wireless Sensor Networks (WSN) are gaining increasing attention, since they enable a broad range of novel applications starting from monitoring oceans to exploring distant planets. WSNs consist of hundreds of nodes that have typically very limited recourses (computational, memory, energy, etc.) and are deployed in a dynamic environment, where they have to continuously adapt to new conditions. Due to the small-size requirement of the nodes, they are highly resource-constrained. Because of that, the amount of functionality that may be present in each node is limited. Therefore, cooperation between nodes is needed in order to accomplish complex tasks. These facts turn the design of applications for WSNs into a challenge. A promising approach how to deal with it is to use the emergent self-organization metaphor. In this paper a new process algebra (PA) called ``Locality-aware extension of pi-Calculus'' is presented. The algebra is one of several techniques included in a new design methodology for the design of self-organizing behavior in MDES. The method is based on pi-Calculus and allows a high-level description of interactions among processes. As the most important characteristic of self-organization is the restriction of interactions to neighboring elements (localized interactions), we extend the pi-Calculus with locality awareness, a necessary abstraction to allow the modeling of self-organization in MDES. To get full locality awareness in pi-Calculus, we extended it with concepts for modeling spatiality, probability and time. Moreover, new types of channels are included to cover various types of communication such as distribution, broadcast and aggregation. In order to validate this new PA, we successfully model a self-organizing clustering algorithm for WSNs.
Wireless Sensor Networks (WSN) are rapidly gaining attention since enabling a broad spectrum of n... more Wireless Sensor Networks (WSN) are rapidly gaining attention since enabling a broad spectrum of novel applications ranging from vineyard monitoring to space exploration. WSNs may consist of up to thousands of nodes, which typically have limited recourses (computational, memory, energy, etc.) and are deployed in a dynamic environment where they have to continuously adapt to new conditions. Given the resource constrains of typical WSN nodes, the amount of functionality that can be realized at each node is also highly limited. Therefore, cooperation between nodes is needed in order to accomplish more complex tasks. These facts turn design of applications for WSNs into a challenging endeavor. A promising approach how to cope with this is using the emergent self-organization metaphor. Unfortunately most of the current designs using this metaphor are developed employing the ad hoc and trial-and-error method, which is inherently unsystematic, as well as, inefficient. In this paper we present an approach how to systematically design emergent self-organization for massively distributed embedded systems like WSN.
This paper presents an extension of the pi-Calculus which allows the high-level modeling of self-... more This paper presents an extension of the pi-Calculus which allows the high-level modeling of self-organizing protocols for Wireless Sensor Networks (WSNs). Process algebras (PA) as pi-Calculus are concerning the high-level description of interaction among processes. Because the most important characteristic of self-organization is the restriction of interaction to neighboring elements (localized interactions), we extend the pi-Calculus with the locality awareness, a necessary abstraction to allow the modeling of self-organization in WSNs. To get full locality awareness of pi-Calculus we extended it with spatiality, probability and time. Moreover, new types of channels were included in the pi-Calculus to include the different types of communication existing in a WSN: distribution, broadcast and aggregation. In order to validate our new PA, we successfully model a self-organizing clustering algorithm for WSN.
In this work concepts of division of labor in social insects and emergent self-organization are u... more In this work concepts of division of labor in social insects and emergent self-organization are used to design a very efficient heuristic for clustering wireless sensor networks. Differently from previous approaches, we aim at creating clusters with a minimum amount of resources and good intra-cluster connectivity. Our heuristic has two steps. First, we elect the most suitable clusterheads that have the extra responsibility of leading and representing the cluster. Afterwards, the heuristic selects the respective members of the clusters. These processes are guided by a response function that determines the suitability of each node to a given task (role). For example, nodes with good connectivity and high energy level are good candidates for being clusterheads. In addition to the division of labor, we are using a positive/negative feedback mechanism to control the stimulus for attracting new members. Until having enough resources, the positive feedback acts in order to recruit new members. After gathering enough resources, the negative feedback starts to play a major role. Simulations showed that for 80% of cases the proposed heuristic could find results which are below 2.3 times the theoretical optimal solution, define as the sum of the intracommunication cost of the clusters.
Given the resource constraints and the relatively high cost of communication in wireless sensor n... more Given the resource constraints and the relatively high cost of communication in wireless sensor networks, data collection presents one of the central challenges in this network class. In this paper, we propose an efficient self-organizing data collection protocol, which addresses this challenge. Exploiting the knowledge of the underlying topology, the proposed approach uses a novel link acceptor, responsible for choosing the links to be added to the data routing structure, as well as, a next-hop selector taking into account energy information and the distance towards the sink. Using this information, the introduced next-hop selector allows a straightforward adjustment of the trade-off between preferring shorter routes or a higher degree of load balancing. Further, the amount of oscillations is minimized by using polarization functions and probabilistic next-hop selections.
Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive... more Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive and Embedded Software (MOMPES 2008) Message from the Organizers _____ vi Committees _____vii Regular Papers Session on Modelling Approaches Towards a Model-Based Approach ...
Jean Bézivin, INRIA & U Nantes (FR) Siobhán Clarke, Trinity College Dublin (IE) Jörg Desel, KU Ei... more Jean Bézivin, INRIA & U Nantes (FR) Siobhán Clarke, Trinity College Dublin (IE) Jörg Desel, KU Eichstätt-Ingolstadt (DE) Dov Dori, Technion (IL) João M. Fernandes, UMinho (PT) Robert France, Colorado SU (US) António A. Frohlich, UF Santa Catarina (BR) Lídia Fuentes, U Málaga (ES) Hassan Gomaa, George Mason U (US) Luís Gomes, UN Lisboa (PT) David Harel, Weizmann (IL) Mike Hinchey, NASA (US) Jens B. Jørgensen, U Aarhus (DK) Ridha Khedri, McMaster U (CA) Péricles Loucopoulos, Loughborough U (UK) Ricardo J. Machado, UMinho (PT) Dirk ...
Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive... more Page 1. Table of Contents Fifth International Workshop on Model-based Methodologies for Pervasive and Embedded Software (MOMPES 2008) Message from the Organizers _____ vi Committees _____vii Regular Papers Session on Modelling Approaches Towards a Model-Based Approach ...
"Industrial Ethernet is gradually becoming pervasive in the automation field. EtherCAT is one suc... more "Industrial Ethernet is gradually becoming pervasive in the automation field. EtherCAT is one such technology, combining high real-time performance with a rich functionality set. Besides that, EtherCAT offers short cycle times, accurate time synchronization, redundancy and high data throughput. Most EtherCAT applications are in the 500-1000us domain. There are only few EtherCAT master implementations in the sub-100 or sub-50us range for high-performance applications. This paper presents EtherCAT based distributed controller which is capable of less than 30us cycle times and was implemented on P2020 processor. Total HW and SW overhead per cycle is 9.4us with additional jitter of 5us. Achieved preciseness of the distributed time is below 20ns. The stack was designed to be also reused on different platforms.
"
This paper presents a simulation tool integration framework which aims to integrate tools from va... more This paper presents a simulation tool integration framework which aims to integrate tools from various research fields in order to provide a seamless design flow for distributed systems with Emergent Self-Organization (ESO). ESO is a decentralized dynamic process with many favorable properties which makes it attractive for large scale distributed systems. However, ESO has a "non-linear" and "random" nature requiring expertise and tools from various research fields. Instead of extending every simulator and modeling framework to contain some of the required tools we propose a tool integration framework consisting of a repository of ESO design tools together with an integration infrastructure. The tools can be immediately used, thus significantly reducing development time and helping to fully explore the potential of ESO. Moreover, these tools can be created by experts on various aspects of ESO and seamlessly used in any relevant application domain. We demonstrate the usefulness of the proposed framework by showing how it can be used to improve an existing self-organizing data collection algorithm for Wireless Sensor Networks.
Nature has provided an elegant solution for the routing problem millions of years ago, when ant c... more Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing, finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.
ABSTRACT Nowadays, a range of applications and systems are emerging that consist of hundreds or t... more ABSTRACT Nowadays, a range of applications and systems are emerging that consist of hundreds or thousands of computing devices, which are available at low cost but severely limited in their resources. A proper orchestration of these elements can yield a powerful system, which performs complex tasks, while staying simple and making efficient use of its resources. Designing such systems is a challenging task. The classical approach is to develop them in an ad hoc manner, which does not fully leverage the potential of these systems and is far from what can be achieved. There are methodologies which try to overcome this challenge but they do not address essential issues. Moreover, most of them do not provide a design environment to support the design process. In this paper, we propose a new methodology and design environment for systematic construction of emergent behavior in large-scale distributed embedded systems which address issues at both micro- and macroscopic layer. Our approach and simulator were successfully used to design emergent clustering and data collection in large scale wireless sensor networks.
Massively Distributed Embedded Systems (MDES) such as Wireless Sensor Networks (WSN) are gaining ... more Massively Distributed Embedded Systems (MDES) such as Wireless Sensor Networks (WSN) are gaining increasing attention, since they enable a broad range of novel applications starting from monitoring oceans to exploring distant planets. WSNs consist of hundreds of nodes that have typically very limited recourses (computational, memory, energy, etc.) and are deployed in a dynamic environment, where they have to continuously adapt to new conditions. Due to the small-size requirement of the nodes, they are highly resource-constrained. Because of that, the amount of functionality that may be present in each node is limited. Therefore, cooperation between nodes is needed in order to accomplish complex tasks. These facts turn the design of applications for WSNs into a challenge. A promising approach how to deal with it is to use the emergent self-organization metaphor. In this paper a new process algebra (PA) called ``Locality-aware extension of pi-Calculus'' is presented. The algebra is one of several techniques included in a new design methodology for the design of self-organizing behavior in MDES. The method is based on pi-Calculus and allows a high-level description of interactions among processes. As the most important characteristic of self-organization is the restriction of interactions to neighboring elements (localized interactions), we extend the pi-Calculus with locality awareness, a necessary abstraction to allow the modeling of self-organization in MDES. To get full locality awareness in pi-Calculus, we extended it with concepts for modeling spatiality, probability and time. Moreover, new types of channels are included to cover various types of communication such as distribution, broadcast and aggregation. In order to validate this new PA, we successfully model a self-organizing clustering algorithm for WSNs.
Wireless Sensor Networks (WSN) are rapidly gaining attention since enabling a broad spectrum of n... more Wireless Sensor Networks (WSN) are rapidly gaining attention since enabling a broad spectrum of novel applications ranging from vineyard monitoring to space exploration. WSNs may consist of up to thousands of nodes, which typically have limited recourses (computational, memory, energy, etc.) and are deployed in a dynamic environment where they have to continuously adapt to new conditions. Given the resource constrains of typical WSN nodes, the amount of functionality that can be realized at each node is also highly limited. Therefore, cooperation between nodes is needed in order to accomplish more complex tasks. These facts turn design of applications for WSNs into a challenging endeavor. A promising approach how to cope with this is using the emergent self-organization metaphor. Unfortunately most of the current designs using this metaphor are developed employing the ad hoc and trial-and-error method, which is inherently unsystematic, as well as, inefficient. In this paper we present an approach how to systematically design emergent self-organization for massively distributed embedded systems like WSN.
This paper presents an extension of the pi-Calculus which allows the high-level modeling of self-... more This paper presents an extension of the pi-Calculus which allows the high-level modeling of self-organizing protocols for Wireless Sensor Networks (WSNs). Process algebras (PA) as pi-Calculus are concerning the high-level description of interaction among processes. Because the most important characteristic of self-organization is the restriction of interaction to neighboring elements (localized interactions), we extend the pi-Calculus with the locality awareness, a necessary abstraction to allow the modeling of self-organization in WSNs. To get full locality awareness of pi-Calculus we extended it with spatiality, probability and time. Moreover, new types of channels were included in the pi-Calculus to include the different types of communication existing in a WSN: distribution, broadcast and aggregation. In order to validate our new PA, we successfully model a self-organizing clustering algorithm for WSN.
In this work concepts of division of labor in social insects and emergent self-organization are u... more In this work concepts of division of labor in social insects and emergent self-organization are used to design a very efficient heuristic for clustering wireless sensor networks. Differently from previous approaches, we aim at creating clusters with a minimum amount of resources and good intra-cluster connectivity. Our heuristic has two steps. First, we elect the most suitable clusterheads that have the extra responsibility of leading and representing the cluster. Afterwards, the heuristic selects the respective members of the clusters. These processes are guided by a response function that determines the suitability of each node to a given task (role). For example, nodes with good connectivity and high energy level are good candidates for being clusterheads. In addition to the division of labor, we are using a positive/negative feedback mechanism to control the stimulus for attracting new members. Until having enough resources, the positive feedback acts in order to recruit new members. After gathering enough resources, the negative feedback starts to play a major role. Simulations showed that for 80% of cases the proposed heuristic could find results which are below 2.3 times the theoretical optimal solution, define as the sum of the intracommunication cost of the clusters.
Given the resource constraints and the relatively high cost of communication in wireless sensor n... more Given the resource constraints and the relatively high cost of communication in wireless sensor networks, data collection presents one of the central challenges in this network class. In this paper, we propose an efficient self-organizing data collection protocol, which addresses this challenge. Exploiting the knowledge of the underlying topology, the proposed approach uses a novel link acceptor, responsible for choosing the links to be added to the data routing structure, as well as, a next-hop selector taking into account energy information and the distance towards the sink. Using this information, the introduced next-hop selector allows a straightforward adjustment of the trade-off between preferring shorter routes or a higher degree of load balancing. Further, the amount of oscillations is minimized by using polarization functions and probabilistic next-hop selections.
Uploads
Papers by Dalimir Orfanus
"
"