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.
Target tracking is a main application of wireless sensor networks (WSNs), and has been studied widely \cite{tian06RTAS, Bahl2000INFOCOM}. In this work, we study multiple objects tracking problem using WSNs, in which we assume no equipment is carried by the object and the tracking procedure is passive. We first show that without carefully design, Received Signal Strength Indicator (RSSI) and Link Quality...
Data collection is one of the most important functions provided by wireless sensor networks. In this paper, we study the theoretical limitations of data collection and data aggregation in terms of delay and capacity for a wireless sensor network where n sensors are randomly deployed. We consider two different communication scenarios (with or without aggregation) under physical interference model....
Data aggregation is a primitive communication task in wireless sensor networks (WSNs). In this paper, we study designing data aggregation schedules under the Protocol Interference Model for answering queries. Given a network consisting of a set of nodes V distributed in a two-dimensional plane, we address different kinds of queries in this paper. First and foremost, we consider a single one-off query...
In this paper, we study efficient data collection in wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum number of messages to be sent by all nodes, or the minimum total energy costs by all nodes. We analytically prove that all proposed methods are either optimum or within constants factor of the optimum. We then investigate the...
We mainly study the achievable multicast throughput (AMT) for homogeneous wireless ad hoc networks under Gaussian channel model. We focus on two typical random networks, i.e., random extended networks (REN) and random dense networks (RDN). In REN and RDN, n nodes are randomly distributed in the square region with side-length ??n and 1, respectively. We randomly choose ns nodes as the sources of multicast...
The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant contexts. Classically, trilateration is widely employed for testing network localizability; even in many cases it wrongly recognizes a localizable graph as non-localizable. In this study, we analyze the limitation of trilateration...
Sleep scheduling is a widely used mechanism in wireless sensor networks (WSNs) to reduce the energy consumption since it can save the energy wastage caused by the idle listening state. In a traditional sleep scheduling, however, sensors have to start up numerous times in a period, and thus consume extra energy due to the state transitions. The objective of this paper is to design an energy efficient...
In this paper, we focus on the networking-theoretic multicast capacity for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when all nodes are individually power-constrained. During the transmission, the power decays along path with the attenuation exponent alpha > 2. In REN and RDN, n nodes are randomly distributed in the square region with side-length...
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.