ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / This paper discusses simulating iNET's protocol stack using OPNET Modeler. It shows an example of a custom protocol simulated in OPNET Modeler, and how to model the test article, and ground station as reusable components for future simulation. Network simulation is a critical tool for iNET as it enables design decisions that cannot be made analytically due to the complexity of the problem. This work addresses the incorporation of iNET's protocol stack into the OPNET Modeler tool set as this piece of iNET is unique and is not available in OPNET Modeler.

There is an increasing demand for reliable wireless communication in embedded real time systems.  Various communication requirements make the development and deployment of applications that rely on the existence of a protocol stack a challenging research and industrial field of activity. Suitable protocol stacks need to be designed and implemented on new hardware platforms and software structures. Applications that exchange packets over a wireless medium have to deal with time constraints, error checks and have to be aware of energy consumption.   PIE (Platform for Intelligent Embedded Systems) is an experimental platform developed at Halmstad University for educational purposes.  It is a robotic vehicle with wireless communication capabilities that can be used to experiment with traffic scenarios where the vehicles communicate in order to cooperate, for example to avoid hazards or to build platoons.   This thesis addresses the design and implementation of a protocol stack suitable for the PIE platform in the area of vehicle alert systems. Requirements include low latencies along with low packet loss ratios.  The thesis addresses also experimenting with reactive objects for programming network software.

No description available.

The primary research objective of this dissertation is to demonstrate that the effects of communication protocol stack offload (CPSO) on application execution time can be attributed to the following two complementary sources. First, the application-specific computation may be executed concurrently with the asynchronous communication performed by the communication protocol stack offload engine. Second, the protocol stack processing can be accelerated or decelerated by the offload engine. These two types of performance effects can be quantified with the use of the degree of overlapping Do and degree of acceleration Daccs. The composite communication speedup metrics S_comm(Do, Daccs) can be used in order to quantify the combined effects of the protocol stack offload. This dissertation thesis is validated empirically. The degree of overlapping Do, the degree of acceleration Daccs, and the communication speedup Scomm characteristic of the system configurations under test are derived in the course of experiments performed for the system configurations of interest. It is shown that the proposed metrics adequately describe the effects of the protocol stack offload on the application execution time. Additionally, a set of analytical models of the networking subsystem of a PC-based cluster node is developed. As a result of the modeling, the metrics Do, Daccs, and Scomm are obtained. The models are evaluated as to their complexity and precision by comparing the modeling results with the measured values of Do, Daccs, and Scomm. The primary contributions of this dissertation research are as follows. First, the metric Daccs and Scomm are introduced in order to complement the Do metric in its use for evaluation of the effects of optimizations in the networking subsystem on parallel performance in clusters. The metrics are shown to adequately describe CPSO performance effects. Second, a method for assessing performance effects of CPSO scenarios on application performance is developed and presented. Third, a set of analytical models of cluster node networking subsystems with CPSO capability is developed and characterised as to their complexity and precision of the prediction of the Do and Daccs metrics.

International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California / The advent of COTS based network-centric data systems brings a whole new vocabulary into the realm of instrumentation. The Communications and computer industries have developed networks to a high level and they continue to evolve. One of the basic techniques that has proven itself useful with this technology is the use of a “layered architecture.” This paper is an attempt to discuss the basic ideas behind this concept and to give some understanding of the vocabulary that has grown up with it.

In this thesis, a new stack architecture for sensor networks is proposed. The stack consists of the following layers: application, query, aggregation, network, MAC and physical. Various algorithms are implemented using this stack and it is shown that this stack is modular. Following an overview of sensor networks, the previous protocol stack suggestions for sensor networks are examined. Sensor network algorithms that can be classified as sensor data management systems are surveyed and compared with each other. Four of the surveyed algorithms, namely, TAG, Synopsis Diffusion, Tributary-Delta and Directed Diffusion are implemented using the introduced stack. The implementation is performed using a sensor network model developed with OMNeT++ simulator. The simulation results are compared to the original results of these algorithms. Obtaining similar results, the stack and algorithm implementations are validated, moreover, it is shown that the stack does not induce any performance degradation. Using the implementation details of the algorithms, the modularity of the suggested stack is demonstrated. Finally, additional benefits of the stack are discussed.

