Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Samayveer Singh is active.

Publication


Featured researches published by Samayveer Singh.


iet wireless sensor systems | 2016

NEECP: Novel energy-efficient clustering protocol for prolonging lifetime of WSNs

Samayveer Singh; Satish Chand; Rajeev Kumar; Aruna Malik; Bijendra Kumar

In this paper, a novel energy-efficient clustering protocol (NEECP) for increasing the network lifetime in wireless sensor networks is proposed. This technique selects the cluster heads in an effective way with an adjustable sensing range and performs data aggregation using chaining approach. It also avoids transmission of redundant data by using a redundancy check function for improving the network lifetime. It is implemented by considering the data with aggregation and without aggregation. The NEECP without aggregation increases the network lifetime by 59.76 and 7.17% as compared with the hybrid energy-efficient distributed (HEED) and intra-balanced low-energy adaptive clustering hierarchy (IBLEACH), respectively. It increases the network lifetime by 122.92 and 49.53% over the HEED and IBLEACH, respectively, while considering data aggregation.


International Journal of Computer Applications | 2010

Energy-Efficient Data Gathering Algorithms for Improving Lifetime of WSNs with Heterogeneity and Adjustable Sensing Range

Samayveer Singh; Ajay K. Sharma

this paper, the energy-efficient data gathering algorithms for improving lifetime of WSNs with heterogeneity and adjustable sensing range have been reported. Here we have assumed that the sensor nodes and base-station are not mobile. The more over location and initial energy of the sensor nodes is known and number of sensor nodes is randomly distributed over a monitoring region. For the heterogeneity the three types of nodes: a normal, advanced and super node with some fraction in terms of their initial energy has been taken. In this work, we have proposed new distributed energy efficient algorithms AEEDPSH and ADLBPSH, based on the distance from the base station and sensor residual energy as well as scheduling of sensor nodes to alternate between sleep and active mode. The simulation results illustrate that the proposed algorithms AEEDPSH and ADLBPSH balance the energy dissipation over the whole network thus prolonging the network lifetime.


International Journal of Modern Physics B | 2015

Mechanical, spin polarized electronic and magnetic properties of TmX(X = Cu, Ag): First principle study

Satish Chand; R. P. Singh; A. Govindan; Samayveer Singh

To study the mechanical, spin polarized electronic and magnetic behavior of TmX(X = Cu, Ag), full-potential linear augmented plane wave plus local orbital method has been used. The lattice parameter (a0), bulk modulus (B0) and its first-order pressure derivative have been calculated using optimization method. Mechanical properties have been studied in terms of elastic constants (Cij), Youngs modulus (Y), shear modulus (G) and Poissons ratio (v) at ambient temperature and pressure which are found to be consistent with available experimental/theoretical values. Electronic properties have been investigated in terms of band structure and density of state histograms for spin up and spin down channel. Electronic and magnetic behavior of TmX shows that studied materials are metallic ferromagnets with high spin polarization in which Tm-f state electrons are contributed mainly.


international conference on information systems | 2014

Optimum deployment of sensors in WSNs

Samayveer Singh; Satish Chand; Bijendra Kumar

Ant Colony Optimization (ACO) is one of the important techniques for solving optimization problems. It has been used to find locations to deploy sensors in a grid environment [12], in which the targets, called point of interest (PoI), are located on grid points in a square grid. The locations of sensors, which are grid points, are determined by considering the sink location as the starting point for deploying sensors. Though that work provides optimum number of sensors to cover all targets with respect to the given sink location, yet it does not provide which sink location provides minimum number of sensors to cover the targets. In this paper, we use ACO technique and find the sink location for which the number of sensors is minimum among all available locations in the grid. In our algorithm, we compute sum of distances of the targets from that sensor, which are in its range. Then we add these sums for all sensors in the grid. This distance corresponds to the given sink location. We repeat same process for computing the distance by changing the sink location in the grid. We choose that sink location for which the distance is minimum and this sink location requires minimum number of sensors to cover all targets. We carry out simulations to demonstrate the effectiveness of our proposed work.


grid computing | 2010

A heterogeneous power efficient load balancing target-monitoring protocol for sensor networks

Samayveer Singh; Ajay K. Sharma

