Ayad salhieh | The Australian University (original) (raw)

Papers by Ayad salhieh

Wireless sensor network is a network that contains a set of autonomous inexpensive devices called... more Wireless sensor network is a network that contains a set of autonomous inexpensive devices called sensors. These sensors communicate together to detect, track, and monitor physical environments. Since energy is the scarcest resource in wireless sensor networks, some necessary improvements should be made to current detection algorithms to reduce the amount of consumed energy.In this paper, two detection algorithms are

International Journal of Computers and Applications, 2004

Energy conservation is a critical issue in wireless sensor networks for node and network life, as... more Energy conservation is a critical issue in wireless sensor networks for node and network life, as the nodes are powered by batteries. One way of doing so is to use only local information available to the nodes in the network. This article evaluates a number of power-aware routing protocols based on local information only. The simulation shows that basing the routing decision on the remaining power of neighbouring nodes is not by itself enough. Instead, using the directional value and the sum of power remaining at the next neighbours gives the routing protocol a broader perspective about the condition of the network from a local point of view and enhances the decision process.

CRC Press eBooks, Jul 28, 2004

Wireless sensor networks have become possible because of the ongoing improvements in sensor techn... more Wireless sensor networks have become possible because of the ongoing improvements in sensor technology and VLSI. One issue in smart sensor networks is achieving efficient operation because of the limited available power. For important classes of sensor networks, such as biomedical sensors, the locations of the sensing nodes are fixed and the placement can be predetermined. In this paper, we consider the topology that best supports communication among these sensor nodes. We propose a power-aware routing protocol and simulate the performance, showing that our routing protocol adapts routes to the available power. This leads to a reduction in the total power used as well as more even power usage across nodes. We consider different routes and topologies, demonstrating the difference in performance and explaining the underlying causes.

Engineering, Technology & Applied Science Research, 2016

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the catego... more The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

Zenodo (CERN European Organization for Nuclear Research), Apr 17, 2016

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the catego... more The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any metaheuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any metaheuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

The International Journal of Learning: Annual Review, 2009

ABSTRACT Energy conservation is a critical issue in wireless sensor networks for node and network... more ABSTRACT Energy conservation is a critical issue in wireless sensor networks for node and network life, as the nodes are powered by batteries. One way of doing so is to use only local information available to the nodes in the network. This article evaluates a number of power-aware routing protocols based on local information only. The simulation shows that basing the routing decision on the remaining power of neighbouring nodes is not by itself enough. Instead, using the directional value and the sum of power remaining at the next neighbours gives the routing protocol a broader perspective about the condition of the network from a local point of view and enhances the decision process.

Simulated robotic soccer is frequently used as a test method for contemporary artificial intellig... more Simulated robotic soccer is frequently used as a test method for contemporary artificial intelligence research. It provides a real-time environment with complex dynamics and sensor information that is both noisy and limited. Team coordination between the robots is essential for success. Cultural Algorithm (CA) is a branch of evolutionary algorithms, and it is used in this research to teach software robots to play soccer by finding the best action to execute depending on its position on the field, and its relation to the nearest opponent. The action of each agent is encoded by an integer string that represents the action rules. Our agents played against a team of defenders from well-known teams in order to enhance their offensive capabilities. Agents developed good offensive abilities through team coordination processes supported by Cultural Algorithms. The simulation results are obtained using the well-known Robo-Cup soccer simulator. The results of this research suggest the effectiveness of the proposed method as well as indicating future research directions.

Proceedings of the 7th annual international conference on Mobile computing and networking, 2001

