Sudhakara Adiga - Academia.edu (original) (raw)

Uploads

Papers by Sudhakara Adiga

Research paper thumbnail of Integrating Goals after Prioritization and Evaluation – A Goal-Oriented Requirements Engineering Method

International Journal of Software Engineering & Applications, Nov 30, 2014

Decision support system in Requirements engineering plays an important role in software developme... more Decision support system in Requirements engineering plays an important role in software development life cycle. The relationship between functional and non-functional requirements often plays a crucial role in resolving conflicts or arriving at decisions in requirements engineering phase. Goal-Oriented Requirements Engineering (GORE) methods make a good attempt of addressing these aspects which are helpful in decision support. We propose a GORE method-Integrating goals after prioritization and evaluation (IGAPE). The method is semi-formal in nature thereby ensuring active stakeholder participation. In this paper we elaborate the various steps of IGAPE method. The output of IGAPE is then given as input to a decision support system which makes use of Analytic Hierarchy Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). Integration of IGAPE with AHP and TOPSIS will clearly provide a rationale for various decisions which are arrived at during the requirements engineering phase. The method is illustrated for an e-commerce application and is validated by expert analysis approach.

Research paper thumbnail of Graphs With Metric Dimension Two-A Characterization

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex... more In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .

Research paper thumbnail of Integrating Goals after Prioritization and Evaluation – A Goal-Oriented Requirements Engineering Method

International Journal of Software Engineering & Applications, 2014

Decision support system in Requirements engineering plays an important role in software developme... more Decision support system in Requirements engineering plays an important role in software development life cycle. The relationship between functional and non-functional requirements often plays a crucial role in resolving conflicts or arriving at decisions in requirements engineering phase. Goal-Oriented Requirements Engineering (GORE) methods make a good attempt of addressing these aspects which are helpful in decision support. We propose a GORE method-Integrating goals after prioritization and evaluation (IGAPE). The method is semi-formal in nature thereby ensuring active stakeholder participation. In this paper we elaborate the various steps of IGAPE method. The output of IGAPE is then given as input to a decision support system which makes use of Analytic Hierarchy Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). Integration of IGAPE with AHP and TOPSIS will clearly provide a rationale for various decisions which are arrived at during the requirements engineering phase. The method is illustrated for an e-commerce application and is validated by expert analysis approach.

Research paper thumbnail of Data Communication in Mobile Wireless Sensor Networks

International Journal of Computer Applications, 2012

A Mobile Wireless Sensor Network (M-WSN) derives its name by considering either mobile sink or mo... more A Mobile Wireless Sensor Network (M-WSN) derives its name by considering either mobile sink or mobile sensor nodes within the Wireless Sensor Network (WSN). As the sensor nodes are energy constrained, energy efficiency is the main aspect to be considered in any applications. By considering mobile sensor nodes in WSN, we can have better energy efficiency, improved coverage, and enhanced target tracking in Wireless Sensor Network. Due to mobility of nodes, a mobile WSN has dynamic topology. For all data gathering applications, the topology of mobile WSN depends on either the path of mobile sink or position of mobile nodes. Hence whole WSN topology keeps on changing as either sink is mobile or sensor nodes are mobile. That is, we have dynamic topology. Depending on application scenario, we may use a mobile sink to collect information from a static WSN or a dynamic WSN. In general static WSN uses multihops for data communication from sensor node to sink. Hence sensor node closer to sink is always in use and its energy gets exhausted quickly, thereby it dies down first, breaking link to sink and whole network collapses. This is one of the serious problems to be considered. Mobile WSN is one of approach that can increase life time of network because nodes close sink keeps on changing so that no particular node will be always close to sink. It is also possible by controlled mobility of nodes, all nodes in turn can take role of being close to sink and provide necessary services. Also by providing mobility to nodes in controlled manner it also possible to reduce number of hops to sink from a node, there by errors in communication gets reduced. In this article we consider two general application areas, studying the conditions of disastrous area where in static sensor nodes are deployed in disastrous area and a mobile sink agent which is outside the boundary moves around predefined path to gather information's of disastrous area, a battle field where in two way data communication between captain and soldiers is required where both captain and soldiers may have low mobility. The networking required in both cases is mobile WSN. We propose proper architecture and data communication in these contexts.

