| Keywords | 
        
            | Mobile ad-hoc network, fuzzy priority scheduler, DSR, NS2.34 | 
        
            | INTRODUCTION | 
        
            | Mobile Ad-hoc Networks (MANETs) are wireless networks consisting entirely of mobile nodes that communicate on-themove       without base stations. Nodes in these networks will both generate user and application traffic and carry out network       control and routing protocols. Rapidly changing connectivity, network partitions, higher error rates, collision interference,       bandwidth and power constraints together pose new problems in network control—particularly in the design of higher level       protocols such as routing and implementing applications with Quality of Service requirements. The network topology may       vary rapidly and unpredictably over time, because the nodes are mobile. The network is decentralized, where all network       activity including discovering the topology and delivering messages must be executed by the nodes themselves. Hence       routing functionality will have to be incorporated into the mobile nodes. | 
        
            | In the proposed networks as shown in Fig.1, the mobility of nodes and the error prone nature of the wireless medium pose       many challenges like frequent route changes and packet losses. Such problem increases packet delay and decrease       throughput which degrades the quality of service. In order to make the performance better, the scheduler can be used.       C.Gomathy et al. [1] has designed a fuzzy based priority scheduler to determine the priority of the packets. Kumar et al. [2]       defined how to improve the end-to-end QoS target in MANET. Mary Bader et al. [3] has focused primarily on routing       protocols -how to route packet hop by hop as efficient as possible and medium access control (MAC - how to share the       medium efficiently). | 
        
            | This paper deals with a fuzzy based scheduler that improves the QoS parameters in wireless ad-hoc network. Overall end to       end performance will be improved using the scheduling algorithm and this algorithm also decides the priority of the packets       so that which queued will process next. If scheduling scheme is not used then packets will be processed in FIFO i.e. first in       first out manner due to which frequent drop of packet is observed. The disadvantage of this technique is that it cannot       differentiate among connections. Hence the choice of scheduling algorithm to determine which queued packet to process       next will have a significant effect on overall end to end performance. | 
        
            | A great deal of research has been done to improve the QoS of MANET. Research paper such as [4] focused on routing       protocols to improve link stability, end-to-end delay and bandwidth optimization. Paper [5] proposed an efficient coding       scheme for the dissemination of data between MANET nodes. Paper [6][7] compared the performance of various routing       protocols with regards to mobility, delay, packet loss and network congestion and [8] discussed the link stability in       MANET. Paper [9], used a fuzzy inference system with two input variables and a single output (priority index). The two input       variables are channel capacity and data rate; these were used to determine the priority index of packets to be scheduled.       Fuzzy scheduling in MANET is discussed in [10] based on buffer size and number of hops suffered by packets. | 
        
            | DSR PROTOCOL | 
        
            | A. DSR Protocol | 
        
            | Dynamic source routing (DSR) is a routing protocol for wireless mesh networks. However, it uses source routing instead of       relying on the routing table at each intermediate device. This protocol is truly based on source routing whereby all the       routing information is maintained (continually updated) at mobile nodes. It has only two major phases, which are Route       Discovery and Route Maintenance. Route Reply would only be generated if the message has reached the intended       destination node. To return the Route Reply, the destination node must have a route to the source node. If the route is in the       Destination Node's route cache, the route would be used. Otherwise, the node will reverse the route based on the route       record in the Route Request message header. In the event of fatal transmission, the Route Maintenance Phase is initiated       whereby the Route Error packets are generated at a node. The erroneous hop will be removed from the node's route cache;       all routes containing the hop are truncated at that point. Again, the Route Discovery Phase is initiated to determine the most       viable route. The basic approach of this protocol (and all other on-demand routing protocols) during the route construction       phase is to establish a route by flooding Route Request packets in the network. This protocol uses a reactive approach       which eliminates the need to periodically flood the network with table update messages which are required in a table-driven       approach. | 
        
            | B. Packet Scheduling Scheme | 
        
            | To improve the quality of service of MANET, a scheduling scheme is required. This is an algorithm that determines the       order in which a thread or data flow can access the available resources. Packets from various flows arrive at a node, and the       scheduler is used to treat individual flow fairly in order to improve the quality of service. Some of the conventional       available scheduling algorithms are FIFO, Priority Queuing (PQ) and weighted fair queuing (WFQ); these algorithms are designed to improve the QoS of a network [11]: In FIFO: various packet flows are kept in the buffer until they are ready       to be processed by the queue. Packets that arrived first at the queue are served first and any other packet that arrives later       will have to wait in the queue until all previous packets have been served. If the average packet arrival rate is greater than       queue processing rate, the queue will not be able to cope with the intensity of packet arrivals, thus congestion will occur.       Hence packets will be discarded by the queue either because the queue buffer is already full or it has exceeded the waiting       threshold in the queue. | 
        
            | FUZZY SCHEDULER SCHEME | 
        
            | A. Fuzzy Logic | 
        
            | Fuzzy systems are defined with a strong mathematical basis. Fuzzy systems are rule based systems. It is a rule base system       which consists of a set of IF-THEN rules. The rules are statements in which some work is characterized by continuous       membership functions. Fuzzy model is made up of blocks comprises of a knowledge base fuzzifier, knowledge base defuzzifier       and an inference engine as shown in Figure 2. | 
        
            | B. Fuzzy Algorithm | 
        
            | There are two basic approaches or algorithm used in fuzzy logic. The first one is Mamdani and second is Sugeno, both the       algorithms are developed for fuzzy concept. In this paper we use the Mamdani algorithm for developing the concept of       fuzzy scheduler in dynamic source routing protocol. The description of Mamdani algorithm is given below. | 
        
            | Loop \\ System is running for ever | 
        
            | For each DSR packet queue, the queue does the following: | 
        
            | Step 1: For each ready packet P (a packet which is in packet queue and eady to transmit) | 
        
            | Feed it into the rule base schedule System engine. | 
        
            | Consider the output of fuzzy system having priority of packet P. | 
        
            | Step 2: Execute the packet with highest priority until any scheduling event occurs (a running packet finishes, until a new       packet arrives) | 
        
            | Step 3: Update the DSR queue | 
        
            | END | 
        
            | END loop\\C. Fuzzy Based Scheduler | 
        
            | The proposed fuzzy scheduler had two input variables and a single output which is the priority index of each packet. In       this model, all the inputs considered contributes to congestion (both internally and externally), unlike previous fuzzyscheduling schemes. The two inputs of the fuzzy model are data rate and channel capacity of the individual nodes that       the packet is associated with as shown in Figure 3. The inputs are fuzzified, implicated, aggregated and defuzzified to       obtain the crisp value which is the output i.e. priority index. | 
        
            | A modified rule-based fuzzy scheduler that deals with both task priority and its execution time is presented in this section.       A fuzzy-based decision maker (FDM) has a modified rule-based fuzzy scheduler that deals with both task priority and its       execution time is presented in this section. A fuzzy-based decision maker (FDM) has been proposed to compute the new       priority (Pn) of all packets according to the packets priority (Po) and its expiry time (Ex), as shown in Table 1. The       measured variables are inverted into suitable linguistic variables. In this application, the following linguistic variables are       used for priority (Po), and new calculated priority (Pn); Very Low (VL), Low (L), Medium (M), High (H), and Very High       (VH). The fuzzy sets definitions for expiry time (Ex) are Low (L), Medium (M) and High (H). The proposed fuzzy decision       maker is a collection of linguistic rules which describe the relationships between measured variables (Po & Ex), and       calculated output (Pn). | 
        
            | The rules are defined with care and are shown in Table 1.       To illustrate the first rule, it can be interpreted as follows:       “If expiry time is low, data rate is low, and channel capacity is low, then priority index is low.” Since in this rule, data rate and       channel capacity are low and packets are associated with low delay, the priority index is set to be low. The ninth rule is       interpreted as: “If expiry time is low, data rate is high, and channel capacity is high, then priority index is very low.” In this       rule, even though the expiry time remains the same, the data rate and channel capacity are high, priority index is set to be very low. Similarly, the other rules are framed. The priority index, if very low, indicates that the packets are associated with the       highest priority and will be scheduled immediately. If the index is very high, then packets are with the lowest priority and will be       scheduled only after high priority packets are scheduled. The degree to which an element belongs to given set is called       degree of membership. The membership functions are shown in fig 4. | 
        
            | PERFORMANCE EVALUATION | 
        
            | A. Simulation SetupThe network simulator NS2.3 [12][13] provides scalable simulations of wireless networks and helps to analyze and evaluate       the performance of the proposed fuzzy schedulers. In this simulation 50 mobile nodes move with a rectangular field of       1500m×300m in size. The rectangular field is chosen so that the average hop distance between any two nodes will be larger       than that of a square field with the same area. The duration of each run is 900 simulated seconds. The mobility model used is       random waypoint model [14]. The radio model used is the two ray model [15]. The mobility rates used with different pause       time are as 0, 45, 90, 180, 270, 540, 720 and 900 seconds. The maximum moving speed is 20mps. Traffic source are CBR       UDP. Each packet is 512 bytes long, thus resulting 2kbps data transfer rate for each session. | 
        
            | B. Results and Evaluation | 
        
            | 1) Packet Delivery Ratio: It is the ratio of the number of data packets actually delivered to the destination to the       number of data packets supposed to be received. This shows the effectiveness of the protocol. | 
        
            | 2) Average end-to-end delay: It indicates how long it took for a packet to travel from the source to the application layer       of the destination. | 
        
            | 3) Dropped Packets: The dropped packets are the data packets that are dropped during the link breaks and collision. | 
        
            | CONCLUSION | 
        
            | In this paper, a technique based on fuzzy concept for mobile ad-hoc network is presented which analyze the performance of the       fuzzy based priority scheduler for QoS parameters in mobile ad-hoc network. It combines the input parameters such as channel       capacity and data rate to find the priority index. The fuzzy scheduler attaches a priority index to each packet in the queue of the       node. The crisp value is calculated based on the inputs such as queue length, data rate and expiry time of the packets which are       delivered from the network. From the results above it is seen that packet delivery ratio in case of fuzzy DSR is better than       simply DSR. Average end to end delay and dropped packets are also improved and shows better results when fuzzy DSR is       used. | 
        
            | Tables at a glance | 
        
            | 
                
                    
                        |  |  
                        | Table 1 |  | 
        
            |  | 
        
            | Figures at a glance | 
        
            | 
                
                    
                        |  |  |  |  |  
                        | Figure 1 | Figure 2 | Figure 3 | Figure 4 |  
                        |  |  |  |  
                        | Figure 5a | Figure 5b | Figure 5c |  | 
        
            |  | 
        
            | References | 
        
            |  C. Gomathy  and S. Shanmugavel "Supporting QoS in MANET by Fuzzy Priority Scheduler  and Performance Analysis with Multicast RoutingProtocols" EURASIP Journal  on Wireless Communication and Networking 2005:3, 426-436.
  Kumar Manoj,  S. c. Sharma, Sandip Vijay and Amit Dixit "Performances Analysis of  Wireless Ad-hoc Network Using OPNET Simulator   "International  Conference on "Intelligent Systems and Networks" (ISN-08) ISTK  Haryana, 22-24th 2008, 267-270 Feb. 2008
  B. G. Chun  and M. Baker, "Evaluation of packet scheduling algorithms in mobile ad hoc  networks," ACM SIGMOBILE Mobile Computing andCommunications Review, vol.  6, no. 3, pp. 36-49, 2002.
  Hannan Xiao,  W. K. G. Seah, A. Lo, and K. C. Chua, “A flexible quality of service model for  mobile ad-hoc networks,” in Vehicular         Technology  Conference Proceedings, 2000.VTC 2000-Spring Tokyo.2000 IEEE 51st, 2000, vol.  1, pp. 445-449 vol.1.
  C. Chow and  H. Ishii, “Video Streaming over Mobile Ad-Hoc Networks: Multipoint-to-Point  Transmission with Multiple Description Coding,” inTENCON 2006. 2006 IEEE Region  10 Conference, 2006, pp. 1-4.
 C. E.  Perkins, E. M. Royer, S. R. Das, and M. K. Marina, “Performance comparison of  two on-demand routing protocols for ad hoc networks,”Pers. Commun. IEEE, vol.  8, no. 1, pp. 16-28, 2001.
 M. T. Hyland,  B. E. Mullins, R. O. Baldwin, and M. A. Temple, “Simulation-Based Performance  Evaluation of Mobile Ad Hoc Routing         Protocols in a  Swarm of Unmanned Aerial Vehicles,” in Advanced Information Networking and  Applications Workshops, 2007, AINAW ’07.         21st  International Conference on, 2007, vol. 2, pp. 249-256.
 K.  Ramachandran, I. Sheriff, E. Belding, and K. Almeroth, “Routing Stability in  Static Wireless Mesh Networks,” in University of         California, Santa  Barbara, 2007.
  K. Manoj, S.  C. Sharma, and L. Arya, “Fuzzy Based QoS Analysis in Wireless Ad hoc Network  for DSR Protocol,” Adv. Comput. Conf.         2009 IACC 2009  IEEE Int., pp. 1357-1361, 6
  C. Gomathy  and S. Shanmugavel, “An efficient fuzzy based priority scheduler for mobile ad  hoc networks and performance analysis for variousmobility models,” in Wireless  Communications and Networking Conference, 2004.WCNC.2004 IEEE, 2004, vol. 2,  pp. 1087- 1092 Vol.2
  Joong-Min  Kim, In-Kap Park, and Chung-Hyun Kim, “A study on the performance enhancements  of video streaming service based on         MPLS network,” in  Intelligent Signal Processing and Communication Systems, 2004.ISPACS 2004.  Proceedings of 2004         International  Symposium on, 2004, pp. 601-603.
 The Network  Simulator– ns2.http://www.isi.edu/nsnam/ns.
  C.Gomathy  and S.Shanmugavel, “Implementation of modified Fuzzy Priority Schedule for  MANET and performance analysis with         mixedtraffic,“in  Proc.11thNationalConference.
  Y.-C. Hu and  D.B.Johnson, “Caching Strategies in On-Demand Routing Protocols for Wireless Ad  Hoc Networks”, Proc. ACM International Conferenceon Mobile Computing and  Networks (MOBICOM), 2000.
   T.S. Rappaport, “Wireless communications – Principles and Practice”, Pearson  edition 2003.
 |