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.
In this paper, we present hybrid mesh tree, a new scatternet formation algorithm for Bluetooth ad hoc networks. The hybrid mesh tree constructs a mesh-shaped topology in one dense area and extended by tree-shaped topology in the other areas. First, hybrid mesh tree uses a designated root to construct a tree-shaped subnet and propagates a constant k in its downstream direction to determine new roots...
Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node's routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information,...
Multi-Point Relaying (MPR) is a well-known relay pruning algorithm that has proved to be useful for efficient dissemination in Mobile Ad hoc Networks (MANETs). But this technique may be useful for other tasks in MANET link-state routing as well. In particular, the approach is attractive for the selection of topology information to be flooded across the network. Requirements for such topology selection...
In this paper we present a survey on Genetic Operators for d-MST problem with a discussion. The contribution has two parts. The first part contains the specification of the proposed operators of crossing and mutation. The new operators offer the locality, complete heredity, and are nevertheless computationally efficient. We target to generate only valid solutions without intermediate stages such detection's...
The control of the topology of a network makes it possible for the network nodes to reduce their power of transmission while ensuring that network connectivity is preserved. This paper explains the need for energy consumption control in Wireless Mesh Networks (WMNs) and proposes a Local Minimum Shortest-Path Tree (LM-SPT) algorithm for topology control for the WMNs. The algorithm is distributed with...
Coding advantage refers to the potential for network coding to improve end-to-end throughput or reduce routing cost. How large can the coding advantage be? We investigate this fundamental question in the classic undirected network model. So far, all known networks where such potential exists are based on a special class of topologies known as combinatorial networks. We try to prove a rather small...
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.