Mobile Ad hoc Networks (MANET) are characterized by multi hop wireless connectivity, infrastructure less environment and frequently changing topology. Wireless links in MANET are highly error prone and can go down frequently due to mobility of nodes. Most reactive routing protocols do not maintain routing information at the node, on link failure typically a route error message is sent to the so...

A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand routing protocol for decreasing maintenance overhead in ad hoc networks. However, some path breaks can cause significant overhead and transmission delays. If the maintenance overhead of the routing table can be reduced, ta...

∗ This research is supported in part by The New Jersey Center for Multimedia Research and in part by New Jersey Institute of Technology under Grant No 421050. Abstract In this paper we propose PSR (Position-guided Sliding-window Routing), a position-based/link-state hybrid, proactive routing protocol that provides for a flat, mobile ad-hoc routing architecture. Our protocol is based on the supe...

Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. In clustering the clusterhead manage and store recent routing information. However the frequent change of clusterhead leads to loss of routi...

Existing geographic routing algorithms face serious challenges due to location errors, nonplanarity issues and overhead of location service. To solve these issues, we propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clus...

Mobile ad hoc network has been a huge challenge to develop a routing protocol that can meet different application requirements and optimize the routing path according to the change of topology. Geographic routing protocol mainly used to provide application needs but it will provide inaccurate local topology and destination position information introduces high overhead when there is no traffic. ...

Quality-of-Service (QoS) routing is indispensable to real-time applications in integrated services packet-switching networks. However, existing QoS-routing schemes based on either request ooding or link-state dissemination are ineecient in terms of message overhead and/or operational cost. This paper proposes a QoS-routing algorithm with bounded ooding which not only dramatically reduces messag...

Finding a path with suucient resources to meet the end-to-end timing constraints | which we call Quality-of-Service (QoS) routing | is indispensable to integrated services packet networks that transport time-critical traac. However, existing QoS-routing schemes based on either request-ooding or link-state dissemination are not eecient in terms of their message overhead and/or operational cost. ...

In this work we suggest algorithms that increase the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the ...

Control overhead in a mobile ad hoc network may be reduced through hierarchical routing. However, to facilitate packet forwarding in a hierarchically organized network, each datagram must specify the hierarchical address of the destination. Maintaining and acquiring hierarchical addresses represents a location management (LM) problem and incurs control overhead in addition to that of a routing ...