Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
7 results
Search Results
Item A holistic approach to influence maximization(Springer International Publishing, 2017) Sumith, N.; Annappa, B.; Bhattacharya, S.A social network is an Internet-based collaboration platform that plays a vital role in information spread, opinion-forming, trend-setting, and keeps everyone connected. Moreover, the popularity of web and social networks has interesting applications including viral marketing, recommendation systems, poll analysis, etc. In these applications, user influence plays an important role. This chapter discusses how effectively social networks can be used for information propagation in the context of viral marketing. Picking the right group of users, hoping they will cause a chain effect of marketing, is the core of viral marketing applications. The strategy used to select the correct group of users is the influence maximization problem. This chapter proposes one of the viable solutions to influence maximization. The focus is to find those users in the social networks who would adopt and propagate information, thus resulting in an effective marketing strategy. The three main components that would help in the effective spread of information in the social networks are: the network structure, the user's influence on others, and the seeding algorithm. Amalgamation of these three aspects provides a holistic solution to influence maximization. © Springer International Publishing AG 2017. All rights reserved.Item Pedestrian tracking algorithm in NLOS environments(2012) Gupta, C.; Biswas, D.This paper presents a cellular network based positioning algorithm in an urban environment characterized by multipath and severe non line of sight (NLOS) errors. The proposed algorithm mitigates localization error up to 75% as shown by the simulation results. The algorithm involves an initial averaging step followed by a prediction step for optimization, confining the estimated location close to the actual location. The proposed algorithm doesn't require additional hardware like sensors, accelerometers, gyroscopes etc. for localization as used in traditional cellular network based positioning methods. This approach can also be utilized in indoor positioning system (IPS) and global positioning systems (GPS) when at most three satellites are available. Low computational complexity of the algorithm is an added advantage. Utilization of orthogonal sources of information for improving accuracy is also explored. © 2012 IEEE.Item Range assignment with k-power levels in a Wireless Sensor Network(Institute of Electrical and Electronics Engineers Inc., 2018) Lakshmi, M.P.; Shetty D, S.D.Energy minimization in Wireless Sensor Network (WSN) has gained the attention of several researchers because of its diverse applications in the real world. Optimization in power assignment increases the lifetime of a network. Available sensor nodes operate with a set of discrete power levels in which each sensor node can be assigned with one of the power levels from the given set. Dual power assignment problem was studied by researchers in which only two power levels are available for assignment in a WSN. As the Dual power assignment problem is proved to be NP-hard, several approximation algorithms were proposed. We consider k-power level assignment problem for a given set of sensor nodes with the objective of minimizing the total power assigned to the network provided each sensor node is assigned a power level only from the given set. We propose two heuristic algorithms; one is based on Euclidean Minimum Spanning Tree (MST) and the other is an Incremental Heuristic which runs in polynomial time. We present the simulation results to compare and analyze the proposed algorithms. We also conduct the experiments for various number of nodes by varying the number of power levels. © 2018 IEEE.Item Improved Algorithm for Minimum Power 2-Connected Subgraph Problem in Wireless Sensor Networks(Institute of Electrical and Electronics Engineers Inc., 2018) Lakshmi, M.; Shetty D, D.A Wireless Sensor Network (WSN) consists of small sensor nodes which communicate with each other using wireless radio channel and are used to monitor certain environmental parameters. Since the nodes are powered by a small battery of limited capacity, it is important to minimize the energy consumption in a WSN. By using an appropriate topology the energy utilization of the network can be minimized which results in an increased lifetime of a WSN. In practice, the transmission power of a sensor node can be tuned to obtain a required topology that satisfies certain connectivity constraints and this problem is known as Range Assignment Problem. For a given network, a reduced topology is constructed satisfying some connectivity constraints like k-connectivity, bounded diameter etc. Fault tolerance addresses the issue of node or link failure which aims at k-connectivity so that, the network has at least k vertex disjoint paths between any two nodes of the network. With the motivation of achieving fault tolerant network with minimum transmission energy, we consider Minimum power 2-connected subgraph (MP2CS) problem which is proved to be NP-hard. A polynomial time heuristic is proposed in this paper for the MP2CS problem and simulation is performed to compare with the existing algorithm. © 2018 IEEE.Item Optimal algorithm for minimizing interference with two power levels in wireless sensor networks(Engineering and Technology Publishing, 2019) Lakshmi, M.P.; Shetty D, D.Interference is a major hindrance to the communication in wireless sensor networks which needs to be optimized in order to minimize the total power consumption of the network. A sensor node in a WSN is assigned certain transmission range for sensing and transmission of data. If the transmission between any two nodes is affected by a third node, then it leads to interference. Sender interference of a node in WSN is the number of nodes that lie within the transmission range of that vertex. The receiver interference of a node x is the number of other nodes which include x in their transmission range. In recent days WSNs are operated by a discrete set of power levels in which a limited number of power levels are available which can be assigned to a node. The problem of minimizing the maximum sender interference of a WSN using only two power levels is studied in this paper. An optimal algorithm is presented in this paper which assigns transmission power to the sensor nodes of a given network such that the maximum sender interference is minimized and it results in a connected topology. An algorithm for receiver interference is also proposed using a similar concept, and an extensive simulation is performed to compare the maximum sender and receiver interference for the same instances. © 2019 Journal of Communications.Item Unified ball convergence of third and fourth convergence order algorithms under ??continuity conditions(University of Guilan, 2021) Argyros, G.; Argyros, M.; Argyros, I.K.; George, S.There is a plethora of third and fourth convergence order algorithms for solving Banach space valued equations. These orders are shown under conditions on higher than one derivatives not appearing on these algorithms. Moreover, error estimations on the distances involved or uniqueness of the solution results if given at all are also based on the existence of high order derivatives. But these problems limit the applicability of the algorithms. That is why we address all these problems under conditions only on the first derivative that appear in these algorithms. Our analysis includes computable error estimations as well as uniqueness results based on ?? continuity conditions on the Fréchet derivative of the operator involved. © 2021 University of Guilan.Item Kantorovich-type results for generalized equations with applications(Springer Science and Business Media B.V., 2022) Regmi, S.; Argyros, I.K.; George, S.; Argyros, C.I.Kantorovich-type results for generalized equations are extended with no additional conditions using Newton procedures. Iterates are shown to belong in a smaller domain resulting to tighter Lipschitz constants and a finer convergence analysis than in earlier works. © 2022, The Author(s), under exclusive licence to The Forum D’Analystes.