Shirish Karande
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shirish Karande has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Hayder Radha
Michigan State University
10 shared publications - Kiran Misra
Michigan State University, East Lansing, MI, USA
5 shared publications - Muhammad Usman Ilyas
Department of Computer and Network Engineering, College of Computer Science and Engineering, University of Jeddah, Jeddah, Saudi Arabia
2 shared publications - Syed Ali Khayam
Department of Electrical & Computer Engineering, Michigan State University, East Lansing, MI 48824 USA
2 shared publications - Hayder Radha
Michigan State University
1 shared publication - Jae-Gon Kim
Electronics and Telecommunications Research Institute
1 shared publication
Latest Publications
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21555486,p. 324-333
INPoD: In-Network Processing over Sensor Networks based on Code Design
In this paper, we develop a joint network coding (NC)-channel coding error-resilient sensor-network approach that performs in-network processing based on channel code design (INPoD). INPoD represents a major development of an underlying framework for designing code-on-network-graph (CNG). CNG (and hence INPoD) maps variable nodes of low density parity check (LDPC) codes onto sensor nodes, and consequently translates check equations (used in linear algebraic LDPC codes) into in-network processing. INPoD/CNG codes not only improve capacity, but are also resilient to errors in noisy environments. In absence of INPoD, basic CNG employs standard LDPC codes while assuming the underlying sensor network is capable of supporting the degree distribution dictated by these codes. In practice, however, we usually have the network topology pre-determined by the placement of the sensors, and hence we are constrained to map a code onto a given topology. In this paper, we specifically address this problem, and propose the INPoD framework which enables the use of LDPC design tools in the design of CNG for a given sensor network topology. We formulate the design of CNG, as a convex optimization problem, which determines the best codes to be used, given the underlying network connectivity and channel conditions. Specifically, we use density evolution to design degree distributions which controls the performance of the joint NC-channel code CNG. We also give a code construction algorithm, which achieves a designed degree distribution. We show that well-designed INPoD provide gains of 1.5 to 2.5 dB, when compared with the best known erasure codes - LT codes.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21555486,p. 324-333
INPoD: In-Network Processing over Sensor Networks based on Code Design
In this paper, we develop a joint network coding (NC)-channel coding error-resilient sensor-network approach that performs in-network processing based on channel code design (INPoD). INPoD represents a major development of an underlying framework for designing code-on-network-graph (CNG). CNG (and hence INPoD) maps variable nodes of low density parity check (LDPC) codes onto sensor nodes, and consequently translates check equations (used in linear algebraic LDPC codes) into in-network processing. INPoD/CNG codes not only improve capacity, but are also resilient to errors in noisy environments. In absence of INPoD, basic CNG employs standard LDPC codes while assuming the underlying sensor network is capable of supporting the degree distribution dictated by these codes. In practice, however, we usually have the network topology pre-determined by the placement of the sensors, and hence we are constrained to map a code onto a given topology. In this paper, we specifically address this problem, and propose the INPoD framework which enables the use of LDPC design tools in the design of CNG for a given sensor network topology. We formulate the design of CNG, as a convex optimization problem, which determines the best codes to be used, given the underlying network connectivity and channel conditions. Specifically, we use density evolution to design degree distributions which controls the performance of the joint NC-channel code CNG. We also give a code construction algorithm, which achieves a designed degree distribution. We show that well-designed INPoD provide gains of 1.5 to 2.5 dB, when compared with the best known erasure codes - LT codes.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 450-455
A Multi-Tier Model for BER Prediction over Wireless Residual Channels
Bit-error rate (BER) modeling and prediction over residual wireless channels, which represent errors not corrected by the physical layer, has emerged as an active research area. Recently, it has been shown that signal to noise ratio (SNR) is a useful side-information that could be employed for BER prediction. In this paper, we propose a novel and accurate three-tier model that leverages a received packet's SNR and checksum side-information to predict BER in future packets over a wireless residual channel. We first observe that direct inference of BER from SNR results in optimistic estimates because of the relatively large amounts of error-free data (in comparison with corrupted data) received on viable wireless networks. Consequently, we propose a model that separates packet-and bit-error prediction. At the first tier, we employ a high-order packet-level Markov model which predicts whether or not a packet is in error. The second tier model is invoked only when a corrupted packet is predicted. The second tier consists of conditional probabilities that predict future SNR values based on the current packet's SNR. Once the SNR is predicted, a third-tier provides the BER estimate for that SNR using a binary-symmetric channel model. We use 802.11b traces collected over an operational 802.11b LAN to compare the performance of the proposed predictor with state-of-the-art predictors. We show that at all three 802.11b data rates (2, 5.5 and 11 Mbps) the proposed model has higher BER prediction accuracy than the optimum Yule-Walker and finite-state Markov chain predictors.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 450-455
A Multi-Tier Model for BER Prediction over Wireless Residual Channels
Bit-error rate (BER) modeling and prediction over residual wireless channels, which represent errors not corrected by the physical layer, has emerged as an active research area. Recently, it has been shown that signal to noise ratio (SNR) is a useful side-information that could be employed for BER prediction. In this paper, we propose a novel and accurate three-tier model that leverages a received packet's SNR and checksum side-information to predict BER in future packets over a wireless residual channel. We first observe that direct inference of BER from SNR results in optimistic estimates because of the relatively large amounts of error-free data (in comparison with corrupted data) received on viable wireless networks. Consequently, we propose a model that separates packet-and bit-error prediction. At the first tier, we employ a high-order packet-level Markov model which predicts whether or not a packet is in error. The second tier model is invoked only when a corrupted packet is predicted. The second tier consists of conditional probabilities that predict future SNR values based on the current packet's SNR. Once the SNR is predicted, a third-tier provides the BER estimate for that SNR using a binary-symmetric channel model. We use 802.11b traces collected over an operational 802.11b LAN to compare the performance of the proposed predictor with state-of-the-art predictors. We show that at all three 802.11b data rates (2, 5.5 and 11 Mbps) the proposed model has higher BER prediction accuracy than the optimum Yule-Walker and finite-state Markov chain predictors.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 259-264
Adaptive Network Coding With Noisy Packets
In this paper we study the problem of employing network coding in presence of bit corruptions in the packets. We consider a network model within which a minimal amount of processing is employed at intermediate nodes. Under such a paradigm the efficiency of a network coding function, is dependent on the bit-error rates (BER) observed in the packets. Hence under time-varying channel conditions the network coding functions need to adapt in accordance to the channel state associated with the packets. We propose a systematic optimization approach to design an adaptive network coding (ANC) scheme which facilitates efficient exchange of mutually independent information. Under the proposed scheme the intermediate nodes relay the packets with or without piggybacking, depending on the corruption in the received packets and in accordance to pre-designed exchange rules. We illustrate the performance benefits of the proposed optimizations on the basis of channel models derived from actual 802.11 b and 802.15.4 measurements.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 259-264
Adaptive Network Coding With Noisy Packets
In this paper we study the problem of employing network coding in presence of bit corruptions in the packets. We consider a network model within which a minimal amount of processing is employed at intermediate nodes. Under such a paradigm the efficiency of a network coding function, is dependent on the bit-error rates (BER) observed in the packets. Hence under time-varying channel conditions the network coding functions need to adapt in accordance to the channel state associated with the packets. We propose a systematic optimization approach to design an adaptive network coding (ANC) scheme which facilitates efficient exchange of mutually independent information. Under the proposed scheme the intermediate nodes relay the packets with or without piggybacking, depending on the corruption in the received packets and in accordance to pre-designed exchange rules. We illustrate the performance benefits of the proposed optimizations on the basis of channel models derived from actual 802.11 b and 802.15.4 measurements.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (15224880) , V - 65-65
Transmission-Distortion Tradeoffs in Network Channel Coding
Network channel coding (NCC) is a framework under which intermediate router/nodes employ encoding/decoding operations to facilitate an efficient multicast delivery of video. The network usage and video distortion is a function of the channel coding rates assigned to nodes in the network. In this paper, we investigate the tradeoff between the total bandwidth usage and a global distortion measure. We propose a dynamic programming based framework to identify the optimal transmission-distortion operating points. The proposed optimal allocation of coding rates is compared with an earlier version of NCC, network embedded FEC (NEF), which optimally places codecs of a fixed channel coding rate within the network. The proposed NCC scheme is shown to achieve significantly improved transmission distortion tradeoffs.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (15224880) , V - 65-65
Transmission-Distortion Tradeoffs in Network Channel Coding
Network channel coding (NCC) is a framework under which intermediate router/nodes employ encoding/decoding operations to facilitate an efficient multicast delivery of video. The network usage and video distortion is a function of the channel coding rates assigned to nodes in the network. In this paper, we investigate the tradeoff between the total bandwidth usage and a global distortion measure. We propose a dynamic programming based framework to identify the optimal transmission-distortion operating points. The proposed optimal allocation of coding rates is compared with an earlier version of NCC, network embedded FEC (NEF), which optimally places codecs of a fixed channel coding rate within the network. The proposed NCC scheme is shown to achieve significantly improved transmission distortion tradeoffs.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 737-740
CLIX: Network Coding and Cross Layer Information Exchange of Wireless Video
Network coding (NC) can be efficiently combined with the "physical layer broadcast" property of wireless mediums to facilitate mutual exchange of independent information. At the same time, experimental/theoretical analysis of wireless networks has shown the efficacy of cross-layer protocols that relay corrupted packets in bandwidth hungry video applications. The integration of NC-based information exchange and cross-layer (CL) protocols for wireless video is the primary theme of this work. A particular issue addressed in this paper is the impact of errors in a packet, on the performance of a network code. Thus, we identify the operating conditions under which NC, despite the presence of residue errors, is beneficial. Based on theoretical analysis and experiments using 802.11b wireless traces it is established that the combination of NC with relay of corrupted packets can perform better than (i) conventional schemes that drop all corrupted packets (ii) a scheme that deploys network coding only (iii) a scheme that only deploys a CL strategy that recovers information from corrupted packets. The proposed cross-layer exchange (CLIX) scheme significantly improves the performance of an H.264 based video codec for wireless networks.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 737-740
CLIX: Network Coding and Cross Layer Information Exchange of Wireless Video
Network coding (NC) can be efficiently combined with the "physical layer broadcast" property of wireless mediums to facilitate mutual exchange of independent information. At the same time, experimental/theoretical analysis of wireless networks has shown the efficacy of cross-layer protocols that relay corrupted packets in bandwidth hungry video applications. The integration of NC-based information exchange and cross-layer (CL) protocols for wireless video is the primary theme of this work. A particular issue addressed in this paper is the impact of errors in a packet, on the performance of a network code. Thus, we identify the operating conditions under which NC, despite the presence of residue errors, is beneficial. Based on theoretical analysis and experiments using 802.11b wireless traces it is established that the combination of NC with relay of corrupted packets can perform better than (i) conventional schemes that drop all corrupted packets (ii) a scheme that deploys network coding only (iii) a scheme that only deploys a CL strategy that recovers information from corrupted packets. The proposed cross-layer exchange (CLIX) scheme significantly improves the performance of an H.264 based video codec for wireless networks.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 825-828
Influence of Graph Properties of Peer-to-Peer Topologies on Video Streaming with Network Channel Coding
Network channel coding (NCC) distributes channel coding functions over network nodes participating in common or diverse communication sessions. A particular case of NCC is network embedded FEC (NEF), which has been shown to exhibit significant improvements in the performance of video streaming applications over multicast peer-to-peer (p2p) trees. The placement of NCC/NEF codecs and its utility in improving the throughput performance is in general a function of the underlying p2p graph topology. In this paper we consider two major forms of p2p topologies: (1) perfectly structured k-ary tree topologies that can be built from (virtually) ideal p2p graphs and (2) unstructured random tree topologies where new nodes randomly join as children to any of the existing peers. The two topologies represent an optimal low diameter structured p2p topology and a trivial randomly evolving sub-optimal topology, respectively. In this paper, we show the impact of key graph parameters, such as the maximum node-degree k and minimum tree-height D, on the performance of NCC in terms of NEF throughput as well as video quality for both structured and unstructured topologies. The utility of NCC/NEF for low-degree and/or less structured p2p topologies is especially highlighted by demonstrating that, embedding of additional codecs can render the performance of less structured topologies or higher diameter topologies to be almost as good as that of the very well structured low diameter topologies. We also investigate the impact of the graph properties on the placement of the NEF codecs
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 825-828
Influence of Graph Properties of Peer-to-Peer Topologies on Video Streaming with Network Channel Coding
Network channel coding (NCC) distributes channel coding functions over network nodes participating in common or diverse communication sessions. A particular case of NCC is network embedded FEC (NEF), which has been shown to exhibit significant improvements in the performance of video streaming applications over multicast peer-to-peer (p2p) trees. The placement of NCC/NEF codecs and its utility in improving the throughput performance is in general a function of the underlying p2p graph topology. In this paper we consider two major forms of p2p topologies: (1) perfectly structured k-ary tree topologies that can be built from (virtually) ideal p2p graphs and (2) unstructured random tree topologies where new nodes randomly join as children to any of the existing peers. The two topologies represent an optimal low diameter structured p2p topology and a trivial randomly evolving sub-optimal topology, respectively. In this paper, we show the impact of key graph parameters, such as the maximum node-degree k and minimum tree-height D, on the performance of NCC in terms of NEF throughput as well as video quality for both structured and unstructured topologies. The utility of NCC/NEF for low-degree and/or less structured p2p topologies is especially highlighted by demonstrating that, embedding of additional codecs can render the performance of less structured topologies or higher diameter topologies to be almost as good as that of the very well structured low diameter topologies. We also investigate the impact of the graph properties on the placement of the NEF codecs
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1973-1976
Utilizing SSR Indications for Improved Video Communication in Presence of 802.11B Residue Errors
Radio hardware used for the reception of 802.11b frames is capable of associating a signal to silence ratio (SSR) with each received frame. If a received frame is corrupted, then these SSR indications can be used to provide robust apriori estimate of the bit error rate in the packet. In many recently proposed cross-layer protocols, for transmission of video over wireless networks, recovery of information from partially corrupted packets has shown significant utility. In this paper, based on experiments with actual 802.11b error traces, we show that the channel state information (CSI) provided by the SSR indications can be used to improve the error recovery performance of an FEC scheme employed in conjunction with a cross-layer protocol. H.264 based simulation are used to establish the efficacy of the proposed work for video applications; specifically for video over 802.11b WLAN
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1973-1976
Utilizing SSR Indications for Improved Video Communication in Presence of 802.11B Residue Errors
Radio hardware used for the reception of 802.11b frames is capable of associating a signal to silence ratio (SSR) with each received frame. If a received frame is corrupted, then these SSR indications can be used to provide robust apriori estimate of the bit error rate in the packet. In many recently proposed cross-layer protocols, for transmission of video over wireless networks, recovery of information from partially corrupted packets has shown significant utility. In this paper, based on experiments with actual 802.11b error traces, we show that the channel state information (CSI) provided by the SSR indications can be used to improve the error recovery performance of an FEC scheme employed in conjunction with a cross-layer protocol. H.264 based simulation are used to establish the efficacy of the proposed work for video applications; specifically for video over 802.11b WLAN
- 1 March 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 283-288
On Modeling of 802.1lb Residue Errors
Errors that are observed at the MAC layer of a wireless protocol are known as residue errors due to the failure of the physical layer to correct them. In this paper, based on experimentation with actual 802.11b wireless LANs (WLANs), it is shown that the 802.11b residue error process is a highly non-stationary process; and hence error models derived on the basis of observations at one time/environment may not be applicable at/in another. Thus MAC-layer modeling/prediction techniques need to adapt on the basis of some channel state information (CSI). Consequently, in this work, we characterize the variation in the behavior of the residue error process in accordance to the radio-link signal to silence ratio (SSR) indications (SSRI). The residue error process is treated as a piecewise stationary process, where each piece corresponds to a PHY/MAC packet. In particular, we construct a unified Markov framework to obtain SSR aware Markov models for residue errors. Further, it is shown that the proposed SSR aware Markov framework provides significant performance benefits and can characterize the residue error traces even across varied WLAN setups. This leads to the design of non-homogenous Markov models that can vary the transition matrix on the basis of using SSR indication as side-information. We deploy such a non-homogenous Markov model and show that it can characterize the error process significantly better than Markov models that are derived by ignoring SSR values.
- 1 March 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 283-288
On Modeling of 802.1lb Residue Errors
Errors that are observed at the MAC layer of a wireless protocol are known as residue errors due to the failure of the physical layer to correct them. In this paper, based on experimentation with actual 802.11b wireless LANs (WLANs), it is shown that the 802.11b residue error process is a highly non-stationary process; and hence error models derived on the basis of observations at one time/environment may not be applicable at/in another. Thus MAC-layer modeling/prediction techniques need to adapt on the basis of some channel state information (CSI). Consequently, in this work, we characterize the variation in the behavior of the residue error process in accordance to the radio-link signal to silence ratio (SSR) indications (SSRI). The residue error process is treated as a piecewise stationary process, where each piece corresponds to a PHY/MAC packet. In particular, we construct a unified Markov framework to obtain SSR aware Markov models for residue errors. Further, it is shown that the proposed SSR aware Markov framework provides significant performance benefits and can characterize the residue error traces even across varied WLAN setups. This leads to the design of non-homogenous Markov models that can vary the transition matrix on the basis of using SSR indication as side-information. We deploy such a non-homogenous Markov model and show that it can characterize the error process significantly better than Markov models that are derived by ignoring SSR values.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12 (15503607) , 5457-5462
Improving Wireless Multimedia Quality using Header Detection with Priors
Recent wireless multimedia studies have revealed that forward error correction (FEC) on corrupted packets yields better bandwidth utilization and lesser delay than retransmissions. To facilitate FEC decoding at a wireless receiver, it is desirable to relay maximum number of (error-free and corrupted) packets to the receiver's application layer. To that end, most cross-layer multimedia schemes perform partial checksum only on packet headers. However, even with a partial checksum, bursty wireless errors introduce frequent header corruptions, thereby causing considerable packet drops. In this paper, we extend our work in [1], which proposed receiver-based schemes to correct a packet's critical (and corrupted) header fields. This paper: (a) poses header detection as the well-known decision theoretic problem of detecting known parameters in noise, (b) evaluates two detectors using bit-error traces collected over an 802.11b network, (c) provides throughput results for the detectors, and (d) uses video in conjunction with FEC as an example to highlight the efficacy of the proposed schemes. We show that header detection provides significant improvements in throughput and video quality over the conventional UDP/IP protocol stack.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12 (15503607) , 5457-5462
Improving Wireless Multimedia Quality using Header Detection with Priors
Recent wireless multimedia studies have revealed that forward error correction (FEC) on corrupted packets yields better bandwidth utilization and lesser delay than retransmissions. To facilitate FEC decoding at a wireless receiver, it is desirable to relay maximum number of (error-free and corrupted) packets to the receiver's application layer. To that end, most cross-layer multimedia schemes perform partial checksum only on packet headers. However, even with a partial checksum, bursty wireless errors introduce frequent header corruptions, thereby causing considerable packet drops. In this paper, we extend our work in [1], which proposed receiver-based schemes to correct a packet's critical (and corrupted) header fields. This paper: (a) poses header detection as the well-known decision theoretic problem of detecting known parameters in noise, (b) evaluates two detectors using bit-error traces collected over an 802.11b network, (c) provides throughput results for the detectors, and (d) uses video in conjunction with FEC as an example to highlight the efficacy of the proposed schemes. We show that header detection provides significant improvements in throughput and video quality over the conventional UDP/IP protocol stack.
- 31 May 2005
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 20 (8) , 728-742
Network-embedded FEC for optimum throughput of multicast packet video
- 31 May 2005
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 20 (8) , 728-742
Network-embedded FEC for optimum throughput of multicast packet video