Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.
The aim of the current study is to in evaluate the role of SOD activity in the previously reported oxidative stress in our laboratory(1), in the patients with different brain tumors. SOD activity was assayed according to riboflavin/NBT method and its specific activity was calculated in patients with benign and malignant brain tumors and control. Moreover the specific activity was compared in these samples according to gender and the occurrence of disease.Non significant elevation (P > 0.05) in SOD specific activity was observed in tissue of malignant tumors in comparison to that of in benign brain tumors. While a highly significant decrease (P < 0.001) of the specific activity was found in sera of malignant patients group in comparison to t
... Show MoreTrue random number generators are essential components for communications to be conconfidentially secured. In this paper a new method is proposed to generate random sequences of numbers based on the difference of the arrival times of photons detected in a coincidence window between two single-photon counting modules
Automatic Programming Assessment (APA) has been gaining lots of attention among researchers mainly to support automated grading and marking of students’ programming assignments or exercises systematically. APA is commonly identified as a method that can enhance accuracy, efficiency and consistency as well as providing instant feedback on students’ programming solutions. In achieving APA, test data generation process is very important so as to perform a dynamic testing on students’ assignment. In software testing field, many researches that focus on test data generation have demonstrated the successful of adoption of Meta-Heuristic Search Techniques (MHST) so as to enhance the procedure of deriving adequate test data for efficient t
... Show MoreThis study reported the investigation of the Radio Frequency (RF) signal propagation of Global System for Mobile Communications (GSM) coverage in Emmanuel Alayande College of Education (EACOED), Oyo, Oyo State, Nigeria. The study aims at amplifying the quality of service and augment end users' sensitivity of the wireless services operation. The drive test method is adopted with estimation of coverage level and received signal strength. The Network Cell Info Lite application installed in three INFINIX GSM mobile phones was employed to take the measurement of the signal strength received from the transmitting stations of different mobile networks. The results of the study revealed that MTN has the maximum signal strength with a mean value
... Show MoreKey generation for data cryptography is vital in wireless communications security. This key must be generated in a random way so that can not be regenerated by a third party other than the intended receiver. The random nature of the wireless channel is utilized to generate the encryption key. However, the randomness of wireless channels deteriorated over time due to channel aging which casing security threats, particularly for spatially correlated channels. In this paper, the effect of channel aging on the ciphering key generations is addressed. A proposed method to randomize the encryption key each coherence time is developed which decreases the correlation between keys generated at consecutive coherence times. When compared to the
... Show MoreTo decrease the impact on the environment of building waste, the recycled aggregate may be used in various sustainable engineering applications, such as roller compacted concrete pavement (RCCP). This research examined how using recycled aggregate as a partial replacement for natural aggregate as coarse or fine affected the mechanical properties of roller-compacted concrete pavement. The recycled aggregate was crushed and sieved to coarse and fine aggregate before being used in the roller-compacted concrete pavement. Compressive strength, splitting tensile strength, and flexural strength were all evaluated after the samples were prepared at 28 and 90 days of curing. According to the study's findings, the partial replacem
... Show MoreBackground: In young adults, multiple sclerosis is a prevalent chronic inflammatory demyelinating condition. It is characterized by white matter affection, but many individuals also have significant gray matter involvement. A double-inversion recovery pulse (DIR) pattern was recently proposed to improve the visibility of multiple sclerosis lesions. Objective: To find out how well a DIR sequence, FLAIR, and T2-weighted pulse sequences can find MS lesions in the supratentorial and infratentorial regions. Methods: A total of 37 patients with established diagnoses of multiple sclerosis were included in this cross-sectional study. Brain MRI was done using double inversion recovery, T2, and FLAIR sequences. The number of lesions was count
... Show MoreSequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove
... Show MoreSequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of
... Show More