Partha Sarathi Mandal - INRIA Futurs

Partha Sarathi Mandal
Are you Partha Sarathi Mandal?

Claim your profile, edit publications, add additional information:

Contact Details

Partha Sarathi Mandal
INRIA Futurs

Pubs By Year

External Links

Pub Categories

Computer Science - Distributed; Parallel; and Cluster Computing (9)
Computer Science - Data Structures and Algorithms (2)
Computer Science - Networking and Internet Architecture (2)
Computer Science - Cryptography and Security (1)
Mathematics - Mathematical Physics (1)
Quantum Physics (1)
Mathematical Physics (1)

Publications Authored By Partha Sarathi Mandal

Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we study barrier sweep coverage with mobile sensors where the barrier is considered as a finite length continuous curve on a plane. The coverage at every point on the curve is time-variant. Read More

The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can even be solved for very weak, \emph{oblivious} robots: robots which cannot maintain state from one round to the next. The oblivious robot model is hence attractive from a self-stabilization perspective, where state is subject to adversarial manipulation. Read More

There has been a wide interest in designing distributed algorithms for tiny robots. In particular, it has been shown that the robots can complete certain tasks even in the presence of faulty robots. In this paper, we focus on gathering of all non-faulty robots at a single point in presence of faulty robots. Read More

We study a generalized scheme of Swanson Hamiltonian from a second-derivative pseudosupersymmetric approach. We discuss plausible choices of the underlying quasi-Hamiltonian and consider the viability of applications to systems like the isotonic oscillator and CPRS potential. Read More

Localization is one of the most important factor in wireless sensor networks as many applications demand position information of sensors. Recently there is an increasing interest on the use of mobile anchors for localizing sensors. Most of the works available in the literature either looks into the aspect of reducing path length of mobile anchor or tries to increase localization accuracy. Read More

Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \cite{Li09}. In this paper we have proposed an {\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed algorithm guarantees maximum spreading in $O(\sqrt{n})$ rounds without creating any coverage hole. Read More

Data inconsistencies are present in the data collected over a large wireless sensor network (WSN), usually deployed for any kind of monitoring applications. Before passing this data to some WSN applications for decision making, it is necessary to ensure that the data received are clean and accurate. In this paper, we have used a statistical tool to examine the past data to fit in a highly sophisticated prediction model i. Read More

Position verification in wireless sensor networks (WSNs) is quite tricky in presence of attackers (malicious sensor nodes), who try to break the verification protocol by reporting their incorrect positions (locations) during the verification stage. In the literature of WSNs, most of the existing methods of position verification have used trusted verifiers, which are in fact vulnerable to attacks by malicious nodes. They also depend on some distance estimation techniques, which are not accurate in noisy channels (mediums). Read More

Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation technique can help greatly to reduce power consumption. Read More

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Read More