A STUDY & ANALYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION

Transcription

1 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN A STUDY & ANALYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION S. Upadhyay 1, A. Upadhyay 2, P. Joshi 3 and Suresh C.Gupta 4 1 Department of Electronics& Communication, Cambridge Institute of Technology, Ranchi, Jharkhand 2 Department of Electronics& Communication, Dehradun Institute of Technology (University), Dehradun, UK ABSTRACT: Channel access protocol is very important issue for node (link) scheduling and we try to focus on the Hybrid Activation Multiple Access Scheduling protocol (HAMA) for wireless ad hoc networks through this work. This channel access scheduling protocols activate either nodes or links only; HAMA is a node-activation oriented channel access scheduling protocol that also maximizes the chance of link activations. According to HAMA, the only required information for scheduling channel access at each node is the identifiers of neighbors within two hops. Using this neighbourhood information, multiple winners for channel access are elected in each contention context, such as a time slot in a frequency band or a spreading code. Except for time slot synchronization and neighbor updates on the two-hop neighborhood changes, HAMA dedicates the bandwidth completely to data communication. The frame loss and throughput characteristics of HAMA are analyzed, and its performance is compared with pure node activation based scheduling protocols by simulations on different application. Keywords: MANET, Channel access protocol, mobility model, routing protocol NCR Algorithm [I] NTRODUCTION A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. In this paper, we analyze packet scheduling algorithm to find those that most improve performance in congested network. Hence, a scheduling algorithm to schedule the packet based on their priorities will improve the performance of the network. Packet schedulers in wireless ad hoc networks serve data packets in FIFO order. Scheduling algorithms are important components in the provision of guaranteed quality of service parameters. The design of scheduling algorithms for mobile ad hoc networks is challenging one because of highly variable link error rates and dynamic nature of the network. An ad hoc network is a self-organizing wireless network comprised only of mobile nodes interconnected by a multihop path and without the support of any pre-existing wired infrastructure. In these networks, the mobility of nodes and the error-prone nature of the wireless medium introduce many challenges, including frequent route changes and packet losses. Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 63

2 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION These problems increase the packet delays and decrease the throughput. As traffic load in the network increases, the performance of the network decreased. Research in this area has focused primarily on routing protocols and medium access control (MAC). However, there is little understanding of the queuing dynamics in the nodes of these networks and different packet scheduling algorithms in the queues of the nodes provide solution for performance degradation. Thus scheduling algorithm manages the changes in queuing dynamics in different situation also improves the performance of the network. We apply the NCR algorithm to derive four channel access protocols in ad hoc network. [II] MOBILE AD-HOC NETWORK (MANET) A mobile ad-hoc network (MANET) is a collection of mobile nodes which consist of temporary network without the aid of any centralized infrastructure and it acts as a both host and routers. It is an autonomous system of mobile hosts connected by wireless networks links which does not required any wired support for intercommunications. Collaborative computing and communications in smaller areas can be set up using MANET, such as office buildings, organizations, conferences etc. The network's wireless topology may be unpredictable. This has been an area of active research, and progress has been reported in several directions [1]. This type of network play very important role at the time of emergency as it can build their network in few hour and people can quickly share information and data acquisition operations in inhospitable terrain. The MANETs routing protocols are characteristically subdivided into three categories: Table Driven Routing Protocol (Proactive), On Demand Routing Protocol (Reactive) and Hybrid Routing Protocol. MANET routing protocols are subdivided into two categories as shown below in [Figure-1]. MANET Reactive Proactive DSDV AODV DSR Figure: 1. MANET & its concerned routing protocol 94