Autobiographical Statement 107 viii List of Tables 2.1 Radio Characteristic . . . . . . . . . . .... more Autobiographical Statement 107 viii List of Tables 2.1 Radio Characteristic . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.1 Interior Routing, 2D . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.2 Edge Routing, 2D . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.3 Fixed Number of Hops, 2D . . . . . . . . . . . . . . . . . . . . . . . . 43 4.4 Routing Freedom and Power Dissipation; 3 and 6 Neighbors . . . . . 44 4.5 Routing Freedom and Power Dissipation; 4 and 8 Neighbors . . . . . 44 4.6 Edge and Interior Routing Power Dissipation . . . . . . . . . . . . . . 45 4.7 Six Neighbors for 2D and 3D Routing Power Dissipation . . . . . . . 46 4.8 Round 10000 from S(0,0) to D(5,5) . . . . . . . . . . . . . . . . . . . 48 4.9 First Node Dead For DSAP at Round 10191 from S(0,0) to D(5,5) . . 51 4.10 First Node Dead Aware--DSAP from S(0,0) to D(5,5) . . . . . . . . . 51 4.11 First Node Dead For Fixed All Routing . . . . . . . . . . . . . . . . . 52 4.12 Topol...

The variance in number and types of tasks required to be implemented within Distributed Virtual E... more The variance in number and types of tasks required to be implemented within Distributed Virtual Environments (DVE) highlights the needs for communication protocols can achieve consistency. In addition, these applications have to handle an increasing number of participants and deal with the difficult problem of scalability. Moreover, the real-time requirements of these applications make the scalability problem more difficult to solve. In this paper, we have implemented Updatable Queue Abstraction protocol (UQA) on TCP (TCP-UQA) and compared it with original TCP, UDP, and Updatable Queue Abstraction based on UDP (UDP-UQA) protocols. Results showed that TCP-UQA was the best in queue management.

International Journal of Computers and Applications, 2004

2011 IEEE Congress of Evolutionary Computation (CEC), 2011

Page 1. Boosting Cultural Algorithms with an Incongruous Layered Social Fabric Influence Function... more Page 1. Boosting Cultural Algorithms with an Incongruous Layered Social Fabric Influence Function Mostafa Z. Ali, Ayad Salhieh, and Randa T. Abu Snanieh Computer Information Systems Jordan University of Science & Technology ...

2009 WRI World Congress on Computer Science and Information Engineering, 2009

Wireless sensor network is a network that contains a set of autonomous inexpensive devices called... more Wireless sensor network is a network that contains a set of autonomous inexpensive devices called sensors. These sensors communicate together to detect, track, and monitor physical environments. Since energy is the scarcest resource in wireless sensor networks, some necessary improvements should be made to current detection algorithms to reduce the amount of consumed energy.In this paper, two detection algorithms are

Communications in Computer and Information Science, 2010

Studies in Computational Intelligence, 2011

In this research we present a new framework based on Cultural Algorithms using an enhanced social... more In this research we present a new framework based on Cultural Algorithms using an enhanced social fabric influence function to solve nonlinearly constrained global optimization problems. We identify how knowledge sources used by Cultural Algorithms ...

Communications in Computer and Information Science, 2010

... 325 Jatin Verma and Sunita Prasad Extended Abstracts of Posters A Novel Framework for Executi... more ... 325 Jatin Verma and Sunita Prasad Extended Abstracts of Posters A Novel Framework for Executing Untrusted Programs..... ... 358 Kumar Dhiraj, E. Ashwani Kumar, Rameshwar Baliar Singh, and Santanu Kumar Rath Page 15. ...

Studies in Computational Intelligence, 2012

Linear data transformations are essential operations in many machine learning algorithms, helping... more Linear data transformations are essential operations in many machine learning algorithms, helping to make such models more flexible or to emphasize certain data directions. In particular for high dimensional data sets linear transformations are not necessarily uniquely determined, though, and alternative parameterizations exist which do not change the mapping of the training data. Thus, regularization is required to make the model robust to noise and more interpretable for the user. In this contribution, we characterize the group of transformations which leave a linear mapping invariant for a given finite data set, and we discuss the consequences on the interpretability of the models. We propose an intuitive regularization mechanism to avoid problems in under-determined configurations, and we test the approach in two machine learning models.

Handbook of Sensor Networks: Compact Wireless …, 2004

14.2 Background Much of the related research addresses WSNs that are mobile and battery powered. ... more 14.2 Background Much of the related research addresses WSNs that are mobile and battery powered. Because of these requirements, most of the literature is concentrated on finding solutions at various levels of the communication protocol, including being extremely ...

