#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Localization is an important issue for Wireless Sensor Networks in a wireless sensor network. A mobile sensor may change its position rapidly and thus require localization calls frequently. It is important to control the number of localization calls, as it is rather expensive. The existing schemes for reducing the frequency of localization calls for mobile… (More)

- B. Sau, K. Mukhopadhyaya
- 2009 First International Communication Systems…
- 2009

Localization is an important issue for Wireless Sensor Networks (WSN). We consider a WSN consisting of identical sensors. All known distances between the sensors are assumed to be less than the communication range of the sensors and all unknown distances greater. We also assume that the communication range is at least twice as much as the sensing range.… (More)

- B. Sau, K. Mukhopadhyaya
- 2008 Fourth International Conference on Wireless…
- 2008

Centralized localization dissipates a lot of energy in pooling the proximity information of the individual nodes. In contrast a distributed algorithm usually uses only local information at each node. Most localization algorithms available in the literature are are anchor based or they estimate the position of the sensors at the cost of losing accuracy. In… (More)

A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configuration, the positions of the nodes may be computed uniquely in finite time. Therefore, identifying localizable networks is an important function. If the complete information about… (More)

- Buddhadeb Sau, Krishnendu Mukhopadhyaya
- 2006 IFIP International Conference on Wireless…
- 2004

Finding the location of an object, other than sensor in a sensor network is an important problem. Here a technique is proposed to find the location of objects in a sensor grid. The locations of the sensors are assumed to be known. A sensor can only sense the number of objects present in its neighborhood. This small information injects low traffic in the… (More)

Autonomous mobile robots are capable of moving through an environment where human access is difficult or impossible. Due to the low cost and long life cycle of a passive RFID tag, the identification of an object by passive RFID tags is gaining its popularity. Path (e.g., road) following by mobile robots based on paint line detection has recently been… (More)

In recent technological advances, RFID system is efficient for finding the position or identifying an object in an environment where direct human access is difficult or impossible. In this paper, we introduce 2-sensing covered (each point of the application field falls within the sensing zone of at least two readers) wireless networks of anchor-free RFID… (More)

- Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau
- ArXiv
- 2017

Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed independently by each robot so that all robots meet at a single node after finite time. The robots operate in Look-Compute-Move cycles. In each cycle, a robot takes a snapshot of the… (More)

- Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau
- ArXiv
- 2016

In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in R, d ≥ 2, for a system of n static points and m mobile points having motion defined by rational parametric functions. We have shown that the corresponding Euclidean 1-center function is a piecewise differentiable function and have… (More)

A distance based network localization determines the positions of the nodes in the network subject to some distance constraints. The network localization problem may be modeled as a non-convex nonlinear optimization problem with distance constraints which are either convex or non-convex. Existing network localization algorithms either eliminate the… (More)