A critical aspect of applications with WSNs is increase the sensor nodes lifetime. Power constrained WSNs are useable such as they can communicate sensed data to a processing node. Communication and sensing consume energy therefore energy saving and improving lifetime of WSNs can be achieved by scheduling of sensor nodes. In scheduling allow sensor nodes can interchange its state into idle, sleep and active modes and adjusting the transmission or sensing range. In this paper, we provide a problem formulation for the lifetime maximization problem in WSNs with adjustable sensing ranges for a heterogeneous network model (super, advance and normal nodes). The network lifetime increases with the number of sensors at different targets and sensing range. When number of targets increased, the lifetime of the network decreases as more targets are monitored. The simulation results for target monitoring protocol, HALBPS verify that with the adjustable sensing range, heterogeneous nodes and different targets, the overall network lifetime improved as compared with existing protocols.


international conference on heterogeneous networking for quality, reliability, security and robustness | 2013

3-Tier Heterogeneous Network Model for Increasing Lifetime in Three Dimensional WSNs

Samayveer Singh; Satish Chand; Bijendra Kumar

Homogeneous algorithms assume that the entire sensor node equipped with equal amount of energy. In this paper, a network model has been proposed which incorporate heterogeneity in term of their energy. The term heterogeneity means nodes equipped with dissimilar amount of energy. This model contains three tier node heterogeneity namely tier-1, tier-2, and tier-3 heterogeneity. We assume that nodes are equipped in three dimensions, not mobile, and randomly distributed. It performance is compared with 3D-ALBP, called 3D-hetALBP. Finally, the simulation results demonstrate that our proposed heterogeneous algorithm is more effective in prolonging the network lifetime compared with 3D-ALBP.


Telecommunication Systems | 2017

Multilevel heterogeneous network model for wireless sensor networks

Samayveer Singh; Satish Chand; Bijendra Kumar

The lifetime of a network can be increased by increasing the network energy. The network energy can be increased either increasing the number of sensors or increasing the initial energy of some sensors without increasing their numbers. Increasing network energy by deploying extra sensors is about ten times costlier than that using some sensors of high energy. Increasing the initial energy of some sensors leads to heterogeneous nodes in the network. In this paper, we propose a multilevel heterogeneous network model that is characterized by two types of parameters: primary parameter and secondary parameters. The primary parameter decides the level of heterogeneity by assuming the values of secondary parameters. This model can describe a network up to nth level of heterogeneity (n is a finite number). We evaluate the network performance by applying the HEED, a clustering protocol, on this model, naming it as MLHEED (Multi Level HEED) protocol. For n level of heterogeneity, this protocol is denoted by MLHEED-n. The numbers of nodes of each type in any level of heterogeneity are determined by the secondary model parameter. The MLHEED protocol (for all level heterogeneity) considers two variables, i.e., residual energy and node density, for deciding the cluster heads. We also consider fuzzy implementation of the MLHEED in which four variables are used to decide the cluster heads: residual energy, node density, average energy, and distance between base station and the sensor nodes. In this work, we illustrate the network model up to seven levels (


Confluence The Next Generation Information Technology Summit (Confluence), 2014 5th International Conference - | 2014

An energy efficient clustering protocol with fuzzy logic for WSNs

Samayveer Singh; Satish Chand; Bijendra Kumar


Multimedia Tools and Applications | 2018

An Improved Histogram-Shifting-Imitated reversible data hiding based on HVS characteristics

Rajeev Kumar; Satish Chand; Samayveer Singh

1\le n\le 7


International Journal of Computer Applications | 2012

A Distributed Energy-Efficient Target Tracking Protocol for Three Level Heterogeneous Sensor Networks

Yashveer Singh; Samayveer Singh; Rajeev Kumar

Collaboration


Dive into the Samayveer Singh's collaboration.

Top Co-Authors

Avatar

Satish Chand

Jawaharlal Nehru University

View shared research outputs
Top Co-Authors

Avatar

Bijendra Kumar

Netaji Subhas Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Rajeev Kumar

Netaji Subhas Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Ajay K. Sharma

National Institute of Technology Delhi

View shared research outputs
Researchain Logo
Decentralizing Knowledge