Quantum computers for optimization the performance

Computers decrease human work and concentrate on enhancing the performance to advance the technology. Various methods have been developed to enhance the performance of computers. Performance of computer is based on computer architecture, while computer architecture differs in various devices, such as microcomputers, minicomputers, mainframes, laptops, tablets, and mobile phones. While each device has its own architecture, the majority of these systems are built on Boolean algebra. In this study, a few basic concepts used in quantum computing are discussed. It is known that quantum computers do not possess any transistor and chip while being roughly 100 times faster than a common classic silicon computer. Scientists believe that quantum computers are the next generation of the classic computers

An efficient wireless network discovery method for vertical handover between WiMAX and WLAN

One of the most difficult tasks for coordination the vertical handover is the discovering currently available radio access networks. Although the mobile nodes (MN) is easily can access to Worldwide Interoperability for Microwave Access (WiMAX) network, but continually it would have to discover available wireless local area network (WLAN) networks, which provide high data rates but have limited coverage area. This process discovers has a significant effect on the discovery time and power consumption for MNs. this article introduce a new technique to enhance access router discovery (EARD) method to solve this problems. Our proposal EARD method, previous access router provides information about the neighbouring networks for MN to discover available networks as soon as possible. We can see through simulation results that by enabling the EARD method has improved power consumption and the discover time of networks in the performance of MNs compared to the conventional network discovery techniques

SCSA: Evaluating skyline queries in incomplete data

Skyline queries have been extensively incorporated in various contemporary database applications. The list includes but is not limited to multi-criteria decision-making systems, decision support systems, and recommendation systems. Due to its great benefits and wide application range, many skyline algorithms have already been proposed in numerous data settings. Nonetheless, most researchers presume the completion of data meaning that all data item values are available. Since this assumption cannot be sustained in a large number of real-world database applications, the existing algorithms are rather inadequate to be directly applied on a database with incomplete data. In such cases, processing skyline queries on incomplete data incur exhaustive pairwise comparisons between data items, which may lead to loss of the transitivity property of the skyline technique. Losing the transitivity property may in turn give rise to the problem of cyclic dominance. In order to address these issues, we propose a new skyline algorithm called Sorting-based Cluster Skyline Algorithm (SCSA) that combines the sorting and partitioning techniques and simplifies the skyline computation on an incomplete dataset. These two techniques help boost the skyline process and avoid many unnecessary pairwise comparisons between data items to prune the dominated data items. The comprehensive experiments carried out on both synthetic and real-life datasets demonstrate the effectiveness and versatility of our approach as compared to the currently used approaches

Improved handover decision algorithm using multiple criteria

The transfer of massive data between varied network positions links of network relies on data rate, as well as the traffic capacity of the network. Conventionally, a device that is mobile can be used to attain vertical handover functional by weighing in only an aspect, which refers to Received Signal Strength (RSS). The application of this particular criterion could lead to interruption in services, ineffective vertical handover, and a network load that is not balanced. Hence, this paper proposes an improvised vertical handover decision algorithm by integrating multi-criteria within a wireless network that is heterogeneous. The proposed algorithm comprised of three vertical handover decision algorithms, namely: mobile weight, network weight, and equal weight. Additionally, three technology interfaces were embedded in this study including Worldwide interoperability for Microwave Access (WiMAX), Wireless Local Area Network (WLAN), and Long-Term Evolution (LTE). As a result, the simulation outcomes demonstrated that the handover decision algorithm for network weight generated exceptional outputs, in comparison to mobile and equal weights, as well as the conventional network decision algorithm from the aspects of handover failure and handover number probabilities

A network selection algorithm based on enhanced access router discovery in heterogeneous wireless networks

The management process between different wireless technologies for mobile devices is very important to complete the handover operations. The handover operation needs to determine the delay and packet loss in order to be the quality of service within a certain level. Selecting the best available network at the appropriate time is very significant in the direction of realizing ubiquitous networks. In this paper a network selection approach named enhanced access router discovery (EARD) is proposed. The approach is developed to work in a heterogeneous environment including of WiMAX and WLAN networks. The EARD method utilizes the prioritized rating for multiple criteria (PRMC) proposed for selecting the target network. The proposed approach is evaluated with respect to various conditions with different traffic types. The simulation results show that our proposed approach outperform the traditional network selection methods is selecting the most appropriate network

An enhanced group mobility management method in wireless body area networks

Mobility management of wireless body area networks (WBANs) is an emerging key element in the healthcare system. The remote sensor nodes of WBAN are usually deployed on subjects’ body. Certain proxy mobile IPv6 (PMIP) methods have been recommended, however, PMIP is relatively impractical in group mobility management pertaining to WBAN. It is likely to cause enormous registration and handover interruptions. This paper presents an approach aims at overcome these limitations using improved group mobility management method. The method emphasizes on incorporation of authentication, authorization, and accounting (AAA) service into the local mobility anchor (LMA) as an alternative to independent practice. Furthermore, proxy binding update (PBU) and AAA inquiry messages are merged. Additionally, AAA response and proxy binding acknowledge (PBA) message are combined. The experiment results demonstrate that the proposed method outperforms the existing PMIP methods in terms of delay time for registration, the handover interruptions and the average signaling cost