Research paper thumbnail of Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GP k )

Special Matrices, 2018

In this paper, we introduce the notion of perfect matching property for a k-partition of vertex s... more In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GP k , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GP k ) is realizable as a graph if and only if P satis_es perfect matching property. For A(G)A(GP k ) = A(Γ) for some graph Γ, we obtain graph parameters such as chromatic number, domination number etc., for those graphs and characterization of P is given for which GP k and Γ are isomorphic. Given a 1-factor graph G with 2n vertices, we propose a partition P for which GP k is a graph of rank r and A(G)A(GP k ) is graphical, where n ≤ r ≤ 2n. Motivated by the result of characterizing decomposable Kn,n into commuting perfect matchings [2], we characterize complete k-partite graph Kn1,n2,...,nk which has a commuting decomposition into a perfect matching and its k-complement.

Research paper thumbnail of Matrix Product of Graphs

Combinatorial Matrix Theory and Generalized Inverses of Matrices, 2013

ABSTRACT In this paper, we characterize the graphs G and H for which the product of the adjacency... more ABSTRACT In this paper, we characterize the graphs G and H for which the product of the adjacency matrices A(G)A(H) is graphical. We continue to define matrix product of two graphs and study a few properties of the same product. Further, we consider the case of regular graphs to study the graphical property of the product of adjacency matrices.

Research paper thumbnail of Performance evaluation of random linear network coding using a Vandermonde matrix

Physical Communication, 2014

ABSTRACT This paper discusses random linear network coding with and without the use of a Vandermo... more ABSTRACT This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparison of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using Vandermonde matrix can improve the network utilization factor by reducing the overhead compared to random linear coding that does not use Vandermonde matrix. Our numerical results show that random linear network coding with Vandermonde matrix provides considerable improvement in throughput and delay when compared to a network employing traditional store and forward strategy. An inherent feature of random linear network coding which makes it possible to employ simple encryption techniques is as well discussed.

Research paper thumbnail of Integrating Goals after Prioritization and Evaluation – A Goal-Oriented Requirements Engineering Method

International Journal of Software Engineering & Applications, Nov 30, 2014

Decision support system in Requirements engineering plays an important role in software developme... more Decision support system in Requirements engineering plays an important role in software development life cycle. The relationship between functional and non-functional requirements often plays a crucial role in resolving conflicts or arriving at decisions in requirements engineering phase. Goal-Oriented Requirements Engineering (GORE) methods make a good attempt of addressing these aspects which are helpful in decision support. We propose a GORE method-Integrating goals after prioritization and evaluation (IGAPE). The method is semi-formal in nature thereby ensuring active stakeholder participation. In this paper we elaborate the various steps of IGAPE method. The output of IGAPE is then given as input to a decision support system which makes use of Analytic Hierarchy Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). Integration of IGAPE with AHP and TOPSIS will clearly provide a rationale for various decisions which are arrived at during the requirements engineering phase. The method is illustrated for an e-commerce application and is validated by expert analysis approach.

Research paper thumbnail of Graphs With Metric Dimension Two-A Characterization

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex... more In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .

Research paper thumbnail of Integrating Goals after Prioritization and Evaluation – A Goal-Oriented Requirements Engineering Method

International Journal of Software Engineering & Applications, 2014

Decision support system in Requirements engineering plays an important role in software developme... more Decision support system in Requirements engineering plays an important role in software development life cycle. The relationship between functional and non-functional requirements often plays a crucial role in resolving conflicts or arriving at decisions in requirements engineering phase. Goal-Oriented Requirements Engineering (GORE) methods make a good attempt of addressing these aspects which are helpful in decision support. We propose a GORE method-Integrating goals after prioritization and evaluation (IGAPE). The method is semi-formal in nature thereby ensuring active stakeholder participation. In this paper we elaborate the various steps of IGAPE method. The output of IGAPE is then given as input to a decision support system which makes use of Analytic Hierarchy Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). Integration of IGAPE with AHP and TOPSIS will clearly provide a rationale for various decisions which are arrived at during the requirements engineering phase. The method is illustrated for an e-commerce application and is validated by expert analysis approach.

