University of Calcutta (informally known as Calcutta University or CU) is a collegiate public state university located in Kolkata, West Bengal, India.&nbsp;Within India it is recognized as a &quot;Five-Star University&quot; and accredited &quot;A&quot; Grade by National Assessment and Accreditation Council.

&nbsp;

The University of Calcutta has secured the Fifth position among the Universities of India in the prestigious &quot;Indian University Ranking 2019&quot; list, released by the NIRF of the Ministry of Human Resource Development, Government of India.

&nbsp;

It was established on 24 January 1857, and was one of the first institutions in Asia to be established as a multidisciplinary and Western-style university. Its alumni and faculty include several heads of state, heads of government, social reformers, prominent artists, only academy award winner and Dirac medal winner in India, many Fellows of the Royal Society and five Nobel laureates as of 2019 which is highest in South Asia.

University Of Calcutta

World University root node

GENERAL

Int. J. Cryptogr. Inf. Secur

A secure encryption logic for communication in wireless sensor networks

Procedia Technology

New database architecture for smart query handler of spatial database

International Journal of Advanced Smart Sensor Network Systems (IJASSN)

Energy efficient multievent routing in wsn

Wireless sensor network comprises of numerous tiny sensor nodes to form an ad hoc distributed sensing and data propagation network to collect the context information on the physical environment. Wireless sensor networks are used for remotely monitoring tasks and effective for data gathering in a variety of environments. Minimizing energy dissipation and maximizing network lifetime are one of the central concerns to design applications and protocols for wireless sensor networks. Cluster based architectures are one of the most practical solutions in order to cope with the requirements of large scale of sensor networks. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. In this paper, we have presented a brief review of the state of the art scenario of various routing protocols and propose a weighted energy efficient cluster based routing for wireless sensor networks. Conducted simulation experiments on different scenarios shown its ability to obtain effective &amp; efficient communications among different clusters and achieves scalability in large scale of wireless sensor networks. © 2012 IFIP International Federation for Information Processing.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Weighted energy efficient cluster based routing for wireless sensor networks

Sharing of secret values in MANET is inconsistent and computationally insecure due to its dynamic nature. Over the years, key generation, encryption and decryption have evolved as important techniques for providing secure routing in MANETs. Many researchers are involved in solving the secret sharing problem. Shamir's proposal is one of the eminent secret sharing schemes. However, this scheme does not include secure key generation. This paper proposes the use of the mathematical theory of Chinese remainder theorem coupled with the commonly used RSA for generating keys. Computational complexity of CRT is less than RSA modular exponentiation scheme. This helps to reduce the computational overhead. Once a secure key has been generated, it has been used for finding a secure route between source and destination. The final route is selected based on the highest weighted trust value of the routes. The three phased approach is aimed to increase the overall performance. © 2012 IEEE.

Proceeding of the 15th International Conference on Computer and Information Technology, ICCIT 2012

A secure routing scheme in MANET with CRT based secret sharing

International Journal of Computer Applications

A CRT based encryption methodology for secure communication in MANET

arXiv preprint arXiv:1211.

Application of data mining in protein sequence classification

A Mobile Ad Hoc Network (MANET) is a network built on ad hoc demand by some mobile wireless nodes geographically distributed over an area. There is no fixed infrastructure and also no centralized administration. The traditional security measures fail to provide the required security level in MANETs. Specialised detection schemes are to be employed for detecting the intruder attack in MANET. The intrusion detection systems based on mobile agents uses a set of mobile agents moving from one node to another node within a network. The distributed ID consists of multiple mobile agents which cooperate over a large network and communicate with each other. This as a whole reduces network bandwidth usage by moving data analysis computation to the location of the intrusion data & support heterogeneous platforms. In this paper, a mobile agent based IDS have been proposed to detect the black hole attack in MANET, with the aim of reducing computational complexity. © 2011 Springer-Verlag.

Communications in Computer and Information Science