The CanX-4 and CanX-5 mission currently under development at The University of Toronto Institute for Aerospace Studies Space Flight Laboratory UTIAS/SFL is a challenging formation flying technology demonstration. Its requirements of sub-metre control accuracy have yet to be realized with nanosatellites. Many large technical challenges must be addressed in order to ensure the success of the CanX-4/5 mission. This includes the development of software for an intersatellite communication system, integration and optimization of key formation flying algorithms onto the Payload On-Board Computer as well as the development of a Hardware-In-The-Loop simulator for full on-orbit mission simulations. This thesis will provide background knowledge of the Space Flight Laboratory and its activities, the CanX-4/5 mission, and nally highlight the authors contributions to overcoming each of these technical challenges and ensuring the success of the CanX-4 and CanX-5 mission.

The CanX-4 and CanX-5 mission currently under development at The University of Toronto Institute for Aerospace Studies Space Flight Laboratory UTIAS/SFL is a challenging formation flying technology demonstration. Its requirements of sub-metre control accuracy have yet to be realized with nanosatellites. Many large technical challenges must be addressed in order to ensure the success of the CanX-4/5 mission. This includes the development of software for an intersatellite communication system, integration and optimization of key formation flying algorithms onto the Payload On-Board Computer as well as the development of a Hardware-In-The-Loop simulator for full on-orbit mission simulations. This thesis will provide background knowledge of the Space Flight Laboratory and its activities, the CanX-4/5 mission, and nally highlight the authors contributions to overcoming each of these technical challenges and ensuring the success of the CanX-4 and CanX-5 mission.

Network coding is a technique used to increase the capacity of a network by combining messages sent over the network. The combined messages could be separated by using sufficient original messages which were used to combine the messages. Network coding can be implemented in different layers of the 051 stack, but to date a complete comparison between different implementations of network coding has not been done. The goal of this dissertation is to implement a wireless node model with network coding in the MAC layer and evaluate the performance characteristics of reference networks that implement the new node model. This will serve as the first step of a greater goal, namely finding the most favourable position in the 051 stack to implement network coding. The characteristics of the different implementations of network coding are presented in this dissertation. Simulations were done in OPNET® to find further attributes concerning the implementation of network coding in the MAC layer. The simulation process used is presented and explained, and the results from the simulations are analysed. Network coding in the simulations was implemented opportunistically. The results show that the more often different nodes send frames to the coding node, the better network coding performs. The work contributes to finding the best layer for implementing network coding for its increased throughput. A benchmark network was created so that network coding could be implemented in all the layers of the 051 stack, and then be compared to each other. An implementation of network coding in the MAC layer was simulated and analyzed. We conclude that, because there are so many different purposes for which networks are used, a single instance of network coding is unlikely to be similarly beneficial to all purposes. There still remains work to find the most favourable position for network coding in the 051 stack for all the different types of network coding. / Thesis (M. Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2011

Network coding is a technique used to increase the capacity of a network by combining messages sent over the network. The combined messages could be separated by using sufficient original messages which were used to combine the messages. Network coding can be implemented in different layers of the 051 stack, but to date a complete comparison between different implementations of network coding has not been done. The goal of this dissertation is to implement a wireless node model with network coding in the MAC layer and evaluate the performance characteristics of reference networks that implement the new node model. This will serve as the first step of a greater goal, namely finding the most favourable position in the 051 stack to implement network coding. The characteristics of the different implementations of network coding are presented in this dissertation. Simulations were done in OPNET® to find further attributes concerning the implementation of network coding in the MAC layer. The simulation process used is presented and explained, and the results from the simulations are analysed. Network coding in the simulations was implemented opportunistically. The results show that the more often different nodes send frames to the coding node, the better network coding performs. The work contributes to finding the best layer for implementing network coding for its increased throughput. A benchmark network was created so that network coding could be implemented in all the layers of the 051 stack, and then be compared to each other. An implementation of network coding in the MAC layer was simulated and analyzed. We conclude that, because there are so many different purposes for which networks are used, a single instance of network coding is unlikely to be similarly beneficial to all purposes. There still remains work to find the most favourable position for network coding in the 051 stack for all the different types of network coding. / Thesis (M. Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2011