Portable mud remover

Basically, the only way to remove mud is by using shovel. The process of removing mud usually need us to shovel out the mud, put it into buckets and carry it outside and by using a garden sprayer or hose to wash away mud from hard surfaces [1]. This is because there are no specific tools or products to remove the mud in our industries. In that case, our group had come up with an idea to design a “Portable Mud Remover” which is inspired from a lawnmower and vacuum as shown in Figure 10.1. The idea of using concept of lawnmower is because to make is the product is portable and easy to handling. The smallest types of lawnmower are pushed by a human user and are suitable for small space. The problem occurs for the pool vacuum is that the product is not suitable to suck the mud because it is not designed for a heavy duty work

Performance metrics for the prediction of link and path availability in VANETs

In this paper metrics are produced which may be used for performance enhancement in Vehicular ad-hoc networks (VANETs) protocols. The method described makes use of the concept of link availability estimates which are produced on an individual link basis and which may be combined by multiplication to produce a quality metric for the whole route. The technique is discussed in the context of the Ad hoc On-demand Distance Vector (AODV) routing method

A new routing metric for DYMO protocol on mobile AD HOC network

Mobile ad hoc networks (MANETs) are consists of mobile devices connected wirelessly. MANETs communicate without any fixed infrastructure or any centralized domain. All the nodes are free to move randomly within the network and share information dynamically. Routing protocol in MANET show how the mobile nodes messages are forwarded in a multi-hop fashion. The wireless connectivity and node mobility in MANET networks contributes in rapid topological changes, which brings the need for a channel aware routing protocol. Hence, the need for efficient routing protocols to allow the nodes to communicate. In such a communication scheme a routing protocol play an important role in the network performances. Achieving high user data rates over multi-hop wireless paths is considered the ultimate goal for MANET. To overcome this problem, several important modifications to the routing protocol algorithms are then considered to operate better in networks. This research work proposed a SNR-based routing metric for Dynamic Mobile Ad hoc Network onDemand (DYMO) routing protocol. This paper starts by investigate and compare the performance among reactive routing protocols in MANET. Secondly, the DYMO protocol choose routes based on SNR metric are modeled as proposed the new routing metric. Simulations scenarios are used for the work of the research by develop the new routing metrics in DYMO protocol module in OMNET++. The results show that SNR-DYMO improves the performance of the MANET in terms of throughput and packet delivery ratio throughout all simulation scenarios

A Cross-Layer Modification to the DSR Routing Protocol in Wireless Mesh Networks

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance comparisons between max_min_AEF, Metric Path (MP), and the well known ETT metrics are also carried out in this work. The results of this modification suggest that employing the max_min_AEF as a routing metric outperforms the Hc, ETT, and MP within the DSR protocol in WMNs in terms of throughput. This is because the max_min_AEF is based upon avoiding directing traffic through congested nodes where significant packet loss is likely to occur. This throughput improvement is associated with an increment in the delay time due to the long paths taken to avoid congested regions. To overcome this drawback, a further modification to the routing discovery mechanism has been made by imposing a hop count limit (HCL) on the discovered paths. Tuning the HCL allows the network manager to tradeoff throughput against delay. The choice of congestion avoidance metric exhibits another shortcoming owing to its dependency on the packet size. It penalises the smaller packets over large ones in terms of path lengths. This has been corrected for by introducing a ModAEF metric that explicitly considers the size of the packet. The ModAEF metric includes a tuning factor that allows the operator determine the level of the weighting that should be applied to the packet size to correct for this dependence