Raksha Upadhyay
Raksha Upadhyay has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Uma Rathore Bhatt
Department of Electronics and Telecommunication, Institute of Engineering and Technology, Devi Ahilya University, Indore, India
7 shared publications - Abhay Kumar
School of Electronics, Devi Ahilya University, Indore, India
3 shared publications - Sangita Solanki
DAVV
2 shared publications - Vijay Bhat
Sage University
2 shared publications - Vijendra Mishra
Department of Electronics and Telecommunication, Institute of Engineering and Technology, Devi Ahilya University, Indore, India
2 shared publications - Ankit Soni
Room No D108, D-Block, Department of Electronics & Telecommunication, Institute of Engineering & Technology (IET-DAVV), Devi Ahilya Vishwavidyalaya India, Indore, India
1 shared publication
Latest Publications
- 21 August 2025
- Published by Springer Nature
- p. 243-257
Route Finding Scheme for Front End of Fiber Wireless Access Network
- 21 August 2025
- Published by Springer Nature
- p. 243-257
Route Finding Scheme for Front End of Fiber Wireless Access Network
- 1 June 2024
- Published by Bentham Science Publishers Ltd. in International Journal of Sensors, Wireless Communications and Control
- Vol. 14 (2) , 134-143
Delay and Fairness Analysis of C-RAN for Single and Multi Scheduling Domain Strategies
Background: Centralized Radio Access Network (C-RAN) is the most promising network architecture for next-generation communication networks. It meets the need for flexibility on fronthaul as well as large bandwidth on backhaul of the network. All along, scheduling is very important for the transmission of information in an organized manner. C-RAN has not been studied with the scheduling domain strategies yet in the literature. Objective: So, in this work, packet transmission duration, overall transmission time, wait time, and fairness index parameters have been calculated and analysed for C-RAN architecture for two different scheduling domains. The total transmission cycle time parameter is calculated for the three upper functional split options of C-RAN. The overall transmission time is a parameter calculated for the entire uplink channel. Method: To implement the network scenario, extensive scripting is done on MATLAB Editor for single scheduling domain (SSD) and multi-scheduling domain (MSD) for three higher functional split options of C-RAN. The data traffic generated in the network is considered random. Result: A closer examination of results reveals the advantages and disadvantages of both algorithms, as well as trade-offs between them. Conclusion: For quicker data transmission, SSD should be preferred whereas MSD should be preferred if multiple users want to access resources simultaneously. Lower functional split options of C-RAN require less transmission cycle time. The MSD technique is fairer than SSD.
- 1 June 2024
- Published by Bentham Science Publishers Ltd. in International Journal of Sensors, Wireless Communications and Control
- Vol. 14 (2) , 134-143
Delay and Fairness Analysis of C-RAN for Single and Multi Scheduling Domain Strategies
Background: Centralized Radio Access Network (C-RAN) is the most promising network architecture for next-generation communication networks. It meets the need for flexibility on fronthaul as well as large bandwidth on backhaul of the network. All along, scheduling is very important for the transmission of information in an organized manner. C-RAN has not been studied with the scheduling domain strategies yet in the literature. Objective: So, in this work, packet transmission duration, overall transmission time, wait time, and fairness index parameters have been calculated and analysed for C-RAN architecture for two different scheduling domains. The total transmission cycle time parameter is calculated for the three upper functional split options of C-RAN. The overall transmission time is a parameter calculated for the entire uplink channel. Method: To implement the network scenario, extensive scripting is done on MATLAB Editor for single scheduling domain (SSD) and multi-scheduling domain (MSD) for three higher functional split options of C-RAN. The data traffic generated in the network is considered random. Result: A closer examination of results reveals the advantages and disadvantages of both algorithms, as well as trade-offs between them. Conclusion: For quicker data transmission, SSD should be preferred whereas MSD should be preferred if multiple users want to access resources simultaneously. Lower functional split options of C-RAN require less transmission cycle time. The MSD technique is fairer than SSD.
- 28 June 2023
- Published by Springer Nature in Wireless Personal Communications
- Vol. 131 (2) , 1249-1278
Online Strainer Based Scheduling (OSBS) for Improving Energy Efficiency in FiWi Access Networks
- 28 June 2023
- Published by Springer Nature in Wireless Personal Communications
- Vol. 131 (2) , 1249-1278
Online Strainer Based Scheduling (OSBS) for Improving Energy Efficiency in FiWi Access Networks
- Open Access
- 31 May 2023
- Published by Polish Academy of Sciences Chancellery in International Journal of Electronics and Telecommunications
- Vol. 69 (2) , 361-369
PCA Based Components Selection Criteria for Computationally Efficient Physical Layer Key Generation (PLKG) System
Data security is one of the prime concerns in wireless networks. PLKG has been emerging as an attractive alternative to traditional cryptographic techniques. PLKG is more computationally efficient than cryptography. Moreover, PLKG using Principal component analysis (PCA) as pre-processing may further save computations. This paper proposes three mechanisms to select components of PCA which are based on Information content, Mean and Histfit. Bit Disagreement Rate (BDR) is compared for each mechanism. Histfit based method is found to be best. Since only two components are supposed to be processed for key generation, it is computationally efficient/ power efficient too.
- 31 May 2023
- Published by Polish Academy of Sciences Chancellery in International Journal of Electronics and Telecommunications
- Vol. 69 (2) , 361-369
Open AccessPCA Based Components Selection Criteria for Computationally Efficient Physical Layer Key Generation (PLKG) System
Data security is one of the prime concerns in wireless networks. PLKG has been emerging as an attractive alternative to traditional cryptographic techniques. PLKG is more computationally efficient than cryptography. Moreover, PLKG using Principal component analysis (PCA) as pre-processing may further save computations. This paper proposes three mechanisms to select components of PCA which are based on Information content, Mean and Histfit. Bit Disagreement Rate (BDR) is compared for each mechanism. Histfit based method is found to be best. Since only two components are supposed to be processed for key generation, it is computationally efficient/ power efficient too.
- 16 May 2022
- Published by Springer Nature
- p. 209-221
Latency Analysis of Different Functional Split Options of C-RAN with Slot Based DBA on TWDM-PON
- 16 May 2022
- Published by Springer Nature
- p. 209-221
Latency Analysis of Different Functional Split Options of C-RAN with Slot Based DBA on TWDM-PON
- 14 July 2021
- Published by Taylor & Francis
- p. 169-184
Lightweight Security Solutions for IoT using Physical-Layer Key Generation
Modern networking technologies involve the interconnection of smart and intelligent physical objects to provide advanced services. These physical objects may be part of various network technologies like WLAN, wireless sensor network (WSN), Internet of Things (IoT), etc., and share data in wireless mode, which should be secured from threats. These physical devices possess many constraints like power, computational complexity and storage, and are required to have lightweight security algorithms. Traditionally, security is achieved by the higher layers of the communication model, which has high computational complexity and consumes more power. In this chapter, a secure-key-generation scheme from physical layer characteristics is introduced as a possible lightweight security alternative to traditional upper-layer security approaches. The proposed scheme is based on the wiretap-channel model and security is achieved by generating keys at both communicating ends independently, based on inherent common-channel characteristics like randomness. It is mainly based on the principle of spatial decorrelation and channel reciprocity for identical carrier frequency. There is no provision for sharing keys as in public-key cryptography, so physical-layer key generation is not vulnerable to threats like key leakage. The generated key at the transmitter encrypts plain text; the generated cipher is transmitted on the common channel and is decrypted at the receiver end using the key generated by the receiver. Key generation consists of fundamental blocks like channel probing and quantization followed by information reconciliation and privacy amplification. The physical-layer key generation is already a power-efficient security solution; this chapter aims to enhance this capacity further. This is done by introducing low-end signal conditioning in the channel-probing step using moving-window averaging. This solution not only improves system performance but also makes it suitable for limited- power applications. The performance of the key-generation system is characterised in terms of the bit-disagreement rate between the generated key sequences of communicating parties and the key randomness by means of the NIST statistical test suite.
- 14 July 2021
- Published by Taylor & Francis
- p. 169-184
Lightweight Security Solutions for IoT using Physical-Layer Key Generation
Modern networking technologies involve the interconnection of smart and intelligent physical objects to provide advanced services. These physical objects may be part of various network technologies like WLAN, wireless sensor network (WSN), Internet of Things (IoT), etc., and share data in wireless mode, which should be secured from threats. These physical devices possess many constraints like power, computational complexity and storage, and are required to have lightweight security algorithms. Traditionally, security is achieved by the higher layers of the communication model, which has high computational complexity and consumes more power. In this chapter, a secure-key-generation scheme from physical layer characteristics is introduced as a possible lightweight security alternative to traditional upper-layer security approaches. The proposed scheme is based on the wiretap-channel model and security is achieved by generating keys at both communicating ends independently, based on inherent common-channel characteristics like randomness. It is mainly based on the principle of spatial decorrelation and channel reciprocity for identical carrier frequency. There is no provision for sharing keys as in public-key cryptography, so physical-layer key generation is not vulnerable to threats like key leakage. The generated key at the transmitter encrypts plain text; the generated cipher is transmitted on the common channel and is decrypted at the receiver end using the key generated by the receiver. Key generation consists of fundamental blocks like channel probing and quantization followed by information reconciliation and privacy amplification. The physical-layer key generation is already a power-efficient security solution; this chapter aims to enhance this capacity further. This is done by introducing low-end signal conditioning in the channel-probing step using moving-window averaging. This solution not only improves system performance but also makes it suitable for limited- power applications. The performance of the key-generation system is characterised in terms of the bit-disagreement rate between the generated key sequences of communicating parties and the key randomness by means of the NIST statistical test suite.
- 2 November 2019
- Published by Springer Nature
- p. 433-447
Placement of Routers and Cloud Components in Cloud-Integrated Wireless-Optical Broadband Access Network
- 2 November 2019
- Published by Springer Nature
- p. 433-447
Placement of Routers and Cloud Components in Cloud-Integrated Wireless-Optical Broadband Access Network
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Contour Based Scheduling Approach (CBSA)for DBA Using Hybrid-MA for FiWi Access Network
In modern world of communication, demand for bandwidth is exponentially increasing and hence to match this demand many technologies come under researchers’ scanner. To improve the bandwidth availability and flexibility, fiber wireless (FiWi) access network has been proposed which is an integration of passive optical network (PON) and wireless local area network (WLAN). However, utilization of bandwidth cannot be fully achieved with FiWi architecture alone. Therefore different dynamic bandwidth allocation and scheduling approaches are used to fully utilize the bandwidth. In this paper, we have proposed a contour based scheduling for DBA using hybrid multiple access to provide better delay performance and wavelength utilization. The proposed approach has been compared with limited Interleaved Polling with Adaptive Cycle Time (IPACT) for time division multiple access (TDMA) and hybrid-MA (multiple access) architectures. Parameters like delay and load handling ability are evaluated for comparison.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Contour Based Scheduling Approach (CBSA)for DBA Using Hybrid-MA for FiWi Access Network
In modern world of communication, demand for bandwidth is exponentially increasing and hence to match this demand many technologies come under researchers’ scanner. To improve the bandwidth availability and flexibility, fiber wireless (FiWi) access network has been proposed which is an integration of passive optical network (PON) and wireless local area network (WLAN). However, utilization of bandwidth cannot be fully achieved with FiWi architecture alone. Therefore different dynamic bandwidth allocation and scheduling approaches are used to fully utilize the bandwidth. In this paper, we have proposed a contour based scheduling for DBA using hybrid multiple access to provide better delay performance and wavelength utilization. The proposed approach has been compared with limited Interleaved Polling with Adaptive Cycle Time (IPACT) for time division multiple access (TDMA) and hybrid-MA (multiple access) architectures. Parameters like delay and load handling ability are evaluated for comparison.