Most recent issue published online in the International Journal of Internet Protocol Technology.
International Journal of Internet Protocol Technology
http://www.inderscience.com/browse/index.php?journalID=144&year=2023&vol=16&issue=3
Inderscience Publishers Ltd
en-uk
support@inderscience.com
International Journal of Internet Protocol Technology
1743-8209
1743-8217
© 2023 Inderscience Enterprises Ltd.
© 2023 Inderscience Publishers Ltd
editor@inderscience.com
International Journal of Internet Protocol Technology
https://www.inderscience.com/images/files/coverImgs/ijipt_scoverijipt.jpg
http://www.inderscience.com/browse/index.php?journalID=144&year=2023&vol=16&issue=3
-
Computation on scheduling attacks and optimal resource utilisation in wireless sensor networks via optimisation techniques
http://www.inderscience.com/link.php?id=133026
Security issues of wireless sensor nodes for classifying sensory data and its accuracy needed to prevent wastage of sensor resources. The limitation occurs due to processing of small-scale samples in training or data imbalance, which occurs due to nodal density. In this context, pre-processing of sensor data to overcome scheduling attacks considered with two algorithms is proposed. The first is 'Time Stamp Reordering for Scheduling Attack' (TSRSA) and the second is 'Energy Efficiency based Routing using Simulated Annealing' (EERSA). The former is susceptible to scheduling attacks, whereas the later alleviate this by using simulated annealing. EERSA method provides optimal moves as data traverses using energy bound values, time-bound transitions using propagation delay and offset values. The simulation of both developed protocols measured and compared for misalignment ratio and consolidated residual energy.
Computation on scheduling attacks and optimal resource utilisation in wireless sensor networks via optimisation techniques
S. Narasimha Prasad; K. Senthamil Selvan; B. Lakshmi Dhevi; A. Niranjil Kumar
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 131 - 137
Security issues of wireless sensor nodes for classifying sensory data and its accuracy needed to prevent wastage of sensor resources. The limitation occurs due to processing of small-scale samples in training or data imbalance, which occurs due to nodal density. In this context, pre-processing of sensor data to overcome scheduling attacks considered with two algorithms is proposed. The first is 'Time Stamp Reordering for Scheduling Attack' (TSRSA) and the second is 'Energy Efficiency based Routing using Simulated Annealing' (EERSA). The former is susceptible to scheduling attacks, whereas the later alleviate this by using simulated annealing. EERSA method provides optimal moves as data traverses using energy bound values, time-bound transitions using propagation delay and offset values. The simulation of both developed protocols measured and compared for misalignment ratio and consolidated residual energy.]]>
10.1504/IJIPT.2023.133026
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 131 - 137
S. Narasimha Prasad
K. Senthamil Selvan
B. Lakshmi Dhevi
A. Niranjil Kumar
Department of Electronics and Communication Engineering, Dhanalakshmi College of Engineering, Anna University, Chennai, Tamil Nadu, India ' Department of Electronics and Communication Engineering, Prince Shri Venkateshwara Padmavathy Engineering College, Chennai, Tamil Nadu, India ' Institute of Artificial Intelligence and Machine Learning, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai, Tamil Nadu, India ' Department of Electronics and Communication Engineering, Dhanalakshmi College of Engineering, Chennai, Tamil Nadu, India
scheduling attacks
misalignment ratio
resource utilisation
2023-08-25T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
16
3
131
137
2023-08-25T23:20:50-05:00
-
Distribution and tracking current live location of recognised criminal face at decentralised blockchain through image
http://www.inderscience.com/link.php?id=133028
In the current era, the Internet of Things (IoT), Blockchain Technology and Face recognition are the most emergent technologies to make more advanced and smart cities. In our day-to-day life, security and recognition play a significant position, and managing those securities and recognition is vital for the service providers. Major parts of security depend on passwords, encryption, recognition, secure storage, etc. To prevent any criminal of IoT applications or for preventing any unethical activities of IoT applications, there is a need for a strong secure network. Here, we have designed an algorithm to store with time stamping and signature as well as a live location tracking algorithm to enhance the security of the IoT recognition system through decentralised blockchain storage. In the Blockchain server, we have proposed a decentralised solution to find the live location of the recognised criminal face through which we can prevent any wrong activities furthermore. We have stored the recognised information on blockchain storage and used the time stamping, signature, and transaction of blockchain to ensure the security and track the current location of the criminal face with the blockchain. Hence, through storage at the decentralised server criminal information is in the immutable form on the server and ensures the guarantee of data security at an extended level. In the result, the accuracy, real-time criminal location, and the execution time of the output were all assessed using the ORL datasets and self-created datasets. The current live location tracking rate was approximately 99%, while the average accuracy was around 98%. At various sizes and DPI combinations, the elapsed time and execution times were also assessed.
Distribution and tracking current live location of recognised criminal face at decentralised blockchain through image
Sana Zeba; Mohammad Amjad
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 138 - 147
In the current era, the Internet of Things (IoT), Blockchain Technology and Face recognition are the most emergent technologies to make more advanced and smart cities. In our day-to-day life, security and recognition play a significant position, and managing those securities and recognition is vital for the service providers. Major parts of security depend on passwords, encryption, recognition, secure storage, etc. To prevent any criminal of IoT applications or for preventing any unethical activities of IoT applications, there is a need for a strong secure network. Here, we have designed an algorithm to store with time stamping and signature as well as a live location tracking algorithm to enhance the security of the IoT recognition system through decentralised blockchain storage. In the Blockchain server, we have proposed a decentralised solution to find the live location of the recognised criminal face through which we can prevent any wrong activities furthermore. We have stored the recognised information on blockchain storage and used the time stamping, signature, and transaction of blockchain to ensure the security and track the current location of the criminal face with the blockchain. Hence, through storage at the decentralised server criminal information is in the immutable form on the server and ensures the guarantee of data security at an extended level. In the result, the accuracy, real-time criminal location, and the execution time of the output were all assessed using the ORL datasets and self-created datasets. The current live location tracking rate was approximately 99%, while the average accuracy was around 98%. At various sizes and DPI combinations, the elapsed time and execution times were also assessed.]]>
10.1504/IJIPT.2023.133028
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 138 - 147
Sana Zeba
Mohammad Amjad
Department of Computer Engineering, Jamia Millia Islamia University, New Delhi 110025, India ' Department of Computer Engineering, Jamia Millia Islamia University, New Delhi 110025, India
blockchain technology
IoT
face recognition
criminal recognition
criminal tracking
2023-08-25T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
16
3
138
147
2023-08-25T23:20:50-05:00
-
Towards a transmission control mechanism for data centres based on flow deadline and size over software defined networking
http://www.inderscience.com/link.php?id=133030
Data centres (DCN) support lots of online services, which possess strict deadline constraints. Some research shows that TCP protocol cannot provide deadline-aware transmission services for intra-DCN traffic, because TCP protocol cannot learn about upper application information and always fairly allocate bottleneck bandwidth. As a result, those throughput-sensitive flows have bigger sending windows, yet deadline-aware flows have to queue for forwarding along with longer delays. To address the issue above, we present DSATC, a transmission control mechanism based on flow deadline and size. DSATC uses double ECN thresholds to mark packets, takes the remaining completion time and size of a flow to calculate the flow urgency and redefines the adjustment method of the congestion window (CWND) to balance congestion control and flow deadline completion rate. The experimental results show that DSATC not only efficiently raises flow deadline completion rate and reduces flow completion time but also lifts network throughput.
Towards a transmission control mechanism for data centres based on flow deadline and size over software defined networking
Yu Tianfang; Qiu Xuesong
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 148 - 160
Data centres (DCN) support lots of online services, which possess strict deadline constraints. Some research shows that TCP protocol cannot provide deadline-aware transmission services for intra-DCN traffic, because TCP protocol cannot learn about upper application information and always fairly allocate bottleneck bandwidth. As a result, those throughput-sensitive flows have bigger sending windows, yet deadline-aware flows have to queue for forwarding along with longer delays. To address the issue above, we present DSATC, a transmission control mechanism based on flow deadline and size. DSATC uses double ECN thresholds to mark packets, takes the remaining completion time and size of a flow to calculate the flow urgency and redefines the adjustment method of the congestion window (CWND) to balance congestion control and flow deadline completion rate. The experimental results show that DSATC not only efficiently raises flow deadline completion rate and reduces flow completion time but also lifts network throughput.]]>
10.1504/IJIPT.2023.133030
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 148 - 160
Yu Tianfang
Qiu Xuesong
School of Computer Science, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing, China ' School of Computer Science, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing, China
data centre
SDN
deadline-aware
congestion control
TCP protocol
2023-08-25T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
16
3
148
160
2023-08-25T23:20:50-05:00
-
A comparative performance analysis of TCP congestion control algorithm: elastic TCP vs. e-Elastic TCP
http://www.inderscience.com/link.php?id=133029
The Transmission Control Protocol (TCP) is a widely used transport layer protocol for reliable IP networks. To handle congestion in the network due to various reasons many algorithms have been designed. In this paper, we have carried out a detailed analysis of the Elastic TCP congestion control algorithm which is based on delay and independent of Round-Trip Time (RTT). Elastic TCP uses a Window-correlated Weighting Function (WWF) for deciding the update of congestion window size. We have proposed an enhanced Elastic (e-Elastic) for further improvement of performance. These algorithms Elastic and e-Elastic are more suitable for the high and moderate Bandwidth-Delay Product (BDT) while we have tested it for moderate BDT on network simulator-3 (ns-3). Our proposed algorithm improves the average throughput with 5.11%, 10.14%, 10.69% and 11.07% over Elastic, CUBIC, Veno and New Reno, respectively.
A comparative performance analysis of TCP congestion control algorithm: elastic TCP vs. e-Elastic TCP
Vivek Kumar Jaiswal; Sanjeev Patel
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 161 - 175
The Transmission Control Protocol (TCP) is a widely used transport layer protocol for reliable IP networks. To handle congestion in the network due to various reasons many algorithms have been designed. In this paper, we have carried out a detailed analysis of the Elastic TCP congestion control algorithm which is based on delay and independent of Round-Trip Time (RTT). Elastic TCP uses a Window-correlated Weighting Function (WWF) for deciding the update of congestion window size. We have proposed an enhanced Elastic (e-Elastic) for further improvement of performance. These algorithms Elastic and e-Elastic are more suitable for the high and moderate Bandwidth-Delay Product (BDT) while we have tested it for moderate BDT on network simulator-3 (ns-3). Our proposed algorithm improves the average throughput with 5.11%, 10.14%, 10.69% and 11.07% over Elastic, CUBIC, Veno and New Reno, respectively.]]>
10.1504/IJIPT.2023.133029
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 161 - 175
Vivek Kumar Jaiswal
Sanjeev Patel
Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela, Odisha, India ' Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela, Odisha, India
TCP congestion control
reno
CUBIC
veno
elastic TCP
e-Elastic TCP
average throughput
loss-ratio
2023-08-25T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
16
3
161
175
2023-08-25T23:20:50-05:00
-
Efficient routing protocol for IoT networks based on fog computing and routing protocol of low-power lossy networks
http://www.inderscience.com/link.php?id=133031
The Internet of Things (IoT) is prevalent in the modern era because of its versatile application in every field. IoT solves real word problems through the connectivity of the internet. Smart devices in IoT control the environment and provide diverse utilities. IoT networks make human life easy by using next-generation technology. Even after various studies on IoT still, the major challenge is routing. Various algorithms are proposed but still remarkable performance is not achieved. The standard algorithm for low-power lossy network (RPL) protocol does not work well in parent selection for bulky networks. FOG-RPL is based on fog computing with an innovative objective function. In this paper, FOG-RPL is proposed and tested on the Cooja simulator with Contiki OS with quality parameters. The simulation of FOG-RPL is performed with performance parameters and results show that the packet loss ratio is 6% and the energy consumption is 0.6 mw, which is 11% more efficient than the existing algorithm.
Efficient routing protocol for IoT networks based on fog computing and routing protocol of low-power lossy networks
Ankit Verma; Suman Deswal
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 176 - 184
The Internet of Things (IoT) is prevalent in the modern era because of its versatile application in every field. IoT solves real word problems through the connectivity of the internet. Smart devices in IoT control the environment and provide diverse utilities. IoT networks make human life easy by using next-generation technology. Even after various studies on IoT still, the major challenge is routing. Various algorithms are proposed but still remarkable performance is not achieved. The standard algorithm for low-power lossy network (RPL) protocol does not work well in parent selection for bulky networks. FOG-RPL is based on fog computing with an innovative objective function. In this paper, FOG-RPL is proposed and tested on the Cooja simulator with Contiki OS with quality parameters. The simulation of FOG-RPL is performed with performance parameters and results show that the packet loss ratio is 6% and the energy consumption is 0.6 mw, which is 11% more efficient than the existing algorithm.]]>
10.1504/IJIPT.2023.133031
International Journal of Internet Protocol Technology, Vol. 16, No. 3 (2023) pp. 176 - 184
Ankit Verma
Suman Deswal
Department of Computer Science & Engineering, Deenbandhu Chhotu Ram University of Science and Technology, Murthal, Sonipat, Haryana, India ' Department of Computer Science & Engineering, Deenbandhu Chhotu Ram University of Science and Technology, Murthal, Sonipat, Haryana, India
IoT networks
routing protocols
internet of things
fog computing
2023-08-25T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
16
3
176
184
2023-08-25T23:20:50-05:00