Research paper thumbnail of Data Communication in Mobile Wireless Sensor Networks

International Journal of Computer Applications, 2012

A Mobile Wireless Sensor Network (M-WSN) derives its name by considering either mobile sink or mo... more A Mobile Wireless Sensor Network (M-WSN) derives its name by considering either mobile sink or mobile sensor nodes within the Wireless Sensor Network (WSN). As the sensor nodes are energy constrained, energy efficiency is the main aspect to be considered in any applications. By considering mobile sensor nodes in WSN, we can have better energy efficiency, improved coverage, and enhanced target tracking in Wireless Sensor Network. Due to mobility of nodes, a mobile WSN has dynamic topology. For all data gathering applications, the topology of mobile WSN depends on either the path of mobile sink or position of mobile nodes. Hence whole WSN topology keeps on changing as either sink is mobile or sensor nodes are mobile. That is, we have dynamic topology. Depending on application scenario, we may use a mobile sink to collect information from a static WSN or a dynamic WSN. In general static WSN uses multihops for data communication from sensor node to sink. Hence sensor node closer to sink is always in use and its energy gets exhausted quickly, thereby it dies down first, breaking link to sink and whole network collapses. This is one of the serious problems to be considered. Mobile WSN is one of approach that can increase life time of network because nodes close sink keeps on changing so that no particular node will be always close to sink. It is also possible by controlled mobility of nodes, all nodes in turn can take role of being close to sink and provide necessary services. Also by providing mobility to nodes in controlled manner it also possible to reduce number of hops to sink from a node, there by errors in communication gets reduced. In this article we consider two general application areas, studying the conditions of disastrous area where in static sensor nodes are deployed in disastrous area and a mobile sink agent which is outside the boundary moves around predefined path to gather information's of disastrous area, a battle field where in two way data communication between captain and soldiers is required where both captain and soldiers may have low mobility. The networking required in both cases is mobile WSN. We propose proper architecture and data communication in these contexts.

Research paper thumbnail of Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GP k )

Special Matrices, 2018

In this paper, we introduce the notion of perfect matching property for a k-partition of vertex s... more In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GP k , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GP k ) is realizable as a graph if and only if P satis_es perfect matching property. For A(G)A(GP k ) = A(Γ) for some graph Γ, we obtain graph parameters such as chromatic number, domination number etc., for those graphs and characterization of P is given for which GP k and Γ are isomorphic. Given a 1-factor graph G with 2n vertices, we propose a partition P for which GP k is a graph of rank r and A(G)A(GP k ) is graphical, where n ≤ r ≤ 2n. Motivated by the result of characterizing decomposable Kn,n into commuting perfect matchings [2], we characterize complete k-partite graph Kn1,n2,...,nk which has a commuting decomposition into a perfect matching and its k-complement.

Research paper thumbnail of Matrix Product of Graphs

Combinatorial Matrix Theory and Generalized Inverses of Matrices, 2013

ABSTRACT In this paper, we characterize the graphs G and H for which the product of the adjacency... more ABSTRACT In this paper, we characterize the graphs G and H for which the product of the adjacency matrices A(G)A(H) is graphical. We continue to define matrix product of two graphs and study a few properties of the same product. Further, we consider the case of regular graphs to study the graphical property of the product of adjacency matrices.

Research paper thumbnail of Performance evaluation of random linear network coding using a Vandermonde matrix

Physical Communication, 2014

ABSTRACT This paper discusses random linear network coding with and without the use of a Vandermo... more ABSTRACT This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparison of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using Vandermonde matrix can improve the network utilization factor by reducing the overhead compared to random linear coding that does not use Vandermonde matrix. Our numerical results show that random linear network coding with Vandermonde matrix provides considerable improvement in throughput and delay when compared to a network employing traditional store and forward strategy. An inherent feature of random linear network coding which makes it possible to employ simple encryption techniques is as well discussed.