Professional Documents
Culture Documents
A Novel Approach For QoS in MANET
A Novel Approach For QoS in MANET
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 119
Abstract— A Mobile Ad-Hoc network (MANET) is a self organising network of nodes connected through wireless links. With
the increase in popularity of wireless network and various applications running over those networks, it is necessary to provide
the quality in terms of bandwidth and delay for the real time applications such as audio and video in MANET. Providing QoS in
MANET is a difficult task as they have random and dynamic topology. A few set of existing QoS models like CEDAR, QAODV,
FQMM etc have been proposed for MANET, but none of them has been able to satisfy the bandwidth and delay constraints to-
gether. Therefore, In this paper, a protocol called “A Novel Approach for QoS in MANET(NQM)” has been proposed for providing
the best suited route in accordance with the network traffic and QoS parameters.
—————————— ——————————
1 INTRODUCTION
to provide QoS along with the solution of above cited The above defined Data Packet Header contains the fol-
problems. Before proceeding to discuss the algorithm of lowing fields:
NQM, a brief discussion about the various packets, tables Pkt_Type: This field defines the type of Packet. i.e. whether the packet is a data
and processes, required by the protocol is given in follow- packet or Beacon_REQ Packet, Beacon_REP Packet, RERR Packet.
ing subsections. Pkt_Seq_No: This field is use for the identification of the data packet. This field
can be used at the time of reassembling data packets at the destination node.
3.1 Terminology for NQM S_Addr: This field contains the address of source node
MN: Mobile Node D_Addr: This field contains the address of the destination node
Q: The occupancy of the wireless media by the QoS L_V_N: This field contains the list of visited nodes. This field is helpful in
connections observed at any MN (i.e. transmitted or re- removing the loops.
ceived by any MN antenna) is Q bps. i.e. the occupancy of TTL: This filed contains the maximum no of hops that a particular data packet
the QoS traffic competing for the same shared media at can visit to reach its destination.
any MN is <= Q bps. r: Required bandwidth for routing the data packet
Req_Bandwidth (r): It signifies the minimum bandwidth TOS: Type of service for a particular data packet.
required by the MN for transmitting the data in terms of
bps. i.e. unless the Require Bandwidth parameter is not 3.3 Neighboring Node Table (NNT)
fulfilled the data will not be transmitted
In NQM, each node in the networks maintains a table
Overall_Avail_Bandwidth (OAB): Overall available
called as “Neighboring Node Table” (NNT) which con-
bandwidth at any node say MNi is initially set to its max- tains the information regarding each node with in its own
imium limit say MB. However, when ever a node MNi vicinity given in Table 1. This NNT will be very helpful in
requires a percentage of bandwidth for transmission, it finding the best node for routing the data packet. The
reserve it using ‘r’ parameter and OAB is set to OABi = nodes in the NNT are arranged in the decreasing order of
OABi – r their stable power signals.
TABLE 1
OAB = OAB – r NEIGHBORING NODE TABLE
Avail_Bandwidth (AB): Available Bandwidth, When the Neighbor Node Ad- AB Delay
data packet is sent to the destination or intermediate node it dress
will reserve the bandwidth required by it , the maximum N1 100 1,4,3,0
available bandwidth now is: N2 90 2,3,5,1
N3 110 1,4,0,0
Min(OAB i, OABj ) N4 150 0,1,0,0
This information is refreshed after a certain interval of
i.e this is the minima of the overall available bandwidth time by broadcasting a Bacon_Request Packet. The format
of MNi and MNj, which are trying to reserve a part of of Beacon_Request packet is given in Fig. 3.
overall available bandwidth from the communication
channel. Pkt_Type S_Addr D_Addr OAB
Fig. 3. Beacon_Request Packet Header
TOS(Type of Service): This parameter can be used to
identify the actual service need of the data packet. The Pkt_Type: Beacon_Request Packet
major choice is a three way tradeoff between low-delay, S_Addr: Source Address
high-reliability, and high-throughput. Depending up on D_Addr: Destination Address
the various kinds of applications running on the mobile MAB: Maximum Available Bandwidth at the Source node.
nodes, the applications have been categorized into 4 sets
of services and maximum delay parameters has been ap- Every neighbor node sends back the Beacon_Reply Packet
propriately allocated as given below: (Fig. 4.)to the source node from where the Bea-
con_Request Packet has been arrived.Whenever a node
Type of Service : A B C D receives the Beacon_Request packet, the node calculate
the Avail_Bandwidth parameter on the basis of the fol-
(D)Delay possible: 0 1 2 3
lowing function: AB = Min(OABi,OABj) and subsequently
3.2 Data Packet Header stores the information into its NNT table.
This packet is used for exchange of data between the mo-
bile nodes. The format of data packet header is given in
Fig. 2.
Pkt_Type S_Addr D_Addr AB Delay
Pkt_Type: Beacon_Reply Packet 6. At the intermediate node, check whether the address of
S_Addr: Source Address the node is same as destination address. If yes, then
D_Addr: Destination Address consume the Data packet. Otherwise, check for the
AB: Min(OABi, OABj) node address in List of visited node (L_V_N). If found
Delay: Average delay for different type of services e.g.(1,0,0,2) then ignore the data packet.
7. At the intermediate node the max hop count (TTL) is
The neighboring nodes send the computed ABij value and
compared with the no of nodes visited. If number of vi-
the average delay parameter value for various services to the
requesting node which in turn update its NNT table. Entries sited nodes is less the TTL entry then continue the
in NNT also get updated whenever a node moves from one process from step 1. Otherwise, drop the data packet
vicinity to another. This process helps in maintaining a and send an error message to the message originating
consistent network view. node.
5 CONCLUSION
If Dynamic and unpredictable topology, limited band-
width, limited resources in terms of battery and storing
capacity are the major characteristics of MANET, and
with the increase popularity of the mobile applications, it
has become very important to provide quality in terms of
bandwidth and delay. NQM, a table driven routing pro-
Fig. 6. Participating nodes in MANET tocol has handled the core issues of QoS parameters i.e.
bandwidth and delay efficiently. Thus, NQM() algorithm
ensures that the routes are readjusted by itself depending
upon the mobility of the nodes. The NNT table endures
that QoS parameters are fulfilled as per the requirement.
The NQM thus provides the reduction in data processing,
saves the battery backup, reduces the delay in transmis-
TABLE 3 sion of data packet, and avoidloops.
NNT ENTRIES OF PARTICIPATING NODE
REFERENCES
[1] Elizabeth M. Royer, C-K Toh, “Review of Current Routing Protocols for
Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications,
Type Of Service: A B C D Vol. 6, April 1999,pp. 46-55.
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 12, DECEMBER 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 123
[2] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, and tor C.R. State Engg. College Murthal, Haryana India from 2004 to
JorjetaJetcheva. "A Performance Comparison of Multi-Hop Wireless Ad 2005. Presently he is working as Executive Director & Dean, Faculty
Hoc Network Routing Protocols". Proceedings of the 4th Annual of Engineering & Technology, Faridabad, India. He has supervised
ACM/IEEE International Conference on Mobile Computing and Networking six Ph.D.’s. He has more than 90 publications in International / Na-
(MOBICOM-98), pages 85-97, October 1998. tional Journals and Conferences. He is recipient of Best Paper
[3] R. Braden, D. Clark, and S. Shenker, “Integrated services in the Internet Award from the System Society of India in 1987.His areas of interest
are control, microprocessor-based instruments, and networking.
architecture: an overview,” 1994, IETF RFC 1633.
[4] S. Blake, D. Black, M. Carlson, E. Davies, Z.Wang, andW. Weiss, “An
Parul Tomar received her M.Tech degree in computer Engineering
architecture for differentiated services,” 1998, IETF RFC 2475. from Maharshi Dayanand University, Rohtak in 2006. Presently, she
[5] Hannan XIAO, Winston K.G. SEAH, Anthony LO and Kee Chiang is working as Assistant Professor in Department of Computer Engi-
CHUA “ Flexible Quality Service Model for Ad-HOC Networks”, pro- neering, YMCA University of Science and Technology, Faridabad,
ceedings of the IEEE Vehicular Technology Conference, Tokio, Japan, May India. She is pursuing Ph.D. in Computer Science and Applications
2000. from Kurukshtra University, Kurukshetra. Her areas of interest are
[6] [ACLZ99]G-S. Ahn, A.T. Campbell, S-B. Lee, and X. Zhang, “INSIG- adhoc networks, Databases, software engineering, programming.
NIA”, Internet Draft, draft-ietf-manet-insignia-01.txt,Oct 1999.
[7] R. Sivakumar, P.Sinha, and V. Bharghavan.”CEDAR: A Core Extraction
Distributed Ad Hoc Routing Algorithm”, IEEE JSAC, Special Issue on
Ad hoc Networks aand Applications, Vol 3 N 8, august 1999
[8] Qi Xue , Aura Ganz “Ad hoc QoS on-demand routing (AQOR) in
mobile ad hoc networks ”, Journal of Parallel and Distributed Compu-
ting,(63), 154-165, 2003.
[9] Dinesh Dharmaraju, Ayan Roy-Chowdhury, Pedram Hovareshti, John
S. Baras, "INORA - A Unified Signaling and Routing Mechanism for
QoS Support in Mobile Ad hoc Networks", International Conference on
Parallel Processing Workshops (ICPPW'02), 2002.
[10] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced
Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIG-
COMM’94 Conference on Communications Architectures, Protocols and Ap-
plications, 1994, pp. 234–244.
[11] C. E. Perkins, E. M. Belding-Royer, and S. Das, “Ad hoc on-demand
distance vector (AODV) Routing”, RFC 3561, July2003, Category: Expe-
rimental, work in progress.
[12] Johnson, D. A. Maltz, and Y.-C. Hu, “The Dynamic Source Routing
Protocol for Mobile Ad Hoc Networks (DSR),”IETF Draft, April 2003,
work in progress.
[13] Llorence Cerda, Micheal Voorhaen, Rafaek Guimaraes, Jose-M Barcel,
Jorge Garcia, and Chris Blondia “A Reservation Scheme Satisfying
Bandwidth QoS Constraints for Ad-Hoc Networks”. Lecture Notes in
Computer Science (LNCS), springerlink.
[14] Kui Wu, Janelle Harms “QoS support in Mobile Ad hoc Networks”,
Crossing Boundaries- an interdisciplinary journal, vol 1 , No 1 – Fall 2001.
[15] Available at Andrew S. Tanenbaum, “Computer Networks”, Prentice-
Hall India, Third Edition.
Dr. M.K. Soni received the B.Sc. Eng. And M.Sc. Eng. degrees from
Kurukshetra University, Kurukshetra, India, in 1972 and 1975, re-
spectively, and the Ph.D. degree from Kurukshetra niversity in colla-
boration with Indian Institute of Technology, Delhi, India, in 1988.
Earlier, he has worked as Professor , Chairman and Dean Electrical
Engg. Deptt. N.I.T. Kurukshetra, India. He has also worked as Direc-