Wireless sensor network is a network that contains a set of autonomous inexpensive devices called... more Wireless sensor network is a network that contains a set of autonomous inexpensive devices called sensors. These sensors communicate together to detect, track, and monitor physical environments. Since energy is the scarcest resource in wireless sensor networks, some necessary improvements should be made to current detection algorithms to reduce the amount of consumed energy.In this paper, two detection algorithms are

International Journal of Computers and Applications, 2004

Energy conservation is a critical issue in wireless sensor networks for node and network life, as... more Energy conservation is a critical issue in wireless sensor networks for node and network life, as the nodes are powered by batteries. One way of doing so is to use only local information available to the nodes in the network. This article evaluates a number of power-aware routing protocols based on local information only. The simulation shows that basing the routing decision on the remaining power of neighbouring nodes is not by itself enough. Instead, using the directional value and the sum of power remaining at the next neighbours gives the routing protocol a broader perspective about the condition of the network from a local point of view and enhances the decision process.

CRC Press eBooks, Jul 28, 2004

Wireless sensor networks have become possible because of the ongoing improvements in sensor techn... more Wireless sensor networks have become possible because of the ongoing improvements in sensor technology and VLSI. One issue in smart sensor networks is achieving efficient operation because of the limited available power. For important classes of sensor networks, such as biomedical sensors, the locations of the sensing nodes are fixed and the placement can be predetermined. In this paper, we consider the topology that best supports communication among these sensor nodes. We propose a power-aware routing protocol and simulate the performance, showing that our routing protocol adapts routes to the available power. This leads to a reduction in the total power used as well as more even power usage across nodes. We consider different routes and topologies, demonstrating the difference in performance and explaining the underlying causes.

Engineering, Technology & Applied Science Research, 2016

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the catego... more The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

Zenodo (CERN European Organization for Nuclear Research), Apr 17, 2016

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the catego... more The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any metaheuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any metaheuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

The International Journal of Learning: Annual Review, 2009

ABSTRACT Energy conservation is a critical issue in wireless sensor networks for node and network... more ABSTRACT Energy conservation is a critical issue in wireless sensor networks for node and network life, as the nodes are powered by batteries. One way of doing so is to use only local information available to the nodes in the network. This article evaluates a number of power-aware routing protocols based on local information only. The simulation shows that basing the routing decision on the remaining power of neighbouring nodes is not by itself enough. Instead, using the directional value and the sum of power remaining at the next neighbours gives the routing protocol a broader perspective about the condition of the network from a local point of view and enhances the decision process.

Simulated robotic soccer is frequently used as a test method for contemporary artificial intellig... more Simulated robotic soccer is frequently used as a test method for contemporary artificial intelligence research. It provides a real-time environment with complex dynamics and sensor information that is both noisy and limited. Team coordination between the robots is essential for success. Cultural Algorithm (CA) is a branch of evolutionary algorithms, and it is used in this research to teach software robots to play soccer by finding the best action to execute depending on its position on the field, and its relation to the nearest opponent. The action of each agent is encoded by an integer string that represents the action rules. Our agents played against a team of defenders from well-known teams in order to enhance their offensive capabilities. Agents developed good offensive abilities through team coordination processes supported by Cultural Algorithms. The simulation results are obtained using the well-known Robo-Cup soccer simulator. The results of this research suggest the effectiveness of the proposed method as well as indicating future research directions.

Proceedings of the 7th annual international conference on Mobile computing and networking, 2001

