Request Packets Research Articles

Delay-sensitive Quality of Service Routing with Integrated Admission Control for Wireless Mesh Network

Wireless mesh networks (WMNs) extend and improve broadband Internet connectivity for the end-users roaming around the edges of the wired network. Amid the explosive escalation of users sharing multimedia content over the Internet, the WMNs need to support the effective implementation of various multimedia applications. The multimedia applications require assured quality of service (QoS) to fulfill the user requirements. The QoS routing in WMNs needs to guarantee the QoS requirements of multimedia applications. Admission control (AC) is the primary traffic control mechanism used to provide QoS provisioning. AC admits a new flow only if the QoS requirements of already admitted flows are not violated, even after the admission of a new flow. We propose a new QoS routing protocol integrated with AC called Delay-Sensitive QoS Routing with integrated Admission Control (DSQRAC) to control the admission of delay-sensitive flows. A delay-aware cross-layer routing metric is used to find the feasible path. DSQRAC is implemented using ad-hoc on-demand distance vector (AODV) routing protocol, where a delay-sensitive controlled flooding mechanism is used to forward the route request packets. In the proposed work, we adjust/reassign the channels to aid the QoS routing to increase the likelihood of accepting a new flow. The simulation results show that the performance of the proposed QoS routing protocol is better than the existing schemes.

Hybrid Duplex Medium Access Control Protocol for Tsunami Early Warning Systems in Underwater Networks

Tsunamis are devastating natural phenomena that cause extensive damage to both human life and infrastructure. To mitigate such impacts, tsunami early warning systems have been deployed globally. South Korea has also initiated a project to install a tsunami warning system to monitor its surrounding seas. To ensure reliable warning decisions, various types of data must be combined, but efficiently transmitting heterogeneous data poses a challenge due to the unique characteristics of underwater acoustic communication. Therefore, this paper proposes a Hybrid Duplex Medium Access Control (HDMAC) protocol designed for a tsunami warning system, with a specific focus on heterogeneous data transmission. HDMAC efficiently handles both seismic and environmental data by utilizing hybrid duplexing, which combines frequency duplex for seismic data with time duplex for environmental data. The protocol addresses the distinct transmission requirements for each data type by optimizing channel utilization through a group Automatic Repeat request (ARQ) scheme and packet size adjustment. Theoretical analysis predicts that HDMAC can achieve a channel utilization of up to 0.91 in smaller networks and 0.64 in larger networks. HDMAC is validated through simulations, and the simulation results closely match these predictions. The simulation results demonstrate the efficiency of HDMAC in supporting real-time submarine earthquake monitoring systems.

On the aggregation of FIBs at ICN routers using routing strategy

Utilizing in-network caching is essential for the current communication network. In the last decade, ICN (Information-Centric Networking) has been under the spotlight as a network that mainly focuses on transmitted and received data rather than on hosts that transmit and receive data. In ICNs, to appropriately forward request packets, a router maintains a routing table called FIB (Forwarding Information Base). However, it is unsuitable for us to assume that FIB can store entries of all contents within a network. This is mainly because the FIB memory is not large enough to store the prefix of all contents. Thus, for realizing global-scale ICNs, it is crucial to develop an effective technique to reduce the size of FIB. In this paper, to tackle the reduction in the FIB size with the aggregation, we propose a routing strategy called constrained shortest-path tree (CSPT) routing. The fundamental idea of our CSPT routing is to combine shortest-paths on the network and that on a shortest-path tree of the network, which is intended to enhance the effect of FIB aggregation. Furthermore, we extensively investigate the relationship, i.e., trade-off, between the FIB aggregation and the communication performance of ICN using CSPT routing. Consequently, we reveal that our CSPT routing can dramatically reduce the number of FIB entries while suppressing the increase in the number of hops required to deliver request packets.

A local filtering-based energy-aware routing scheme in flying ad hoc networks

