Enhanced dynamic bandwidth allocation proportional to queue length with threshold value for VBR traffic

In Asynchronous Transfer Mode (ATM) network, Variable Bit Rate (VBR) service category has been defined to support any application for which the end-system can benefit from statistical multiplexing, by sending information at a variable rate, and can tolerate or recover from a potentially small random loss ratio. Due to its burst characteristic, bandwidth allocation strategy is necessary in order to share the network resources with other traffics fairly. The implementation of proposed approaches; heuristic, Unused Buffer Reallocation (UnBR) and Higher-priority Queue Sharing (HQS), in bandwidth strategy perform better improvement if compare to the proposed strategy. In addition, we observed that a bandwidth strategy did not always perform well, hence, suitable strategies should be chosen depending on the different conditions in order to fulfill its network demand

Enhancing the Stability of the Improved-LEACH Routing Protocol for WSNs

Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes' residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes' distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes' distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime

Energy efficient path reconstruction in wireless sensor network using iPath

Wireless sensor networks operate through commonly self-organized sensor nodes to transfer data in a multi-hop approach to a central sink. In order to support fine-grained diagnostic analysis and optimize the performance level of the networks, the reconstruction of per-packet routing path is essential. However, in large-scale networks, the performance levels of the current path reconstruction method decline rapidly, with loss of links. An efficient approach to fully comprehend the complex internal behavior of network is through the reconstruction of the routing path of each received packet at the sink side. This paper discussed the added of energy efficiency parameter to enhance the inference Path (iPath). Thus, the iPath by added the energy efficiency enables the reconstruction of the per-packet routing paths of large-scale networks, by providing a stable and efficient route to exchange messages between source and destination in a timely manner. This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. Energy efficient iPath (E-iPath) is evaluated with several variations of nodes in WSN deployments as well as large-scale simulations. The findings demonstrate that E-iPath surpasses other current approaches such as EEPMM. E-iPath has accomplished low transmission overhead which it has reduced 13% of the energy consumption and has gained significant reconstruction ratio compared with iPath

ATM switch: impact of heuristic approach to static bandwidth allocation

In this paper, the performance evaluation of two Asynchorous Transfer Mode (ATM) scheduler strategies, static bandwidth allocation with and without heuristic approach are presented. Several experiments were carried out by using the ON-OFF distribution source model based on the ATM Various Bit Rate (VBR) service category. The strategy with the heuristic approach improves the buffer cell loss ratio (CLR) performance significantly. Several numerical results are presented to show the effects of the heuristic approach to bandwidth allocation

The design and development of peer-to-peer based mobile application for petty trading

Recent popularity of mobile devices such as smart phones and tablets have increase the usage of these devices including by petty traders. This paper presents a prototype mobile phone application designed and developed to enhance the business activities for petty traders especially in open markets such as night markets. The proposed application consists of three major component for petty trading activities: i)Trader Searching Component, ii)Trader- Customer Communication Component, and iii)Trader Pamphlet Distributor. Provided that both the trader and customer have installed the application on their phones the application will provide real-time information to the customer regarding nearest available traders doing their businesses at a particular trading place visited by the customer. It has to be noted that the application is based on decentralized peer-to-peer architecture in which there is no centralized party managing all the data

Two Stages Transfer Algorithm (TSTT) for independent tasks scheduling in heterogeneous computing systems

Task scheduling is critical in heterogeneous systems especially with the huge number of tasks transmitted over grid causing system delay. Since heuristics are proposing methods for solving heterogeneous computing systems, several techniques were proposed for the scheduling on grid computing systems to get better execution time. In this paper, a proposed new heuristic algorithm named Two Stages Tasks Transfer (TSTT) algorithm to enhance Tenacious Penalty Based scheduling (TPB) algorithm. Heterogeneous Computing Scheduling Problem (HCSP) mathematical model has been used, where the independent tasks assigned to heterogeneous machines with different characteristics. Twelve datasets with different heterogeneity level examined using different heuristic algorithms to compare the performance with our proposed algorithm. The proposed algorithm showed its efficiency in term of makespan, resource utilization metrics for set of tasks