Vol. 28, No. 16, (2019), pp. 627-634
A Reliable Data Sharing Protocol for Increasing Data Availability in MANET
V. Gokula Krishnan1*, Dr. N. Sankar Ram2 and V. Divya3
1Research Scholar, Faculty of Computer Science and Engineering, Sathyabama Institute of Science and Technology, Chennai, India
2Professor & Head, Department of Computer Science and Engineering, Rajalakshmi Engineering College, Thandalam, Chennai, India
3Research Scholar, Faculty of Electrical and Electronics Engineering, Sathyabama Institute of Science and Technology, Chennai, India
1[email protected], 2[email protected], 3[email protected]
Abstract — Mobile Ad hoc Network (MANET) is an indivisible part of wireless network where the nodes are placed randomly. Due to dynamic nature, data availability plays a major role which may degrade the network performance. Data availability defines number of replicated data to be shared between nodes to increase network efficiency. If network partition occurs, the data may not be accessed by the node which leads to network unavailability. In previous work, balancing of data availability and delay was focused. To overcome this issue, a Reliable Data Sharing Protocol (RDSP) is introduced to achieve high data availability and to balance energy efficiency. In first phase of the proposed protocol, neighbor routing is adopted to find reliable node. In second phase, data availability procedure is adopted in the network where the node consumes less energy to replicate the data. In third phase, Cluster is formed to improve data sharing between two nodes and energy model is adopted to improve lifetime of the network. Simulation results are performed on RDSP and existing protocols in terms of throughput, data sharing ratio, packet delivery ratio and computational overhead.
Keywords — MANET, Data sharing, Cluster, Reliable node, Scheduling, Packet delivery ration and overhead.
_______________________________________________________________________________
1. INTRODUCTION
Mobile Ad hoc Network is a network which consists of several mobile nodes which are randomly roaming inside or outside the network. Existing Wireless Local Area Network (WLAN) standards, such as IEEE 802.11, do not employ physical layer error correction, which makes them trivial targets for Denial-of-Service (DoS) attacks. For example, an attacker only needs to jam one bit to induce failure of the Cyclic Redundancy Check (CRC). Hence, the jammer needs to expend several orders of magnitude less energy than a legitimate sender. It is likely that a small number of coordinated jammers can launch very harmful attacks with only limited energy resources. For instance, this group of jammers may be able to prevent all network communications, partition the network, or force traffic to be routed over a particular network region, where an adversary has powerful equipment for encryption cracking or traffic analysis.
The use of multipath routing with data redundancy can statistically enhance data availability. If one or more paths are jammed, it may still be possible to reconstruct an end-to-end message from the information carried by the remaining paths. However, as mentioned previously, the physical proximity of the chosen paths must be taken into account such that multiple node-disjoint paths are spatially far apart; this can be accomplished by choosing paths with low correlation. All network traffic going through nodes within these regions was dropped. It was found that the use of less-correlated paths significantly increases the probability that at least one end-to-end route remains operational, especially as the radius R increases.
Vol. 28, No. 16, (2019), pp. 627-634
Data availability is a major issue in the ad hoc networks due to dynamic nature.
However many approaches were focused on the improvement of data availability while adopting dynamic links. In our proposed work, reliable data sharing protocol is adopted to increase the data availability by selecting reliable links and scheduling mechanism.
2. PREVIOUS WORK
In this work [1], authors introduced genetic search algorithm and cooperative cache algorithm to improve the quality of service. However, the reliable node selection is the major concern to provide QoS but it was not focused in this work. The data availability enhancement approach [2] was introduced to reduce data traffic by increasing data transmission. Here the temporary storage is maintained by each node during multi-hop routing. Each time the request matching will be performed based on neighbor hopping.
The overhead of server and server traffic is also maintained through multiple routes to enhance data sharing.
In [3], authors proposed the congestion adaptive and delay sensitive multirate routing protocol for MANET using cross layer approach. The cross layer approach is adopted between network layer, MAC layer and physical layer to improve network efficiency.
Sridhar et.al [4] proposed trusted and optimized routing based on bio-inspired meta heuristics technique. The behavior of ant was focused to provide solutions to complex combinatorial issues. It also includes the optimization method and learning stability. The efficient, trusted and optimized routes were found using this routing. It provides better performance compared to existing techniques. In this work [5], an optimized Energy efficient Route Selection algorithm was introduced to provide energy routing policy based on trust parameters and meta heuristic algorithm. The major issues like latency, congestion and packet loss were rectified here. In [6], a trust-based secure QoS routing scheme was introduced by combining social and QoS trust. It relies on mitigating which shows the packet forwarding misbehavior by discovering path through reliable communication. The best forwarding node was chosen based on The scheme would select the best forwarding node based on remaining energy, channel quality and link quality etc.
Kulathumani et.al [7] proposed a structure-free protocol to identify duplicate data replication in MANETs. Self repelling random walk procedure is adopted to aggregate the information. The overhead was reduced to improve data sharing.
In this work [8], Internet of Bikes-DTN routing protocol was introduced based on data aggregation using the Delay Tolerant Network (DTN) to provide efficient data collection.
The aggregation schemes like temporal, spatial and spatio-temporal aggregation.
In [9], data confidential and reliable bee clustering routing protocol is proposed in the clustered bee ad hoc networks to disseminate data to all the bees inside the region. If destination goes out of the region, it is difficult to find the node until it replies.
Salman et.al [10] proposed route decision mechanism to improve reliability of network.
Received signal strength was taken as the major indicator to improve network coverage. It includes mobility model, type of radio link and propagation scenario.
In this work [11], an overhead aware multipath routing protocol was proposed to increase the relay node selection. The routing for energy and overhead aware and computational trust were achieved in the multipath routing.
Walikar [12] introduced the concept of reliable and stable route construction method to observe the network context and routing decisions in selection of neighbor nodes and
Vol. 28, No. 16, (2019), pp. 627-634
route establishment process. The Q-Learning method was implemented based on reliable hop node with model based specifications based on energy level, node stability and signal strength.
In this work [13], energy efficient and reliable routing protocol was developed to provide less mobility and high reliability of network. The distance ratio was measured between source node and base station to communicate with cluster heads in order to increase the data replication rate.
3. PROPOSED PROTOCOL
In ad hoc networks, data distribution is generally influenced by data replication and route instability. Moreover the consumption of energy per node will also reduce the sharing of information between the nodes. In our proposed protocol, reliable nodes are chosen based on capacity, bit error rate of links and signal strength of network region.
The following assumptions are made before the discovery of routing and implementation of reliable node selection.
3.1. UPDATE OF NEIGHBOR NODE LOCATION
In such scenarios, source node or Cluster Head (CH) in network region may not able to find the neighbour node in their routing table due to high mobility. In this case, source node will check its routing table to determine the least hop neighbours. Once it is found, it will send the route request packets to join the route. If it is accepted, the update will be sent to Destination Node (DN). If DN goes out of the network coverage, the location alert packets will be immediately sent to source node. Inspite of dynamic scenarios, routes are changing due to frequent node mobility. The following procedure is adopted to identify location of DN based on reliability metric.
Step 1:
The reliability metric of each node is determined based on node stability and packet authentication. Node stability is defined as the quality of node which communicates the information and responds immediately at any time and any cost. Packet authentication is based on genuineness of packets which is produced by node. Based on these two metrics, Reliable node will be chosen.
Step 2:
Once all the nodes are checked and verified from reliability metric, these nodes will become Reliable nodes which can be selected in active route participation. All the updates are loaded in routing table of every node.
Step 3:
If any node tries to steal the information between data packets, it will be immediately isolated using trust model. The trust model focuses on the node behaviour. If any violation occurs, it will be suggested to source node or CH. Then it will be immediately isolated from reliable routing and data transformation.
Step 4:
The location information of Destination node and neighbour node will be updated to Source node for reliable data transformation using trilateration method.
3.2. CLUSTER MODEL
Cluster is formed based on group of mobile nodes and Region Cluster Head (RCH) will be selected and it supports Replica management [14]. Node requests huge of data or number of replicated data to improve data sharing. It will be reported to RCH. Currently RCH can check the item-id in Advanced reproduction Table (ART) to ascertain whether
Vol. 28, No. 16, (2019), pp. 627-634
or not the information item is accessible within the cluster. If any match entry is found, the request is redirected there to node relating that item-id. Otherwise RCH can request that knowledge item to different RCHs if knowledge is found then request forwarding is stopped and knowledge is came back to the requester.
Once a node receives a knowledge item then, it will build a reproduction of it for future use. And AN update message is send to its RCH. within the method of returning the info item to the requesting node, a node in underlying path, if it's a RCH, then it begin reproduction allocation method (RAP). In RAP, at first cluster head can get the scale of the info item, whose reproduction has to be created therein cluster. Currently cluster head can RCH check its ART, and check for a node with free area accessible larger than the scale of knowledge item dk. Currently if RCH gets a node with space-available larger than or equals to the scale knowledge item, then RCH replicate the info item thereon node.
Once replicating knowledge item thereon node, node can send a message to the RCH so RCH can update its entries associated with that node in ART. Currently if RCH fails to urge a node with space-available larger than or equals to the scale knowledge item, then RCH can opt for a node with most free area accessible.
Once choosing node send that node to decision a procedure (MCR (NK, S)) to form enough area to duplicate that knowledge item thereon node. Calls of removing the information things at a node are primarily based upon the Replacement Policy (RP) are defined. Once undefeated creation of free area at that node, RCH cans replicating that knowledge item thereon node, node can send a message to the chief. RCH can update its entries associated with that node in ART. Once change its ART, the RCH can send this update message to those RCHs can check their ART, if the entry of that item is found then this update is discard otherwise RCH can opt for a mobile node wherever the reproduction of that item will be created.
3.3. ENHANCING DATA SHARING THROUGH RELIABLE ROUTING In existing approaches, the data replication algorithms and protocols were introduced to improve data sharing. But the problem was that lagging of balancing energy and data sharing during information distribution. In this phase, once reliable routes are chosen, the Neighbor Reliable Node (NRN) will be identified. The NRN is found based on the following metrics.
i) Location (LoCk) ii) Distance (DRk)
iii) Placement of node towards source node (PLk)
These parameters ensure effective packet delivery by choosing reliable routes. It is determined as follows,
k k k
k aggregate LOC DR PL
NRN
The location parameter shows the position of node inside the region where the node becomes NRN. The distance determines the travelling of data packets through route distance. Likewise, the placement of node defines direction of node towards source node or CH. The following data sharing algorithm illustrates the improvement of data availability.
Procedure: NFN selection
Input: M // all nodes are located inside the network region Source Node (SN) // initiates data sharing process
Etx, Ety // Energy spent at transmitter side and receiver side
Output: Number of nodes to carry on data sharing process to increase data availability.
Vol. 28, No. 16, (2019), pp. 627-634
Step 1: Source node initiates the route discovery. If any node receives the packets, three metrics i.e. Location, Distance and node placement towards source node or CH will be calculated immediately to share the data.
Step 2: The delay of each node while information sharing is calculated as, )
/ (
02 .
0 DR toSN CoverageRadius Delay k
This delay is used to improve packet availability whenever the node requests.
Step 3: Packets are scheduled in the route by SN to reach destination node using data scheduling procedure.
Step 4: If distance and stability of transmitted packets are less compared to received packets, the message will be forwarded otherwise it will be discarded.
Step 5: Source node suggests all nodes to get replication of data if it is discarded or lost by neighbor nodes. Whenever node tries to replicate the data, the energy will be estimated to identify the energy lost.
Step 6: Estimate the number of packets to be shared by finding requirements of data for active nodes during data transformation.
4. SIMULATION RESULTS
The proposed Protocol is simulated and analyzed using Network Simulation (NS2.34) and it is depicted in GNU plot. In this simulation, 150 mobile nodes are moving randomly in 1200 x 1200 square meter region around 100 simulation time in ms. The transmission rate is constant bit rate. The simulation and setting parameters are illustrated in Table 1.
Table1. Simulation and Setting Parameters of RDST No. of Nodes 150
Area Size 1000 X 1000 sq.m
Mac 802.11
Radio Range 200m
Simulation Time 100 sec Traffic Source CBR Packet Size 80 bytes
Mobility Model Random Way Point
Antenna Omni Directional
Protocol AODV
4.1 QUALITY OF SERVICE METRICS
The performance metrics are defined and evaluated.
Computational Overhead: It defines the number of control packets sent by source node towards destination node.
Average end to end delay: The delay occurs from source to destination node during packet travelling.
Data Sharing Ratio: It defines the replication of data from node to node during each interval.
Packet delivery ratio: It defines the ratio of number of packets received to the number of packets sent.
The proposed protocol RDSP is compared with existing protocols and algorithms.
Vol. 28, No. 16, (2019), pp. 627-634
Figure 1 illustrates the performance analysis of End to end delay for Proposed Protocol (RDSP) and existing protocols. Compared to existing protocols, RDSP achieves less delay due to implementation of scheduling procedure.
Fig. 1 End to end Delay Vs Time
Figure 2 presents the comparison of protocols in terms of packet delivery ratio. From the results, RDSP achieves high packet delivery ratio than existing protocols due to cluster hierarchy.
Fig. 2 Throughput Vs Time
Figure 3 shows the performance of throughput metric for proposed protocols and existing protocols. It is clearly seen that RDSP shows high throughput due to reliable node selection.
Vol. 28, No. 16, (2019), pp. 627-634
Fig. 3 Packet Delivery Ratio Vs Speed
Figure 4 shows the results of Data sharing ratio of proposed protocol and existing protocols. Based on reliable node selection and data sharing algorithm, RDSP achieves high ratio than existing protocols.
Fig. 4 Data Availability Ratio Vs Time 5. CONCLUSION
In MANET, implementation of data availability becomes a major issue which leads to network unavailability. Data sharing protocol is adopted in the proposed work to deliver packets as well as to replicate packets whenever the node requests. Data availability is improved by adopting reliable cluster head in cluster routing to enhance replicate of data based on necessity. The computational overhead is comparatively reduced due to scheduling to avoid collisions. Throughput is improved in each interval while reducing packet loss. Both data sharing ratio and packet delivery ratio is improved by choosing the location, accuracy and direction of nodes in the network region. In future, it is planned to focus on fuzzy enhanced data sharing protocol to provide reliable and secure data replication in ad hoc networks.
Vol. 28, No. 16, (2019), pp. 627-634
6. REFERENCES
[1] Faragher, John Mack. "Bungalow and Ranch House: The Architectural Backwash of California". Western Historical Quarterly 32.2 (2001): 149-173.
[2] Vijay Vasanth and K. Venkatachalapathy, “QoS Improvement through Enhanced Reactive Routing Protocol in MANET”, International Journal of Recent Technology and Engineering (IJRTE), Vol.7, Issue 5, 2019, pp. 547-550.
[3] Sushma Sainwar and Prof. Vishal Shrivatava, “Approach for Enhancing Data Availability in MANET”, International Journal of Computer Trends and Technology (IJCTT), Vol. 49, No. 1, 2017, pp. 27-31.
[4] Mahadev A. Gawas, Lucy J. Gudino, and K. R Anupama, “Congestion-Adaptive and Delay-Sensitive Multirate Routing Protocol in MANETs: A Cross-Layer Approach”, Journal of Computer Networks and Communications, 2019, pp.1-14.
[5] S. Sridhar, V. Nagaraju, B. R. Tapas Bapu, R. Shankar and R. Anitha, “Trusted and Optimized Routing in Mobile Ad-Hoc Networks Emphasizing Quality of Service”, Applied Mathematics and Information Science, Vol. 12, No. 3, 2018, pp. 655-663.
[6] P. Ramesh and Dr. M. Devapriya, “An Optimized Energy Efficient Route Selection Algorithm for Mobile Ad hoc Networks based on LOA”, International Journal of Engineering and Advanced Technology, Vol. 8, No. 2, 2018, pp. 298-304.
[7] Muhammad Salman Pathan, Nafei Zhu, Jingsha He, Zulfiqar Ali Zardari, Muhammad Qasim Memon and Muhammad Iftikhar Hussain, “An Efficient Trust-Based Scheme for Secure and Quality of Service Routing in MANETs”, Future Internet, Vol. 10, No.
16, 2018, pp. 1-16.
[8] V. Kulathumani, M. Nakagawa and A. Arora, “EZ-AG: structure-free data aggregation in MANETs using push-assisted self-repelling random walks”, Journal of Internet Services and Applications, Vol. 9, No. 5, 2018, pp. 1-14.
[9] Yosra Zguira, Hervé Rivano and Aref Meddeb, “Internet of Bikes: A DTN Protocol with Data Aggregation for Urban Data Collection”, Sensors, Vol. 18, 2018, pp. 1-39.
[10] Sajyth RB and Sujatha. G, “Design of data confidential and reliable bee clustering routing protocol in MANET”, International Journal of Engineering & Technology , Vol. 7, No. 2,. 2018, pp. 661-666.
[11] Salman M. Al-Shehri and Pavel Loskot, “Enhancing Reliability of Tactical MANETs by Improving Routing Decisions”, Journal of Low Power Electronics and Applications, Vol. 8, No. 49, 2018, pp. 1-15.
[12] Uppalapati Srilakshmi and Bandla Srinivasrao, “An Overhead Aware Multipath Routing Protocol for Improving Relay Node Selection in MANET”, International Journal of Recent Technology and Engineering, Vol. 8, Issue 1, 2019, pp. 2890-2897.
[13] Gyanappa A. Walikar, “ Reliable and Stable Route Construction in Mobile Ad Hoc Networks Using R- Learning Techniques”, International Journal of Engineering Science Invention, Vol. 7, No. 2, 2018, pp. 58-63.
[14] Young-jun Oh and Kang-whan Lee, “Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks”, International Journal of Distributed Sensor Networks, Vol. 13, No. 1, 2017, pp. 1-16.
[15] Rajeev Kumar and Prashant Kumar, “Replica Allocation techniques based on Clusters for MANETs”, International Conference on Emerging Trends in Computer and Electronics Engineering (ICETCEE'2012) March 24-25, 2012, Dubai, pp. 56-59.
