The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Arsenic poisoning due to contaminated groundwater in West Bengal, India, has been thought to be limited to the Lower Ganga Plain (LGP). Skin lesions in villagers led us to evaluate arsenic exposure in the Moyna and Adrebok villages of 24 Porgana (s) West Bengal, India in the LGP where tube wells water was used for drinking water. Results of this investigation are indicated that the groundwater of...
A lot of research has been done in finding range-based methods such as computing RSSI, time of arrival, angle of arrival or time difference of arrival and range-free methods such as centroid computation, DV-hop and approximate position in triangle, for localization in wireless sensor networks. Range-based methods estimate location more precisely than range-free methods. However, range-free methods...
This paper introduces higher dimensional consensus, a framework to capture a number of different, but, related distributed, iterative, linear algorithms of interest in sensor networks. We show that, by suitably choosing the iteration matrix of the higher dimensional consensus, we can capture, besides the standard average-consensus, a broad range of applications, including sensor localization, leader-follower,...
This paper presents a distributed sensor localization algorithm with inter-sensor distance information in m-dimensional Euclidean space using only m + 1 anchors (sensors that know their exact locations). Under the assumption that the M sensors (with unknown locations) lie in the convex hull of the m + 1 anchors and the underlying network is connected, we derive a linear algorithm that employs barycentric...
A sample path large deviations principle is established for the (scaled) vector of number of customers in a Jackson network of many-server queues, in the asymptotic regime where the arrival rate at each queue and the number of servers increase to infinity in a specified fashion. This result is obtained under the assumption of (possibly time-inhomogeneous) Markovian service and routing, and a condition...
The authors presented an algorithm to localize sensors in m-dimensional Euclidean space Ropfn with unknown locations assuming the following: (1) there are (m + 1) sensors that know their absolute coordinates-the anchors; (2) each sensor communicates with m + 1 of its neighbors; and (3) the sensors lie in the convex hull of the anchors. The localization algorithm is a generalization of consensus-it...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.