C. P. Koushik
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
C. P. Koushik has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- A. Keerthika
Electronics and Communication Engineering, Aarupadai Veedu Institute of Technology, Chennai, India
1 shared publication - C. Saranya Jothi
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology
1 shared publication - Elizabeth Chang
School of Science, Technology and Engineering, University of the Sunshine Coast, Moreton Bay, QLD, Australia
1 shared publication - Pandu Vetrivelan
School of Electronics Engineering, Vellore Institute of Technology, Chennai, India
1 shared publication - R. Roselinkiruba
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai, India
1 shared publication - Vanlin Sathya
Celona Inc, Campbell, USA
1 shared publication
Latest Publications
- 26 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (41) , 88881-88901
A video data hiding technique based on pixel sequence, weight interpolation and quorum function
- 26 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (41) , 88881-88901
A video data hiding technique based on pixel sequence, weight interpolation and quorum function
- 22 February 2023
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 70 (3) , 2233-2245
Markov Chain-based Mobility Prediction and Relay-node Selection for QoS Provisioned Routing in Opportunistic Wireless Network
In the fields of networking and communication, wireless sensor networks are a commonly used technology. Although Mobility in Wireless Networks or Mobile Ad hoc Networks (MANETs) were developed to solve most critical problems in a disaster scenario. However, data transmission in a disaster area is a difficult operation due to irregular connections between sensing devices and the sink. Opportunistic network-based MANETs are utilized to overcome this problem. There are many routing issues such as communication overhead ratio, packet loss, and packet delivery ratio at mobile nodes. There are several traditional approaches used in opportunistic networks for node localization and routing. The drawback of these traditional routing methods is their poor reliability. A Markov chain-based opportunistic routing protocol is proposed in this paper. A Markov chain model is used to predict the node mobility for the random mobility model, and a neighbor table-based relay node selection procedure is proposed. A Markov prediction model uses the history of a node’s movement without requiring additional information. By analyzing simulation metrics including delay, overhead rate, packet drop, and packet delivery rate, the proposed routing protocol is evaluated and verified based on the Packet Delivery Ratio (PDR) in an opportunistic network environment (ONE) simulator. In addition, existing routing protocols such as Spray and Wait (SNW), Epidemic, Prophet, and MaxPro differ from the proposed routing protocol in terms of buffer size, node count, and message generation rate. Corresponding result analysis demonstrates the superior performance of the proposed routing protocol over existing protocols.
- 22 February 2023
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 70 (3) , 2233-2245
Markov Chain-based Mobility Prediction and Relay-node Selection for QoS Provisioned Routing in Opportunistic Wireless Network
In the fields of networking and communication, wireless sensor networks are a commonly used technology. Although Mobility in Wireless Networks or Mobile Ad hoc Networks (MANETs) were developed to solve most critical problems in a disaster scenario. However, data transmission in a disaster area is a difficult operation due to irregular connections between sensing devices and the sink. Opportunistic network-based MANETs are utilized to overcome this problem. There are many routing issues such as communication overhead ratio, packet loss, and packet delivery ratio at mobile nodes. There are several traditional approaches used in opportunistic networks for node localization and routing. The drawback of these traditional routing methods is their poor reliability. A Markov chain-based opportunistic routing protocol is proposed in this paper. A Markov chain model is used to predict the node mobility for the random mobility model, and a neighbor table-based relay node selection procedure is proposed. A Markov prediction model uses the history of a node’s movement without requiring additional information. By analyzing simulation metrics including delay, overhead rate, packet drop, and packet delivery rate, the proposed routing protocol is evaluated and verified based on the Packet Delivery Ratio (PDR) in an opportunistic network environment (ONE) simulator. In addition, existing routing protocols such as Spray and Wait (SNW), Epidemic, Prophet, and MaxPro differ from the proposed routing protocol in terms of buffer size, node count, and message generation rate. Corresponding result analysis demonstrates the superior performance of the proposed routing protocol over existing protocols.