Results 1 - 10 of 108,031

A CONVEX OPTIMIZATION METHOD FOR AUTONOMOUS SELF-ORGANIZATION IN DYNAMIC WIRELESS NETWORKS

by Christopher Cobden Davis, See Profile, Jaime Llorca, Stuart D. Milner, Christopher C. Davis , 2008
"... A convex optimization method for autonomous self-organization in dynamic wireless networks ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
A convex optimization method for autonomous self-organization in dynamic wireless networks

WAVEFORMS FOR DYNAMIC WIRELESS NETWORKS: IS LAYERING

by A Good Idea
"... Software radios offer an unprecedented degree of flexibility to designers of wireless networks. SDR enables dynamic modification of physical layer parameters which can be used to improve overall system performance. However, it is difficult to exploit this opportunity. Excessive flexibility leads to ..."
Abstract - Add to MetaCart
Software radios offer an unprecedented degree of flexibility to designers of wireless networks. SDR enables dynamic modification of physical layer parameters which can be used to improve overall system performance. However, it is difficult to exploit this opportunity. Excessive flexibility leads

Dynamic Wireless Network in Cooperative Communications

by Viji M, Mrs Pretty Babu
"... Abstract- Cooperative communication has become a tremendous interest in Wireless Network. This type of cooperative communication is used for improving the network capacity in wireless network by reducing the interference and also improving the transmission power. In a normal networking communication ..."
Abstract - Add to MetaCart
Abstract- Cooperative communication has become a tremendous interest in Wireless Network. This type of cooperative communication is used for improving the network capacity in wireless network by reducing the interference and also improving the transmission power. In a normal networking

Lightweight Neighborhood Cardinality Estimation in Dynamic Wireless Networks

by Marco Cattani, Marco Zuniga, Andreas Loukas, Koen Langendoen
"... Abstract—We address the problem of estimating the neighborhood cardinality of nodes in dynamic wireless networks. Different from previous studies, we consider networks with high densities (a hundred neighbors per node) and where all nodes estimate cardinality concurrently. Performing concurrent esti ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—We address the problem of estimating the neighborhood cardinality of nodes in dynamic wireless networks. Different from previous studies, we consider networks with high densities (a hundred neighbors per node) and where all nodes estimate cardinality concurrently. Performing concurrent

Minimum-Energy Broadcast Routing in Dynamic Wireless Networks ∗

by Afonso Ferreira Andaubinjarry , 2011
"... One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. A good example is the minimum-energy broadcast routing problem for a static network in the plane, which attracted a great deal of attention these past years. The problem is ..."
Abstract - Add to MetaCart
, namely that computing a Minimum Spanning Tree of a planar network in the presence of mobility is actually NP-Complete. This result implies that the above approximation solution cannot be used in dynamic wireless networks. On the positive side, we give a polynomial-time algorithm to build a rooted

Hierarchical routing over dynamic wireless networks

by Dominique Tschopp, Suhas Diggavi, Matthias Grossglauser - IN SIGMETRICS , 2007
"... Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of consuming throughput available for data transmission, which is a precious resource in wireless networks. In this paper, w ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of consuming throughput available for data transmission, which is a precious resource in wireless networks. In this paper

A distributed architecture for multimedia in dynamic wireless networks

by Chunhung Richard Lin, Mario Gerla - Global Telecommunications Conference (GLOBECOM '95), IEEE , 1995
"... The paper presents a self-organizing, wireless mobile radio net-work for multimedia support. The proposed architecture is distri-buted and it has the capability of rapid deployment and dynamic reconfiguration. Without the need of base stations, this architec-ture can operate in areas without a wired ..."
Abstract - Cited by 27 (4 self) - Add to MetaCart
The paper presents a self-organizing, wireless mobile radio net-work for multimedia support. The proposed architecture is distri-buted and it has the capability of rapid deployment and dynamic reconfiguration. Without the need of base stations, this architec-ture can operate in areas without a

Simulating Adaptive Routing in Highly Dynamic Wireless Networks

by Ralph Jansen - In Proceedings of the 12th European Simulation MultiConference , 1998
"... Small battery powered hand held computers are becoming more and more important for the daily work. The growing number of these mobile units demand for communication structures which are specially tailored for their needs. A lot of research has been done, especially in the area of cellular networks, ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
, leading to the construction of highly reliable, wireless networks offering acceptable bandwidth for data transfer. However, cellular networks require a well organized infrastructure and cause considerable costs for setup and operation. In order to gain more flexibility ad-hoc networks have been developed

Robust geo-routing on embeddings of dynamic wireless networks

by Suhas Diggavi, Matthias Grossglauser, et al. - IN INFOCOM , 2007
"... Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This is of particular interest when either absolute coordinates for geographic routing are unavailable or when they poorly reflec ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
reflect the underlying connectivity in the network. We focus on dynamic networks induced by time-varying fading and mobility. This requires that the embedding is stable over time, whereas the focus of most existing embedding algorithms is on low distortion of single realizations of a graph. We develop a

Automatic service selection in dynamic wireless network

by George J. Lee, John Wroclawski - First ACM International Workshop WMASH’03 (2003
"... We consider the use of machine learning agents to autonomously and continually select among wireless access services available to a user. The work in this thesis is part of the Personal Router project; a technical research program aimed at reshaping the wireless network access market towards greater ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
We consider the use of machine learning agents to autonomously and continually select among wireless access services available to a user. The work in this thesis is part of the Personal Router project; a technical research program aimed at reshaping the wireless network access market towards
Results 1 - 10 of 108,031