Krishna Moorthy Sivalingam

Krishna Moorthy Sivalingam

Auto-generated profile, based on publicly available information

Krishna Moorthy Sivalingam

Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 November 2002 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SLS. Lindsey
S. Lindsey
CRC. Raghavendra
C. Raghavendra
KSK.M. Sivalingam
K.M. Sivalingam
Gathering sensed information in an energy efficient manner is critical to operating the sensor network for a long period of time. The LEACH protocol presented by Heinzelman et al. (2000) is an elegant solution where clusters are formed to fuse data before transmitting to the base station. In this paper, we present an improved scheme, called PEGASIS (power-efficient gathering in sensor information systems), which is a near-optimal chain-based protocol that minimizes energy. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH. For many applications, in addition to minimizing energy, it is also important to consider the delay incurred in gathering sensed data. We capture this with the energy /spl times/ delay metric and present schemes that attempt to balance the energy and delay cost for data gathering from sensor networks. We present two new schemes to minimize energy /spl times/ delay using CDMA and non-CDMA sensor nodes. We compared the performance of direct, LEACH, and our schemes with respect to energy /spl times/ delay using extensive simulations for different network sizes. Results show that our schemes perform 80 or more times better than the direct scheme and also outperform the LEACH protocol.

1 July 2001 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
CJChristine E. Jones
Christine E. Jones
KSKrishna M. Sivalingam
Krishna M. Sivalingam
PAPrathima Agrawal
Prathima Agrawal
JCJyh Cheng Chen
Jyh Cheng Chen

29 August 2005
Verified
Conference Paper
Closed access
SLS. Lindsey
S. Lindsey
CRC. Raghavendra
C. Raghavendra
KSK. Sivalingam
K. Sivalingam

1 November 2008
Verified
Conference Paper
Closed access
YKYogesh R. Kondareddy
Yogesh R. Kondareddy
PAPrathima Agrawal
Prathima Agrawal
KSKrishna Sivalingam
Krishna Sivalingam
The concept of cognitive radio networks has introduced a new way of sharing the open spectrum flexibly and efficiently. However, there are several issues that hinder the deployment of such dynamic networks. The common control channel problem is one of such issue. Cognitive radio networks are designed by assuming the availability of a dedicated control channel. In this paper, we identify and discuss the network setup problem as a part of the common control channel problem. Probabilistic and deterministic ways to start the initial communication and setup a cognitive radio network without the need of having a common control channel in both centralized and multi-hop scenarios are suggested. Extensive MATLAB simulations validate the effectiveness of the algorithms.

12 September 2005 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
BWBo Wen
Bo Wen
RSR. Shenai
R. Shenai
KSK. Sivalingam
K. Sivalingam
This paper studies the connection-assignment problem for a time-division-multiplexed (TDM) wavelength-routed (WR) optical wavelength-division-multiplexing (WDM) network. In a conventional WR network, an entire wavelength is assigned to a given connection (or session). This can lead to lower channel utilization when individual sessions do not need the entire channel bandwidth. This paper considers a TDM-based approach to reduce this inefficiency, where multiple connections are multiplexed onto each wavelength channel. The resultant network is a TDM-based WR network (TWRN), where the wavelength bandwidth is partitioned into fixed-length time slots organized as a fixed-length frame. Provisioning a connection in such a network involves determining a time-slot assignment, in addition to the route and wavelength. This problem is defined as the routing, wavelength, and time-slot-assignment (RWTA) problem. In this paper, we present a family of RWTA algorithms and study the resulting blocking performance. For routing, we use the existing shortest path routing algorithm with a new link cost function called least resistance weight (LRW) function, which incorporates wavelength-utilization information. For wavelength assignment, we employ the existing least loaded (LL) wavelength selection; and for time-slot allocation, we present the LL time-slot (LLT) algorithm with different variations. Simulation-based analyses are used to compare the proposed TDM architecture to traditional WR networks, both with and without wavelength conversion. The objective is to compare the benefits of TDM and wavelength conversion, relative to WR networks, towards improving performance. The results show that the use of TDM provides substantial gains, especially for multifiber networks.

1 June 1999 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JCJyh-Cheng Chen
Jyh-Cheng Chen
KSK.M. Sivalingam
K.M. Sivalingam
PAP. Agrawal
P. Agrawal
RAR. Acharya
R. Acharya
[[abstract]]©1999 IEEE-This paper describes the design and analysis of the scheduling algorithm for energy conserving medium access control (EC-MAC), which is a low-power medium access control (MAC) protocol for wireless and mobile ATM networks. We evaluate the scheduling algorithms that have been proposed for traditional ATM networks. Based on the structure of EC-MAC and the characteristics of wireless channel, we propose a new algorithm that can deal with the burst errors and the location-dependent errors. Most scheduling algorithms proposed for either wired or wireless networks were analyzed with homogeneous traffic or multimedia services with simplified traffic models. We analyze our scheduling algorithm with more realistic multimedia traffic models based on H.263 video traces and self-similar data traffic. One of the key goals of the scheduling algorithms is simplicity and fast implementation. Unlike the time-stamped based algorithms, our algorithm does not need to sort the virtual time, and thus, the complexity of the algorithm is reduced significantly[[department]]資訊工程學