PRPrativa Rai

Prativa Rai

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Prativa Rai has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An innovative approach to Raga pattern identification

    by Sudipta Chakrabarty, Prativa Rai, Ruhul Islam, Hiren Kumar Deva Sarma

    Raga is a fundamental element of Indian classical music (ICM), crucial for identifying the unique characteristics of a given song. Recognizing the embedded Raga allows for various applications, including music therapy, and leveraging the therapeutic effects of different Ragas. The use of mathematical techniques such as fast fourier transform (FFT) and fundamental frequency measurement (FFM) in calculating note values has proven effective for Raga pattern recognition. Both methods yield nearly identical results, facilitating accurate identification of Ragas. Once identified, these Ragas can be used for specific therapeutic purposes, harnessing their healing potential.

  • Energy efficient communication protocol for wireless sensor networks with mobile node

    by Hiren Kumar Deva Sarma, Prativa Rai, Bhupesh Deka

    Wireless Sensor Networks have become hot research stuff in the current age. This field has got tremendous scopes in various application areas. Generally, a Wireless Sensor Network contains hundreds or thousands of sensing nodes. It is desirable to make these nodes cheaper. This fact also instigates design of simple and yet efficient algorithms and protocols for data communication over the sensor network and also for the successful operation of the network. Though the sensor nodes are expected to be static throughout, the mobility of the sensor nodes gives rise to some more sophisticated applications like better environment monitoring and tracking.The mobility of the sensor nodes increases the complexity in the design of the algorithms and protocols since it increases the rate of topology change. In this paper, sensor node mobility is considered and a routing protocol for such a mobile sensor network has been proposed.The base station is considered to be powerful as well as static. The proposed routing protocol is hierarchical. The formation of clusters and cluster head node selection are done by the base station. During the clustering process, the sensor field is divided into some virtual grids. The sensor node mobility factor is considered during the cluster formation process. The communication between ordinary sensor nodes and the cluster head node is carried out in single hop fashion. And depending on the current topology, the communication between the cluster head node and the base station may be of multi-hop fashion. The performance of the proposed protocol in terms of energy efficiency is observed through simulation. The results of simulation are reported here. The future scope of the work is outlined.


  • Applicability of wavelet transform in Multi-Resolution Motion estimation technique

    by Hiren Kumar, Prativa Rai, Deva Sarma, Gopal Thapa

    The lossy compression scheme is often used to compress data such as digital image and video. Such a video compression scheme based on the wavelet transform is presented in this paper. The multi-resolution/multi-frequency nature of the discrete wavelet transform is an ideal tool for representing images and video signals. Wavelet transform decomposes a video frame into a set of sub-frames with different resolutions corresponding to different frequency bands. These multi-resolution frames also provide a representation of the global motion structure of the video signal at different scales. The motion activities for a particular sub-frame at different resolutions are different but highly correlated since they actually specify the same motion structure at different scales. In the multi-resolution motion compensation approach, motion vectors in higher resolution are predicted by the motion vectors in the lower resolution and are refined at each step. In this paper, we propose a variable block-size MRMC (Multi-Resolution Motion Compensation) scheme. The approximate sub-image which carries the maximum information of the image sequence is compensated using the smallest block size and the other approximate sub-images are compensated using relatively bigger block sizes. The motion vectors of the approximate sub-images in lower resolution are used for motion compensation of their corresponding sub-images. This scheme considerably reduces the computing load, storage and transmission bandwidth. During transmission of an image sequence, only the residual image after motion compensation and the motion vector of the first level decomposition need to be transmitted to the decoder in order to reconstruct the original image. The simulation results show that the proposed approach has a satisfactory performance in terms of peak-to-peak signal-to-noise ratio (PSNR).


  • Energy efficient cluster based routing protocol for Wireless Sensor Networks

    by Sonam Palden Barfunga, Prativa Rai, Hiren Kumar Deva Sarma

    Wireless Sensor Networks consist of hundreds of tiny, inexpensive, resource constrained sensor nodes. Routing is a challenging task in such environment mainly due to the unique constraints the wireless sensor networks suffer from. Highly dynamic topology of wireless sensor networks is another challenge due to which the existing route becomes unavailable very frequently. Energy efficiency of the protocols and algorithms being a major design goal in sensor network setup, in this paper a novel energy efficient routing protocol is proposed. The proposed protocol is hierarchical and cluster based. In this protocol, the Base Station selects the Cluster Heads (CH). The selection procedure is carried out in two stages. In the first stage, all candidate nodes for becoming CH are listed, based on the parameters like relative distance of the candidate node from the Base Station, remaining energy level, probable number of neighboring sensor nodes the candidate node can have, and the number of times the candidate node has already become the Cluster Head. The Cluster Head generates two schedules for the cluster members namely Sleep and TDMA based Transmit. The data transmission inside the cluster and from the Cluster Head to the Base Station takes place in a multi-hop fashion. The current session ends when the energy level of any one of the current Cluster Heads reduces to half of its initial energy amount. The simulation results of the proposed protocol are also reported. Future scopes of this work are outlined.