Topology Control in Wireless AD HOC Networks

Basagni, Stefano; Conti, Marco; Giordano, Silvia

doi:10.1002/0471656895.ch6

Cited by 23 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When considering a RGG as topological model for a wireless network, one of the important issues is to keep the network connected using the minimal amount of energy consumption, i.e., using the smallest transmitting distance. This is called the critical power among the networking community [Li04], and the connectivity threshold among the mathematical community [Pen03]. In the book of Penrose, the results are exposed in full generality, for any distance norm, and any dimension.…”

Section: Static Propertiesmentioning

confidence: 99%

“…Topology control is a technique that uses the tuning of certain parameters, usually the transmitting range r or the maximum degree of the graph, to change/form the topology of the graph representing the network in order to maintain the connectivity while optimizing the energy (or minimizing the interference). There are very good recent surveys on the topic of topology control, see for instance [San05b,Li04]. One of the important problems in topology control is the critical transmitting range for connectivity: what is the smallest radius, denoted by r c , that keeps G connected?…”

Section: Static Propertiesmentioning

confidence: 99%

“…Further applications of unit discs and random geometric graphs as models for more general ad hoc networks are discussed in the references [Hek06,dMCA06,Li04,GY07,YMG08] and in Chapter 1 of [vL09].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Theoretical Aspects of Graph Models for MANETs

Dı́az

Mitsche

Santi

2010

Monographs in Theoretical Computer Science. An EATCS Series

View full text Add to dashboard Cite

Abstract. We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

show abstract

Section: Static Propertiesmentioning

confidence: 99%

Section: Static Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Theoretical Aspects of Graph Models for MANETs

Dı́az

Mitsche

Santi

2010

Monographs in Theoretical Computer Science. An EATCS Series

View full text Add to dashboard Cite

show abstract

“…Thus, packet delivery is not guaranteed for these protocols. Hence, one of the primary concerns in the area of sensor networks is to develop algorithms that control the network topologies [11], [12]. Given the fact that sensor nodes are operated by limited battery power, have limited amount of memory, and have topologies that are often not available and may be dynamic, localized algorithms with prior knowledge on neighboring nodes up to a fixed number of distant hops, are ideally preferred.…”

Section: Introductionmentioning

confidence: 99%

Enhanced Topological Graphs for 2-D Sensor Networks

Salti

Taleb

Alyatama

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

For an efficient usage of the sensor technology, several design factors (e.g., topology and sensing coverage) should be taken into account. In this paper, we focus on the underlying topology of sensor networks in two-dimensional environments and enhance a set of recently proposed graphs [1]. The new enhanced graphs are referred to as the Derived Circles version 2 (DC α v2) graphs. We show that DC α v2 graphs are locally constructed, connected, have the rotationability property, and have the Euclidean Minimum Spanning Tree (EMST) as their subgraphs. Moreover, we show that the new set of graphs has a bounded Euclidean/length and power dilation when 0.5 ≤ α ≤ 1. Furthermore, via simulations, we confirm most of these properties, and demonstrate that the DC α v2 graphs also have bounded Euclidean and power dilations when 0 < α < 0.5. In addition, we demonstrate that DC α v2 graphs outperform the Half Space Proximal (HSP ) and the Relative Neighbourhood Graph (RN G) graphs in terms of the network dilation, Euclidean dilation, and power dilation. This, in turn, increases the speed for message delivery, reduces the energy consumption of nodes and accordingly prolongs the network lifetime.

show abstract

“…That is, such an algorithm has no sequential propagation of states. Comprehensive surveys of topology control can be found in [14] and [20].…”

Section: Related Workmentioning

confidence: 99%

Topology control in ad hoc wireless networks with hitch-hiking

Cardei

Yang

2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 200

View full text Add to dashboard Cite

Abstract-In this paper, we address the Topology control with Cooperative Communication (TCC) problem in ad hoc wireless networks. Cooperative communication is a novel model introduced recently that allows combining partial messages to decode a complete message. The objective of the TCC problem is to obtain a strongly-connected topology with minimum total energy consumption. We show that the TCC problem is NP-complete and design two distributed and localized algorithms to be used by the nodes to set up their communication ranges. Both algorithms can be applied on top of any symmetric, strongly-connected topology to reduce total power consumption. The first algorithm uses a distributed decision process at each node that makes use of only 2-hop neighborhood information. The second algorithm sets up the transmission ranges of nodes iteratively, over a maximum of six steps, using only 1-hop neighborhood information. We analyze the performance of our approaches through extensive simulation.

show abstract

Topology Control in Wireless AD HOC Networks

Cited by 23 publications

References 25 publications

Theoretical Aspects of Graph Models for MANETs

Theoretical Aspects of Graph Models for MANETs

Enhanced Topological Graphs for 2-D Sensor Networks

Topology control in ad hoc wireless networks with hitch-hiking

Contact Info

Product

Resources

About