Dalimir OrfanusChange photo
    Add Contact Information
    EditDone Editing
    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... 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 ...
    ABSTRACT
    Download (.pdf)
    ABSTRACT
    ABSTRACT
    ABSTRACT
    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... 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 and Embedded Software (MOMPES 2008) Message from the Organizers _____ vi Committees _____vii Regular Papers Session on Modelling Approaches... 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 such technology, combining high real-time performance with a rich functionality set. Besides that, EtherCAT offers short cycle times, accurate... 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.
    "
    Download (.pdf)
    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... 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 colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has... 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.
    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.... 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 novel applications ranging from vineyard monitoring to space exploration. WSNs may consist of up to thousands of nodes, which typically have... 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-organizing protocols for Wireless Sensor Networks (WSNs). Process algebras (PA) as pi-Calculus are concerning the high-level description of... 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 used to design a very efficient heuristic for clustering wireless sensor networks. Differently from previous approaches, we aim at creating... 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 networks, data collection presents one of the central challenges in this network class. In this paper, we propose an efficient self-organizing... 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.
    Distributed RSoCs are the next step towards a new generation of embedded systems. Applications running on heterogeneous distributed RSoCs require an OS which dynamically adapts to their variable demands. In this paper, we present a novel... more
    Distributed RSoCs are the next step towards a new generation of embedded systems. Applications running on heterogeneous distributed RSoCs require an OS which dynamically adapts to their variable demands. In this paper, we present a novel decentralized OS service design, which enables OS adaptiveness, resource sharing, and recon¯gurability on distributed RSoCs. The challenges faced by this design are classi¯ed and discussed. To cope with them, biologically inspired algorithms, e.g. for service discovery, are adopted, which use only local information provided by an RSoC and its direct neighbors.
    Download (.pdf)
    The growing design complexity of today's embedded real-time systems requires new techniques aiming the raising of the abstraction level since earlier stages of design in order to deal with such complexity in a suitable way. This paper... more
    The growing design complexity of today's embedded real-time systems requires new techniques aiming the raising of the abstraction level since earlier stages of design in order to deal with such complexity in a suitable way. This paper reports a case study, which provides an assessment of two well-know high-level paradigms, namely Aspect- (AO) and Object-Oriented (OO) Paradigms. Concepts of both paradigms were applied at modeling phase of a Distributed Embedded Real-Time System (DERTS). The handling of DERTS functional and non-functional requirements (at modeling level) using AO and OO concepts is discussed. Both paradigms are compared using of a set of software engineering metrics, which were adapted to be applied at modeling level. The presented results show the suitability of each paradigm for DERTS specification in terms of reusability quality of model elements.
    Designing protocols for wireless networks is a challenging task. Combined with the fact that such networks are often deployed for critical missions like forest fire detection in the WSN scenario or have to function properly and... more
    Designing protocols for wireless networks is a challenging task. Combined with the fact that such networks are often deployed for critical missions like forest fire detection in the WSN scenario or have to function properly and efficiently for an extended period of time, it is desirable to thoroughly test, analyze and evaluate newly developed communication protocols before deployment. In order to do this, simulations are a good compromise between cost/complexity and accuracy of the results. Since there are many simulators for wireless networks, it is often difficult to decide which one to choose. Therefore, we present a case study in which four common wireless network simulators were used to evaluate a well-known topology control protocol (SPAN). Within the case study, we describe the strengths and weaknesses of the examined network simulators: First, we evaluate the usability of the simulators in terms of different parts of the protocol developer's work process. Moreover, we also focus on the simulator's support for reusability and maintainability of simulation models by measuring particular model properties. For this purpose, we have proposed a model of quality for network simulators. The model of quality defines which properties of models to measure and how to interpret them. As opposed to other simulator comparisons, we do not focus on the correlation of the individual simulation results. Through this paper, we aim at providing a basis for finding an adequate simulator for a particular task.
    Download (.pdf)
    In order to evaluate the behavior and performance of protocols for wireless networks, simulations are a good compromise between cost and complexity, on the one hand, and accuracy of the results, on the other hand. Since there are many... more
    In order to evaluate the behavior and performance of protocols for wireless networks, simulations are a good compromise between cost and complexity, on the one hand, and accuracy of the results, on the other hand. Since there are many simulators for wireless networks, it is often difficult to decide which simulator to choose. To help shed light on this issue, we present a case study in which four popular wireless network simulators were used to evaluate a well-known topology control protocol (SPAN). Within the case study, we describe outstanding and desirable but missing features of the simulators, outlining their strengths and weaknesses. Further, we compare the amount of effort needed for installation, familiarization, implementation (needed lines of code and lines for configuration) and visualization. As opposed to other simulator comparisons, we do not focus on the correlation of the individual simulation results, but try to compare the simulators from feature and usability point of view. This paper can help other researchers to quickly identify which simulator is most suitable for their needs.
    Download (.pdf)
    In this paper we present integration technology which integrates loosely coupled software tools which process heterogeneous information from web sources. Goals of the integration technology were to unify web presentation and to support... more
    In this paper we present integration technology which integrates loosely coupled software tools which process heterogeneous information from web sources. Goals of the integration technology were to unify web presentation and to support cooperation of proposed tools. For this purpose we used development framework Cocoon which is built around the concepts of separation of concerns and component-based web development. We also included the framework Hibernate for object-relational mapping and the library log4j for easily logging. Besides this, we extended Cocoon with specialized generator which helps tools to generate their web presentations, communicate with integration technology and to cooperate with other tools.
    Download (.pdf)
    -
    author rank

    Join Dalimir and 37,934,453 other researchers on Academia.edu

    not now
    Academia © 2016