The concern of reducing power consumption and the schedule length (or makespan) has added new lev... more The concern of reducing power consumption and the schedule length (or makespan) has added new levels of complexities to the scheduling of task graphs on multiprocessors. Recent researches in the field have obtained considerable improvement in power consumption with a comparable makespan by exploring a large search space with mixed integer linear programming (MIP). However, MIP based solutions are applicable only to smaller instances of task graphs. In this paper, we propose a multi-objective genetic algorithm (P2Gen) that uses dynamic voltage/frequency scaling (DVFS) to perform Power (P) and Performance (P) aware scheduling. With DVFS, tasks are made to run on low voltages, which decreases their computation power. However, it also increases their execution costs and hence, is optimized with a genetic algorithm. In the first phase, P2Gen optimizes the makespan whereas the second phase uses DVFS with multiple tolerance levels of the obtained makespan to optimize both the objectives. T...
Security[16] is an essential feature for wired and wireless network[1]. But due to its unique cha... more Security[16] is an essential feature for wired and wireless network[1]. But due to its unique characteristics of MANETs[10], it creates a number of consequential security challenges to network. MANETs are vulnerable to various attacks[2], blackhole[12] is one of the possible attack. In this paper, we represent an intrusion detection[5] system for MANETs against blackhole attack using fuzzy logic[4]. Our system successfully detects the blackhole in the network and this information is passed to other nodes also. We also provide a detailed performance evaluation based on various network parameters. Our results show that the proposed system not only detects the blackhole[12] node, but improves the performance of AODV under the blackhole attack. General Terms Computer Network, Wireless Network, Manets, Security Issues.
2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2016
Duplication and dynamic voltage/frequency scaling (DVFS) creates an interesting trade-off for sch... more Duplication and dynamic voltage/frequency scaling (DVFS) creates an interesting trade-off for scheduling task graphs on multiprocessors to improve energy consumption and schedule length (or makespan). With DVFS, tasks are made to run on low voltages, which decreases their computation power. However, it also increases their execution costs and hence, may increase the schedule length. Furthermore, applying DVFS on processors does not impact the communication delay/energy consumption. Duplicating a task on multiple processors reduces the communication delay among them, which further reduces the schedule length. Although duplication reduces the communication energy among processors, it also increases the overall computation energy. In this paper, we explore this trade-off between duplication and DVFS, and propose a polynomial time heuristic to schedule task graphs on heterogeneous multiprocessors. The tasks are carefully duplicated with DVFS to reduce its impact on the computation energ...
Set Cover is one of the most studied optimization problems in Computer Science. In this paper, we... more Set Cover is one of the most studied optimization problems in Computer Science. In this paper, we target two interesting variations of this problem in a geometric setting: (i) Open image in new window , and (ii) Open image in new window problems. In both problems, the input consists of a set P of points and a set O of geometric objects in the plane. The objective is to maximize the number of points covered by a set \(O'\) of selected objects from O. In the MDC problem we restrict the objects in \(O'\) are pairwise disjoint (non-intersecting). Whereas, in the MIC problem any pair of objects in \(O'\) should not share a point from P (however, they may intersect each other). We consider various geometric objects as covering objects such as axis-parallel infinite lines, axis-parallel line segments, unit disks, axis-parallel unit squares, and intervals on a real line. For axis-parallel infinite lines both MDC and MIC problems admit polynomial time algorithms. On the other han...
Abstract A new method is proposed in the present work for identifying fault severity in the ball ... more Abstract A new method is proposed in the present work for identifying fault severity in the ball bearings. Proposed method named as multi-scale refined composite standard deviation fuzzy entropy is based on the improvement in the existing method called refined composite multi-scale fuzzy entropy. The acquired vibration signal is initially decomposed into numerous mode functions by ensemble empirical mode decomposition method. To investigate the performance of new method, methodology is split into two phases - detection and identification. In detection phase, response of a healthy system in comparison to the faulty system under different operating conditions are examined while estimation of fault severity in the inner and outer race of bearing is analyzed in identification phase. Accuracy of classifying fault severity by the proposed method has been verified by three well-established classifiers. Proposed methodology can be reliably used for fault diagnosis because of the remarkable results obtained.
IEEE Transactions on Green Communications and Networking
Duty cycling and data aggregation are widely used energy management techniques in sensor networks... more Duty cycling and data aggregation are widely used energy management techniques in sensor networks. In this paper, we investigate structure free aggregation in duty cycle sensor networks, which is used for reporting random events sensed by sensor nodes to a fixed sink. The objective is to optimize energy consumption as well as the event reporting time (ERT). To achieve the objective, first, an aggregation aware mixed integer linear formulation (named AMIP) is proposed. Later, three aggregation aware strategies have been proposed which are based on: distance of nodes to the sink node, link quality of nodes and both link quality and distance (hybrid). Finally, AMIP is used to optimize parameters for the proposed aggregation strategies. The techniques are implemented in Contiki operating system and are tested over Cooja network simulator as well as on a real test bed. It has been observed that the hybrid technique is more close to the optimal solution obtained from the AMIP. It minimizes the energy consumption and ERT and increases the aggregation gain as compared to the other approaches in simulation as well as in real experiments.
In this paper, an aggregation aware early event notification technique (AAEENT) is proposed for w... more In this paper, an aggregation aware early event notification technique (AAEENT) is proposed for wireless sensor networks characterised by unpredictable events. The novelties of the AAEENT are two folds. First, an aggregation aware reliable routing policy is proposed to deliver event's data over high throughput paths to final destination as early as possible. This reliable routing policy minimises the number of retransmissions, which in turn reduces network congestion. Second, temporal data aggregation has been used to minimise redundant data at each intermediate node. The proposed technique has been implemented in Contiki operating system and is evaluated over Cooja network simulator. From the results, it has been observed that due to reduced network bottlenecks in the proposed technique, the event notification time declined upto 35% and overall power consumption is reduced upto 37% in contrast to the constant delay based aggregation, random waiting based aggregation policy and the existing collect protocol.
19th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP) In Conjunction with IPDPS 2015, May 28, 2015
Duplication based heuristics have been widely utilized for scheduling communication intensive, pr... more Duplication based heuristics have been widely utilized for scheduling communication intensive, precedence constrained tasks on multiple processors. Duplicating the predecessor of a task on the processor to which the task is assigned can result in the minimization of the communication cost. This helps in reducing the schedule length. However, this reduction comes at the cost of extra computing power required to duplicate the tasks. We have tried to address this trade-off in this paper. We propose "controlled" duplication algorithms for scheduling real-time periodic tasks with end-to-end deadlines on heterogeneous multiprocessors. We observe that whether to duplicate tasks or not is decided by the task deadlines. In the case that the deadline can be met without duplication, more schedule holes are created. These holes can be used to schedule other tasks. Simulations show that the proposed algorithms efficiently utilize the holes and improve the success ratio by 15%.
IEEE Transactions on Parallel and Distributed Systems
Energy efficiency along with enhanced performance are two important goals of scheduling on multip... more Energy efficiency along with enhanced performance are two important goals of scheduling on multiprocessors. This paper proposes a Contention-aware, Energy Effïcient, Duplication based Mixed Integer Programming (CEEDMIP) formulation for scheduling task graphs on heterogeneous multiprocessors, interconnected in a distributed system or a Network on Chip architecture. The effect of duplication is studied with respect to minimizing: the makespan, the total energy for processing tasks and messages on processors and network resources respectively and the tardiness of tasks with respect to their deadlines. Optimizing the use of duplication with MIP provides both energy effïciency and performance by reducing the communication energy consumption and the communication latency. The contention awareness gives a more accurate estimation of the energy consumption. We also propose a corner case that allows the scheduling of a parent task copy after a copy of the child task which may lead to efficient schedules. It has been observed that the proposed MIP with a clustering based heuristic provides scalability and gives 10 to 30% improvement in energy with improved makespan and accuracy when compared with other duplication based energy aware algorithms.
AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without ... more AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without the required intervention of any existing infrastructure or centralized access point such as base station. The dynamic topology of MANET allows nodes to join and leave the ...
AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without ... more AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without the required intervention of any existing infrastructure or centralized access point such as base station. The dynamic topology of MANET allows nodes to join and leave the ...
The concern of reducing power consumption and the schedule length (or makespan) has added new lev... more The concern of reducing power consumption and the schedule length (or makespan) has added new levels of complexities to the scheduling of task graphs on multiprocessors. Recent researches in the field have obtained considerable improvement in power consumption with a comparable makespan by exploring a large search space with mixed integer linear programming (MIP). However, MIP based solutions are applicable only to smaller instances of task graphs. In this paper, we propose a multi-objective genetic algorithm (P2Gen) that uses dynamic voltage/frequency scaling (DVFS) to perform Power (P) and Performance (P) aware scheduling. With DVFS, tasks are made to run on low voltages, which decreases their computation power. However, it also increases their execution costs and hence, is optimized with a genetic algorithm. In the first phase, P2Gen optimizes the makespan whereas the second phase uses DVFS with multiple tolerance levels of the obtained makespan to optimize both the objectives. T...
Security[16] is an essential feature for wired and wireless network[1]. But due to its unique cha... more Security[16] is an essential feature for wired and wireless network[1]. But due to its unique characteristics of MANETs[10], it creates a number of consequential security challenges to network. MANETs are vulnerable to various attacks[2], blackhole[12] is one of the possible attack. In this paper, we represent an intrusion detection[5] system for MANETs against blackhole attack using fuzzy logic[4]. Our system successfully detects the blackhole in the network and this information is passed to other nodes also. We also provide a detailed performance evaluation based on various network parameters. Our results show that the proposed system not only detects the blackhole[12] node, but improves the performance of AODV under the blackhole attack. General Terms Computer Network, Wireless Network, Manets, Security Issues.
2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2016
Duplication and dynamic voltage/frequency scaling (DVFS) creates an interesting trade-off for sch... more Duplication and dynamic voltage/frequency scaling (DVFS) creates an interesting trade-off for scheduling task graphs on multiprocessors to improve energy consumption and schedule length (or makespan). With DVFS, tasks are made to run on low voltages, which decreases their computation power. However, it also increases their execution costs and hence, may increase the schedule length. Furthermore, applying DVFS on processors does not impact the communication delay/energy consumption. Duplicating a task on multiple processors reduces the communication delay among them, which further reduces the schedule length. Although duplication reduces the communication energy among processors, it also increases the overall computation energy. In this paper, we explore this trade-off between duplication and DVFS, and propose a polynomial time heuristic to schedule task graphs on heterogeneous multiprocessors. The tasks are carefully duplicated with DVFS to reduce its impact on the computation energ...
Set Cover is one of the most studied optimization problems in Computer Science. In this paper, we... more Set Cover is one of the most studied optimization problems in Computer Science. In this paper, we target two interesting variations of this problem in a geometric setting: (i) Open image in new window , and (ii) Open image in new window problems. In both problems, the input consists of a set P of points and a set O of geometric objects in the plane. The objective is to maximize the number of points covered by a set \(O'\) of selected objects from O. In the MDC problem we restrict the objects in \(O'\) are pairwise disjoint (non-intersecting). Whereas, in the MIC problem any pair of objects in \(O'\) should not share a point from P (however, they may intersect each other). We consider various geometric objects as covering objects such as axis-parallel infinite lines, axis-parallel line segments, unit disks, axis-parallel unit squares, and intervals on a real line. For axis-parallel infinite lines both MDC and MIC problems admit polynomial time algorithms. On the other han...
Abstract A new method is proposed in the present work for identifying fault severity in the ball ... more Abstract A new method is proposed in the present work for identifying fault severity in the ball bearings. Proposed method named as multi-scale refined composite standard deviation fuzzy entropy is based on the improvement in the existing method called refined composite multi-scale fuzzy entropy. The acquired vibration signal is initially decomposed into numerous mode functions by ensemble empirical mode decomposition method. To investigate the performance of new method, methodology is split into two phases - detection and identification. In detection phase, response of a healthy system in comparison to the faulty system under different operating conditions are examined while estimation of fault severity in the inner and outer race of bearing is analyzed in identification phase. Accuracy of classifying fault severity by the proposed method has been verified by three well-established classifiers. Proposed methodology can be reliably used for fault diagnosis because of the remarkable results obtained.
IEEE Transactions on Green Communications and Networking
Duty cycling and data aggregation are widely used energy management techniques in sensor networks... more Duty cycling and data aggregation are widely used energy management techniques in sensor networks. In this paper, we investigate structure free aggregation in duty cycle sensor networks, which is used for reporting random events sensed by sensor nodes to a fixed sink. The objective is to optimize energy consumption as well as the event reporting time (ERT). To achieve the objective, first, an aggregation aware mixed integer linear formulation (named AMIP) is proposed. Later, three aggregation aware strategies have been proposed which are based on: distance of nodes to the sink node, link quality of nodes and both link quality and distance (hybrid). Finally, AMIP is used to optimize parameters for the proposed aggregation strategies. The techniques are implemented in Contiki operating system and are tested over Cooja network simulator as well as on a real test bed. It has been observed that the hybrid technique is more close to the optimal solution obtained from the AMIP. It minimizes the energy consumption and ERT and increases the aggregation gain as compared to the other approaches in simulation as well as in real experiments.
In this paper, an aggregation aware early event notification technique (AAEENT) is proposed for w... more In this paper, an aggregation aware early event notification technique (AAEENT) is proposed for wireless sensor networks characterised by unpredictable events. The novelties of the AAEENT are two folds. First, an aggregation aware reliable routing policy is proposed to deliver event's data over high throughput paths to final destination as early as possible. This reliable routing policy minimises the number of retransmissions, which in turn reduces network congestion. Second, temporal data aggregation has been used to minimise redundant data at each intermediate node. The proposed technique has been implemented in Contiki operating system and is evaluated over Cooja network simulator. From the results, it has been observed that due to reduced network bottlenecks in the proposed technique, the event notification time declined upto 35% and overall power consumption is reduced upto 37% in contrast to the constant delay based aggregation, random waiting based aggregation policy and the existing collect protocol.
19th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP) In Conjunction with IPDPS 2015, May 28, 2015
Duplication based heuristics have been widely utilized for scheduling communication intensive, pr... more Duplication based heuristics have been widely utilized for scheduling communication intensive, precedence constrained tasks on multiple processors. Duplicating the predecessor of a task on the processor to which the task is assigned can result in the minimization of the communication cost. This helps in reducing the schedule length. However, this reduction comes at the cost of extra computing power required to duplicate the tasks. We have tried to address this trade-off in this paper. We propose "controlled" duplication algorithms for scheduling real-time periodic tasks with end-to-end deadlines on heterogeneous multiprocessors. We observe that whether to duplicate tasks or not is decided by the task deadlines. In the case that the deadline can be met without duplication, more schedule holes are created. These holes can be used to schedule other tasks. Simulations show that the proposed algorithms efficiently utilize the holes and improve the success ratio by 15%.
IEEE Transactions on Parallel and Distributed Systems
Energy efficiency along with enhanced performance are two important goals of scheduling on multip... more Energy efficiency along with enhanced performance are two important goals of scheduling on multiprocessors. This paper proposes a Contention-aware, Energy Effïcient, Duplication based Mixed Integer Programming (CEEDMIP) formulation for scheduling task graphs on heterogeneous multiprocessors, interconnected in a distributed system or a Network on Chip architecture. The effect of duplication is studied with respect to minimizing: the makespan, the total energy for processing tasks and messages on processors and network resources respectively and the tardiness of tasks with respect to their deadlines. Optimizing the use of duplication with MIP provides both energy effïciency and performance by reducing the communication energy consumption and the communication latency. The contention awareness gives a more accurate estimation of the energy consumption. We also propose a corner case that allows the scheduling of a parent task copy after a copy of the child task which may lead to efficient schedules. It has been observed that the proposed MIP with a clustering based heuristic provides scalability and gives 10 to 30% improvement in energy with improved makespan and accuracy when compared with other duplication based energy aware algorithms.
AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without ... more AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without the required intervention of any existing infrastructure or centralized access point such as base station. The dynamic topology of MANET allows nodes to join and leave the ...
AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without ... more AbstractMobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without the required intervention of any existing infrastructure or centralized access point such as base station. The dynamic topology of MANET allows nodes to join and leave the ...
Uploads
Papers by Jagpreet Singh