Yogesh Palanichamy

dblp:121/8461 · also Palanichamy Yogesh · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0002-2524-5974ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 8 · 5 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2025 SJO-MRL: Energy efficient path selection algorithm for WSNs
Mohana Bhindu K, Yogesh Palanichamy
Peer Peer Netw. Appl.2
2022 Fuzzy routing for in-network aggregation in wireless sensor networks
Radhakrishnan Maivizhi, Yogesh Palanichamy
Peer-to-Peer Netw. Appl.2
2022 A flexible deadline-driven resource provisioning and scheduling algorithm for multiple workflows with VM sharing protocol on WaaS-cloud
P. Rajasekar, Yogesh Palanichamy
J. Supercomput.2
2021 Packet classification based aerial intelligent relay-road side unit (air-rsu) framework for vehicular ad-hoc networks
A. Samson Arun Raj, Yogesh Palanichamy
Peer-to-Peer Netw. Appl.2
2021 Energy efficient secured K means based unequal fuzzy clustering algorithm for efficient reprogramming in wireless sensor networks
Sripathi Venkata Naga Santhosh Kumar, Yogesh Palanichamy, Munuswamy Selvi, Sannasi Ganapathy, Arputharaj Kannan, Sankar Pariserum Perumal
Wirel. Networks2
2021 Q-learning based routing for in-network aggregation in wireless sensor networks
Radhakrishnan Maivizhi, Yogesh Palanichamy
Wirel. Networks2
2020 An aerial intelligent relay-road side unit (AIR-RSU) framework for modern intelligent transportation system
A. Samson Arun Raj, Yogesh Palanichamy
Peer-to-Peer Netw. Appl.2
2020 Rank-Based Report Filtering Scheme (RRFS) for Verifying Phoney Reports in Wireless Sensor Networks
abstract
Wireless sensor networks (WSNs) are open to false data injection attack when they are deployed in hostile scenarios. Attackers can easily deceive the sink by compromising sensing nodes or by injecting phoney data into the network. Such attacks can deplete the energy resources of the network by providing wrong information which in turn can affect the proper network functioning or sometimes can shut the network from further functioning. The existing schemes that deal with this problem focus on only a few aspects of the false data injection attack. To resolve this problem, we propose a Rank-based Report Filtering Scheme (RRFS), a holistic and group verification scheme for the identification of compromised nodes and the filtering of false data injected into the network. The proposed scheme verifies report among clusters, en-routers, and sink. Hence, the RRFS, a holistic scheme that is composed of three-tier verifications, successfully rejects the false data before the attackers falsify the whole environment, and this makes the system unique. Reliability Index (RI) is calculated by the nodes for fellow cluster members, and the cluster head (CH) provides the score for a node based on its RI. This, in turn, strengthens the scheme by assisting the en-routers to detect the compromised nodes. The RRFS scheme has been verified and validated by extensive simulation and meticulous performance evaluation of filtering efficiency and energy consumption against various schemes. The scheme gives high filtering efficiency against the multiple compromised nodes and also improves the network’s lifespan. The sustainability of RRFS against numerous attacks that are launched in the sensor environment is thoroughly investigated.
M. Gayathri Santhosh, Yogesh Palanichamy
Wirel. Commun. Mob. Comput.2
2018 Energy efficient and secured distributed data dissemination using hop by hop authentication in WSN
Sripathi Venkata Naga Santhosh Kumar, Yogesh Palanichamy
Wirel. Networks2