Pratap Kumar Sahu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Pratap Kumar Sahu has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Abdelhakim Hafid
Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ, Canada
10 shared publicationsJagruti Sahoo
CIISE, Concordia University, (QC), Canada
7 shared publicationsSoumaya Cherkaoui
Dept. of ECE, University of Sherbrooke, (QC), Canada
5 shared publications- Abdelhakim Senhaji Hafid
University of Montréal, Montréal, QC, Canada
4 shared publications Eric Hsiao-Kuang Wu
Department of Computer Science and Information Engineering, National Central University, Zhongli, Taiwan
4 shared publicationsMario Gerla
Department of Computer Science, University of California, Los Angeles, CA, USA
4 shared publications
Latest Publications
- 14 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 21 (3) , 1154-1166
Reliable Emergency Message Dissemination Scheme for Urban Vehicular Networks
Vehicular safety applications based on DSRC/802.11p have strict reliability requirement (greater than 0.99). However, it is difficult to achieve high reliability in wireless medium as the transmission is vulnerable to various wave propagation issues. To the best of our knowledge, none of the existing emergency message dissemination schemes in the literature, achieves a predefined reliability in lossy channel. In this paper, we propose a novel scheme, called reliable emergency message dissemination scheme (REMD), which achieves a predefined reliability for message dissemination while satisfying delay requirements, for various channel conditions. We aim to guarantee very high reliability (e.g., 99%) in each hop, with low control overhead while keeping low end-to-end latency for time-critical applications. We employ zero-correlated unipolar orthogonal codes to combat hidden terminal problem. We exploit periodic beacons, to accurately estimate reception quality of 802.11p wireless link in each cell; then, we use this information to determine the optimal number of broadcast repetitions in each hop. In addition, to ensure reliability in multi-hop, we utilize cooperative communication. The simulation results show that REMD outperforms the existing well-known schemes in the literature. Furthermore, REMD satisfies latency requirements for time-critical vehicular applications and has less network overhead than the existing schemes.
- 14 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 21 (3) , 1154-1166
Reliable Emergency Message Dissemination Scheme for Urban Vehicular Networks
Vehicular safety applications based on DSRC/802.11p have strict reliability requirement (greater than 0.99). However, it is difficult to achieve high reliability in wireless medium as the transmission is vulnerable to various wave propagation issues. To the best of our knowledge, none of the existing emergency message dissemination schemes in the literature, achieves a predefined reliability in lossy channel. In this paper, we propose a novel scheme, called reliable emergency message dissemination scheme (REMD), which achieves a predefined reliability for message dissemination while satisfying delay requirements, for various channel conditions. We aim to guarantee very high reliability (e.g., 99%) in each hop, with low control overhead while keeping low end-to-end latency for time-critical applications. We employ zero-correlated unipolar orthogonal codes to combat hidden terminal problem. We exploit periodic beacons, to accurately estimate reception quality of 802.11p wireless link in each cell; then, we use this information to determine the optimal number of broadcast repetitions in each hop. In addition, to ensure reliability in multi-hop, we utilize cooperative communication. The simulation results show that REMD outperforms the existing well-known schemes in the literature. Furthermore, REMD satisfies latency requirements for time-critical vehicular applications and has less network overhead than the existing schemes.
- 3 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 21 (6) , 2360-2375
Local Traffic Aware Unicast Routing Scheme for Connected Car System
- 3 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 21 (6) , 2360-2375
Local Traffic Aware Unicast Routing Scheme for Connected Car System
- 1 July 2018
- Published by Elsevier in Vehicular Communications
- Vol. 13, 38-55
Quality of service aware multicasting in heterogeneous vehicular networks
- 1 July 2018
- Published by Elsevier in Vehicular Communications
- Vol. 13, 38-55
Quality of service aware multicasting in heterogeneous vehicular networks
- 2 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 18 (9) , 2539-2556
Dynamic Hierarchical Aggregation for Vehicular Sensing
Vehicular sensing has gained prominence in recent years with its use in entities, including traffic management centers, forensic authorities, and air pollution control units. It also provides end users with real-time street images, parking summaries, and road congestion status. To reduce bandwidth usage and improve the content value, the sensed data must be aggregated. Data aggregation is said to be efficient when the destination (i.e., a node that serves as a data collection point in the network) is capable of receiving sensed data from a significant proportion of vehicles. However, when a large number of vehicles attempt to send sensed data, the network becomes congested eventually causing packet losses and collisions. Thus, if aggregation is performed without considering key factors, such as number of vehicles and network dynamics, it is difficult to ensure the efficient collection of sensed data at the destination. In this paper, we propose a dynamic hierarchical aggregation scheme in which sensed data is aggregated using a hierarchy. Moreover, the hierarchy is dynamically updated based on theoretically estimated delivery efficiency. In particular, we perform partition and merge operations within the hierarchy to achieve an improved value of delivery efficiency. The simulation results show that the proposed scheme ensures efficient data collection even with stringent delay requirements and achieves scalability with respect to a number of vehicles in the network.
- 2 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 18 (9) , 2539-2556
Dynamic Hierarchical Aggregation for Vehicular Sensing
Vehicular sensing has gained prominence in recent years with its use in entities, including traffic management centers, forensic authorities, and air pollution control units. It also provides end users with real-time street images, parking summaries, and road congestion status. To reduce bandwidth usage and improve the content value, the sensed data must be aggregated. Data aggregation is said to be efficient when the destination (i.e., a node that serves as a data collection point in the network) is capable of receiving sensed data from a significant proportion of vehicles. However, when a large number of vehicles attempt to send sensed data, the network becomes congested eventually causing packet losses and collisions. Thus, if aggregation is performed without considering key factors, such as number of vehicles and network dynamics, it is difficult to ensure the efficient collection of sensed data at the destination. In this paper, we propose a dynamic hierarchical aggregation scheme in which sensed data is aggregated using a hierarchy. Moreover, the hierarchy is dynamically updated based on theoretically estimated delivery efficiency. In particular, we perform partition and merge operations within the hierarchy to achieve an improved value of delivery efficiency. The simulation results show that the proposed scheme ensures efficient data collection even with stringent delay requirements and achieves scalability with respect to a number of vehicles in the network.
- 26 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 662-670
Optimal Gateway Placement and Reliable Internet Access in Urban Vehicular Environments
Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.
- 26 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 662-670
Optimal Gateway Placement and Reliable Internet Access in Urban Vehicular Environments
Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20, 1-6
A Novel Architecture and Mechanism for On-Demand Services in Vehicular Networks with Minimum Overhead in Target Vehicle Tracking
Vehicular Ad hoc Networks (VANETs) are one of the building blocks for future Intelligent Transportation Systems (ITS). They will support applications for safety and entertainments on the streets. VANETs also provide an excellent potential for on-demand services. Such services in VANETs require real-time request-reply routing between vehicle client and service provider, and also tracking of client location. The vehicle requesting for a service acts as a client. The service provider communicates with clients through fixed base stations. Due to frequent link break- ups in VANET communications, maintaining a one-to- one communication path between service provider and client is an open issue. We refer to such one- to-one communication as the unicast service. In this paper, we propose a novel architecture to solve the unicast service provisioning and vehicle tracking in an integrated manner. Simulation results show that our proposed model reduces network overhead dramatically, and provides an on- demand unicast service with acceptable delivery delay and delivery ratio.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20, 1-6
A Novel Architecture and Mechanism for On-Demand Services in Vehicular Networks with Minimum Overhead in Target Vehicle Tracking
Vehicular Ad hoc Networks (VANETs) are one of the building blocks for future Intelligent Transportation Systems (ITS). They will support applications for safety and entertainments on the streets. VANETs also provide an excellent potential for on-demand services. Such services in VANETs require real-time request-reply routing between vehicle client and service provider, and also tracking of client location. The vehicle requesting for a service acts as a client. The service provider communicates with clients through fixed base stations. Due to frequent link break- ups in VANET communications, maintaining a one-to- one communication path between service provider and client is an open issue. We refer to such one- to-one communication as the unicast service. In this paper, we propose a novel architecture to solve the unicast service provisioning and vehicle tracking in an integrated manner. Simulation results show that our proposed model reduces network overhead dramatically, and provides an on- demand unicast service with acceptable delivery delay and delivery ratio.
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1012-1017
E-NC: PSO based enforced network coding in vehicular networks
In wireless networks, spectral efficiency is a vital issue in the wake of ever increasing bandwidth usage. To improve throughput, in wired and wireless networks, network coding is one of the promising solutions which has been used for a quite some time. On getting coding opportunity in a hop, coding gain is around 100% if physical layer networking, unlike linear network coding which offers maximum coding gain up-to 33%. However, PNC has symbol-level synchronization, carrier-frequency synchronization, and carrier-phase synchronization. The throughput elevate with number of nodes involved in physical layer network coding. In the literature, there is no proposal which increases the involvement of number nodes to elevate overall throughput of the network. In this paper, we are forcing multiple opposite direction routes to share common road segments without compromising delay and reliability requirements. We designed a new particle swarm optimization (PSO) mechanism which offers maximum throughput gain for the entire network. Through network coding such voluntary congestion is solved. Thus, higher packet delivery ratio can be achieved while keeping lower end to end delay which is verified by graphs.
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1012-1017
E-NC: PSO based enforced network coding in vehicular networks
In wireless networks, spectral efficiency is a vital issue in the wake of ever increasing bandwidth usage. To improve throughput, in wired and wireless networks, network coding is one of the promising solutions which has been used for a quite some time. On getting coding opportunity in a hop, coding gain is around 100% if physical layer networking, unlike linear network coding which offers maximum coding gain up-to 33%. However, PNC has symbol-level synchronization, carrier-frequency synchronization, and carrier-phase synchronization. The throughput elevate with number of nodes involved in physical layer network coding. In the literature, there is no proposal which increases the involvement of number nodes to elevate overall throughput of the network. In this paper, we are forcing multiple opposite direction routes to share common road segments without compromising delay and reliability requirements. We designed a new particle swarm optimization (PSO) mechanism which offers maximum throughput gain for the entire network. Through network coding such voluntary congestion is solved. Thus, higher packet delivery ratio can be achieved while keeping lower end to end delay which is verified by graphs.
- 1 October 2015
- Published by Elsevier in Vehicular Communications
- Vol. 2 (4) , 208-222
Dynamic spatial partition density-based emergency message dissemination in VANETs
- 1 October 2015
- Published by Elsevier in Vehicular Communications
- Vol. 2 (4) , 208-222
Dynamic spatial partition density-based emergency message dissemination in VANETs
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23766492,p. 274-279
M-PNC: Multi-hop physical layer network coding for shared paths in vehicular networks
In wireless networks, spectral efficiency is an important issue due to limited available bandwidth. Traditionally, when a receiver collects simultaneous transmissions, packets collide and the much meaningful information cannot be retrieved. Thus, through suitable scheduling, simultaneous transmissions to the receiver are avoided. However, in physical layer network coding, simultaneous transmissions are allowed and the combined signal is equivalent of XOR operation on air. A path from a source to a destination in unicast routing in VANET is called a flow; multiple flows may have common road segments. There will be heavy contention in such shared road segments resulting in lower throughput, lower packet delivery ratio and higher end to end delay. In this paper, we propose a multihop physical layer network coding structure to be used by multiple flows of unicast routing paths. We analyze throughput, end-to-end delay and coding gain with respect to number of routing flows and number of forwarders involved in network coding.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23766492,p. 274-279
M-PNC: Multi-hop physical layer network coding for shared paths in vehicular networks
In wireless networks, spectral efficiency is an important issue due to limited available bandwidth. Traditionally, when a receiver collects simultaneous transmissions, packets collide and the much meaningful information cannot be retrieved. Thus, through suitable scheduling, simultaneous transmissions to the receiver are avoided. However, in physical layer network coding, simultaneous transmissions are allowed and the combined signal is equivalent of XOR operation on air. A path from a source to a destination in unicast routing in VANET is called a flow; multiple flows may have common road segments. There will be heavy contention in such shared road segments resulting in lower throughput, lower packet delivery ratio and higher end to end delay. In this paper, we propose a multihop physical layer network coding structure to be used by multiple flows of unicast routing paths. We analyze throughput, end-to-end delay and coding gain with respect to number of routing flows and number of forwarders involved in network coding.