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.
To minimize energy consumption, efficient broadcasting in ad hoc networks requires the selection of small sets of forwarding nodes and the use of small transmission radii. However, the physical-layer characteristics of radio links are such that receivers may not be able to decode packets sent to them, even without multiple access interference. We present an analytical model to show that the transmission...
We show that, as the number of nodes in the network n tends to infinity, the maximum concurrent flow (MCF) and the minimum cut-capacity scale as Theta(n2r3(n)/k) for a random choice of k ges Theta(n) source-destination pairs, where r(n) is the communication range in the network. In addition, we show that it is possible to attain this optimal order throughput in interference-constrained networks if...
This paper introduces an integrated framework for multicast and unicast routing in mobile ad hoc networks (MANET) based on interest-defined mesh enclaves. Such meshes are connected components of a MANET that span the sources and receivers of unicast and multicast flows. We present the Protocol for Routing in Interest-defined Mesh Enclaves (PRIME), which establishes meshes that are activated and deactivated...
We present the design and performance of a new approach to packet switching for MANETs, which we call context aware protocol engines (CAPE). With CAPE, nodes disseminate information in the network by means of context-aware packet switching that enables the statistical multiplexing of bandwidth, processing and storage resources using integrated signaling covering channel access, routing and other functions,...
We present elliptic demarcation of information transfer (EDIT) as a scheme to maintain paths between a source and destination more robustly and limit signaling overhead incurred in mobile ad hoc networks (MANET). EDIT establishes regions of interest on demand, based on distances between a relay node and a source-destination pair, and maintains proactive signaling within this region of interest. We...
We present Hydra, the first multicast routing protocol for MANETs that establishes a multicast routing structure approximating the set of source-rooted shortest-path trees from multicast sources to receivers, without requiring the dissemination of control packets from each source of a multicast group. Hydra accomplishes this by dynamically electing a core for the mesh of a multicast group among the...
We present a new perspective on the design and analysis of routing protocols for mobile ad-hoc networks (MANETs). Routing metrics, such as distances or link states, result in an ordering of nodes in the network with respect to the origin of the metric. The manner in which the nodes of a network are ordered can give some insight into the performance of the routing protocol. We show how the use of multiple...
We present the CROWN (collaborative routing, scheduling and frequency assignment for wireless ad hoc networks) scheme. CROWN is a cross-layer optimization approach for spectrum-agile nodes to adjust their spectrum allocation and transmission scheduling according to the underlying traffic demands. Instead of choosing the optimal route based on predetermined transmission scheduling and frequency assignment...
In this paper, we compute the throughput capacity of random wireless ad hoc networks in which nodes are endowed with multipacket reception (MPR) capabilities. We show that lambda(n) = Theta((R(n))(1-2/alpha)/n1/alpha) bits per second constitutes a tight bound for the throughput capacity of random wireless ad hoc networks using physical model, where alpha > 2 is the path loss parameter in the physical...
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.