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.
This paper investigates accelerated gossip algorithms for distributed computations in networks where shift-registers are utilized at each node. By using tools from matrix analysis, we prove the existence of the desired acceleration and establish the fastest rate of convergence in expectation for two-register symmetric gossip. Some classes of networks with regular graph topologies are studied in detail...
The sensor network localization problem with distance information is to determine the positions of all sensors in a network, given the positions of some of the sensors and the distances between some pairs of sensors. In sequential localization algorithms were proposed for localizing classes of networks whose sensors possess either a ??trilateration?? or ??bilateration?? ordering, and graph rigidity...
The sensor network localization problem with distance information is to determine the positions of all the sensors in a network given the positions of some sensors and the distances between some pairs of sensors. One approach to localize a large network is to divide the network into smaller subnetworks whereby each subnetwork is localized in its own coordinate system. We present two algorithms which...
This paper studies a modified version of the Vicsek's problem, also known as the "consensus problem". Vicsek et al. (1995) consider a discrete-time model consisting of n autonomous agents all moving in the plane with the same speed but with different headings. Each agent's heading is updated using a local rule based on the average of the headings of its "neighbors". We consider...
The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. We present a specialized localization algorithm and identify the graph properties of some classes of networks that can be localized by the algorithm. We also give an important application of...
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.