National Conference on Research Advances in Communication, Computation, Electrical Science and Structures (NCRACCESS-2015) QOS Improvement In Manet Using Block Authentication Code Poojaa.A1, Usha.V2 Communication Systems Bharathiyar Institute of Engineering for Women (ushavelu92@gmail.com) Abstract-As wireless communication gains popularity, significant research has been devoted to supporting real-time transmission with stringent Quality of Service (QoS) requirements for wireless applications. At the same time, a wireless hybrid network that integrates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been proven to be a better alternative for the next generation wireless networks. By directly adopting resource reservationbased QoS routing for MANETs, hybrids networks inherit invalid reservation and race condition problems in MANETs. In the existing system we propose a QoS-Oriented Distributed routing protocol (QOD) to enhance the QoS support capability of hybrid networks. Taking advantage of fewer transmission hops and any cast transmission features of the hybrid networks, QOD transforms the packet routing problem to a resource scheduling problem. We propose a novel method, DataTransparent Authentication (DaTA) without Communication Overhead, to authenticate data streams. Our strategy neither embeds a digest to the original data, nor sends any out-of band authentication information. Instead, our scheme is based on the timing correlation of data packets between the sender and the receiver. Particularly, the inter packet delays are utilized and some selected packet delays are slightly adjusted (in a range). The inter packet delay increase and decrease represent different bits (0 or 1), and thus, transparently embed the digest. Since we limit the delay adjustment in a small range and the delay adjustment is not cumulative the application’s performance is hardly affected. Index Terms- Quality of Service, Data-Transparent Authentication, Block Authentication Code. I.INTRODUCTION Mobile computing involves mobile communication, mobile hardware, and mobile software. Communication issues include ad hoc and infrastructure networks as well as communication properties, protocols, data formats and concrete technologies. Hardware includes mobile devices or device components. Mobile software deals with the characteristics and requirements of mobile applications. ISSN: 2348 - 8549 Devices Many types of mobile computers have been introduced since the 1990s including the Personal digital assistant/enterprise digital assistant  Smartphone  Tablet computer  Ultra-Mobile PC  Wearable computer Limitations Range & Bandwidth: Mobile Internet Access is generally slower than direct cable. Security standards: When working mobile, one is dependent on public networks, requiring careful use of VPN. Security is a major concern while concerning the mobile computing standards on the fleet. Power consumption: When a power outlet or portable generator is not available, mobile computers must rely entirely on battery power. Transmission interferences: Weather, terrain, and the range from the nearest signal point can all interfere with signal reception. Reception in tunnels, some buildings, and rural areas is often poor. Potential health hazards: People who use mobile devices while driving are often distracted from driving and are thus assumed more likely to be involved in traffic accidents. Cell phones may interfere with sensitive medical devices. Questions concerning mobile phone radiation and health have been raised. Human interface with device: Screens and keyboards tend to be small, which may make them hard to use. Alternate input methods such as speech or handwriting recognition require training. Objective The Data-Transparent Authentication (DaTA) without Communication Overhead, to authenticate data streams. Our strategy neither embeds a digest to the original data, nor sends any out-of band authentication information. Instead, our scheme is based on the timing correlation of data packets between the sender and the receiver. Particularly, the inter packet delays are utilized and some selected packet delays are slightly adjusted (in a range). www.internationaljournalssrg.org Page 49 National Conference on Research Advances in Communication, Computation, Electrical Science and Structures (NCRACCESS-2015) Block Authentication Code (BAC) is used to increase the packet delivery ratio without delay. The BAC technique is use by XOR Operation. A hash function, denoted as H(X), is a one-way hash, using an algorithm such as MD5 or SHA.        II.WORKING FUNCTION Node configuration setting Nodes unique identity Message exchange process for route discovery BAC Generation BAC Embedding/Extraction BAC Authentication Comparison Graph Node Configuration Setting The mobile nodes are designed and configured dynamically, designed to employ across the network, the nodes are set according to the X, Y, Z dimension, which the nodes have the direct transmission range to all other nodes. Nodes Unique Identity All the mobile nodes tend to have a unique id for its identification process, since the mobile nodes communicates with other nodes through its own network id. Message Exchange Process For Route Discovery This module states a 4 step message exchange process (i,e) POLL, REPLY, REVEAL, REPORT. As soon the protocol executed the, POLL and REPLY messages are first broadcasted by Source and its neighbors, respectively. These messages are anonymous and take advantage of the broadcast nature of the wireless medium, allowing nodes to record reciprocal timing information without disclosing their identities. The mobile nodes are designed and configured dynamically, designed to employ across the network, the nodes are set according to the X, Y, Z dimension, which the nodes have the direct transmission range to all other nodes. BAC is embedded by adjusting the inter packet delay. In the following context, we present how the BAC bits can be embedded and extracted without touching the content of the packet. To extract the BAC, the receiver calculates Yr; d as it receives the data packets. To extract an embedded bit, the receiver checks whether Yr; d is less than or greater than 0. The extraction of embedded binary bit is 1 if the value of Yr; d is greater than 0, or 0 if the value of Yr; d3 is less than or equal to 0. It is easy to see that probability of correct extraction is always greater than that of wrong extract. BAC Authentication With the extracted BAC bits and received data packets, the receiver applies the same hash function (H) on the received data packets with the same secret key (k) to generate the content-based BAC following the same procedure used for BAC generation at the sender side. Then, the extracted BAC is compared with the generated BAC. The comparisons consist of two parts: the first part is on the first n bits, while the second is on the rest f 0 bits. Comparison Graph The performance analysis of the existing and proposed work is examined through graphical analysis. Compare the time, throughput and packet delivery ratio. BAC Generation The sender side, the authentication information BAC is generated based on a selected hash function with the packet content and a commonly agreed key as the input. Based on the value of each bit (0/1) of BAC, some packets are scheduled to be sent out with additional delays. BAC Embedding/Extraction After the BAC is generated, the next step is to embed the BAC. Different from existing strategies where the authentication information is sent out-of-band or embedded into the original data before data transmission, in DaTA, the ISSN: 2348 - 8549 www.internationaljournalssrg.org Fig 1: Packet drop Page 50 National Conference on Research Advances in Communication, Computation, Electrical Science and Structures (NCRACCESS-2015) III. ALGORITHM IMPLEMENTED 1. The stream packets are clustered to blocks, denoted as block[i], with b packets in each block. Padding is used when necessary to generate the last block. 2. The length (in terms of bits) of the BAC for each data block is n. 3. A hash function, denoted as H(X), is a one-way hash, using an algorithm such as MD5 or SHA. 4. X, Y represents the concatenation of X with Y. 5. A secret key k is only known to the communicating parties. 6. The origin of the data stream can be identified by a flag, which is f bits, where 0 ≤ f ≤ n. Fig 2: Energy consumption Fig 5: Block diagram for Block Authentication Code Advantages   Fig 3: Throughput Conclusion We propose a new scheme by adjusting packet timing (delay) to authenticate the data stream. Thus, authentication is done without changing the original packet content and without sending additional authentication information. Extensive experiments are conducted locally and over the Internet based on an implemented prototype system and show that our scheme is robust and practical. 1. 2. Fig 4: Packet Delivery Ratio ISSN: 2348 - 8549 Encrypt-last-block has the advantage of not needing to know the length of the message until the end of the computation. It provides high security when the transmission of data occurs. REFERENCES Abdelzaher T. Blum B. He T. Lu C. and Stankovic J. (2002), ‘RAP: A Real-Time Communication Architecture for LargeScale Wireless Sensor Networks,’ Proc. IEEE Real-Time and Embedded Technology Applications Systems. Abdelzaher T. He T. Lu C. and Stankovic J. (2003), ‘SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks,’ Proc. 23rd Int’l Conf. Distributed Computing Systems. www.internationaljournalssrg.org Page 51 National Conference on Research Advances in Communication, Computation, Electrical Science and Structures (NCRACCESS-2015) 3. Alfa A S. Cai J. Mark J W. andShen X. (2008), ‘SemiDistributed User Relaying Algorithm for Amplify-andForward Wireless Relay Networks,’IEEE Trans. Wireless Comm., vol. 7, no. 4, pp. 1348-1357. 4. Bletsas A. Khisti A.Lippman A. and Reed D P. (2006), ‘A Simple Cooperative Diversity Method Based on Network Path Selection,’ IEEE J. Selected Areas in Comm., vol. 24, no. 3, pp. 659-672. 5. Cetin B. Feeney L. Hollos D. Karl H. Kubisch M., and Mengesha S. (2007), ‘Multi-Rate Relaying for Performance Improvement in IEEE 802.11 WLANS,’ Proc. Fifth Int’l Conf. Wired/Wireless Internet Comm. 6. Cidon G. and Kulkarni S. (2006), ‘Load Balancing and in Mobile Ad Hoc Networks,’Ad Hoc Networks, vol. 4, pp. 186203. Cidon I. Mokryn O. andZohar E. (2011), ‘The Power of Prediction: Cloud Bandwidth and Cost Reduction,’ Proc. ACM Special Interest Group Data Comm. (SIGCOMM). 7. 8. Gallager R. and A. Parekh A. (1992), ‘A Generalized Processor Sharing Approach to Flow Control,’Proc. IEEE INFOCOM. 9. Ibrahim S. Liu R.Sadek K. and Su W. (2008), ‘Cooperative Communications with Relay-Selection: When to Cooperate and Whom to Cooperate With?’ IEEE Trans. Wireless Comm., vol. 7, no. 7,pp. 2814-2827. 10. Jiang S. Jiang Y. Liu Y. and Yin Q.(2004), ‘Provisioning of Adaptability to Variable Topologies for Routing Schemes in MANETs,’ IEEE J. Selected Areas in Comm., vol. 22, no. 7,pp. 1347-1356. ISSN: 2348 - 8549 www.internationaljournalssrg.org Page 52