Results 1 
9 of
9
Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
, 2000
"... We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints connectivity and biconnectivity, and one optimization objective ..."
Abstract

Cited by 690 (3 self)
 Add to MetaCart
We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints connectivity and biconnectivity, and one optimization objective maximum power used. We present two centralized algorithms for use in static networks, and prove their optimality. For mobile networks, we present two distributed heuristics that adaptively adjust node transmit powers in response to topological changes and attempt to maintain a connected topology using minimum power. We analyze the throughput, delay, and power consumption of our algorithms using a prototype software implementation, an emulation of a powercontrollable radio, and a detailed channel model. Our results show that the performance of multihop wireless networks in practice can be substantially increased with topology control.
Distributed topology control for power efficient operation in multihop wireless ad hoc networks
, 2001
"... Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connecti ..."
Abstract

Cited by 380 (18 self)
 Add to MetaCart
(Show Context)
Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connectivity. Specifically, based on the directional information, a node grows it transmission power until it finds a neighbor node in every direction. The resulting network topology increases network lifetime by reducing transmission power and reduces traffic interference by having low node degrees. Moreover, we show that the routes in the multihop network are efficient in power consumption. We give an approximation scheme in which the power consumption of each route can be made arbitrarily close to the optimal by carefully choosing the parameters. Simulation results demonstrate significant performance improvements. I.
Faulttolerant and 3Dimensional Distributed Topology Control Algorithms in Wireless Multihop Networks
 in Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN
, 2002
"... We can control the topology of a multihop wireless network by varying the transmission power at each node. The lifetime of such networks depends on battery power at each node. This paper presents a distributed faulttolerant topology control algorithm for minimum energy consumption in these net ..."
Abstract

Cited by 87 (9 self)
 Add to MetaCart
We can control the topology of a multihop wireless network by varying the transmission power at each node. The lifetime of such networks depends on battery power at each node. This paper presents a distributed faulttolerant topology control algorithm for minimum energy consumption in these networks. More precisely, we present algorithms which preserve the connectivity of a network upon failing of, at most, k nodes (k is constant) and simultaneously minimize the transmission power at each node to some extent. In addition, we present simulations to support the effectiveness of our algorithm. We also demonstrate some optimizations to further minimize the power at each node. Finally, we show how our algorithms can be extended to 3dimensions.
A ConeBased Distributed TopologyControl Algorithm for Wireless MultiHop Networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a conebased distributed topology control algorithm. This algorithm does not assume that nodes have GPS information available; rather it dep ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
(Show Context)
The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a conebased distributed topology control algorithm. This algorithm does not assume that nodes have GPS information available; rather it depends only on directional information. Roughly speaking, the basic idea of the algorithm is that a node u transmits with the minimum power p u,# required to ensure that in every cone of degree # around u, there is some node that u can reach with power p u,# . We show that taking # = 5#/6 is a necessary and sufficient condition to guarantee that network connectivity is preserved. More precisely, if there is a path from s to t when every node communicates at maximum power then, if # 5#/6, there is still a path in the smallest symmetric graph G # containing all edges (u, v) such that u can communicate with v using power p u,# . On the other hand, if # > 5#/6,
A MinimumEnergy PathPreserving TopologyControl Algorithm
"... The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In general, it is not energy efficient to use the communication network where every node transmits with maximum power. For energy efficient operations, it is desirable to have a subnetwork ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In general, it is not energy efficient to use the communication network where every node transmits with maximum power. For energy efficient operations, it is desirable to have a subnetwork that preserves a minimumenergy path between every pair of nodes (where a minimumenergy path is one that allows messages to be transmitted with a minimum use of energy). In this paper, we first identify conditions that are necessary and sufficient for a subnetwork of to preserve this property. Using this characterization, we then propose an efficient topologycontrol algorithm that, given a communication network, computes a subnetwork that it preserves at least one minimumenergy path between every pair of nodes. We also propose an energyefficient reconfiguration protocol that maintains this minimumenergy path property as the network topology changes dynamically. We demonstrate the performance improvements of our algorithm over other existing topologycontrol algorithms through simulation.
Article On the Relevance of Using Open Wireless Sensor Networks in Environment Monitoring
, 2009
"... sensors ..."
(Show Context)
A Suitable Size Clustering Algorithm for Ad Hoc Wireless NetworksÃ
, 2001
"... Abstract: Transmit power control is central technique for resource and interference management in Ad hoc wireless network. While power control has been traditionally considered as a means to counteract the harmful effect of channel fading, the more general emerging view is that it is a flexible mech ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: Transmit power control is central technique for resource and interference management in Ad hoc wireless network. While power control has been traditionally considered as a means to counteract the harmful effect of channel fading, the more general emerging view is that it is a flexible mechanism to provide quality of service for individual users. In this paper, a novel adaptive clustering algorithm is presented in order to alleviate the dynamic characteristics of network topology and economize the power energy simultaneously. This proposal is a GPS based mechanism. By predicting the next location of mobile host with its historic trajectory, it adjusts its transmit power in advance. In order to maximize the throughput of network, it controls all clusters in suitable size adaptively. Experiments on GlomoSim have been conducted. The results show that clustering approach proposed in this paper is a practically valuable topology management mechanism for ad hoc wireless networks, especially for mobile networks composed of highspeed mobile hosts. Key words: Ad hoc networks; mobility prediction; power control; clustering algorithm Mobile hosts and wireless network hardware are becoming widely available, and extensive work has been conducted lately in integrating these elements into traditional networks such as the Internet. Oftentimes, however, mobile users wish to communicate in situations in which no fixed wired infrastructure available, either because it is not economically practical or physically possible to provide the necessary infrastructure or because the expediency
Performance Evaluation for a QuasiSynchronous Packet Radio Network (QSPNET)
, 2001
"... We propose a new mediaaccess and connectionestablishment protocol for an adhoc quasisynchronous packet radio network (QSPNET). In the QSPNET, the bandwidth is partitioned into a data channel, used to transmit packets, and a control channel, used to make reservations. Transmitted waveforms in the ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a new mediaaccess and connectionestablishment protocol for an adhoc quasisynchronous packet radio network (QSPNET). In the QSPNET, the bandwidth is partitioned into a data channel, used to transmit packets, and a control channel, used to make reservations. Transmitted waveforms in the QSPNET are made quasisynchronous by using a local GPS clock. The QSPNET uses a novel linear decorrelator receiver for multiuser detection, which permits the reception of quasisynchronous code division multiple access (QSCDMA) waveforms. We initially describe the QSPNET and its connection and flow control protocols, giving the rules of transmission and reception followed by all mobiles. We also provide performance results for the case where connection requests are generated at each node of the QSPNET according to a random process over an infinite time horizon. In particular, we obtain results on the achievable throughput and the average delay as a function of the transmission radius, the quasisynchronous uncertainty interval, the duration of the connections, and the buffer size per node.
SelfOrganized FaultTolerant Feature Extraction in Distributed Wireless Sensor Networks
"... We propose a distributed solution for a canonical task in wireless sensor networks  the extraction of information about interesting environmental features. We explicitly take into account the possibility of sensor measurement faults and develop a distributed Bayesian algorithm for detecting and co ..."
Abstract
 Add to MetaCart
We propose a distributed solution for a canonical task in wireless sensor networks  the extraction of information about interesting environmental features. We explicitly take into account the possibility of sensor measurement faults and develop a distributed Bayesian algorithm for detecting and correcting such faults. Theoretical analysis and simulation results show that 8595% of faults can be corrected using this algorithm even when as many as 10% of the nodes are faulty.