In real-time multimedia applications, the delivery of multimedia information over ad hoc wireless networks has presented difficult challenges requiring considerable research efforts to overcome. To analyze the delivering multimedia packets between mobile nodes with low end-to-end delay and less bandwidth overhead while ensuring high throughput, we propose a queuing network model based on our ad...

In MANETs, there is a constraint on network bandwidth, so different routing protocols has been proposed which broadcasts the packets by flooding which is simple but causes high retransmissions which lead to media congestion and packet collisions that can significantly degrade the network performance and throughput. So, we proposed flooding algorithm which makes use of the nodes position to rebr...

We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected backbone topology based on a minimal dominating set of the network. PATM provides a succinct presentation of the network topology to routing protocols, and therefore reduces the control overhead in routing updates. Two optimiza...

Shortest path tree (SPT) computation is the major overhead for routers using any link-state routing protocols including the most widely used OSPF and IS-IS. Changes of link states are nowadays commonly occurred. It is not efficient and stable for network routing to use traditional static SPT algorithms to recompute the whole SPT whenever a change happens. In this paper, we present new dynamic a...

The military environment presents special challenges for wireless mesh networking. In addition to optimal use of scarce radio resources, dependable network operation is critical: given frequent link and topology changes, rapid recovery of connectivity may be vital for mission success. This paper proposes a routing algorithm for wireless mesh networks with the primary goal of maximizing connecti...

Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the network. Current IP routers only support Equal Cost MultiPath (ECMP) which guarantees that the forwarding paths do not contain loops. However, ECMP provides limited path diversity. In this paper, we present an efficient algorithm that allows routers to enable more path d...

In mobile ad-hoc network (MANET), secure routing is a challenging issue due to its open nature, infrastructure less property and mobility of nodes. The lack of static infrastructure causes several issues in mobile ad hoc network (MANET) environment, such as node authentication and secure routing. In this paper we propose a new protocol for secure routing of data packets in MANET. The approach i...

The dynamic nature of Mobile ad hoc network brought several constraints like scalability, robust connectivity, limited power constraints etc. Several cluster based routing algorithms have been proposed for large scale ad hoc networks. In cluster-based routing, the network is logically divided into groups called clusters. The aim of this grouping is to sustain a steady and effective network topo...

In this paper the mobile ad-hoc networks where there is no fixed infrastructure the mobile nodes are highly dynamic mobility. Due to mobility of node cased increasing over head and also require more energy consumption. , in mobile ad hoc network major challenging issue is energy and network overhead because of mobile nodes have limited energy source which are operated with only DC source. The e...

QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and select paths using this information. Most of these schemes can be categorized as best path routing wh...