MABHIDS: A new Mobile Agent Based Black Hole Intrusion Detection System

Mobile ad hoc networks consist of wireless hosts that communicate with each other without the support of fixed infrastructure. In case of large network, a flat structure may not be the most efficient organization for routing. For this purpose many clustering schemes have been proposed that organize the MANET into a hierarchy, with a view to improve the efficiency of routing. In this paper, we have presented a brief review of the state of the art scenario of routing topologies for mobile ad hoc networks and try to present a scheme that leads to cluster formation which efficiently uses the resources of the MANET. The proposed Cluster Based Mobility Considered Routing Protocol obtains efficient communications among MANET and achieves scalability in large networks by using the clustering technique. The new algorithm takes into consideration the mobility factor during routing and as well as computational overhead is also diminished. © Springer-Verlag Berlin Heidelberg 2011.

Cluster based mobility considered routing protocol for mobile ad hoc network

A distributed and adaptive clustering algorithm is proposed in this paper. A distributed algorithm is based on dominating set. Dominating set is used for selection of cluster head and gateway nodes. The quality of cluster head is calculated based on connectivity, stability and residual battery power. Clustering is a method to build and maintain hierarchical addresses in mobile adhoc networks. Here, several clustering algorithms are surveyed concentrating on those that are based on graph domination. Long term service as cluster head depletes their energy, causing them to drop out of the network. Stable, secure cluster head selection increases lifespan and security of the network. This technique maintains cluster structure as stable as possible. © 2011 Springer-Verlag.

SRCHS - A stable reliable cluster head selection protocol

arXiv preprint arXiv:1111.

Lightweight hierarchical model for HWSNET