An enhanced group mobility managemnt method in wireless body area networks

Mobility management of wireless body area networks (WBANs) is an emerging key element in the healthcare system. The remote sensor nodes of WBAN are usually deployed on subjects’ body. Certain proxy mobile IPv6 (PMIP) methods have been recommended, however, PMIP is relatively impractical in group mobility management pertaining to WBAN. It is likely to cause enormous registration and handover interruptions. This paper presents an approach aims at overcome these limitations using improved group mobility management method. The method emphasizes on incorporation of authentication, authorization, and accounting (AAA) service into the local mobility anchor (LMA) as an alternative to independent practice. Furthermore, proxy binding update (PBU) and AAA inquiry messages are merged. Additionally, AAA response and proxy binding acknowledge (PBA) message are combined. The experiment results demonstrate that the proposed method outperforms the existing PMIP methods in terms of delay time for registration, the handover interruptions and the average signaling cost

Fast handover technique in heterogeneous wireless networks

The next generation of wireless communication systems are facing many challenges that need solutions so that it can coexist with each other. One of these challenges is the mobility solutions that facilitate users with seamless inter-technology roaming capabilities that in turn require a seamless inter-system handover. Naturally, every inter-system roaming which leads to vertical handover requires that both link layer and network layer handovers happen, since network point of attachment as well as the device interface is changed. Several investigations and efforts in standardization are being made by several institutes and individuals to finally design and implement each of these communication layers. However, for the specific purpose of vertical handover in a heterogeneous wireless network, the information preparation for these two layers before any operations of handover can directly affect the significant performance parameters and consequently lead to seamless handover. This thesis is intended for detailing out a study of vertical handover in a heterogeneous wireless network that includes two main aspects. These aspects are the network information gathering and then the use of these information during the vertical handover. First, we proposed an Enhance Access Router Discovery (EARD) method for exchanging the information between the access routers that overlap in the coverage area. The gathered information includes a list of unique IP addresses that are generated and checked by their access router, the media access control (MAC) address of the device, channel number and additional information related to the network characteristics and requirements. Second, the use of these information to support all the handover operations, which includes network discovery, handover decision and handover execution. In the first operation, the previous access router provides information about the neighboring networks for Mobile Node (MN) to discover available networks as soon as possible. The second operation is selecting the best available network for MN through the network side and taking into consideration the traffic type. The last operation, the previous access router rapidly provides a unique Ipv6 address instead of new access router for MNs to execute the last operation of handover. The results show the benefits of our EARD method by improving the discovery time of networks, giving the best performance in terms of network selections and minimizing the handover latency and packet loss in handover execution when compared to the conventional technique

The rapid vertical handover for efficient IPv6 mobility support in heterogeneous wireless network

The management techniques employed for Fast Mobile Internet Protocol version 6 (FMIPv6) and Media Independent Handover services between different wireless technologies are very important for completing the handover operations with the least possible delay. In the FMIPv6 technique, when a mobile node (MN) moves to another network, it needs to perform vertical handover (VHO) operations. These operations have a severe impact on the handover latency. In this article, we propose an enhanced network layer mechanism that is used to support fast handover for VHO. We introduce a new idea for the access router discovery method and propose a rapid VHO algorithm accordingly. Our proposal of a rapid VHO algorithm, a previous access router (pAR), rapidly provides a unique Ipv6 address instead of a new access router (nAR) for MNs. The binding updates to both the home agent and the correspondent node are performed from the pAR. We can observe from the results that by optimizing the network layer, the rapid VHO algorithm rapidly presents unique Ipv6 addresses for MNs with a minimum handover latency and packet loss even at high-speed movements. Finally, we presented an analytical model which shows that by enabling the access router discovery method and enhancing the network layer mechanism, an MN can perform fast handover processes with low handover latency compared with the FMIPv6 technique

OCA: Ordered Clustering-Based Algorithm for E-Commerce Recommendation System

The industry of e-commerce (EC) has become more popular and creates tremendous business opportunities for many firms. Modern societies are gradually shifting towards convenient online shopping as a result of the emergence of EC. The rapid growth in the volume of the data puts users in a big challenge when purchasing products that best meet their preferences. The reason for this is that people will be overwhelmed with many similar products with different brands, prices, and ratings. Consequently, they will be unable to make the best decision about what to purchase. Various studies on recommendation systems have been reported in the literature, concentrating on the issues of cold-start and data sparsity, which are among the most common challenges in recommendation systems. This study attempts to examine a new clustering technique named the Ordered Clustering-based Algorithm (OCA), with the aim of reducing the impact of the cold-start and the data sparsity problems in EC recommendation systems. A comprehensive review of data clustering techniques has been conducted, to discuss and examine these data clustering techniques. The OCA attempts to exploit the collaborative filtering strategy for e-commerce recommendation systems to cluster users based on their similarities in preferences. Several experiments have been conducted over a real-world e-commerce data set to evaluate the efficiency and the effectiveness of the proposed solution. The results of the experiments confirmed that OCA outperforms the previous approaches, achieving higher percentages of Precision (P), Recall (R), and F-measure (F)