| 1. |
- Abdulaziz, Shada, et al.
(författare)
-
Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks
- 2020
-
Ingår i: Algorithms. - : MDPI AG. - 1999-4893. ; 13:2
-
Tidskriftsartikel (refereegranskat)abstract
- An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality.
|
|
| 2. |
- Abdulaziz, Shada
(författare)
-
Marginalized Women & Double Marginalization
- 2019
-
Ingår i: INSAF Center for Defending Freedoms & Minorities.
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- The article discusses the reality of marginalized women in the Marginalized community (al-Muhammashin) in Yemen.
|
|
| 3. |
- Abdulaziz, Shada, et al.
(författare)
-
Memetic Algorithm for the Minimum Edge Dominating Set Problem
- 2013
-
Ingår i: International Journal of Artificial Intelligence. - : Institute of Advanced Engineering and Science. - 2252-8938. ; 2:4, s. 179-186
-
Tidskriftsartikel (refereegranskat)abstract
- The minimum edge dominating set (MEDS) is one of the fundamental covering problems in graph theory, which finds many practical applications in diverse domains. In this paper, we propose a meta-heuristic approach based on genetic algorithm and local search to solve the MEDS problem. Therefore, the proposed method is considered as a memetic search algorithm which is called Memetic Algorithm for minimum edge dominating set (MAMEDS). In the MAMEDS method, a new fitness function is invoked to effectively measure the solution qualities. The search process in the proposed method uses intensification schemes beside the main genetic search operations in order to achieve faster performance. The experimental results proves that the proposed method is promising in solving the MEDS problem.
|
|
| 4. |
- Abdulaziz, Shada, et al.
(författare)
-
Memetic Algorithm with Filtering Scheme for the Minimum Weighted Edge Dominating Set Problem
- 2013
-
Ingår i: International Journal of Advanced Research in Artificial Intelligence. - 2165-4069. ; 2:8, s. 44-49
-
Tidskriftsartikel (refereegranskat)abstract
- The minimum weighted edge dominating set problem (MWEDS) generalizes both the weighted vertex cover problem and the problem of covering the edges of graph by a minimum cost set of both vertices and edges. In this paper, we propose a meta heuristic approach based on genetic algorithm and local search to solve the MWEDS problem. Therefore, the proposed method is considered as a memetic search algorithm which is called Memetic Algorithm with filtering scheme for minimum weighted edge dominating set, and called shortly (MAFS). In the MAFS method, three new fitness functions are invoked to effectively measure the solution qualities. The search process in the proposed method uses intensification scheme, called “filtering”, beside the main genetic search operations in order to achieve faster performance. The experimental results proves that the proposed method is promising in solving the MWEDS problem.
|
|
| 5. |
|
|
| 6. |
- Abdulaziz, Shada
(författare)
-
من تحرير حضرموت إلى تحرير الطفل الحضرمي
- 2018
-
Ingår i: Al-yom Al-rrabea.
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- The article discusses the difficulties that faces children in Hadhramout -Yemen during the civil war. While the politicians and the other elites concentrate to fight terrorism and armed groups they ignore the needs of children, woman, and other marginalized groups.
|
|
| 7. |
- Hedar, Abdel Rahman, et al.
(författare)
-
Wireless sensor networks fault-tolerance based on graph domination with parallel scatter search
- 2020
-
Ingår i: Sensors (Switzerland). - : MDPI AG. - 1424-8220. ; 20:12
-
Tidskriftsartikel (refereegranskat)abstract
- In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.
|
|
