Indonesian Journal of Electrical Engineering and Computer Science Vol. 14, No. 3, June 2019, pp. 1258~1265 ISSN: 2502-4752, DOI: 10.11591/ijeecs.v14.i3.pp1258-1265 1258 Journal homepage: http://iaescore.com/journals/index.php/ijeecs Cooperative and fresher encounter algorithm for reducing delay in MANET N. Noor Alleema 1 , D. Siva Kumar 2 1 Department of Computer Science and Engineering, Sathyabama Institute of Science & Technology, India 2 Department of Electronics and Communication Engineering, Easwari Engineering College, India Article Info ABSTRACT Article history: Received Sep 16, 2018 Revised Nov 17, 2018 Accepted Feb 22, 2019 In Mobile Ad-hoc Networks (MANET), the route discovery is the chief problem for the nodes. In this paper Cooperative and Fresher Encounter Algorithm (CFEA) for Reducing Delay in MANET is proposed. The route discovery problem has been overcome by FResher Encounter algorithm. It is a simple algorithm for discovery the routes in efficient manner in the MANET. The node has the memory of past route details that communicate with remaining nodes. The node prefers to find the intermediate node instead of finding the destination node, that intermediate node keeps the knowledge of recently encounter the destination node. Then the intermediate node communicates with the node which is encountered the destination node recently, and the process is continued until the destination is attained. The main advantage of the scheme is reducing the process time. Keywords: Cooperativeness Energy drained rate Fresher encounter algorithm Link break degree MANET Copyright © 2019 Institute of Advanced Engineering and Science. All rights reserved. Corresponding Author: N. Noor Alleema, Department of Computer Science and Engineering, Sathyabama Institute of Science & Technology, Rajiv Gandhi Salai, Jeppiaar Nagar, Chennai, Tamil Nadu 600119 Email: noor.alleema@gmail.com 1. INTRODUCTION MANET considers three routing objectives: maximize packet delivery ratio, maximize network energy lifetime, and minimize average end-to- end delay. MANET extends three routing metrics: link stability on each link, energy cost on each node, and mean queuing delay on each node. MANET is used in military applications when the soldiers needed the data from sender to the missile ship, fighter plane and tankers [1]. In MANETs each mobile node acts as a router and host. Hence, it doesn’t need any communication support for transfer data packets among mobile nodes. MANETs routing are base on inimitable addresses in the network [2]. The source mobile node indicates the destination address. The network routing service creates a route path that contains multiple intermediate mobile nodes between the source and destination. Data Packets are routed through intermediate nodes and every node forwards the packets according to destination address [3]. Mediuma Access Control (MAC) Protocols for wireless networks can be classified as coordinated and uncoordinated MAC protocols based on the collaboration level [4]. In uncoordinated protocols such as IEEE 802:11, nodes contend with each other to share the common channel. For low network loads, these protocols are bandwidth efficient due to the lack of overhead. However, as the network load increases, their bandwidth efficiency decreases. In coordinated MAC protocols the channel access is regulated. Fixed or dynamically chosen channel controllers determine how the channel is shared and accessed. Coordinated channel access schemes provide support for quality of service (QoS), reduce energy dissipation, and increase throughput for dense networks. The main function of protocol is to find the shortest path between the source and destination. The QoS requirement is to satisfy the end-to-end delay, capable to operate in the