Subhankar Dhar
San Jose State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Subhankar Dhar.
Communications of The ACM | 2011
Subhankar Dhar; Upkar Varshney
Mobile advertising will become more pervasive and profitable, but not before addressing key technical and business challenges.
Journal of Global Information Management | 2006
Subhankar Dhar; Bindu Balakrishnan
In the last few years, Web-based surveys have received increased attention given their potential to cut the costs and time associated with paper-based surveys. In this exploratory study, we consider the feasibility of using the Web as a data collection medium in China, which has a current Internet population of 103 million. Following a review of the literature regarding the design, implementation, and application of Web surveys, and the current state of data collection in developing countries in general and China in particular, we describe how we developed a Web-based survey instrument focusing on the ethical values of IT professionals. We e-mailed 5,000 IT professionals in China, inviting them to participate in the survey. Thirty-seven percent of those contacted visited the Web site and 5.8% submitted the survey. The survey data, both qualitative and quantitative, is analysed and discussed with a view to drawing up instructive guidance for researchers interested to use the Web as a data collection tool in China, as well as developing countries more generally. The Web-based survey has great potential in these contexts, if sensitively designed and implemented. We consider the implications of this research and identify areas where future research is necessary.
Management Research Review | 2012
Subhankar Dhar
Many organizations are outsourcing their IT related services to a third party vendor for quite some time. However, the IT services industry including outsourcing is going through rapid changes with the increasing adoption of Cloud computing. This paper compares global IT outsourcing with Cloud computing along with the evolution of traditional IT services.
ieee international conference on high performance computing, data, and analytics | 2003
Subhankar Dhar; Michael Q. Rieck; Sukesh Pai
In this paper, we propose two new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and d-hop dominating and have a desirable ‘shortest path property’. These algorithms produce sets that are considerably smaller than those produced by an algorithm previously introduced by the authors. One of these two new algorithms has constant-time complexity.
international technology management conference | 2011
Subhankar Dhar
Many organizations are outsourcing their IT related services to a third party vendor for quite some time. However, the IT services industry including outsourcing is going through rapid changes with the increasing adoption of Cloud computing. This paper compares global IT outsourcing with Cloud computing along with the evolution of traditional IT services.
International Journal of Business Data Communications and Networking | 2005
Subhankar Dhar
This paper presents the current state of the art of mobile ad hoc network and some important problems and challenges related to routing, power management, location management as well as multimedia over ad hoc networks. A mobile ad hoc network (MANET) is a temporary self-organizing network of wireless mobile nodes without the support of any existing infrastructure that may be readily available on the conventional networks. Since there is no fixed infrastructure available for MANET with nodes being mobile, routing becomes a very important issue. In addition, we also explain the various emerging applications and future trends of MANET.
Lecture Notes in Computer Science | 2003
Subhankar Dhar; Michael Q. Rieck; Sukesh Pai; Eun Jik Kim
In this paper, we describe and compare several distributed greedy algorithms that produce sets of nodes that can be used to form a virtual backbone for an ad hoc wireless network. The backbone produced is always a d-hop dominating, d-hop connected set and has a desirable “shortest path property”. The perfomance of these algorithms for various parameters are compared.
ieee international technology management conference | 2014
Subhankar Dhar; Sourav Mazumdar
In this paper, we discuss the emerging use of Big Data technologies in Enterprise Data Warehouses and Business Intelligence for the purpose of fostering innovation and producing better business insights and decisions. We present best practices and techniques of Big Data implementation using a 3-legged Big Data environment strategy along with the challenges of enterprise adoption of Big Data technologies. Hence this paper is relevant from an academic as well as a practitioners perspective.
International Journal of Mobile Network Design and Innovation | 2007
Subhankar Dhar; Michael Q. Rieck
New energy-efficient routing algorithms are introduced, based on a generalisation of the k-SPR sets from earlier work by the authors. This generalisation provides a means for the automatic avoidance of certain nodes and links when messages are routed. Sensor networks are modelled as connected graphs with vertex costs and edge costs. In addition, a two-tiered routing system in introduced. The low level routing is used for local routing within k hops, and is essentially (local) link-state routing. The high level routing depends on the routers from a k-SPR set, to manage this global routing.
Lecture Notes in Computer Science | 2005
Michael Q. Rieck; Subhankar Dhar
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the k-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead.