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.
We present a localized algorithm (LTCA) for topology control in wireless sensor networks which has certain desirable properties. First, the algorithm is very simple, strictly local (requires 1-hop information of neighbors) and fast, requiring each node to communicate with its neighbors exactly twice. Second, LTCA does not assume the underlying graph to be a unit disk graph, and in fact works on general...
The critical issue in designing correlated data networks like Wireless Sensor Networks is to minimize the total cost of data transmission in the network, and decrease the amount of data flow. The problem of finding optimal aggregation tree for correlated data gathering in single sink network is considered as an NP-Complete problem and hence heuristic methods are usually applied to solve it [1]. In...
The major functions of a wireless sensor network (WSN) cannot be accomplished without collaboration among wireless sensor nodes. However, most of the work found in literature only focuses a specific type of collaboration, associated with the accomplishment of a certain task, such as: signal processing, routing, etc. In this paper, we present a graph-based model of collaborative work created specifically...
Ad hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use multipath routing where packets (voice/video/...) from a source to a destination travel in two or more maximal disjoint paths. We observe that the need to find a set of maximal disjoint paths can be relaxed by finding a set of paths S wherein only bottlenecked links...
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.