Improved Topology Control Algorithms for Simple Mobile Networks

Che, Fei; Lloyd, Errol L.; Zhao, Liang

doi:10.1007/978-3-642-11723-7_30

Ad Hoc Networks

2010

DOI: 10.1007/978-3-642-11723-7_30

|View full text |Cite

Improved Topology Control Algorithms for Simple Mobile Networks

Fei Che

Errol L. Lloyd

Liang Zhao

Abstract: Abstract. Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the network nodes. Topology control in mobile wireless ad hoc networks under the Simple Mobile Network (SMN) Model was introduced in [6]. In that model, there is only one moving node. That node moves on a straight line segment throughout a unit time interval and no assumptions are made about the moving speed. In this paper we study … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are many solutions proposed in the literature [4], [7], [16], [20], [21], most of which produce very sparse topologies. However, energy conservation is not the only important goal.…”

mentioning

confidence: 99%

Delta-graphs for wireless ad hoc networks

Rahman

Williamson

2012

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)

View full text Add to dashboard Cite

Abstract-Most topology control algorithms for wireless ad hoc networks strive to reduce energy consumption by creating a sparse topology with few long-distance links. However, in a sparse topology, the average path length is relatively large (increasing end-to-end delay), and the number of vertex-disjoint paths between source-destination pairs is relatively small (reducing faulttolerance). Unlike traditional topology control algorithms that generate a single topology with a certain property, we propose a distributed algorithm that generates a family of topologies with a range of characteristics. The network designer can choose a suitable topology by simply tuning a single parameter ∆ (power savings threshold), trading off energy savings for other features such as low latency and fault-tolerance. For the topologies generated by the proposed algorithm, we also provide an analytical model to estimate their structural density. The accuracy of the analytical model is validated with extensive simulation results.I. INTRODUCTION Wireless ad hoc networks are known as "networks without networking", since they do not rely on any pre-configured fixed infrastructure. Rather, the nodes can be deployed spontaneously, perhaps at random, and then be dynamically reconfigured into a manageable and controllable network topology. Such dynamic topology control is widely used in wireless sensor networks, vehicular networks, and wireless mesh network environments, to name a few.Many of these wireless ad hoc networks consist of mobile nodes equipped with limited power sources, such as a battery or a solar cell. Thus energy consumption is a prime consideration in designing such networks. The transmission power between a pair of communicating nodes is one of the dominant factors in the overall energy consumption. Since the transmission power requirement grows (at least) quadratically with the distance between the communicating parties, using one or more nearby neighboring nodes as intermediate relays can dramatically reduce energy consumption. Thus any energy-aware topology control algorithm gives preference to short-distance links rather than long-distance links.In general, a topology control algorithm works as follows. Each node in the network classifies all of its directly reachable neighbors as either "close" or "far". The "closeness" of a neighbor is based on a suitably chosen objective function. If the goal is to conserve energy, then direct communication is used for the close neighbors, while indirect communication (via a relay node) is used for the far neighbors. After the classification step, each node reduces its transmission power to the minimum required to communicate with all of its close neighbors. Thereby a node uses one or more close neighbors to relay information to the far neighbors.

show abstract

“…There are many solutions proposed in the literature [4], [7], [16], [20], [21], most of which produce very sparse topologies. However, energy conservation is not the only important goal.…”

mentioning

confidence: 99%

Delta-graphs for wireless ad hoc networks

Rahman

Williamson

2012

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Improved Topology Control Algorithms for Simple Mobile Networks

Cited by 1 publication

References 8 publications

Delta-graphs for wireless ad hoc networks

Delta-graphs for wireless ad hoc networks

Contact Info

Product

Resources

About