Informatics Publishing Limited

I. Vijaya ¹, Amiya Kumar Rath ², Bhagabat Puthal ³

Affiliations
1 Department of Computer Science and Engineering, Siksha ‘O’ Anusandhan University, Near PNB Bank, Jagmohan Nagar, Khandagiri, Bhubaneswar - 751030, Odisha, IN
2 Department of Computer Science and Engineering and IT, V.S.S.U.T, Sambalpur, Burla – 768018, Odisha, IN
3 Department of Computer Science and Engineering, IGIT Sarang, National Highway 200,Dhenkanal Khalapal – 759146 Odisha, IN

Abstract

Objective: To maintain a stable structure and augment life of mobile nodes. We tried to formulate an Algorithm to make the network structure more stable and accessible. Methods/Analysis: We presented a method to achieve stability in the network, by keeping the communication between nodes as minimal as possible and upkeep the number of clusters formed. This was simulated by selection of cluster head based on probability weighted node calculation looking for the internal table of a node and records its neighbors. We also tried to reduce the overhead of route maintenance and cluster re-election by keeping a threshold value to determine the failure of the cluster head and choose for re-election. In addition to this during re-election, the battery power was also considered. Findings: We used the routing table information, to design our algorithm to detect groups that are stable over time. The algorithm presented for the selection of head node; we selected parameters such as-degree and relative speed of a node with respect to its neighborhood. To evaluate that the cluster formed is a stable structure, we varied the transmission range, speed of nodes and number of nodes moving towards another node. In an ideal scenario, the traffic flow decreases when there is a communication between the head nodes of the Clusters. With the help of Clustering, the chances of interference is reduced which adversely increases the efficiency and network throughput. Applications/Improvements: The work can be extended to enhance the cluster shaping and enhance the adaptability of the protocol.

Keywords

Clustering, Cluster Head, Cluster Setup, Cluster Structure, Maintenance, MANET, Stability.

Full Text

   

I Vijaya ¹, Amiya Kumar Rath ², Bhagabat Puthal ³, Debahuti Mishra ¹, S. Satapathy ¹

Affiliations
1 Department of Computer Science and Engineering, Siksha ‘O’ Anusandhan University, Bhubaneswar - 751030, Odisha, IN
2 Department of Computer Science and Engineering and IT, V.S.S.U.T, Burla - 768018, Odisha, IN
3 Department of Computer Science and Engineering Retired Professor, IGIT, Sarang - 759146, Odisha, IN

Abstract

Objectives: A network is group of devices that are connected to each other called as nodes. The nodes can be mobile or static. The performance of mobile Adhoc wireless networks (MANETs) helps to identify the type of applications that are supported by the network. Our objective is Performance analysis of QoS parameters of MANETs on Mobility & Energy based Model with Routing Protocols. Method/Analysis: The various network scenarios of MANETS are simulated using NS2.35. Protocols used to analyze performance are AODV, DSDV and DSR. Network layer parameters (throughput, packet delivery ratio, normalized routing overhead and average end-to-end delay) are evaluated. Network scenarios are generated through variation in pause time and number of nodes. Area of simulation is formed in 600*600 m*m area. Findings/ Results: The mobiles devices in the network get connected only when there is a demand for it. The reactive gateway discovery algorithm is used in AODV and DSR. With the random movement of nodes in the simulated area (direction) and variation in mobility, the delay and packet drop increases but PDR and throughput decreases. There is a significant differential observed while measuring the performance. Our observation with respect to DSR was it reacted well for two parameters delivery ratio and routing overhead. Average delay was less in AODV and DSDV performed well providing loop free path. Conclusion: After the simulation study and all experimental evaluations we can conclude that the DSR protocol dominates all other protocols like AODV and DSDV. The Dynamic Source Routing protocol in mobility and energy based model for throughput, packet delivery ratio performs well than AODV and DSDV. The adverse result is with the increase of node speed, routing overhead increased for DSR. Positive aspect of DSR was that average energy consumption was quite low in contrast to AODV and DSDV.

Keywords

Average Energy Consumption, Average End-To-End Delay, MANET, Normalized Routing Overhead, Packet Delivery Ratio, Throughput.

Full Text

   

I. Vijaya ¹, Amiya Kumar Rath ², Bhagabat Puthal ³

Affiliations
1 Department of Computer Science and Engineering, Siksha ‘O’ Anusandhan University, Bhubaneswar - 751030, Odisha, IN
2 Department of Computer Science and Engineering and IT, V. S. S. U. T, Burla - 768018, Odisha, IN
3 Department of Computer Science and Engineering IGIT Sarang, Dhenkanal - 759146, Odisha, IN

Abstract

Objective: Mobile Adhoc Networks (MANETs) due to its principle characteristics of network infrastructure, limited resources and transmission range are more vulnerable to multitude of attacks. The objective is to classify the attacks and its counter measures to detect and eliminate malicious nodes. Methods/Analysis: Each attack has been analyzed briefly based on its own characteristics and behavior. Also, the defeating methodologies against network attacks have been described and evaluated as a part of the measurements. We have also proposed an Algorithm to study and analyze networks on affected conditions. We presented analytics and classification of the attacks on the different layers of the network. Findings: On attacked situation in network there will be no data available as the characteristics of the network are unknown. We need to simulate such types of conditions in the network. The performance of the network gets degraded at the time of attack. It was observed that the impact of attack depends on the proximity of the attacker to the source node, it is severe when close and least when far from the source. Each malicious node uses network feature (Distributed Network, Non-centralized, Hop-by-Hop communications, Open network boundary or Wireless media) to break the security. The goal is to violate security service (Availability, Data Confidentiality and Integrity). In our algorithm, we showcased the normalization of the data set such that we get the maximum and minimum values for the classification of the network. The primary groups of data types for classification are: Delay, bandwidth utilization, and drop rate and packet type). There are some secondary classification like conjunction, status of process, running services and utilization of processor. The condition of system was presented as a vector by storing the normalized values in an array. We arrived at simulating a network in attacked situations. Applications/Improvements: The work can be extended to find ways to calculate the threshold effectively. Group attacks can be studied and derive the relationship between the average detection delay and the mobility of the nodes.

Keywords

Attack, Affected Condition, Detect and Eliminate Malicious Nodes, MANET, Security Parameter, Threat.

Full Text