Search

In this paper we propose an approach to improve the performance of existing flood based routing algorithm Ad-hoc on demand Distance Vector Routing [2] for mobile Ad-hoc wireless networks based on heuristic searching technique. Flooding technique is often used for route discovery in on demand mechanism in MANET such as AODV, DSR. To avoid the problem of wireless broadcast storm, the heuristic searching approach was introduced in the process of finding route from source node to destination node. Heuristic function considers the characteristics of MANET (Bandwidth, number of nodes in the given range). If a node S wants to send a packet to D in the flooding method S sends packet to all its neighbor nodes, but in the proposed scheme tries to reduce broadcasting by finding heuristic measures of the neighbors of S. The heuristic measures are evaluated by applying a function to all neighbors. [ABSTRACT FROM AUTHOR]

Maintenance of the cache consistency is a complicated issue in the wireless mobile environment. Caching of frequently accessed data items on the node can reduce the bandwidth requirement of the mobile node environment. In this paper, we present a new technique called Modified Energy Efficient Cache Invalidation Algorithm (MEECIA) especially to reduce the uplink bandwidth consumption in the wireless ad-hoc network, by choosing following modes: Slow, Fast, Super-fast. The mode is selected based on threshold specified for time and the number of node requesting the updated data to other node. Simulation results demonstrate that our algorithm is efficient in improving mobile caching, reducing the communication bandwidth and also efficiently utilizing the energy in ad-hoc network. Compared to the previously reported cache based Invalidation Report (IR), our scheme can significantly improve the performance in terms of energy consumption and reduce the query latency in ad-hoc network. [ABSTRACT FROM AUTHOR]

The existence of selfish nodes, who do not cooperate in routing and forwarding, menaces the applicability of mobile ad hoc networks (MANETs). In this paper, we propose a novel price-based method for stimulating cooperation among the nodes of a MANET. This method utilizes the game-theoretic notion of core to distribute the earnings of a cooperation coalition among its members in an optimal manner. In this way, a stable costefficient route is established between communicating parties. [ABSTRACT FROM AUTHOR]

Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity within the next few years. There are too many applications where one-to-many dissemination is necessary. Most of these applications are characterized by the close collaboration teams with requirements for audio, video conferencing and data sharing which QoS parameters such as bandwidth and delay are very critical for them. In this paper, an efficient algorithm named is proposed to improve the route discovery mechanism in MAODV for QoS multicast routes. QoS-MAODV especially can establish a multicast tree with the minimum required bandwidth support and decrease the end-to-end delay between each destination and the source node. It can establish QoS routes with the reserved bandwidth on per chosen flow. To perform accurate resource reservation, we have developed a method for estimating the consumed bandwidth inmulticast trees by extending the methods proposed for unicast routing. The simulation results show that QoS-MAODV protocol produces higher throughput and lower delay in comparison with MAODV protocol. [ABSTRACT FROM AUTHOR]