The blind flooding of query packets in route discovery more often characterizes the
broadcast storm problem, exponentially increases energy consumption of intermediate …

One way to minimize the broadcast expenses of routing protocols is to cluster the network. In
clustered ad-hoc networks, all resources can be managed easily by resolving scalability …

Various broadcasting schemes have been proposed for a unified routing approach in
Wireless Adhoc Networks. In their efforts, the researchers mostly aim to minimize the routing …

Abstract Recent research in Mobile Ad-hoc Networks mostly deals to minimize the
congestion in the network. In this regard, a variety of query-broadcast techniques have been …

Abstract Route Discovery in Ad-hoc Networks is an important process that is used to find the
optimal path for data transmission. This route exploring process can be either proactive or …

This chapter presents query-broadcasting techniques used to minimize expenses of the
route discovery in ad hoc networks. A broad variety of such techniques have been proposed …

Constructing a stabilized route in dynamic topology and decentralized architecture is still an
unsolved problem in mobile Ad-hoc networks. There are various research contributions …

An algorithm for finding coupling points plays an important role in the Iterative Closest Point
algorithm (ICP) which is widely used in registration applications in medical and 3-D …

It is well-known that dynamic topology, mobility of nodes, infrastructure less property and
absence of central coordinator; make the behaviour of mobile ad hoc network (MANET) …

In order to establish a path from source to destination with less routing cost, we propose a
directional probabilistic algorithm to broadcast RREQ packets toward the destination …