3 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN Reactive Routing Protocol.This protocol also called the on- demand routing protocol. On-demand routing protocols were designed to reduce the overheads in proactive protocols by maintaining information for active routes only. This means that routes are determined and maintained for nodes that require sending data to a particular destination. Route discovery usually occurs by flooding a route request packets through the network [2] Ad-hoc On-demand Distance Vector Routing (AODV) AODV uses a simple request-reply mechanism for the discovery of routes shown in [Figure-2]. It can use hello messages for connectivity information and signals link breaks on active routes with error messages. Routing information has a timeout associated with it as well as a sequence number. The use of sequence numbers allows detecting outdated data, so that only the most current, available routing information is used. This ensures freedom of routing loops and avoids problems known from classical distance vector protocols. When a source node S wants to send data packets to a destination node D but does not have a route to D in its routing table, then a route discovery has to be done by S. The data packets are buffered during the route discovery. The source node S broadcasts a RREQ (Route Request) throughout the network. In addition to several flags, a RREQ packet contains the hop count, a RREQ identifier, the destination address and destination sequence number, and the originator address and originator sequence number. The hop count field contains the distance to the originator of the RREQ, the source node S [3]. It is the number of hops that the RREQ has travelled so far. Dest Next Hop AA AA BB RREQ RREQ RREQ AA CC A B C D RREP RREP RREP D.B B.B D.B B.B C.C D.B B.B D.D Fig: 2. AODV route discovery Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 95

4 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION Dynamic Source Routing (DSR) Protocol DSR is a source routing protocols, and requires the sender to know the complete route to destination. It is based on two main processes: (a) the route discovery process which is based on flooding and is used to dynamically discover new routes, maintain them in nodes cache, (b) the route maintenance process, periodically detects and notifies networks topology changes. Discovered routes will be cashed in the relative nodes. Here route are stored in memory and data packet contains source route in packet header [4]. In DSR, every mobile node in the network needs to maintain a route cache where it caches source routes that it has learned [5] Proactive Routing Protocol (Table-Driven Routing Protocol): In proactive routing, each node has one or more tables that consist of latest and update information of the routes to any node in the network. Each row has the next hop for reaching a node/subnet and the cost of this route. Various table-driven protocols differ in the way the information about a change in topology is propagated through all nodes in the networks. There exist some differences between the protocols that come under this category depending on the routing information which is updated in each routing table. Also, these routing protocols maintain different number of tables. This protocol is not well node entries for each and every node in the routing table of every node this will cause more overhead in the routing table leading to more consumption of bandwidth. Example: Conventional routing schemes, DSDV. [III] RELATED WORK Based on NCR, the node activation multiple access protocol (NAMA) elects nodes for collision-free broadcast transmissions over a single channel. The link activation multiple access (LAMA), the pair-wise link activation multiple access (PAMA), and the hybrid activation multiple access (HAMA) protocols operate over multiple channels that are orthogonal by codes or frequencies to elect either links or nodes for collision-free unicast transmissions, or a mix of broadcast and unicast transmissions [6][7]. We analyze four channel access protocol NAMA, LAMA, PAMA and HAMA and used for different application like FTP, VoIP transfer for real scenario mobile ad hoc network. The four channel access protocol has been considered for this paper and implemented in different application to judge the performance of best channel access protocol. This paper gives the proper idea about the best channel access protocol for choosing suitable access protocol for efficient network of designing. This also helps us to improve the QoS parameters. In HAMA, it is possible that a node has to yield due to the hidden terminal problem, making the corresponding time slot useless for the yielding node [8]. HAMA is a timeslotted code division multiple access scheme based on direct sequence spread spectrum (DSSS) transmission techniques. In DSSS, code assignments are categorized into transmitter-oriented, receiveroriented or a per-link-oriented code assignment schemes (also known as TOCA, ROCA and POCA, 96

5 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN respectively) in ad hoc networks. HAMA adopts transmitter-oriented code assignment because of its broadcast capability [9]. [V] PROBLEM FORMULATION The four channel access protocol has been considered for this paper and implemented in different application to judge the performance of best channel access protocol. This paper gives the proper idea about the best channel access protocol to the engineers for choosing suitable access protocol for efficient network of designing. The different channel access protocol is shown in [Figure-3]. NAMA PAMA LAMA HAMA Figure: 3. Different channel access protocol 4.1 Operation of HAMA HAMA randomly assigns a code to each node in each time slot, and to resolve possible collisions using NCR (Neighborhood-aware contention resolution) algorithm. HAMA works in the following manner: a) Compute the priorities and code assignments of the nodes within the two-hop neighborhood using the following given equation (1) & (2) i.txcode =, k = Hash (i t ).. (1) i.prior = Hash (i t). (2) where Hash (x) = fast message digest generator that return a random integer by hasing the input value (x) and used to carry out the concatenation operation on its two operand. b) A node then derives its state by comparing its own priorities with the priorities of its neighbors. We only require that nodes with higher priorities transmit to those nodes with the lower priorities. This is the overall operation of HAMA Channel access protocol. We focus only on the HAMA channel access protocol and try to judge the performance of this protocol. Although there are many channel access protocol but many literature give idea that HAMA is the one that is more suitable for channel access protocol [10]. The result of the analyses show that HAMA achieves higher channel utilization in ad-hoc network than a distributed scheduling scheme based on node activation, similar throughput as a wellknown scheduling algorithm based on complete topology information, and much higher throughput than ideal CSMA and CSMA/CA protocol. [VI] SCENARIO FOR PERFORMANCE ANALYSIS Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 97

