Pratap Kumar Sahu

Pratap Kumar Sahu

Auto-generated profile, based on publicly available information

Pratap Kumar Sahu

Dept. of Computer Science and Operation Research, University of Montreal, Montreal (QC), Canada

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 July 2015 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
ZSZhengguo Sheng
Zhengguo Sheng
CMChinmaya Mahapatra
Chinmaya Mahapatra
VLVictor C. M. Leung
Victor C. M. Leung
Min ChenMin Chen
Min Chen
PSPratap Kumar Sahu
Pratap Kumar Sahu
Advances in future computing to support emerging sensor applications are becoming more important as the need to better utilize computation and communication resources and make them energy efficient. As a result, it is predicted that intelligent devices and networks, including mobile wireless sensor networks (MWSN), will become the new interfaces to support future applications. In this paper, we propose a novel approach to minimize energy consumption of processing an application in MWSN while satisfying a certain completion time requirement. Specifically, by introducing the concept of cooperation, the logics and related computation tasks can be optimally partitioned, offloaded and executed with the help of peer sensor nodes, thus the proposed solution can be treated as a joint optimization of computing and networking resources. Moreover, for a network with multiple mobile wireless sensor nodes, we propose energy efficient cooperation node selection strategies to offer a tradeoff between fairness and energy consumption. Our performance analysis is supplemented by simulation results to show the significant energy saving of the proposed solution.

15 April 2013 in IEEE Sensors Journal
Verified
Journal Article
Closed access
PSPratap Kumar Sahu
Pratap Kumar Sahu
EWEric Hsiao-Kuang Wu
Eric Hsiao-Kuang Wu
JSJagruti Sahoo
Jagruti Sahoo
Localization is a key issue in wireless sensor networks. The geographical location of sensors is important information that is required in sensor network operations such as target detection, monitoring, and rescue. These methods are classified into two categories, namely range-based and range-free. Range-based localizations achieve high location accuracy by using specific hardware or using absolute received signal strength indicator (RSSI) values, whereas range-free approaches obtain location estimates with lower accuracy. Because of the hardware and energy constraints in sensor networks, RSSI offers a convenient method to find the position of sensor nodes. However, in the presence of channel noise, fading, and attenuation, it is not possible to estimate the actual location. In this paper, we propose an RSSI-based localization scheme that considers the trend of RSSI values obtained from beacons to estimate the position of sensor nodes. Through applying polynomial modeling on the relationship between received RSSI and distance, we are able to locate the maximum RSSI point on the anchor trajectory. Using two such trajectories, the sensor position can be determined by calculating the intersection point of perpendiculars passing through the maximum RSSI point on each trajectory. In addition, we devised schemes to improve the localization method to perform under a variety of cases such as single trajectory, unavailability of RSSI trends, and so. The advantage of our scheme is that it does not rely on absolute RSSI values and hence, can be applied in dynamic environments. In simulations, we demonstrate that the proposed localization scheme achieves higher location accuracy compared with existing localization approaches.

1 August 2011 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JSJagruti Sahoo
Jagruti Sahoo
EWEric Hsiao-Kuang Wu
Eric Hsiao-Kuang Wu
PSPratap Kumar Sahu
Pratap Kumar Sahu
MGMario Gerla
Mario Gerla
Vehicular ad hoc networks (VANETs) have recently been considered as an attractive network architecture to provide various services ranging from road safety to entertainment applications. In this paper, we propose an IEEE-802.11-based multihop broadcast protocol to address the issue of emergency message dissemination in VANETs. The protocol adopts a binary-partition-based approach to repetitively divide the area inside the transmission range to obtain the furthest possible segment. The forwarding duty is then delegated to a vehicle chosen in that segment. Aside from accomplishing directional broadcast for highway scenario, the protocol also exhibits good adaptation to complex road structures. The main focus of the paper lies in reducing broadcast delay, which is an important factor for time-critical safety applications. Most importantly, the contention delay remains almost constant, irrespective of vehicle density. Mathematical analysis is performed to assess the effectiveness of the protocol. Simulation results demonstrate that the proposed protocol imparts greater performance in terms of latency and message progress when compared with contemporary multihop broadcast protocols for VANETs.

4 September 2012 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
PSPratap Kumar Sahu
Pratap Kumar Sahu
EWEric Hsiao-Kuang Wu
Eric Hsiao-Kuang Wu
JSJagruti Sahoo
Jagruti Sahoo
MGMario Gerla
Mario Gerla
Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc. Multihop information dissemination in VANETs is constrained by the high mobility of vehicles and the frequent disconnections. Currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. To obtain destination position, some protocols use flooding, which can be detrimental in city environments. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.

18 June 2013 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JSJagruti Sahoo
Jagruti Sahoo
EWEric Hsiao-Kuang Wu
Eric Hsiao-Kuang Wu
PSPratap Kumar Sahu
Pratap Kumar Sahu
MGMario Gerla
Mario Gerla
Vehicular ad hoc networks (VANETs) provide the communication framework for the dissemination of safety-critical messages such as beacons and emergency messages. The communication channel witnesses significant network load generated by frequently exchanged beacons. Under high-density situations, it leads to a serious scalability problem in VANETs. Moreover, contention-based medium access control (MAC) protocols suffer from a great number of packet collisions, and as a result, the reliability and latency of safety messages are severely affected. Because of the periodic nature of beacons, time-division multiple access (TDMA) can be a good choice over contention-based MAC. In this paper, we propose congestion-controlled-coordinator-based MAC (CCC-MAC), which is a time-slot-based medium access protocol that addresses beacons and emergency messages. Basically, the network is virtually partitioned into a number of segments. Within a segment, medium access is accomplished by using a time-slot-scheduling mechanism supervised by a local coordinator vehicle. A significant number of vehicles can be supported under the proposed configuration. In fact, the proposed scheduling mitigates channel congestion by reducing the transmission time of beacons through the use of multiple data rates. Bandwidth utilization is also improved by reusing the unoccupied time slots. Finally, CCC-MAC ensures fast and reliable propagation of emergency messages by employing a pulse-based reservation mechanism. In the simulations, we demonstrate the ability of CCC-MAC to scale well in different vehicular density scenarios. Moreover, it outperforms existing MAC-layer protocols with respect to packet reception probability and latency of safety messages.

1 August 2009
Verified
Conference Paper
Closed access
JSJagruti Sahoo
Jagruti Sahoo
EWEric Hsiao Kuang Wu
Eric Hsiao Kuang Wu
PSPratap Kumar Sahu
Pratap Kumar Sahu
MGMario Gerla
Mario Gerla
Vehicular Ad Hoc Network has recently been considered as attractive network architecture to provide various services ranging from road safety to entertainment applications. In this paper, we propose an IEEE 802.11 based multihop broadcast protocol to address the issue of safety message dissemination in Vehicular Ad Hoc Networks. This position- based protocol adopts a repetitive 2-partition method to divide the area inside transmission range resulting in a furthest narrow segment and delegates the forwarding duty to a vehicle chosen in the furthest segment. The main focus of the paper lies in reducing broadcast delay which is an important factor in time critical safety applications. We attempt to attain consistent performance irrespective of node density and different VANET scenarios. In addition to this, the protocol also solves the hidden terminal problem of multihop broadcasting. Simulation results show that our protocol achieves greater performance in terms of latency and message progress when compared with other well known multihop broadcast protocols for Vehicular Ad Hoc Networks.