Publications
This page shows Hamzeh's the publications
Metaheuristic Design Pattern: Preference
Abstract - In interactive metaheuristic design, the human helps to steer the trajectory of the search by providing qualitative evaluation to assist in the selection of solution individuals. Exploiting human qualitative evaluation in search provides a mechanism for exploring trade-off judgments among competing criteria taking into account human implicit knowledge and experience. This paper proposes the Preference metaheuristic design pattern involving six abstractions across explicit and implicit knowledge and a priori, interactive and a posteriori dimensions.Keywords – Interactive metaheuristic search, design patterns, preference.
|
|
Dynamic Load Balancing Protocol (DLBP) for Wireless Sensor NetworksAbstract—Wireless Sensor Networks (WSNs) are resource-constrained networks that have been applied in many applications. Many researchers have presented routing protocols to prolong the lifetime of WSNs. In this paper we present a Dynamic Load Balancing Protocol (DLBP) that exploits all network nodes to achieve load balancing and prolong the lifetime of WSN. DLBP has succeeded to build a load balanced tree, eliminate the need for control messages during data routing, keep the load of the WSN balanced during data routing, send messages to next hops without route-discovery delay, quickly maintain and fix network errors and failures. Simulation results show that the network success ratio has reached 97%. Routing overhead has decreased by 72% and network lifetime has increased by 20% comparing to other tested algorithms.
|
|
Energy Balanced Topology For Wireless Sensor Networks - Thesis |
|
Abstract - Wireless Sensor Networks (WSN) is currently one of the hot topics for researchers. The limited resources of sensor nodes, such as battery, memory and processor, create a big challenge to researchers. One of the challenges when working on sensor nodes is to overcome the limited resources to create a routing protocol that saves energy and prolong the WSN lifetime.
This research presents a Dynamic Load Balancing Protocol (DLBP) for WSN. The presented technique was inspired from Game Theory. It works dynamically to balance the load on all WSN nodes and exploits the network nodes to distribute the load fairly on every available sensor node.
Xue algorithm is a dynamic load balancing technique (Xue, et al., 2011). Xue algorithm main idea is to calculate the weights of all neighbor nodes then find the possibility for each link. The data packets will be sent through the link with the highest possibility.
A set of simulation experiments were conducted to evaluate the presented protocol through different metrics. Network scalability was studied, and it was found that DLBP saved energy with a ratio reached 20% comparing to Xue algorithm. The success ratio reached 97%, which is 16% better than Xue algorithm. Moreover, the routing overhead decreased by 72%, and the complexity of calculations decreased by 99.9993%. The network lifetime also increased by 20%.
This research presents a Dynamic Load Balancing Protocol (DLBP) for WSN. The presented technique was inspired from Game Theory. It works dynamically to balance the load on all WSN nodes and exploits the network nodes to distribute the load fairly on every available sensor node.
Xue algorithm is a dynamic load balancing technique (Xue, et al., 2011). Xue algorithm main idea is to calculate the weights of all neighbor nodes then find the possibility for each link. The data packets will be sent through the link with the highest possibility.
A set of simulation experiments were conducted to evaluate the presented protocol through different metrics. Network scalability was studied, and it was found that DLBP saved energy with a ratio reached 20% comparing to Xue algorithm. The success ratio reached 97%, which is 16% better than Xue algorithm. Moreover, the routing overhead decreased by 72%, and the complexity of calculations decreased by 99.9993%. The network lifetime also increased by 20%.
Energy Awareness Tree-Based Routing Protocol for Wireless Sensor NetworksAbstract: - Wireless Sensor Networks (WSNs) are resource-constrained networks that have been applied in several military and civilian applications. Many protocols have been proposed for the simple, low power, low cost WSNs. In this paper we propose a new routing protocol based on Tree Routing (TR). The proposed protocol exploits neighbors’ links in addition to parent-child links to transmit messages while considering the residual energy at each node. Nodes should maintain neighbors' information in their neighbors table. The goal is to try to route the data over the shortest path and at the same time to prolong the network’s lifetime by considering network power consumption and avoiding excessive messages between nodes. The proposed protocol is analyzed and compared with other tree-based routing protocols such as plus tree protocol.
|
|
A Tree-Based Power Saving Routing Protocol for Wireless Sensor NetworksAbstract—Wireless Sensor Networks (WSNs) are a recent
promising technology used to facilitate the provision of many civilian, military, and industrial services. Many challenges hinder the effective use of WSNs to support different applications, such as the resource limitations of sensor devices and the finite battery power. This paper proposes a new routing protocol that considers sensors power limitation and prolongs the network’s lifetime by avoiding excessive messages between nodes. This protocol is based on Tree Routing (TR). It routes the data over the shortest path using parentchild links in accompany with neighbors' links. Also, it solves the problem of node’s failure. The proposed protocol is analyzed and compared with other tree-based routing protocols. |
|