Flying ad hoc network (FANET) is a new technology, which creates a self-organized wireless network containing unmanned aerial vehicles (UAVs). In FANET, routing protocols deal with important challenges due to limited energy, frequent link failures, high mobility of UAVs, and limited communication range of UAVs. Thus, a suitable path is always essential to transmit data between UAVs. In this paper, a local filtering-based energy-aware routing scheme (LFEAR) is proposed for FANETs. LFEAR improves the template of the route request (RREQ) packet by adding three fields, namely the energy, reliable distance, and movement similarity of the relevant route to create stable and energy-efficient paths. In the routing process, LFEAR presents a local filtering construction technique to avoid the broadcasting storm issue. This filter limits the broadcasting range of RREQs in the network. Accordingly, only UAVs inside this local filtered area can rebroadcast RREQs and other UAVs must eliminate these packets. After ending the route discovery process, the destination begins the route selection phase and extracts information about each discovered route, including the number of hops, route energy, reliable distance, and movement similarity. Then, the destination node calculates a score for each path based on the extracted information, selects the route with the highest score, and sends a route reply (RREP) packet to the source node through this route. Finally, the simulation process of LFEAR is performed using the NS2 simulator, and two simulation scenarios, namely change in network density and change in the speed of UAVs, are defined to evaluate network performance. In the first scenario, LFEAR improves energy consumption, packet delivery rate, network lifespan, and delay by 1.33%, 1.77%, 6.74%, and 1.71%, while its routing overhead is about 16.51% more than EARVRT. In the second scenario, LFEAR optimizes energy consumption and network lifetime by 5.55% and 5.67%, respectively. However, its performance in terms of routing overhead, packet delivery rate, and delay is 23%, 2.29%, and 6.67% weaker than EARVRT, respectively.

IoT-SecNet: A Trust-based Framework for Enhancing Security in IoT Communications and Network Layer Protocols

The Internet of Things (IoT) integrates cloud computing, big data, and data mining to become a vital 21st-century technology. IoT uses hardware, software, and communication protocols to connect and share data amongst devices. However, IoT’s increasing usage raises security concerns, especially due to its ubiquitous communication infrastructure. IoT ecosystems depend on communication protocols to connect hardware and application software and enable real-world device deployment. Due to their openness, these protocols are vulnerable to DoS, DDoS, and buffer overflow attacks despite their importance. Thus, a complete framework to protect these protocols at the communication and network layers is needed. This study proposes an IoT-SecNet (Secure Network), a Trust-based Framework to improve security across IoT communication protocols. This framework verifies sensor data and sends request packets for processing, ensuring security and effective traffic management across IoT layers. Through experimental assessments, we show a 90% accuracy rate in identifying assaults and compare it to existing security solutions. Our architecture protects against threats by maintaining high communication layer protocol throughput and low delay.

Detection of black hole attacks in vehicle-to-vehicle communications using ad hoc networks and on demand protocols

PurposeThe potential of vehicle ad hoc networks (VANETs) to improve driver and passenger safety and security has made them a hot topic in the field of intelligent transportation systems (ITSs). VANETs have different characteristics and system architectures from mobile ad hoc networks (MANETs), with a primary focus on vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. But protecting VANETs from malicious assaults is crucial because they can undermine network security and safety.Design/methodology/approachThe black hole attack is a well-known danger to VANETs. It occurs when a hostile node introduces phony routing tables into the network, potentially damaging it and interfering with communication. A safe ad hoc on-demand distance vector (AODV) routing protocol has been created in response to this issue. By adding cryptographic features for source and target node verification to the route request (RREQ) and route reply (RREP) packets, this protocol improves upon the original AODV routing system.FindingsThrough the use of cryptographic-based encryption and decryption techniques, the suggested method fortifies the VANET connection. In addition, other network metrics are taken into account to assess the effectiveness of the secure AODV routing protocol under black hole attacks, including packet loss, end-to-end latency, packet delivery ratio (PDR) and routing request overhead. Results from simulations using an NS-2.33 simulator show how well the suggested fix works to enhance system performance and lessen the effects of black hole assaults on VANETs.Originality/valueAll things considered, the safe AODV routing protocol provides a strong method for improving security and dependability in VANET systems, protecting against malevolent attacks and guaranteeing smooth communication between cars and infrastructure.

TEE-AODV Trust-based Route Selection and Improving Energy Efficiency in MANET

