Motorized cart

Motorized cart is known as an effective tool and timeless that help people carry heavy loads. For farmers, it has an especially vital tool for moving goods. Oil palm farmers typically uses the wheelbarrow to move the oil palm fruit (Figure 10.1). However, there is a lack of equipment that should be further enhanced in capabilities. Motorized carts that seek to add automation to wheelbarrow as it is to help people save manpower while using it. At present, oil palm plantation industry is among the largest in Malaysia. However, in an effort to increase the prestige of the industry to a higher level there are challenges to be faced. Shortage of workers willing to work the farm for harvesting oil palm has given pain to manage oil palm plantations. Many have complained about the difficulty of hiring foreign workers and a high cost. Although there are tools that can be used to collect or transfer the proceeds of oil palm fruits such as carts available. However, these tools still have the disadvantage that requires high manpower to operate. Moreover, it is not suitable for all land surfaces and limited cargo space. Workload and manpower dependence has an impact on farmers' income

Improved Spectrum Mobility using Virtual Reservation in Collaborative Cognitive Radio Networks

Cognitive radio technology would enable a set of secondary users (SU) to opportunistically use the spectrum licensed to a primary user (PU). On the appearance of this PU on a specific frequency band, any SU occupying this band should free it for PUs. Typically, SUs may collaborate to reduce the impact of cognitive users on the primary network and to improve the performance of the SUs. In this paper, we propose and analyze the performance of virtual reservation in collaborative cognitive networks. Virtual reservation is a novel link maintenance strategy that aims to maximize the throughput of the cognitive network through full spectrum utilization. Our performance evaluation shows significant improvements not only in the SUs blocking and forced termination probabilities but also in the throughput of cognitive users.Comment: 7 pages, 10 figures, IEEE ISCC 201

A Decision-Theoretic Approach to Resource Allocation in Wireless Multimedia Networks

The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in terms of decision theory. We propose a scheme that takes decision-theoretic concerns (like preferences) into account and discuss the difficulties and subtleties involved in applying standard techniques from the theory of Markov Decision Processes (MDPs) in constructing an algorithm that is decision-theoretically optimal. As an example of the proposed framework, we construct such an algorithm under some simplifying assumptions. Additionally, we present analysis and simulation results that show that our algorithm meets its design goals. Finally, we investigate how far from optimal one well-known heuristic is. The main contribution of our results is in providing insight and guidance for the design of near-optimal admission-control policies.Comment: To appear, Dial M for Mobility, 200

An Overview of Vertical Handoff Decision Algorithms in NGWNs and a new Scheme for Providing Optimized Performance in Heterogeneous Wireless Networks

Because the increasingly development and use of wireless networks and mobile technologies, was implemented the idea that users of mobile terminals must have access in different wireless networks simultaneously. Therefore one of the main interest points of Next Generation Wireless Networks (NGWNs), refers to the ability to support wireless network access equipment to ensure a high rate of services between different wireless networks. To solve these problems it was necessary to have decision algorithms to decide for each user of mobile terminal, which is the best network at some point, for a service or a specific application that the user needs. Therefore to make these things, different algorithms use the vertical handoff technique. Below are presented a series of algorithms based on vertical handoff technique with a classification of the different existing vertical handoff decision strategies, which tries to solve these issues of wireless network selection at a given time for a specific application of an user. Based on our synthesis on vertical handoff decision strategies given below, we build our strategy based on solutions presented below, taking the most interesting aspect of each one.Vertical Handoff, Genetic Algorithms, Fuzzy Logic, Neural Networks, AHP

A Comparative Study of Prioritized Handoff Schemes with Guard Channels in Wireless Cellular Networks

Mobility management has always been the main challenge in most mobile systems. It involves the management of network radio channel resource capacity for the purpose of achieving optimum quality of service (QoS) standard. In this era of wireless Personal Communication Networks such as Global System for Mobile Communication (GSM), Wireless Asynchronous Transfer Mode (WATM), Universal Mobile Telecommunication System (UMTS), there is a continuous increase in demand for network capacity. In order to accommodate the increased demand for network capacity (radio resource) over the wireless medium, cell sizes are reduced. As a result of such reduction in cell sizes, handoffs occur more frequently, and thereby result in increased volume of handoff related signaling. Therefore, a handoff scheme that can handle the increased signaling load while sustaining the standard QoS parameters is required.This work presents a comparative analysis of four popular developed handoff schemes. New call blocking probability, forced termination probability and throughput are the QoS parameters employed in comparing the four schemes. The four schemes are:RCS-GC,MRCS-GC, NCBS-GC, and APS-GC. NCBS-GChas the leased new call blocking probability while APS-GC has the worst. In terms of forced termination probability, MRCS-GC has the best result, whileRCS-GChas the worst scheme.MRCS-GC delivers the highest number of packets per second while APS-GC delivers the least. These performance metrics are computed by using the analytical expressions developed for these metrics in the considered models in a Microsoft Excel spreadsheet environment.http://dx.doi.org/10.4314/njt.v34i3.2

An improved multi-agent simulation methodology for modelling and evaluating wireless communication systems resource allocation algorithms

Multi-Agent Systems (MAS) constitute a well known approach in modelling dynamical real world systems. Recently, this technology has been applied to Wireless Communication Systems (WCS), where efficient resource allocation is a primary goal, for modelling the physical entities involved, like Base Stations (BS), service providers and network operators. This paper presents a novel approach in applying MAS methodology to WCS resource allocation by modelling more abstract entities involved in WCS operation, and especially the concurrent network procedures (services). Due to the concurrent nature of a WCS, MAS technology presents a suitable modelling solution. Services such as new call admission, handoff, user movement and call termination are independent to one another and may occur at the same time for many different users in the network. Thus, the required network procedures for supporting the above services act autonomously, interact with the network environment (gather information such as interference conditions), take decisions (e.g. call establishment), etc, and can be modelled as agents. Based on this novel simulation approach, the agent cooperation in terms of negotiation and agreement becomes a critical issue. To this end, two negotiation strategies are presented and evaluated in this research effort and among them the distributed negotiation and communication scheme between network agents is presented to be highly efficient in terms of network performance. The multi-agent concept adapted to the concurrent nature of large scale WCS is, also, discussed in this paper