Papers by Pallapa Venkataram
The convergence of wireless communications and multimedia services throws open interesting resear... more The convergence of wireless communications and multimedia services throws open interesting research topics to address. The variety of media-specific QoS requirements and the maintainence of synchronization among different streams to be presented at the receiver in multimedia applications demand additional functionalities at the data link layer. In this paper, we present an approach for efficient link control and management of multimedia applications in next generation wireless networks. We advocate the use of multiple connections, one for each traffic component of the application, as an effective solution for transport of multimedia applications over wireless. The effectiveness of this scheme is guaranteed by providing a new link control technique that works on top of a PRMA-type access protocol and jointly manages different streams of a multimedia application. We show that the proposed scheme performs well, especially during periods in which the system traffic load is high, and rea...
The task of fault diagnosis in computer networks is becoming extremely demanding as networks are ... more The task of fault diagnosis in computer networks is becoming extremely demanding as networks are spreading geographically, and the number of devices and services supported by them are increasing exponentially. In this paper, we present a Network Fault Diagnostic System(NFDS) to diagnose hardware fgaults like link and device failures. The proposed NFDS uses a model-based three-level reasoning approach to network fault diagnosis.
Third International Conference on Advances in Computing, Communication and Information Technology- CCIT 2015
In the area of testing communication systems, the interfaces between systems to be tested and the... more In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature for testing distributed systems based on the Open Distributing Processing (ODP) Basic Reference Model (BRM), which is a generalized version of ISO distributed test architecture. We study in this paper the issue of test selection with respect to such an test architecture. In particular, we consider communication systems that can be modeled by finite state machines with several distributed interfaces, called ports. A test generation method is developed for generating test sequences for such finite state machines, which is based on the idea of synchronizable test sequences. Starting from the initi...
2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)
Informatica
Several best effort schemes (next-hop routing) are used to transport the data in the Internet. So... more Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the network dynamics. With the recent trends in programmable networks, mobile agent technology seems to support more flexible, adaptable and distributed mechanism for routing. In this paper, we propose a Mobile Agent based Routing (MAR) scheme with the objectives similar to Routing Information Protocol (RIP). A comparative study of both the schemes (MAR and RIP) in terms of communication overheads, convergence time, network bandwidth utilization and average session delays is presented. The results demonstrate that the MAR scheme performs better than RIP. MAR has comparatively less communication overheads and convergence time and also offers more flexibility and adaptability as compared to RIP. In addition, this paper also presents a MAR based network load balancing.
International Journal of Wireless Information Networks
The openness of a Mobile Adhoc network (MANET) makes it vulnerable to various attacks that can br... more The openness of a Mobile Adhoc network (MANET) makes it vulnerable to various attacks that can breach privacy, and this demands a privacy protection system. In this paper, we propose a privacy protection system with flexible and adaptable policies to protect privacy during data transfer based on application and context attributes. We also provide the performance analysis model to test the suitability of policies for maintaining privacy, which is essential for the real-time implementation of this system in a resource-limited MANET. Finally, the proposed privacy protection system is compared with previous works using simulations, and the results obtained show the effectiveness of the proposed privacy protection system.
Journal of Traffic and Transportation Engineering (English Edition)
Abstract In recent years, modern metropolitan areas are the main indicators of economic growth of... more Abstract In recent years, modern metropolitan areas are the main indicators of economic growth of nation. In metropolitan areas, number and frequency of vehicles have increased tremendously, and they create issues, like traffic congestion, accidents, environmental pollution, economical losses and unnecessary waste of fuel. In this paper, we propose traffic management system based on the prediction information to reduce the above mentioned issues in a metropolitan area. The proposed traffic management system makes use of static and mobile agents, where the static agent available at region creates and dispatches mobile agents to zones in a metropolitan area. The migrated mobile agents use emergent intelligence technique to collect and share traffic flow parameters (speed and density), historical data, resource information, spatio-temporal data and so on, and are analyzes the static agent. The emergent intelligence technique at static agent uses analyzed, historical and spatio-temporal data for monitoring and predicting the expected patterns of traffic density (commuters and vehicles) and travel times in each zone and region. The static agent optimizes predicted and analyzed data for choosing optimal routes to divert the traffic, in order to ensure smooth traffic flow and reduce frequency of occurrence of traffic congestion, reduce traffic density and travel time. The performance analysis is performed in realistic scenario by integrating NS2, SUMO, OpenStreatMap (OSM) and MOVE tool. The effectiveness of the proposed approach has been compared with the existing approach.
International Journal of Social Computing and Cyber-Physical Systems
Social networks have been very successful for information sharing due to the rapid development of... more Social networks have been very successful for information sharing due to the rapid development of communication and networking. As the technology modernised and many unprotected types of equipment are used in sharing information like events, knowledge, activities, etc., there is a need for a high protection of social networking sites by providing dynamic authentication for social networks users. It is no longer a question of determining whether a user is who or what he/she is declared to be, but it is essential to design a convenient and credible authentication based on activity, relation, etc., of users. Managing and handling such authentication of users is complex and hard for which broad range of technologies need to be called. In this paper, we review some of the existing authentication schemes for social network users. Mainly, we highlight advantages of the existing schemes along with some of the improvements that can be incorporated. We also highlight some of the attacks and their prevention in social networks.
Wireless Personal Communications
Mobile adhoc networks consists of large number of mobile nodes, and is usually deployed to transf... more Mobile adhoc networks consists of large number of mobile nodes, and is usually deployed to transfer data from a sender to a receiver using multi-hop routing. The data being transmitted may contain sensitive information, and undesired disclosure of information can lead to launching of various attacks, thus breaching the data privacy. Earlier works achieve data privacy by using approaches such as data transformation and data perturbation. However, these approaches introduce higher overheads and delays. We propose a computational intelligence based data privacy preserving scheme, where rough set theory is used to anonymize the data during data transfer. Data packets are enclosed within capsules that can be opened only by the designated node, thus preventing the undesired leakage of the data. Also, route between a sender and a receiver is changed dynamically by selecting more than one trusted 1-hop neighbor nodes in each routing step. The proposed data privacy preserving scheme is tested by considering different case studies in a MANET deployed for stock market. Theoretical analysis for data privacy is presented in terms of Information Gain by an attacker and Attacker Overhead, and the performance of proposed scheme against some of the attacks is also discussed. The simulation results show the effectiveness of proposed scheme.
International Journal of Knowledge-based and Intelligent Engineering Systems
ABSTRACT
Proceedings of the 15th International Conference on Computer Communication, Aug 12, 2002
We propose a distributed asynchronous routing algorithm that guarantees that the routing tables a... more We propose a distributed asynchronous routing algorithm that guarantees that the routing tables are free of loops at any point of time. It is a distance vector algorithm, basically derived from the traditional distributed bellman ford algorithm, which it supplements to avoid routing loops. When a node sees the possibility of a loop, it initiates a computation (which spreads to other nodes), and waits to detect the termination of this computation. The properties of loop freedom and convergence of the algorithm to the correct solution are proved, and the complexity of the algorithm analyzed. Further, the algorithm is tested by running it over a test topology. The Distributed Bellman Ford algorithm (DBF) and the Ideal Link State protocol (ILS) are also simulated over the same topology, and their performance is compared. The proposed algorithm is seen to outperform both DBF and ILS.
Journal of the Indian Institute of Science, Feb 8, 2013
Abductive reasoning is identified as a suitable candidate for solving network fault and performan... more Abductive reasoning is identified as a suitable candidate for solving network fault and performance management problems. A method to solve the network fault diagnosis problem using realistic abductive reasoning model is proposed. The realistic abductive inference mechanism is based on the parsimonious covering theory with some new features added to the abductive reasoning model. The network diagnostic knowledge is assumed to be represented in the most general form of causal chaining, namely, hyper- bipartite network. As many explanations may still be generated by the realistic abductive reasoning model, we propose a probabilistic method to order them so as to try out the diagnostic explanation in the decreasing order of plausibility until the hard failure-like faulty device is isolated and replaced/cop-ected. In contrast, performance degradation in communication networks can be viewed to be caused by a set of faults, called soft failures. owing to whkh the network resources like bandwidth cannot be utilized to the expected level. An automated solution to the perfonnance management problem involves identifying these soft failures and use/suggest suitable remedies to tune the network for better performance. Abductive reas.oning model is used again to identify the network soft failures and suggest remedies. Common channel signalling network fault management and Ethernet performance management are taken up as case studies. The results obtained by the proposed approach are encouraging.
Computer Communications, Dec 1, 1997
A method of capturing the complete knowledge of a process plant, for making system is proposed. P... more A method of capturing the complete knowledge of a process plant, for making system is proposed. Provisions have been made to acquire the knowledge of the plant in a hybrid way, which describes the domain-specific, heuristic and the control knowledge. The domain knowledge includes structural and behavioral information about a plant. The heuristic knowledge includes hypotheses regarding fault-location and fault-cause about its structure, behaviour and function. The control knowledge not only contains the procedures for diagnosis, but also comprises of the information regarding the control mechanism about now to access different parts of the Knowledge Base (KB). In the proposed method, the KB for the entire plant is partitioned into a set of Functional Blocks (FBs) which reduces the problem of locating any malfunction to a manageable propotion. The method of knowledge representation is structured and hybrid. The structured organization of KB makes a diagnostic procedure easy, while the hybrid representation makes the KB general and flexible.
Threats to the network resources increase exponentially with the growth of the network /users and... more Threats to the network resources increase exponentially with the growth of the network /users and the technological developments. In this paper, we describe a security management framework for access control to the network resources. We deal this in three steps. In the first part, user access control to a given network is discussed. In the second part, access control to the network resources, both by self usage and delegation, revocation of delegation is presented. The third part explains the access control to the resources belonging to the other networks. A neural network based model is developed for intrusion detection that overcomes most of the limitations of the existing systems.
2015 World Congress on Internet Security (WorldCIS), 2015
The absence of centralized network management in MANET places the responsibility of route establi... more The absence of centralized network management in MANET places the responsibility of route establishment and route maintenance on the nodes in the network. This is the basis of designing widely used routing protocols (example AODV). However, a node with malicious intentions can launch an attack on the network and disrupt its operations. Hence there is an utmost necessity of a mechanism to identify the attack and protect the system from the attackers. In this paper we present a method on providing security in MANET during route maintenance phase using Attacker Detection System (ADS) with the help of Honeypot (HP) and Attack History Database (AHD). The HP interacts with the attackers in order to know their motives and respond accordingly. The use of AHD helps HP in quick attack/attacker identification and crafting replies to attacker. We have simulated MANET with ADS and implemented it in sizes varying from 20 to 200 nodes in NS2. The results presented in paper conform to our claim on the efficiency of ADS in protecting MANET. Also the edge achieved in handling the attacker with the use of HoneyPots and Attack History Database is seen in results.
Uploads
Papers by Pallapa Venkataram