Mobile ad hoc networks (MANETs) are the future communication infrastructure for all devices that operate without the elaborate design found in wired infrastructure networks. Constructing a routing protocol that helps MANETs to achieve (QoS). It is quite challenging to achieve energy-efficient routing, due to its limited resources and node mobility concerns, which would impact node resource stability and lead to congestion and lower user QoS. A novel Trustworthy Energy Efficient AODV protocol has been proposed for improving path selection and locating trusted stations to maximize QoS. This approach employs location data, transmission speed, and directions to estimate the energy usage and trustworthiness of distinct nodes. The proposed TEE-AODV protocol includes two new control information namely Trust Request packet and Trust Reply. (T-RREP) AODV's packet includes a neighbor list and channel trustworthiness. The number of working neighbors in every path is counted, and this information is used to efficiently choose paths. The TEE-AODV calculates a QoS supporting metric for each detected route to identify a traffic-free path at any moment and determines whether it is a trusted route. The NS-2 simulator has been used to assess the suggested approach in terms of specific characteristics, including energy consumption (EC), (PDR), end-to-end delay (), and number of dead nodes. According to the experimental results, the suggested framework enhances reliable route selection while lowering e nd-to-end latency and improving energy efficiency. The experimental findings indicate that the suggested TEE-AODV protocol achieves high energy efficiency rate in the selection of trustworthy route and minimizing the E D .

An ICN-Based On-Path Computing Resource Scheduling Architecture with User Preference Awareness for Computing Network

The Computing Network is an emerging network paradigm that aims to realize computing resource scheduling through the intrinsic capabilities of the network. However, existing resource scheduling architectures based on conventional TCP/IP networks for the Computing Network suffer from deficiencies in routing flexibility and a lack of user preference awareness, while Information-Centric Networking (ICN) holds the potential to address these issues. ICN inherently supports dynamic routing in scenarios such as multi-homing and mobility due to its routing mechanism that is based on content names rather than host addresses, and it is further enhanced by the integration with Software-Defined Networking (SDN) technologies, which facilitate convenient network-layer route readdressing, thus offering a conducive environment for flexible routing scheduling. Furthermore, ICN introduces novel routing protocols that, compared with the more rigid protocol designs in conventional TCP/IP networks, offer greater flexibility in field usage. This flexibility allows for the incorporation of customized fields, such as “preference”, enabling the perception of user preferences within the network. Therefore, this paper proposes a novel ICN-based on-path computing resource scheduling architecture named IPCRSA. Within this architecture, an original design for computing resource request packet format is developed based on the IPv6 extension header. Additionally, preference-based computing resource scheduling strategies are incorporated, which employ the technique for order preference by similarity to ideal solution (TOPSIS) combined with the entropy weight method, to comprehensively evaluate computing resource nodes and use a roulette-selection algorithm to accomplish the probability selection of destination nodes. Experimental results indicate that, in comparison to alternative scheduling schemes, IPCRSA exhibits significant advantages in enhancing scheduling flexibility, improving scheduling success rates, and catering to diverse user requirements.

Enhancing Energy Efficiency in IoT-NDN via Parameter Optimization

The IoT encompasses objects, sensors, and everyday items not typically considered computers. IoT devices are subject to severe energy, memory, and computation power constraints. Employing NDN for the IoT is a recent approach to accommodate these issues. To gain a deeper insight into how different network parameters affect energy consumption, analyzing a range of parameters using hyperparameter optimization seems reasonable. The experiments from this work’s ndnSIM-based hyperparameter setup indicate that the data packet size has the most significant impact on energy consumption, followed by the caching scheme, caching strategy, and finally, the forwarding strategy. The energy footprint of these parameters is orders of magnitude apart. Surprisingly, the packet request sequence influences the caching parameters’ energy footprint more than the graph size and topology. Regarding energy consumption, the results indicate that data compression may be more relevant than expected, and caching may be more significant than the forwarding strategy. The framework for ndnSIM developed in this work can be used to simulate NDN networks more efficiently. Furthermore, the work presents a valuable basis for further research on the effect of specific parameter combinations not examined before.

Traffic-Predictive Routing Strategy for Satellite Networks

To address the issues of uneven satellite network load and unstable link connections, a globally adaptive satellite network routing strategy based on traffic prediction (G-AODV) is proposed by enhancing the existing Ad hoc On-Demand Distance Vector Routing (AODV) protocol. To prevent heavily loaded nodes from becoming intermediate nodes, G-AODV introduces a traffic prediction mechanism in the route discovery phase. The routing request packet adopts the corresponding forwarding control policy based on the comparison between the predicted traffic load value at the next moment and the dynamic threshold. At the same time, a path replacement strategy is adopted to replace paths before node congestion occurs to achieve load balancing. Considering the unstable characteristics of the satellite chain that easily breaks, the route maintenance phase selects a path repair method by judging the node stability to avoid secondary breaks in the route. The simulation results show that in scenarios with different packet delivery rates, compared with the three comparative routing strategies, the packet delivery rate of G-AODV is increased by up to 20%, the packet loss rate is reduced by 22%, and the end-to-end delay is significantly reduced. In scenarios with different communication connection pairs, G-AODV’s packet delivery rate increased by up to 20%, the packet loss rate decreased by 18%, and the end-to-end delay was still reduced.

