Wireless and mobile networks seem to deliver tremendous uses. In its way, MANET leads to enormous real world applications. Routing allows us to implement many real world applications. Complete affinity in an infrequent network like ICMANET is highly impossible. Disconnected MANET is also known as ICMANET which is also a DTN (Delay Torrent Network) that supports for higher delays. It is laborious process to execute routing in a diffused network process to execute routing in a diffused network. To deliver the data packets towards the destined node to its best, a new strategy in routing called Ant routing protocol in concoction with storage strategy LoDis has been proposed. Despite of routing, security is still an unsolved problem. To evaluate this situation, this paper presents a methodology called agent technology which yields a secure routing. Hostile node in the network is spotted with the help of agent at each node. A cryptographic algorithm Advanced Encryption Standard (AES) is habituated to improve secure communication in wide range Mobility and total number of nodes in the network act as variables in examining the hostile nodes in the network to judge the standard of security. Improved performance along with the security is the point to be highlighted.
A group of independent mobile nodes connected via wireless medium is a MANET (Mobile Ad hoc Network). Here the nodes are arranged in a distributed manner. Message passing takes place with the help of the middle node between the source and the destination node. Wireless environment has a serious disadvantage in data transmission so we have opted for the middle node.
It is studious to route in a temporary network topology. In the past ten years, innumerable conventional rout- ing protocols namely distance vector, Link State Routing (LSR), Adhoc On demand Distance Vector (AODV), Distance Source Routing (DSR), Opportunistic Adaptive Routing, Open Shortest Path First (OSPF) routing have been propounded. Beneficial data communication has been promised in these routing protocols. Mobile connected via wireless medium is a MANET and a group of disconnected MANET is called as ICMANET.
Quintessential DTN (Delay Torrent Network) causes huge delays in ICMANET (Intermittently Connected Mobile Ad hoc Network). As confronted in infrequent communication or an interplanetary scale, ICMANET is sketched to execute beneficially over vast distances. High mobility of the nodes in the intermittent networks is a cause of infrequency within the wink of eye nodes getting agitated leads to coin of topology in a dynamic manner. Wild life tracking, habitat monitoring sensor network, military network, nomadic community network and vehicular network etc are some of the classic examples. Routing transforms to an arduous process because of classic contorted style of the network.
Since the past years number of routing protocols has been propounded for dissemation in ICMANET. Flooding, Epidemic, Direction Based Routing, Adaptive Routing, Utility Based Routing, Probabilistic Routing, Copy Case Routing, Spray and Wait Routing, LAROD etc. are some of the routing methodologies. These routing protocols follow a mode for data communication but security is still before question mark. Since MANET is idiosyncratic, the security issue in MANET is grounded to numerous technical disadvantages. Overhearing is due to an intermediate communication and also possesses more security in such case we go for IDS (Intrusion Detection System) by building a trust based environment. Intrusion Detection System has many diversity like behaviour based IDS, knowledge based IDS, Distributed IDS [
As a result of disconnected behavior of the network of ICMANET, it cannot adopt security protocols sketched for MANET. IDS is the trust based system, which is in need of central serve to certify authentication. Since ICMANET don’t have possibility to launch since these techniques are not suited. So a trending methodology for security should be sketched that is not in used for any central system.
In this paper, we recommend a new security protocol for ICMANET. Authentication terminology is passed to each agent at the nodes, the confronted node is promised to be the authenticated node. Before transmitting the data, it is encrypted. Advanced Encryption Standard (AES) is the algorithm used for ciphering and deciphering. This algorithm helps to ensure security without central server.
This paper is ordered as follows. Section II describes the related work for routing in ICMANET. The protocol terminologies are described in Section III. Section IV describes the procedure of secure routing. The execution examination is represented in Section V.
Routing data packets is an uninteresting process in trending ICMANET. Impossibility of routing issue is worked and manifested in many research works. Routing methodologies that are applicable in intermittent network is bestowed in this section. The conventional routing protocol differs to a considerable extreme from new routing methodology. Considering the transient connectivity of ICMN the routing protocols should have the behavior of tolerating higher delays. Following is the detailed description of few intermittent routing protocols.
Flooding based routing is the classic scheme which acts as a platform for the schemes. Here, packet is sent from one node to all other nodes. Every single node is a propagator which attempts to move every message to one of its adjacent node as well as a receiver [
The beaconless routing protocol [
Scalable geographical routing is bestowed as a combination of gossip and random node mobility known as Brownian gossip [
Direction based geographic routing [
To ensure static topology the network is divided into small parts and it upholds the detail regarding host mobility and connectivity changes for higher accuracy. This state’s it as semi probabilistic routing algorithm [
Combination of beaconless routing protocol and storage forward carry technique is the LAROD-LODiS [
Terminologies that were revamped to ensure security in ICMANET is being potrayed in this section which is of A-LODis, Agent working, infrastructure and its concepts and general description of AES algorithm.
Combination of optimization technique and gossiping technique is that an A-LOD is routing protocol. Formulation of ant working is been showcased here as a form of introduction. A well known problem solving technique is swarm intelligence [
Deets transformation varying environment and local deets assessment by adjacent bugs are the two idiosyncrasy application in stigmergy mode of communication. ACO contains maximum number of ants that are required to get a solution for optimization problem. Most popular theory among ants is stigmergic mode of communication used for deets transformation. Wander mode, search mode, return mode, attracted mode, trace mode and carry mode are some of the foraging modes adopted by ants. Optimal solution is attained by supporting a collective interaction through indirect communication which is made possible by parallel and independent execution of ants. Thy individually move in its own way where it accumulates pheromone. The optimal path has more pheromone while less optimal way got its pheromone evaporated. Attractiveness, evaporation and pheromone are the three components of ACO. Beneficial method of bio-inspired communication is show cased in ACO. Key features of ACO are as follows:
(i) Initialization
(ii) Traversing
(iii) Pheromone Deposition
(iv) Updating Pheromone
From
Agent is a set of rules which is capable to provide uninterrupted operation in a diligent environment. They are skilful to handle actions in flexible and highbrowed manners which are subject to changes in the environment. Agent is a piece of code in charge to perform the pre assigned chores. Agents’ decision depends on its spontaneous proficiency and prior experiences [
Security check is done with certain agent parameters by agents placed at each node [
(i) Node ticket―Unique ticket for each node in the network.
(ii) Counter sign―Open key for all nodes in the network.
(iii) Mobility Model―The mobility model of the network topology.
(iv) Origin of Placement―The initial placement of each node in the network.
(v) Lattice Card―An n × n matrix in which each lattice comprises a particular data in it. Each node contains a unique lattice.
(vi) Archetype Generation―The network is with some geometric figuration with which the node assimilates a solitary archetype.
These parameters accumulate on security issues linked in the ICMANET. Each node contains an agent comprises of these components namely:
(i) Data Aggregator
(ii) Node Scrutinizer
(iii) Information Telecaster
It has aggregate of detailed information about all nodes within the network. It contains agent parameters of every node.
It scrutinizes whether the node that receives information in a one among the topology. It chooses any one of agent parameter and checks with the accumulator for confirmation. If they don’t match then it telecasts the presence of foreign node.
It acts as a mediator that allows access for communication among the encountered node. Routing is permitted only if it is confirmed as authorized node by scrutinizer. Execution of agent set at each node is clearly in
Security, cost and compactness and design and implementation simplicity are the key characteristics of AES. As known block size of 128,192,256 is supported by AES and a key size is 128 bits which could be varied depending upon the application. Unlike other encryption technique AES does not use multiple keys which made it to be simplified algorithm. Firstly the input data is transformed to a state array of 4 × 4 matrixes as shown below
Here i0...i15 indicates input data.
Similarly key is also transformed to 4 × 4 matrixes. Number of rounds in AES depends on the input size. Each round other than final round undergoes four evolutions as follows.
(i) Substitute Bytes
(ii) Shift Rows
(iii) Mix Columns
(iv) Add Round Key
The internal functions in AES uphold its operation on a finite field, the polynomials modulo over f(x).
A process of non-linear substitution on each byte of the state array is the substitution bytes.
where A and b are constant 8 × 8 matrixes.
This is nothing but the transposition cipher operates on each row of a state array [
This function on each column where each byte of a column is matched into a value, which is a function of all other, our bytes of that column, which is done by multiplying the state matrix and constant matrix.
where S = 4 × 4 matrix before transmission of Equation (4)
C = Constant matrix
Single column transformation is shown below
A bitwise XOR operation takes place between elements of state array and round key. Except the final round all four transformation will happen in decryption too. Expanding the 128 bit key is a key expansion comprises of following steps:
(i) One-byte circular shift on a word.
(ii) A byte substitution on each byte of its input using S-box.
(iii) The results of previous steps are XOR ed with a round constant RC [j].
Secure communication in assistance with A-Lodis is explained in this section. When a node A tries to pass a message to node B it initially reaches the relay node if the sink node is not within its territory. Message is passed to relay node only after confirming it as an authorized node in the network. This checking process is done by agent technology. Each node comprise of an agent initiates to test R1. The scrutinizer of agent at node A selects any of the parameters and transfers it to R1. If it is a positive reply then it is an authorized node and permitted for deets transformation which is of ciphered form. Ciphering and deciphering is done by AES algorithm. We use Ant-routing scheme to select a relay node. Each node is considered to be an end e-ant. Initially they will be in sleep mode and the pheromone value (Ph) is zero. When data is generated at node A relay node is found in a random manner. Gossiping method is used to measure the productivity of relay node. In this way relay node could be chosen from Ph value and used for broadcasting. Lodis of A-Lodis indicates routing using gossiping technique where nodes can guess the adjacent node location which helps to reach the sink node. Thus secure communication is made possible. Delay in authentication is maintained at its normal level, since these methods use only few seconds to yield the required output. Algorithm for secured A-Lodis and Ant-routing for A-Lodis is shown in
Simulated results of A-Lodis with the set of agent with assured security at each node encounter are explained below. The goal is to achieve a secure communication without any loss in regular performance. We use a simulator [
Parameters compatible for one simulator are listed in
It uses the pheromone mobility model. The nodes move in an area of 2000 × 2000 m with a speed limit [
Assigning individual agent at each node should no way make any effect in performance of LAROD-LoDis.
Parameters | One Simulator |
---|---|
Area | 2000 × 2000 m |
Mobility Model | Pheromone |
Node Density | 200 nodes |
Node Speed | 1.5 m/s |
Radio Range | 250 m |
Packet Life Time | 600 s |
Time taken to route packet is directly proportional to the setting of agents which ensures top-level security in ICMANET. In this paper we come up with an apt yield by setting agent at each node. Transmission of data is preceded with ciphering and deciphering of data using AES algorithm. The execution of protocol is evaluated by node speed density, its variation of life time to which the overhead, number of transmissions, delivery ratio and delay are to be maintained favorably. Maximum security is bestowed with the help of agents.
To highlight the benefit of A-LA we analogize it with ER and SNW. Analogy is done with following metrics:
(i) Performance with respect to Delivery Ratio.
(ii) Performance with respect to Malicious Nodes.
To enlighten the secure routing it is estimated with number of node separated from network as well as number of packets routed through them. Regarding mobility and number o nodes in network these are examined.
In delivery ratio analysis, A-LA stands to be better than ER and SNW in delivering the message. Evaluation results by modifying the number of nodes and transmission range is shown in
spraying in ER and SNW respectively which brings variation in probability. A-LA uses the adjacent intermediate node that it encounters during node mobility which makes out to be best among three. Performance variation of their three methodologies is shown in the figure which describes that performance is in no way affected due to authentication.
We examine security in reference to isolated nodes and data packets routed through them. The influence of secure routing scheme is evaluated with separated in a network. Due to the usage of authentication, the feasibility of A-LA to detect node in the network is high which is darkened in
It is crystal clear that A-LA is efficient for secure routing in ICMN. The A-Lodis is capable of conquering attacks described below.
(i) Dropping Data Packets: this denial of service attack is detected as the malicious nodes do not answer the query posed by agent at each node.
(ii) Dropping Control Packets: this denial of service attack is detected as the malicious node does not route the data packet as it fails to answer the query generated by agent at each node.
(iii) Flooding: This fails since each node detects its adjacent node for data transmission.
(iv) Gray hole: as agent queries and information regarding the relay nodes are updated within regular intervals, this attack will be detected.
(v) Spoofing: As same answer can’t be generated twice during the answer verification scheme, spoofing is detected.
Secure data transmission is made possible in this paper. Agent technology ensures the authorization terms at each node. Agent parameters assist to detect the node and security is invoked with AES algorithm. Even after introducing these schemes, the ordinary performance of routing is not eradicated. Delivery rate, minimum delay and constant overhead are same in A-LA and LLR. A-LA is highlighted with scalable security. Presence of agent promises for secure data communication; whose presence is a key to detect the node. The basic properties of LLR protocol like fewer transmission, low contention, better delivery delay and high scalability are attained with generalized value. A comparative analysis and its corresponding results are enlightened in this paper. Without eradicating the performance, secure communication is made possible. This paper demonstrates secure routing with agent technology and cryptographic mechanisms and is tested with the malicious nodes.
S. Ramesh,R. Indira, (2016) Ant Routing Protocol with Location Services in Intermittently Connected MANETs. Circuits and Systems,07,1087-1097. doi: 10.4236/cs.2016.77092