6 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION In this work 16 mobile nodes are considered, the initial position of these nodes are random in the flat grid aria of 800x800 and in z-direction are considered, so nodes are spared in 800x800 area. In this work one source and one destination node is considered, the starting node is the source node and last node is destination node. All node have mobility, in this work mobility is set as each node change its position after 10 sec and after this node changes its position in every 5 sec all new positions are random in nature. So, in this work we compare three different channel access protocols under different application. Figure: 4. Scenario for FTP Figure: 5. Scenario for VoIP [VII] SIMULATION TOOL EXata is a network emulator that lets you evaluate on-the-move communication networks faster and with more realism than any other emulator. It creates a digital network replica that interfaces with real networks and applications. EXata is composed of the following tools: 1. EXata Architect A graphical experiment design and visualization tool. Architect has two modes: Design mode, for designing experiments, and Visualize mode, for running and visualizing experiments. 2. EXata Analyzer A graphical statistics analyzing tool. 3. EXata Packet Tracer A graphical tool to display and analyze packet traces. 4. EXata File Editor A text editing tool. 98

7 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN EXata Command Line Interface Command line access to the simulator. EXata is a comprehensive suite of tools for emulating large wired and wireless networks. It uses simulation and emulation to predict the behavior and performance of networks to improve their design, operation, and management [11]. EXata SVN provides a cost-effective and easy-to-use alternative to physical test beds that typically have high equipment costs, complex setup requirements and limited scalability. [VIII] MOBILITY MODEL The mobility model uses (RANDAM WAYPOINT MODEL) in a rectangular aria of 800m x 800m with 26 nodes. During the simulation starts its journey form a random spot to a random chosen destination and after every 5 second the topology of the network changed. Once the destination reached, the node takes a rest period of time in second and another random destination is chosen after that pause time the pause time is taken for this simulation is vary for 10s, 20s and 50s. The modal parameters that have been used in the following experiments are summarized in [Table-1] and [Table-2]. Sl. No. Wireless subnet properties 1 Physical Radio type b, Data rate = 2Mbps, Receiver Sensitivity at 2Mbps = dBm 2 MAC Protocol = TDMA, Slot duration = 2.06 ms, Guard time = 1ms, Slot/frame = 16, Propagation delay = 5µs 3 Network Queue size (bytes) =1024, Input/output Queue Scheduler = Round Robin 3 Routing Protocol AODV, Maximum buffer size (bytes) = 4 Router Specified User specified Table: 1. Wireless subnet properties for FTP. 10 Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 99

8 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION Sl. No. Parameter Value 1 Simulator Exata Cyber Protocols Considered AODV& DSR 3 Simulation Time 10s, 20s & 100sec. 4 Simulation Area 800m x 800m 5 Transmission Range m 6 Node Movement Model Random Direction 7 Bandwidth Used 2 Mbps 8 Traffic Type CBR /VBR 9 Data Payload Bytes/packet 10 Channel Access Protocol HAMA Table: 2. Simulation parameter [IX] SIMULATION RESULT The simulation result for FTP and VoIP is shown below: For FTP 16 nodes has been taken and all are activate and for VoIP 16 nodes has been considered and only four nodes are used in which two nodes act as an transmitter and two nodes acts as an receiver shown in [Figure-4] and [Figure-5]. Figure: 6. Throughput of FTP client. 100

