Narottam Chand Kaushal

Dr. Narottam Chand Kaushal


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 March 2011
Verified
Conference Paper
Closed access
VKVivek Katiyar
Vivek Katiyar
NKNarottam Chand Kaushal
Narottam Chand Kaushal
GGGopal Chand Gautam
Gopal Chand Gautam
AKAnil Kumar
Anil Kumar
As the use of wireless sensor networks (WSNs) has grown enormously in the past few decades, the need of scalable & energy efficient routing and data aggregation protocol for large-scale deployments has also risen. LEACH is a hierarchical clustering protocol that provides an elegant solution for such protocols. One deficiency that affects the performance of the protocol is existence of very large and very small clusters in the network at the same time. This leads to the decrease in lifetime of WSNs. In this paper, we propose and analyze a new energy efficient clustering protocol (FZ-LEACH) that eliminates the above problem by forming Far-Zone. Far-Zone is a group of sensor nodes which are placed at locations where their energies are less than a threshold. The simulation results and analysis show that proposed FZ-LEACH algorithm outperforms LEACH in terms of energy consumption and network lifetime.

5 December 2006 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
NKNarottam Chand Kaushal
Narottam Chand Kaushal
RJR. C. Joshi
R. C. Joshi
MMManoj Misra
Manoj Misra

1 January 2007 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
NKNarottam Chand Kaushal
Narottam Chand Kaushal
RJR. C. Joshi
R. C. Joshi
MMManoj Misra
Manoj Misra
Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client′s mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV), to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC), is developed that employs LUV as replacement policy. In ZC one‐hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

1 March 2015 in Renewable and Sustainable Energy Reviews
Verified
Journal Article
Closed access
SHSharma
Sharma
NKNarottam Chand Kaushal
Narottam Chand Kaushal
VSVeena Sharma
Veena Sharma
DYDeepika Yadav
Deepika Yadav

1 January 2022 in Computer Communications
Verified
Journal Article
Closed access
HVHimanshu Verma
Himanshu Verma
NCNaveen Chauhan
Naveen Chauhan
NKNarottam Chand Kaushal
Narottam Chand Kaushal
LALalit Kumar Awasthi
Lalit Kumar Awasthi

8 August 2006
Verified
Conference Paper
Closed access
NKNarottam Chand Kaushal
Narottam Chand Kaushal
RJR.C. Joshi
R.C. Joshi
MMM. Misra
M. Misra
Caching of frequently accessed data in multi-hop ad hoc environment is a potential technique that can improve the data access performance and availability. Cooperative caching, which allows the sharing and coordination of cached data among clients, can further explore the potential of the caching techniques. In this paper, we propose a novel scheme, called zone cooperative (ZC) for caching in mobile ad hoc networks. In ZC scheme, one-hop neighbors of a mobile client form a cooperative cache zone since the cost for communication with them is low both in terms of energy consumption and message exchange. As a part of cache management, cache admission control and VALUE based replacement policy are developed to improve the data accessibility and reduce the local cache miss ratio. An analytical study of ZC based on data popularity, node density and transmission range is also performed. Simulation experiments show that the ZC caching mechanism achieves significant improvements in cache hit ratio and average query latency in comparison with other caching strategies