Abstract- In this paper we show the comparative study of route reservation techniques in ad hoc wireless networks. The reservation technique falls into two groups’ reservation-based (RB) communication and non-reservation-based (NRB) communication. In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source while RB scheme reserves intermediate nodes before the actual transmission begins. The paper describes the Analytical comparison for evaluating the performance, in terms of delay, good put, and throughput of RB and NRB schemes.
Keywords- ad hoc wireless networks, resource reservation, performance analysis, good put, throughput, delay.
There are two switching techniques used in wired networks- circuit switching and packet switching . The major difference between them is the way resources are shared. Circuit switching provides exclusive access to the resources by means of reservation on the other hand resources are shared on demand, without prior reservation in packet switching. The packet switching is suitable for a wired data network such as the Internet; it is not clear whether this is true in the case of ad hoc wireless networks. In this paper, we compare the two switching paradigms: reservation-based (RB) and non-reservation-based (NRB) switching for ad hoc wireless network. The concepts of reservation and non-reservation are analogous to those of circuit switching and packet switching in wired networks, respectively. * In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source. Hence, the resources (in terms of relaying nodes) are shared in an on-demand fashion. This is typical for most of the routing protocols for wireless ad hoc networks proposed in the literature . * In an RB scheme, a source first reserves a multi-hop route to its destination, i.e., it reserves intermediate nodes before the actual transmission begins. The reserved intermediate nodes are required to relay only the message generated by the specific source. This gives the source an exclusive access to the path to the destination. This particular route reservation approach for ad hoc wireless networks was first introduced in .
The rest of this paper is organized as follows: In Section 2, we briefly discuss the related work in this area. We describe the basic principles of operation of RB in section 3 and NRB switching schemes in Section 4. Performance of the two switching schemes is analyzed in detail in Section 5. Finally, concluding remarks are given in Section 6.
II. RELATED WORK
A number of routing protocols for ad hoc wireless networks have been proposed over the past few years. Most of these protocols can be categorized as variants of the NRB routing protocol, where packets are relayed on a route with best effort. Examples include , , , and more references can be found in . A number of studies related to the evaluation of NRB switching schemes have also been reported. In , , , performance of a few routing protocols for ad hoc wireless networks, in terms of throughput, end-to-end delay, and amount of overhead, are investigated using computer simulations. In , an analytical model for evaluating the performance, in terms of capacity and throughput, of static ad hoc wireless networks without a delay constraint is proposed. The achievable network throughput for a given delay constraint is then studied in  and ; however, queuing delay at each node is not taken into consideration. In , the authors consider NRB switching in ad hoc wireless networks and derive delay bounds for a 2-hop relay case and a multihop relay case with packet flooding. In , a ticket-based probing algorithm is used for searching routes...