Neeraj Mittal

Learn More
Cognitive radio (CR) technology is a promising emerging technology that enables a more efficient usage of already assigned spectrum. However, before CR networks can be deployed, new algorithms and protocols need to be developed. When forming an ad-hoc cognitive radio network (CRN), one of the fundamental tasks is to determine the neighbors of each node and(More)
This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single(More)
Wormhole attack is a type of replay attack in wireless networks that has serious consequences and is hard to defend against. This is because the attacker does not need to modify packets or compromise wireless nodes. This paper introduces Wormeros, a new framework to detect wormhole attacks in wireless networks. The framework contains two phases namely(More)
We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate. We show that a slice exists for a global predicate iff the predicate is a regular(More)
Detecting termination of a distributed computation is a fundamental problem in distributed systems. We present two optimal algorithms for detecting termination of a non-diffusing distributed computation for an arbitrary topology. Both algorithms are optimal in terms of message complexity and detection latency. The first termination detection algorithm has(More)
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that contains all consistent cuts of the original computation that satisfy the predicate. We prove that slice exists for all global predicates. We also establish that it is, in general,(More)
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type (or a group) with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their(More)