9 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN Figure: 7. Throughput of FTP server. Figure: 8. Total packet received from network layer (FTP) Figure: 9. Broadcast packet received (FTP) Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 101

10 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION Figure: 10. Total frame received by FTP Sl. No. Link Properties 1 Link Wireless 2 Bandwidth 2Mbps 3 Propagation speed 3 m/s 4 Source 1, 4 5 Destination 16, 13 6 Average talk time 20 sec and 30 sec 7 Start time 7 sec and 5 sec 8 End time 19 sec and 25 sec 9 Encoding G Packetization By interval 11 Packetization interval 20ms 12 Channel Access HAMA Table: 3. Link properties of VoIP 102

11 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN Figure: 11. Total packet received by VoIP Figure: 12. Total frame received from network layer (VoIP) Figure: 13. Total data packet received (VoIP) Figure: 14Data packet received (AODV for IPv4) (VoIP) Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 103

12 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION Figure: 15. Broadcast packet received (VoIP) Figure: 16. Signal received and forwarded to MAC layer Figure: 17. Frame received by VoIP 104

13 International Journal of Computer Engineering and Applications, Volume V, Issue III, March 14 ISSN [X] CONCLUSION & DISCUSSION From above simulation result it is very clear that the performance of channel access protocol i.e. HAMA is efficient for FTP and VoIP. The simulation result shows that HAMA improves channel link utilization to give good throughput. Also the performance of LAMA, NAMA and PAMA have been tested with same scenario, but here we found that the performance of HAMA channel access protocol is better than other channel access protocol as mention above. REFERENCES [1] A. Kumari, N. Gandotra, S. Upadhyay and P. Joshi, Impact of Node Movement on MANET Using Different Routing Protocol for Qos Improvement Under Different Scenario, International Journal of Smart Sensor and Ad-Hoc Network (IJSSAN), Vol. 1, pp. 95, March [2] S. Upadhyay, P. Joshi, N. Gandotra and A. Kumari, Comparison and performance analysis of reactive type DSR, AODV and proactive type DSDV routing protocol for wireless mobile ad-hoc network, using NS-2 simulator, Journal of Engineering and Computer Innovations (JECI) Vol. 2(10), pp , March [3] Y.D Kim, I.Y Moon and S.J Cho, A comparison of improved AODV routing protocol based on IEEE and IEEE , Journal of Engineering Science and Technology (JEST), Vol. 4, No. 2, pp , [4] S.Upadhay, A. Kumari and N.Gandotra, Impact of node mobility on the performance of wireless network using distance vector routing protocol International Journal of Computer Application (IJCA), Vol. 57, No. 12, pp , November, [5] V. Singla, R. Singla, A. Kumar, Performance Evaluation and Simulation of Mobile Ad-hoc Network Routing Protocols, International Journal of Engineering and Innovative Technology (IJEIT) Vol. 1, No. 1, pp Oct 2009 [6] L. Bao and J.J. Garcia-Luna-Aceves, Distributed Transmission Scheduling Using Code-Division Channelization E. Gregori et al. (Eds.): NETWORKING 2002, LNCS 2345, pp , Springer-Verlag Berlin Heidelberg [7] H. Xu and X. Wang, Comparative analysis of scheduling algorithm in ad-hoc mobile networking IEEE, August 09, [8] M. Aur and A. Spohn, Power Efficient Hybrid Channel Access Scheduling in Wireless Multihop Networks, IEEE AICT, pp , Nov [9] L. Bao and J. Garcia-Luna-Aceves, Hybrid channel access scheduling in ad hoc networks, IEEE ICNP, pp , Nov Shrikant Upadhyay, Aditi Upadhyay, Pankaj Joshi and Suresh Prem Gupta 105

14 A STUDY AND ANLYSIS OF SUITABLE CHANNEL ACCESS PROTOCOL FOR MOBILE AD-HOC NETWORK ON DIFFERENT APPLICATION [10] S. Ramanathan and E. L.Lloyd Scheduling algorithm for multihop radio network IEEE/ACM, Vol. 1, No.2, April [11] 106