Mobile Adhoc Network (MANET) is highly vulnerable to malicious attacks due to infrastructure less network environment, be deficient in centralized authorization. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibit is selfishness. Routing protocol plays a crucial role for effective communication between mobile nodes and operates on the basic assumption that nodes are fully cooperative. Because of open structure and limited battery-based energy some nodes (i.e. selfish or malicious) may not cooperate correctly. There can be two types of selfish attacks -selfish node attack (saving own resources) and sleep deprivation (exhaust others' resources. In this paper, we propose a new Mobile Agent Based Intrusion Detection System (IDS). The approach uses a set of Mobile Agent (MA) that can move from one node to another node within a network. This as a whole reduces network bandwidth consumption by moving the computation for data analysis to the location of the intrusion. Besides, it has been established that the proposed method also decreases the computation overhead in each node in the network. © 2011 Springer-Verlag.

Detection of denial of service attack due to selfish node in MANET by mobile agent

Security of Wireless sensor network (WSN) becomes a very important issue with the rapid development of WSN that is vulnerable to a wide range of attacks due to deployment in the hostile environment and having limited resources.Intrusion detection system is one of the major and efficient defensive methods against attacks in WSN. A particularly devastating attack is the sleep deprivation attack, where a malicious node forces legitimate nodes to waste their energy by resisting the sensor nodes from going into low power sleep mode. The goal of this attack is to maximize the power consumption of the target node, thereby decreasing its battery life. Existing works on sleep deprivation attack have mainly focused on mitigation using MAC based protocols, such as S-MAC, T-MAC, B-MAC, etc. In this article, a brief review of some of the recent intrusion detection systems in wireless sensor network environment is presented. Finally, we propose a framework of cluster based layered countermeasure that can efficiently mitigate sleep deprivation attack in WSN. Simulation results on MATLAB exhibit the effectiveness of the proposed model in detecting sleep-deprivation attacks. © 2011 Springer-Verlag.

A survey of recent intrusion detection systems for wireless sensor network

Vehicular communication involves many decision making situations. The existing models for packet routing in VANET fails in cases needing fast decision making. Ambient Intelligence (AmI) system is a relatively new technique which aim at augmenting real environments where users are provided with pervasive virtual services. The ability to learn very quickly from the ambience of an object, and transforming that information into specific response involves a heterogeneous network comprising of vehicles, humans, and road side units. This paper proposes a modular architecture for information sensing, communicating, updation of knowledge-bas, etc, aimed at generating alarms in emergency situations. The emergency situation might involve abnormal physical behaviour, road blockage due to accidents or diversions, etc. © 2011 Springer-Verlag.

VAMI - A novel architecture for vehicular ambient intelligent system

Network mobility support is a matter of great concern in mobile IPv6. The authors have proposed an innovative scheme for handling the delay due to handover. The proposed scheme aims to free Mobility Anchor Point (MAP) from overload, while guaranteeing low latency due to handoff. © 2011 IEEE.

2011 30th URSI General Assembly and Scientific Symposium, URSIGASS 2011

An improved scheme towards fast handover in a hierarchical mobile network

The problem of routing is a complex one in case of mobile ad hoc networks due to the dynamic topology. Clusterization is an efficient means of increasing the efficiency of a MANET. A study of several clustering algorithms has lead to the observation that stable, secure cluster head selection increases lifespan and security of the network. The current state of art also relies heavily on ant colony optimization technique for finding the optimum shortest route in case of MANET. This paper proposes an agent based routing protocol for routing packets in a cluster based MANET. The algorithm is proposed to work in a distributed manner, using the concept of dominating set of mobile nodes. The selection of cluster head is determined on the basis of parameters such as connectivity, stability and residual battery power. © 2011 Springer-Verlag.

A novel distributed clustered approach towards building an agent based routing topology for MANET

In case of wireless networks with infrastructure there is a base station which is reachable through all mobile nodes. Ad-hoc network defers in this point where destination nodes might be unreachable from source nodes. The Mobile Ad-Hoc Network are prone to packet loss and route congestion due to their dynamic nature. The lack of centralized infrastructure adds up to these problems. In this respect cluster based routing mechanism is necessary for dealing with such problems. This paper emphasizes the shortest path finding between the source and destination in cluster based adhoc network for reducing packet delay and energy consumption. The paper also includes a performance comparison of this logic with existing SDSSR algorithm. © 2011 IEEE.

Proceedings of the 2011 International Conference on Communication and Industrial Application, ICCIA 2011

Improved cluster based route discovery algorithm for ad-hoc networks

Vehicular Ad hoc network is a special case of Mobile Ad hoc networks, with high nodes mobility specification and a large energy resource which could extend coverage and system lifetime. Providing reliable and efficient routing in presence of relative movement motivates the introduction of movement awareness to improve performance of existing position-based routing schemes in Vehicular Ad hoc networks. Dramatic increase in the number of vehicles equipped with computing technologies and wireless communication devices has created new application scenarios. In order to meet performance goals in VANET, several routing protocols have been formulated. Each of the existing routing protocols comes with their pros and cons. In our work we propose a new routing protocol, A Speedy Routing Protocol for Vehicular Ad hoc Network. In this routing protocol we try to reduce overhead of maintaining routing data and traverse preferred distance through shortest path. © 2011 Springer-Verlag Berlin Heidelberg.

SRPV: A speedy routing protocol for VANET

International Journal of Wireless \& Mobile Networks (IJWMN) Vol

MADSN: mobile agent based detection of selfish node in MANET

Cloud Computing is a newly developed technology for complex system with large scale resource, information, software sharing with the help of agents. The persisting problem is in the assignment of data locks to the users in case of conflicts. This paper deals with a technique of handling data locks by providing a novel architecture lest a conflict occurs between the users. The architecture uses multiple agents including mobile agents and fixed agent. The proposed scheme enhances the speed of write lock assignment in the SaaAS (Software as an Agent Service) Environment quite efficiently with the help of passing few messages. It also takes a glance into the portability and interoperability of agents in a Cloud computing environment. © 2011 Springer-Verlag.