Autobiographical Statement 107 viii List of Tables 2.1 Radio Characteristic . . . . . . . . . . .... more Autobiographical Statement 107 viii List of Tables 2.1 Radio Characteristic . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.1 Interior Routing, 2D . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.2 Edge Routing, 2D . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.3 Fixed Number of Hops, 2D . . . . . . . . . . . . . . . . . . . . . . . . 43 4.4 Routing Freedom and Power Dissipation; 3 and 6 Neighbors . . . . . 44 4.5 Routing Freedom and Power Dissipation; 4 and 8 Neighbors . . . . . 44 4.6 Edge and Interior Routing Power Dissipation . . . . . . . . . . . . . . 45 4.7 Six Neighbors for 2D and 3D Routing Power Dissipation . . . . . . . 46 4.8 Round 10000 from S(0,0) to D(5,5) . . . . . . . . . . . . . . . . . . . 48 4.9 First Node Dead For DSAP at Round 10191 from S(0,0) to D(5,5) . . 51 4.10 First Node Dead Aware--DSAP from S(0,0) to D(5,5) . . . . . . . . . 51 4.11 First Node Dead For Fixed All Routing . . . . . . . . . . . . . . . . . 52 4.12 Topol...

The variance in number and types of tasks required to be implemented within Distributed Virtual E... more The variance in number and types of tasks required to be implemented within Distributed Virtual Environments (DVE) highlights the needs for communication protocols can achieve consistency. In addition, these applications have to handle an increasing number of participants and deal with the difficult problem of scalability. Moreover, the real-time requirements of these applications make the scalability problem more difficult to solve. In this paper, we have implemented Updatable Queue Abstraction protocol (UQA) on TCP (TCP-UQA) and compared it with original TCP, UDP, and Updatable Queue Abstraction based on UDP (UDP-UQA) protocols. Results showed that TCP-UQA was the best in queue management.

International Journal of Computers and Applications, 2004

2011 IEEE Congress of Evolutionary Computation (CEC), 2011

Page 1. Boosting Cultural Algorithms with an Incongruous Layered Social Fabric Influence Function... more Page 1. Boosting Cultural Algorithms with an Incongruous Layered Social Fabric Influence Function Mostafa Z. Ali, Ayad Salhieh, and Randa T. Abu Snanieh Computer Information Systems Jordan University of Science & Technology ...

2009 WRI World Congress on Computer Science and Information Engineering, 2009

Wireless sensor network is a network that contains a set of autonomous inexpensive devices called... more Wireless sensor network is a network that contains a set of autonomous inexpensive devices called sensors. These sensors communicate together to detect, track, and monitor physical environments. Since energy is the scarcest resource in wireless sensor networks, some necessary improvements should be made to current detection algorithms to reduce the amount of consumed energy.In this paper, two detection algorithms are

Communications in Computer and Information Science, 2010

Studies in Computational Intelligence, 2011

In this research we present a new framework based on Cultural Algorithms using an enhanced social... more In this research we present a new framework based on Cultural Algorithms using an enhanced social fabric influence function to solve nonlinearly constrained global optimization problems. We identify how knowledge sources used by Cultural Algorithms ...

Communications in Computer and Information Science, 2010

... 325 Jatin Verma and Sunita Prasad Extended Abstracts of Posters A Novel Framework for Executi... more ... 325 Jatin Verma and Sunita Prasad Extended Abstracts of Posters A Novel Framework for Executing Untrusted Programs..... ... 358 Kumar Dhiraj, E. Ashwani Kumar, Rameshwar Baliar Singh, and Santanu Kumar Rath Page 15. ...

Studies in Computational Intelligence, 2012

Linear data transformations are essential operations in many machine learning algorithms, helping... more Linear data transformations are essential operations in many machine learning algorithms, helping to make such models more flexible or to emphasize certain data directions. In particular for high dimensional data sets linear transformations are not necessarily uniquely determined, though, and alternative parameterizations exist which do not change the mapping of the training data. Thus, regularization is required to make the model robust to noise and more interpretable for the user. In this contribution, we characterize the group of transformations which leave a linear mapping invariant for a given finite data set, and we discuss the consequences on the interpretability of the models. We propose an intuitive regularization mechanism to avoid problems in under-determined configurations, and we test the approach in two machine learning models.

Handbook of Sensor Networks: Compact Wireless …, 2004

14.2 Background Much of the related research addresses WSNs that are mobile and battery powered. ... more 14.2 Background Much of the related research addresses WSNs that are mobile and battery powered. Because of these requirements, most of the literature is concentrated on finding solutions at various levels of the communication protocol, including being extremely ...