Institution
National Institute of Technology, Meghalaya
Education•Shillong, India•
About: National Institute of Technology, Meghalaya is a education organization based out in Shillong, India. It is known for research contribution in the topics: Control theory & Electric power system. The organization has 503 authors who have published 1062 publications receiving 6818 citations. The organization is also known as: NIT Meghalaya & NITM.
Papers
More filters
••
TL;DR: A distributed data collection mechanism, called Distributed Bus-based Data Collection (DBDC) algorithm, which considers the bus as mobile sink aiming to maximize the amount of collected data and the network lifetime of wireless sensor networks.
Abstract: Data collection is one of the most important research topics in WSNs. In literature, many studies have proposed centralized solutions to cope with the data collection problem. However, most of them considered controllable mobile sink which is controlled by an algorithm to determine its speed, path, stop locations as well as the performed task. In fact, the uncontrollable mobile sink can be also applied to collect data from a given set of deployed sensors. A number of studies assumed that the sink is fixed and all sensors transmit their data to the sink. However, it leads to the problems of unbalanced workload and network disconnection. Some other studies scheduled the controllable mobile sink. However, the algorithms developed by adopting the controllable mobile sink cannot be applied to the scenarios where the uncontrollable mobile sink is adopted. The main reason is that the stops and arrival time of the uncontrollable mobile sink are unknown. In addition, the problems including the high hardware cost and energy limitation of the controllable mobile sink are still needed to be overcome. This paper proposes a distributed data collection mechanism, called Distributed Bus-based Data Collection (DBDC) algorithm, which considers the bus as mobile sink aiming to maximize the amount of collected data and the network lifetime of wireless sensor networks. Applying the proposed DBDC, each sensor negotiates with its neighbors based on a bidding procedure such that the sensor that buffers more data can obtain more sharing slots instead of increasing its power level. To prolong the network lifetime, the sensor with higher remaining energy can enlarge its transmission power, aiming to release more sharing slots to cooperatively help the neighbor that buffers more data. Experimental study reveals that the proposed DBDC algorithm outperforms related works in terms of throughput, network lifetime and fairness.
6 citations
••
TL;DR: From the simulated result analysis, proposed work is found to be outperforming in terms of sharpened image details with diminished effect of artifacts at a reasonable computational burden.
Abstract: Efficient trade-off between the reconstruction qualities and the processing time of any single-image super-resolution reconstruction (SISRR) approach is critically influenced by two major aspects These aspects are (i) appropriate representation of image patch in feature space and (ii) effective searching of candidate patches from the pool of training patches or learned dictionary This paper proposes a neighbor embedding-based SISRR method Novelties of our work include integration of (i) efficient feature mapping scheme which fuses multiple correlated features naturally, (ii) faster searching of candidate patches by measuring the patch correlation in non-Euclidean space and (iii) adaptive selection of neighborhood size using patch characteristic Correlation among features is modeled via global covariance matrix, and the fusion process enables to preserve sufficient structural, spatial correlation among patches Distance functions based on notion of generalized eigenvalue are used for measuring patch similarity which support faster searching of candidate patches Performance analysis of the suggested method is compared with some of the competent state-of-the-art methodologies From the simulated result analysis, proposed work is found to be outperforming in terms of sharpened image details with diminished effect of artifacts at a reasonable computational burden
6 citations
••
TL;DR: The results on FPGA shows that compressor based converters and multipliers produced less amount of propagation delay with a slight increase of hardware resources, and in case of ASIC implementation, a compressor based converter delay is equivalent to conventional converter with a slightly increase of gate count.
6 citations
••
01 Nov 2018
TL;DR: The proposed control law simplifies the controller design of power system stabilizer and provides an effective and robust control to avoid the instability in the FDFPS.
Abstract: In this paper, control of chaos in an extended four-dimensional fundamental power system (FDFPS) using sliding mode control (SMC) is considered. First order sliding mode control laws are derived in order to control the chaotic behaviour in FDFPS. The sufficient stability condition is devised for the designed sliding manifold based on Lyapunov stability theory. The proposed control law simplifies the controller design of power system stabilizer and provides an effective and robust control to avoid the instability in the FDFPS. Simulation is presented in MATLAB environment and reveals the effectiveness of proposed SMC scheme.
6 citations
••
TL;DR: The results depict that the proposed AF approach reduces the correlation effect in SOVA with nominal BER and complexity.
6 citations
Authors
Showing all 517 results
Name | H-index | Papers | Citations |
---|---|---|---|
Sudip Misra | 48 | 535 | 9846 |
Robert Wille | 43 | 457 | 6881 |
Paul C. van Oorschot | 41 | 150 | 21478 |
Sourav Das | 30 | 174 | 4026 |
Mukul Pradhan | 23 | 53 | 1990 |
Bibhuti Bhusan Biswal | 20 | 155 | 1413 |
Naba K. Nath | 20 | 39 | 1813 |
Atanu Singha Roy | 19 | 48 | 1071 |
Akhilendra Pratap Singh | 19 | 99 | 1775 |
Abhishek Singh | 19 | 107 | 1354 |
Vinay Kumar | 19 | 130 | 1442 |
Dipankar Das | 19 | 67 | 1904 |
Gayadhar Panda | 18 | 123 | 1093 |
Gitish K. Dutta | 16 | 26 | 1168 |
Kamalika Datta | 15 | 69 | 676 |