Ethereum Smart Home for Denial of Service and Single Point of Failure

Blockchain is a digital transaction technology adopting the peer-to-peer concept. The implementation of blockchain on Internet of Things (IoT) aims to secure the possibility of potential attacks against devices or transactions taking place on the IoT system. At practical levels, blockchain uses smart contracts to automate programs according to predetermined terms and conditions. This research is aimed at implementing an ethereum-based smart home Smart Contract by modifying the device components, dashboards, and consensus used in Xu et al.’s research. The consensus modification was performed by using Proof of Authority (PoA) aiming to improve block verification performance on the system. The Denial of Service (DoS) attacks and Single Point of Failure (SpoF) vulnerability were performed to evaluate the proposed system. The evaluation was performed with TCP Flood Attack, with request packets of 81,519 packets on port 8545 and ICMP Floods by sending 11,481,703 PING packets. The attack caused some application services running on the Ethereum Node 3 to stop, but did not stop the geth application. As for the Single Point of Failure (SPoF) vulnerability, the Ethereum network is still running and there were no obstacles in the mining process or block verification.

Multicasting Model for Efficient Data Transmission in VANET

VANETs (Vehicle Ad hoc Networks) are networks made up of a number of vehicular nodes that are free to enter and leave the network. The Location Aided Routing (LAR) protocol is the one that is most frequently utilized among them. Here, the route request packets are flooded across many pathways to the source node using the broadcasting strategy. The vehicles that have a direct path to the destination send the route reply packets back to the source. The least number of hops and the sequence number are used to determine the route from source to destination. This research study has used the multicasting approach to construct a path from the source node to the destination node. Within this multicasting strategy, the root nodes from the network are selected for data routing. The path between the source and the destination is chosen using a root node. The suggested approach is put into practice using the NS2, and some parametric values are computed to produce analytical findings.

Temporal Data Correlation Providing Enhanced Dynamic Crypto-Ransomware Pre-Encryption Boundary Delineation.

Ransomware is a type of malware that employs encryption to target user files, rendering them inaccessible without a decryption key. To combat ransomware, researchers have developed early detection models that seek to identify threats before encryption takes place, often by monitoring the initial calls to cryptographic APIs. However, because encryption is a standard computational activity involved in processes, such as packing, unpacking, and polymorphism, the presence of cryptographic APIs does not necessarily indicate an imminent ransomware attack. Hence, relying solely on cryptographic APIs is insufficient for accurately determining a ransomware pre-encryption boundary. To this end, this paper is devoted to addressing this issue by proposing a Temporal Data Correlation method that associates cryptographic APIs with the I/O Request Packets (IRPs) based on the timestamp for pre-encryption boundary delineation. The process extracts the various features from the pre-encryption dataset for use in early detection model training. Several machine and deep learning classifiers are used to evaluate the accuracy of the proposed solution. Preliminary results show that this newly proposed approach can achieve higher detection accuracy compared to those reported elsewhere.

Application of MikroTik Firewall for Website Access Restriction and Prevention of DoS (Denial of Service) Attacks on Internet Networks Al-Mahrusiyah Vocational School Lirboyo

Internet access is so easy that every level of society can access information from the website. If internet access is used positively, it will produce positive things for its users as well. Such as the facilities provided by the management of SMK Al-Mahrusiyah Lirboyo. Students, especially in the Computer and Network Engineering (TKJ) department, get facilities such as PCs in the lab or laptops along with internet access during productive learning hours. In its application in schools, students who are given laptop facilities and internet access do not always use it for learning. Questionnaire data showed that there were other things that were opened, including 37.7% of respondents finding and trying hacking tutorials, 35.8% playing social media, and 34% streaming movies. For this reason, a firewall is needed that restricts students' access to it. The firewall will be formulated with a script on the MikroTik router through the WinBox. The results of firewall tests using a combination of filters and Raw successfully blocked access to social media websites, streaming movies, and anime. The client cannot access and the display in the client browser displays continuous loading. Testing firewalls to ward off DoS attacks was also successful. When tested, LOIC did not send a single request packet and when the CPU resource was checked, the resource was only 1%. The use of firewalls with MikroTik routers is effective in limiting students' access to other things outside of learning. With this, it is hoped that students can better utilize facilities for learning.

