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.
The loose coupling and the inherent scalability make publish/subscribe systems an ideal candidate for event-driven services for wireless networks using low power protocols such as IEEE 802.15.4. This work introduces a distributed algorithm to build and maintain a routing structure for such networks. The algorithm dynamically maintains a multicast tree for each node. While previous work focused on...
We present a distributed algorithm for joint power control, routing and scheduling in multihop wireless networks. The algorithm also provides for Quality of Service (QoS) guarantees, namely, end-to-end mean delay guarantees and hard deadline guarantees, for different users. It is easily implementable and works by giving local dynamic priority to flows requiring QoS, the priority being a function of...
This work considers the problem of communication in dense and large scale wireless networks composed of resource-limited nodes. In this kind of networks, a massive amount of data is becoming increasinglyavailable, and consequently implementing protocols achievingerror-free communication channels constitutes an importantchallenge. Indeed, in this kind of networks, the prevention of messageconflicts...
Wireless networks progress into subsequent creation to afford quicker and superior services, a key in technology Wireless mesh networks have been emerged in recent times. A wireless mesh network comprised of radio nodes which a form of wireless ad hoc network. In wireless mesh network nodes are combination of mesh routers and mesh clients. Wireless mesh network shows potential wireless technology...
Recently there have been numerous studies exploring the benefits of the coalition formation in a cognitive radio network and it has been shown that coalition formation tends to improve the performance of cognitive radio networks. In this paper, we use the concepts from matching theory to form coalitions of varying size among cognitive radio users for cooperative spectrum sensing under target detection...
In this paper, we study completely uncoupled learning algorithms for general utility maximization. We illustrate the algorithm with a wireless network application viz distributed user association. Our main contribution is expansion of achievable rate region by allowing time sharing of resources, which the previous works based on completely uncoupled strategies have ignored. First, we present a distributed...
Caching popular contents at the edge of wireless networks has recently emerged as a promising technology to improve the quality of service for mobile users, while balancing the peak-to-average transmissions over backhaul links. In contrast to existing works, where a central coordinator is required to design the cache placement strategy, we consider a distributed caching problem which is highly relevant...
Recently there have been numerous studies exploring the benefits of the coalition formation in a cognitive radio network and it has been shown that coalition formation tends to improve the performance of cognitive radios. In this paper, we use the concepts from matching theory to form coalitions among cognitive radio users for cooperative spectrum sensing under target detection probability constraint...
Along with the spectrum resources increasingly scarce, the Cognitive Radio Networks (CRNs) are drawn more and more attention. Most of existing results on CRNs aim at utilizing wireless spectrum efficiently, however, the network becomes invalid easily due to stochastic activities of Primary Users (PUs). How to sustain the connectivity of the network becomes more and more challenging. In traditional...
Submodular maximization enables efficient approximation of machine learning, networking, and language processing problems. Typically, these problems have been shown to have matroid constraints, which generalize matching and partition conditions. Developing scalable, distributed submodular optimization algorithms that guarantee the same performance as centralized techniques has been an active area...
Referred to as the directed virtual backbone, a directed connected dominating set (DCDS) is a subgraph of the graph representation of wireless networks in which each node has a different transmission range and is equipped with a directional antenna. Considering the applications of DCDS, the size of the DCDS and the overhead for DCDS construction should be minimized. While a number of protocols to...
In this paper we consider distributed localization in a wireless peer-to-peer network. Each node is required to estimate the geographical configuration of the whole network (i.e., the positions of all nodes regardless of link availability) based on local processing and iterated information exchange with neighbors. We propose a new weighted-average consensus method based on received-signal-strength...
In this paper, distributed relay selection in cooperative wireless networks is modeled as a Chinese restaurant game (CRG). Specifically, the CRG is used to model strategic relay selection decisions of source nodes, taking into account negative network externality due to the potential sharing of relay nodes among source nodes. In turn, a distributed relay selection algorithm is proposed and shown to...
In a peer-to-peer wireless network, efficient distributed scheduling algorithms generally require all active nodes to acquire the state information of their respective neighbors, e.g., their queue lengths. However, information exchange between nodes is challenging in the absence of a collision-free schedule, mainly due to the half duplex design of today's radios. This paper studies medium access control...
We consider online in-network regression over wireless networks. We model the distributed regression as a least square problem and perform the computation over an overlay computational structure that is identical to the multilayer back-propagation of neural networks. The overlay is aligned to the physical topology of the network. The sources of the explanatory (input) and response (output) variables...
This paper addresses the use of distributed coherent communication techniques across a wireless network of tactical radios to enable extended-range communications. Conventional tactical communication systems providing multi-kilometer terrestrial ranges utilize large and costly manpack or vehicular-mount radios. In this paper we discuss techniques for distributing the transmit functions coherently...
We consider the problem of scheduling wireless networks with stochastic packet arrivals on the links and constant transmission rates. We propose a scheduling policy based on solving a Maximum Weighted Independent Set (MWIS) problem at each time slot on a conflict graph that incorporates all the interference constraints. Due to the computational difficulty of solving the MWIS on general graphs, we...
We consider the problem of estimation from noisy relative measurements in a network. In previous work, a distributed scheme for obtaining least-squares (LS) estimates was developed based on the Jacobi algorithm; in a synchronous version, the algorithm was shown to converge exponentially and bounds on the rate of convergence have been obtained. In this paper, we design and analyze a new class of distributed...
In this paper, we propose a set of heuristics to be used within greedy algorithms to build connected dominating sets (CDSs). These algorithms depends on a heuristic and we show that the selection of such heuristic is fundamental to optimizing system operation, both in terms of energy consumption and data transmission. Based on some parameters such as the node's degree, the distances between nodes...
We consider in-network distributed implementations of some stochastic approximation type estimation algorithms, subject to transmission constraints in wireless networks. Based on the analysis of asynchronous stochastic approximation schemes, we formulate the problem of optimizing the transmission schedule subject to constraints imposed by wireless transmission, so as to maximize the speed of convergence...
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.