Reuse in software development is a practice that improves the software development process. Reusing existing software artifacts requires an efficient retrieval mechanism. Leaning out software repository for effective and efficient retrieval and reuse of relevant artifacts requires identifying and eliminating the wasteful artifacts it may involve. Model matching is a preliminary step to identify what is common and what is variant among the software artifacts. However, the time for matching two models to find the optimal correspondence between their elements is exponential. Artificial Bee Colony algorithm is a heuristic that is getting popularity as reasonable solution for problems under different optimization scenarios. This paper presents a solution algorithm based on Artificial Bee Colony for matching UML class diagrams. On a dataset of ten pairs of class diagrams, the performance of the suggested approach is empirically evaluated and compared with Ant Colony approach. The performance of the two algorithms are reported in terms of accuracy of matching and execution time. The results indicate the superiority of the Artificial Bee Colony algorithm in terms of accuracy rate and execution time.

One of the main sources of the routing overhead is the routing protocols that are based on flooding mechanisms. Such routing protocols result in low performance and high resource consumption, especially for constrained devices such as sensors, and actuators. Besides, there are many sensor-based indoor or outdoor applications that rely on deterministic nodes' controllable deployment. Mainly, these applications are used for monitoring and control, for example, home, building, and factory automation and monitoring applications; or outdoor monitoring applications, like forest, disaster, and agriculture areas. The shortcoming in the flooding routing protocols has been addressed by using location-based routing that uses GPS devices. This would decrease the routing overhead but will increase the cost of the network nodes since it need hardware support. In this paper, a solution that reduces the overhead of the flooding mechanisms without needing any hardware support is proposed. The proposed protocol is a routing protocol for Wireless Sensor Networks (WSN) called ID-Based Routing; It uses predefined node identifications to build the routes and is designed especially for grid topology-based applications. It consumes nearly zero memory footprint because it doesn't use routing tables at all. Moreover, its communication is very low since no need to send packets to establish the routes, which consumes much energy due to radio communication to send/receive routing packets.

This study presents a middleware-based Adaptive Cruise Control (ACC) system to reduce driving time. The ACC system supports four driving modes and controls automobile acceleration and deceleration to maintain a set pace or avoid a collision. Real-time adaptive cruise control delays may harm people. A narrow window period should be used to minimize time delay in such applications since timeliness is critical. We propose a real-time ACC system that incorporates the Information Cluster, Radar, Brake Switches, and Cruise Switches, the ACC Controller, the Engine/Throttle Controller, a Brake Controller, brake actuators, speed sensors, and rear brake lights. We suggest an approach that eliminates the hierarchical information flow structure of ACC, which normally has an upper and lower controller. Real-time publisher/subscriber DDS middleware will exchange data. This study also detailed the publish/subscribe model's architecture and proposed QoS policies. A rudimentary prototype that replicates communication between these components was created and tested. The findings demonstrate that the system still works within the allowable delay in such actual systems while leveraging DDS middleware functionalities.

The sensors at the first-hop from the base station limit the network lifetime of a uniformly deployed Wireless Sensor Networks (WSN). That is because all the other nodes rely on them to forward their traffic to the base station; which eventually results in "energy hole" problem. Normal distribution is considered as a promising solution for this problem. Thus, in this paper we focus on studying the effect of the normal distribution deployment variations on the network performance. We selected the coverage performance metric, which is considered as one of the most important Quality of Service metrics in WSN. We derive an equation that can be used to get the best distribution parameters (σx, σy), standard deviations, using our proposed approximation approach called equivalent square method (ESM). Our model is verified using previous reliable published results.

Smart grid is the future vision for supplying energy. It integrates the advances in power engineering as well as information technology and telecommunication in one cohesive network. However, this vision poses several challenges; one of the key challenges is the continuous monitoring of the state of every component (e.g. voltage, current, temperature, energy consumption, energy prices, etc.) in the system. Wireless sensor network is a promising candidate for fulfilling this task. This work suggests a new realistic approach for providing energy for the deployed sensor nodes using mobile charger. The aim is to sustain the operation of the sensor network in terms of data transmission and coverage. The proposed approach integrates the cluster formation process using LEACH-C with the recharging process by defining the required emitted energy as well as the locations to be visited by the mobile charger. The main objectives are to maximize the nodes battery utilization, distribute power effectively from the energy harvester, and optimize the distance between mobile charger and sensor nodes. We tested our approach using NS2 simulator. The simulation results have shown the achievement of the above objectives.

Enabling Real-Time video streaming over wireless networks faces challenges of time-varying channel conditions and the limited network resources. The instability of wireless networks lead to problems such as limited and time-varying bandwidth and traffic congestion when transmitting a burst of video streams. The time-varying wireless channel conditions expose the transmitted video packets to be delayed or dropped. However, in Real-Time video streaming each frame must be delivered and decoded by its playback time. As a result, efficient Real-Time video streaming requires an efficient video quality of service (QoS) transmission control mechanism to adapt to the network changes. Recently, layer coding (LC) enables Real-Time and scalable video streaming to clients of heterogeneous capabilities by dropping upper enhancement layers without the need of re-encoding and with less bit rate. However, layer coding still facing unfair layer protection problem in which packets from the base or lower layers might be dropped while there is a chance to drop packets from the upper enhancement layers. Loosing packets from the base layer can significantly affect the delivered video quality and sometimes lead to an interruption especially in error-prone networks as wireless networks. Architectural solutions at the middleware level introduce higher flexibility, more efficiency in development time and more QoS control. In this paper, we investigate the behavior of video streaming over Real-Time publish-subscribe based middleware. We propose and develop an unequal layer protection mechanism for Real-Time video streaming based on the Data Distribution Service (DDS) middleware, and show the performance of our approach over IEEE 802.11g WLAN networks. Our approach shows a graceful degradation of video quality while maintaining a robust video streaming free of visible error or interruptions.

The contemporary routing algorithms were built and tested under the assumption of uniformly distributed sensor nodes. However, this assumption is not always true. In some industrial applications and due to the scope of the ongoing monitoring process, sensors are installed and condensed in some area, while they are sparse in other areas. In this work, we investigate the impact of sensor node deployment distributions on the performance of different flavors of LEACH routing algorithm. Further, we study the impact of base station location, and different data loads. A comparison between LEACH and LEACH-C is conducted. The results show that different sensor distributions leads to significant differences in network performance. Furthermore, it shows that LEACH-C out performs LEACH almost in all distributions variations and base station locations.

A Mobile Ad-hoc NETwork (MANET) is an infrastructureless network consisting of self-configuring mobile nodes connected by wireless links. Nodes rely on each other to store and forward packets. Most of the proposed MANET protocols assume cooperative and friendly network context, and do not address security issues. Furthermore, MANETs are highly vulnerable for passive and active attacks because of their open medium, rapidly changing topology, lack of centralized monitoring. Encryption and authentication solutions, which are considered as the first line of defense, are not sufficient to protect MANETs from packet dropping attacks. Most of the current Intrusion Detection Systems (IDSs) for MANETS rely on the Watchdog technique. In this research we study the behavior of this technique and propose a novel mechanism, named: Adaptive ACKnowledgment (AACK), for solving two significant problems: the limited transmission power and receiver collision. This mechanism is an enhancement to the TWOACK scheme where its detection overhead is reduced while the detection efficiency is increased. NS2 is used to simulate and evaluate the proposed scheme and compare it against the TWOACK and Watchdog methods. The obtained results show that the new AACK scheme outperforms both of the TWOACK and Watchdog methods in terms of network packet delivery ratio and routing overhead.