Scanner++: Enhanced Vulnerability Detection of Web Applications with Attack Intent Synchronization

Scanners are commonly applied for detecting vulnerabilities in web applications. Various scanners with different strategies are widely in use, but their performance is challenged by the increasing diversity of target applications that have more complex attack surfaces (i.e., website paths) and covert vulnerabilities that can only be exploited by more sophisticated attack vectors (i.e., payloads). In this paper, we propose Scanner++, a framework that improves web vulnerability detection of existing scanners through combining their capabilities with attack intent synchronization. We design Scanner++ as a proxy-based architecture while using a package-based intent synchronization approach. Scanner++ first uses a purification mechanism to aggregate and refine attack intents, consisting of attack surfaces and attack vectors extracted from the base scanners’ request packets. Then, Scanner++ uses a runtime intent synchronization mechanism to select relevant attack intents according to the scanners’ detection spots to guide their scanning process. Consequently, base scanners can expand their attack surfaces, generate more diverse attack vectors and achieve better vulnerability detection performance. For evaluation, we implemented and integrated Scanner++ together with four widely used scanners, BurpSuite, AWVS, Arachni, and ZAP, testing it on ten benchmark web applications and three well-tested real-world web applications of a critical financial platform from our industry partner. Working under the Scanner++ framework helps BurpSuite, AWVS, Arachni, and ZAP cover 15.26%, 37.14%, 59.21%, 68.54% more pages, construct 12.95×, 1.13×, 15.03×, 52.66× more attack packets, and discover 77, 55, 77, 176 more bugs, respectively. Furthermore, Scanner++ detected eight serious previously unknown vulnerabilities on real-world applications, while the base scanners only found three of them.

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Mobile ad hoc network or in short MANET is a group of node that exchange the information from source node to destination node on wireless network. The main problem in MANET is on the network structure that change continously that is cause by node mobility that made route disconnected. If route disconnect there will be another route discovery processes that will take much time. AOMDV (Ad hoc On-demand Multipath Distance Vector) routing protocol works by doing broadcast Route Request Packet (RREQ) from source node to neighbor node (intermediate node) and then it will continously until it arrives to destination node. AOMDV didnt choose the best neighbor node while broadcast RREQ packet so the route constructed have high possibility to disconnected and must re-broadcast until it find stable route and it will be a long time and not effective. To solve this problem it proposed to add a modification with AOMDV routing protocol with calculation of bandwidth, round trip time, and packet loss ratio to choose neighbor node to find the best route. Routing protocol performance will tested using test parameter throughput, delay, and packet delivery ratio to choose the best neighbor node. Based on test result, the proposed modification can improve the preformance of AOMDV routing protocol. After modification, average throughput has improved 43.26 %, Packet Delivery Ratio (PDR) improved 3.15 % and average end-to-end delay reduce 31.26%.

An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)

MANET (mobile ad-hoc network) is a wireless ad-hoc network made up of mobile devices that use peer-to-peer routing to provide network access instead of using a preexisting network infrastructure. Despite the network infrastructure’s simplicity, it faces issues such as changeable connection capacity, dynamic topology, node battery power exhaustion, and inadequate physical security. Broadcasting is a standard MANET approach for sending messages from a source node to all other nodes in the network. Flooding is a frequent method for broadcasting route request (RREQ) packets, which is susceptible to broadcast storms. The high retransmission rate is caused by the standard flooding technique, which causes media congestion and packet collisions, which can drastically reduce throughput and network performance. In a mobile ad-hoc network, efficient broadcasting focuses on selecting a compact forward node set while assuring broadcast coverage. The goal is to find a limited number of forward nodes that will provide complete coverage. In this paper, we propose an optimized and energy-efficient routing protocol for MANET (mobile ad-hoc network) based on dynamic forwarding probability in general and AODV (ad hoc on-demand distance vector) in particular, in which the route request packets are randomly controlled to increase the network lifetime and reduce packet loss in the flooding algorithm. We tested and assessed the results of our proposed solution using various network performance factors after implementing and integrating it into NS-2. According to simulation findings, our proposed technique effectively reduced route request propagation messages (RREQ). The suggested technique is more efficient, has a longer network lifetime, and uniformly utilizes node residual energy, enhancing network throughput and minimizing routing overhead when compared to regular and modified AODV protocols.

