Cognitive Radio Ad Hoc Networks (CRAHN) are emerging as significant drivers in the ICT world. CRAHN users expect more enhanced data transfer rates, quality of experience and service to meet the diversification. To provide efficient and quality enabled services in CRAHN, wireless networks need to adopt new technologies
The performance of CRAHN in different communication scenarios is better when comparing with other wireless technology enabled networks. To meet the enhanced and growing complexity in CRAHN, it is necessary to improve autonomy and intelligence in it. In general, CR is a smart technology, i.e., CR has better efficiency in analyzing, sensing, and making decisions for allocating the dynamic resources and managing the spectrum. Few issues are still present in CR network's resource allocation like complexity, increased time for computation, a lengthier route to destination, route failure, and controlled optimization. To minimize emerging issues like this, CR users need to have a better ability to make decisions while interacting with different environments. Auspiciously, the artificial intelligence (AI) era is stepping-in. In the modern era of artificial intelligence, machines have awareness about creating interactions with varying environments like human beings. AI adopts optimization methodologies and clustering methodologies
The nodes in CRAHN have minimum energy but deployed in the environment that has significant number of hazardous attacks
Session Initiation Protocol (SIP)
An approach for detecting the intrusion to comprehend the potential of IoT
An IDS based on Feed Forward Deep Neural Networks
Routing indicates the process of finding a path to the destination in a network (i.e., from source to destination). The processes
Different protocols are being proposed to overcome the issues in CRAHN, but still CRAHN is facing many issues like high delay, energy consumption, critical routing and intrusions. So far, protocols proposed for ad-hoc networks like CRAHN focus only on one objective, (i.e., finding the best route) but did not consider security about the data. This research work has aimed to develop a protocol that can effectively perform different actions like (i) detecting the intrusion (ii) finding the ideal route to destination (iii) providing better security to data (iv) minimize the delay and energy consumption.
The CRAHN has huge roles in new fields and the network needs an adequate routing procedure for efficient data transmission between nodes. More applications attracted the CRAHN environment, and CRAHN's security level needs to be effective. Yet new developments in CRAHN security offer the network some protection. It demands a few additional controlling methodologies to enhance the security of the network internally and externally. Yet delivering network protection is a big challenge, as it will secure any bit of information from attackers. The transmission of data from the source-node to destination-node through neighbor nodes is generic; however, the choice of secured communication path should avoid attacker interference. The routing protocol proposed in this protocol is bee colony focused. The various stages involved in the proposed routing protocol are:
Selecting the nearest nodes
Path uncovering
Path selection
Providing security to the path
Forwarding of data
The scout bee role in this protocol is to find the shortest cum best path; also, it can be indicated as a path to the food source, from source to destination. In real-time, bees releases an odor, treated as a signal that assists in identifying the source of food and marks the exact path to the source of the food. The shortest route usually has a high fragrance (i.e., the odor) signal response as compared with other routes. It is possible to divide the scout bees into the primary scout bee (PSB) and the secondary scout bee (SSB). Those two kinds of bees are used for requesting a path and reply to the request.
The operation of selecting the nearest node is performed once the network route is chosen, i.e., by ending the whispering signals (i.e.,
In the path uncovering stage, the source node transmits the different numbers of primary Scout bees (i.e., PREQ packets) to the nearest random nodes during this path uncovering phase. The primary task of PSB is to transmit the data via the nearest nodes and assist the food source classification. The destination node gets multiple requests from the different nodes randomly and it gives an obstacle for several scout bees in reaching the scot bees. The reason falls as a time limit, the collision between nodes, failure of the path, and other routing-related assaults. Target nodes attempt to send Path Reply (i.e., PREP) messages with the assistance of SSB. The security of the paths is taken care of by these bees. The mechanism of path protection is introduced and it is indicated as false (or 0) to denote the path is not secured. Indication of the path as true (or 1) signifies the secured path and there exists no need for the incorporation of security algorithm. An essential aspect of path discovering is to generate the predetermined PSB and the value of trust level is used for that. Such values are determined for the nodes before the data arrives without any difficulties in the destination. The SSB also uses it to check whether the return path is correct. Description of the key Scout bees and the confidence worthiness are provided for the destination node. The secondary node to pass the data to the sink node utilizes trust values. If the path is inconsistent, the security mechanism for secure communication between the nodes will be initiated.
Path selection is made by collecting detailed information about the trust value, level of energy available and time, etc. from the SSB. It also offers the details of the detection of route assaults. Once that information is collected for route selection, a sink node receives different SSB PREP packets. Consider SB1, SB2, SB3, SB4 and SB5 as scout bees that roam via the different number of nodes for reaching the destination node (i.e., the food source), and P1, P2, P3, P4 and P5 as the paths for SB in reaching the destination node. If a scout bee starts its progression towards the destination node from the sink node, then it will not receive any better idea about the destination. Following two scenarios are considered for path selection:
where N indicates the Rank, w represents the Worst SSB node; g denotes the Best SSB node.
To make communication in a secured manner, it is necessary to calculate the trust level of a secured path and data. The calculation of overall trust is also essential. If the level of trust is received as 1 then it indicates no need for the usage of security, but if it is 0 then it shows the usage of security. A comparison of trust level values is made in Many-to-Many manner with other paths and scout bees. At last, SSB gathers and brings the collected information to sink node from the destination node
In this scenario, it is assumed that two SSB identifies a unique path to the source of food having equal hop count, distance, and lifespan. Every SSB tries to achieve the sink node cum other node support towards deciding to select the better path. This research work makes use of a method, namely “Rank Selection Process (RSP)” for evaluating individual paths. When SSB enters the destination node, a ranking process is initiated. Once the secondary scout bee enters the destination node, the process of rank selection is initiated. The values for the fitness can be allocated as energy level or confidence of the path. Distribution of ranks is done according to their fitness values through the collection of secondary scout bees.
RSP concedes categorization of chosen SSB involves the below steps:
Based on the trust level value (i.e., the fitness value), SB is ordered in a decreasing manner.
Assign a rank value for SSB based on its trust level value.
Assess the energy level and trust level value of every SSB.
Only when the trust level value is zero, then the security phase is executed, else no. This research work makes use of handshake methodology to proceed the security phase, and it involves the below stages:
Whispering messages (i.e., Hello Message) are sent to the neighbor node by SSB.
Once after receiving the whispering message, the neighbor node sends an acknowledgment and sends its whispering message to the SSB.
Once after receiving the acknowledgment message, SSB sends its data to the neighbor node. In Parallel, it accepts the whispering message of its neighbor.
Once after receiving the SSB data, the neighbor node sends acknowledgment as the confirmation of receiving the data.
If there arises a necessity of providing security, then RSA security is applied for avoiding the malicious node intrusion in CRAHN.
This research work utilizes the Rivest Shamir Adelman Algorithm
1. Choose two huge prime number
2. Compute
3. SSB computes the public key E (i.e., used for encryption), with the condition of having (A-1) and (B-1) as not a factor.
4. Neighbour computes the private key D (i.e., used for decryption), which satisfies the below equation
5. To encrypt, compute CT (i.e., ciphertext) from PT (i.e., plain text) by using the below equation
6. SSB transmits CT as an encrypted text to the neighbor node.
7. To decrypt the CT, neighbor node computes PT from CT using the below equation
SSB applies the procedure mentioned in the above step is used to provide security. Once after completing the security phase, SSB reaches the sink node to pass the information that the current path is secured and better for making the communication.
The current section makes a discussion about evaluating the BISP using NS2 simulations. In general, there exists no trusted simulator for evaluating protocols for CRAHN. Furthermore, the details that are available regarding the protocol implementation or simulation for CRAHN are unclear to understand, especially the performance of protocols. This paper attempts to compare BISP against WPIP
Parameters of Simulation | Values |
Simulation Area Size | 2500 ×2500 m2 |
Simulator Name and Version | NS2.35 |
Count of nodes | 10 to 100 varying with 10 |
Mobility Model | Randomway Point |
Speed of Mobility | 4 m/s to 40 m/s |
Type of Traffic | Constant Bit Rate |
Type of Channel | Wireless |
MAC | 802.16 |
Transmission Range | 500 m |
Initial Energy | 15 Joules |
Size of Packet | 0.512 kb |
This research works makes use of below mentioned metric for analyzing the performance of proposed protocol BISP against WPIP
Node Count | 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 100 |
Protocols | ||||||||||
BISP | 75 | 73 | 71 | 68 | 65 | 63 | 61 | 59 | 57 | 55 |
WPIP | 71 | 69 | 64 | 63 | 61 | 59 | 57 | 55 | 52 | 50 |
GRP | 59 | 57 | 53 | 52 | 50 | 47 | 46 | 44 | 42 | 41 |
Node count | 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 100 |
Protocols | ||||||||||
BISP | 75 | 73 | 71 | 68 | 65 | 63 | 61 | 59 | 57 | 55 |
WPIP | 71 | 69 | 64 | 63 | 61 | 59 | 57 | 55 | 52 | 50 |
GRP | 59 | 57 | 53 | 52 | 50 | 47 | 46 | 44 | 42 | 41 |
Analysis of the overall packet drop against the node count is shown in
Node count | 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 100 |
Protocols | ||||||||||
BISP | 10 | 11 | 13 | 15 | 16 | 19 | 21 | 23 | 25 | 27 |
WPIP | 16 | 18 | 22 | 24 | 26 | 31 | 33 | 37 | 39 | 44 |
GRP | 41 | 43 | 47 | 51 | 57 | 62 | 63 | 69 | 75 | 81 |
Delay analysis of proposed protocol against the existing protocols presented in
Node count | 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 100 |
Protocols | ||||||||||
BISP | 9 | 11 | 14 | 17 | 21 | 22 | 22 | 21 | 20 | 18 |
WPIP | 15 | 18 | 22 | 25 | 27 | 29 | 33 | 35 | 37 | 41 |
GRP | 33 | 34 | 37 | 41 | 43 | 47 | 51 | 55 | 59 | 62 |
The overall energy consumption versus node count demonstrated in
Node count | 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 100 |
Protocols | ||||||||||
BISP | 7 | 10 | 12 | 16 | 19 | 21 | 22 | 22 | 23 | 22 |
WPIP | 21 | 25 | 27 | 32 | 35 | 37 | 39 | 42 | 43 | 45 |
GRP | 32 | 33 | 36 | 38 | 44 | 48 | 53 | 56 | 62 | 66 |
This study has proposed a BISP security mechanism based on the instinctive characters of bees. The BISP has an influence on dealing with malicious nodes inside the network and secures the data packet before the transmission. Nevertheless, the utilization of instinctive characters of bee towards the detection of malicious nodes has confined improvement. The routing concept can be an ensemble with a trusted cryptographic algorithm to ensure the security of data getting transmitted to the destination. The proposed protocol performance has been evaluated using selected performance metrics in the network simulator. The simulation study shows that the proposed protocol has improvement in performance based on energy consumption and delay compare with WPIP and GRP protocols. The results of BISP advance WPIP and GRP in terms of enhanced throughput and packet delivery ratio, reduced delay, packet drop and energy consumption. Follow-up work will examine the malicious and intruding nodes by applying the machine learning algorithms with different parameter.