Congestion aware and game based odd even adaptive routing in network on chip many-core architecture

The era of single processors had almost reached a saturation state, and the industry had moved to multi-core processors for the newer generation of many-core architecture. Interconnections between multiple cores with network on chip (NoC) surpass traditional bus architecture for its quality of service (QoS) and other additional services. Seamless communication among the cores is more significant for better performance and the proper utilization of the cores. The rise in the cores count in a semiconductor chip adds the complexity of the communication among cores. Cache misses request and packet transmission’s traffic possibly will reduce the performance of the architecture. A theoretical game-based methodology is proposed to improvise the performance and communication by routing the request packets in the NoC of the many core architectures and the throughput is maximized with reduced latency by using the stag-hunt game (SHG) model. The proposed communication algorithm routes the packets in an adaptive way by detecting the congestion in routers. The SHG based odd-even routing algorithm is adaptive and can divert the packets towards less congested routers using the information gathered about congestion in the system, so that the overall performance of the system in terms of latency and throughput is improved.

A lightweight DDoS detection scheme under SDN context

Software-defined networking (SDN), a novel network paradigm, separates the control plane and data plane into different network equipment to realize the flexible control of network traffic. Its excellent programmability and global view present many new opportunities. DDoS detection under the SDN context is an important and challenging research field. Some previous works attempted to collect and analyze statistics related to flows, usually recorded in switches, to address DDoS threats. In contrast, other works applied machine learning-based solutions to identify DDoS and achieved promising results. Generally, most previous works need to periodically request flow rules or packets to obtain flow statistics or features to detect stealthy exceptions. Nevertheless, the request for flow rules is very time-consuming and CPU-consuming; moreover may congest the communication channel between the controller and the switches. Therefore, we present FORT, a lightweight DDoS detection scheme, which spreads the rule-based detection algorithm at edge switches and determines whether to start it by periodically retrieving the ports state. A time-series algorithm, ARIMA, is utilized to determine the port statistics adaptively, and an SVM algorithm is applied to detect whether a DDoS attack does occur. Representative experiments demonstrate that FORT can significantly reduce the controller load and provide a reliable detection accuracy. Referring to the false alarm rate of 1.24% in the comparison scheme, the false alarm rate of this scheme is only 0.039%, which significantly reduces the probability of false alarm. Besides, by introducing the alarm mechanism, this scheme can reduce the load of the southbound channel by more than 60% in the normal state.

Prevention of Blackhole Attack in MANET using Certificate less Signature Scheme

Mobile AdHoc Networks (MANETs) are the network of self-configuring nodes. Such nodes communicate through single as well as multi-hop modes without the aid of any centralized administrator or pre-existing network infrastructure. Due to this reason, MANETs have gained a highly significance in modern wireless networking technologies. Such networks are extremely vulnerable to one of the security attack i.e. blackhole attack. It is a malicious node when an attacker is able to send a fake route reply to the originator of a route request packet. Such attackers discard the legitimate packets and replay packets in the whole network thereby adversely affecting network performance. Most of the security protocols for MANET are using bilinear pairing methods to provide security against security attacks and it takes high computing cost for the computation of pairing operations. Nowadays, researchers are using certificate-less signature schemes in distributed environments to provide efficient security. This signature scheme is very popular because it does not use any certificate authority for the management of security certificates. In this paper, we proposed an efficient technique to prevent blackhole attack in MANET using RSA-based certificateless signature scheme without using any bilinear pairing operations. Our scheme provides security against forgery and blackhole attacks and is evaluated under a discrete logarithm problem. Proposed scheme outperforms existing schemes in terms of these metrics viz., throughput, packet delivery ratio, routing overhead and end-to-end delay when we are varying mobility and fixed percentage of malicious nodes. Our proposed scheme not only detects or prevents the blackhole attack but it is also capable to provide important security services viz., integrity, authentication and non-repudiation.