Construction and maintenance of virtual backbone in wireless networks

Shukla, K. K.; Sah, Sudhakar

doi:10.1007/s11276-012-0512-6

Cited by 13 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in algorithms proposed in [7]- [12], there are no In addition to study the MCDS problem for smaller size, some CDS construction algorithms focus on other parameters of a CDS such as diameter, Average Backbone Path Length (ABPL), load balancing and fault tolerance. The diameter of a given connected graph is the length of the longest shortest path between a pair of nodes in the graph [10]. Kim Donghyun in [2] presented two centralized algorithms with constant approximation ratios and bounded diameters.…”

Section: Remarksmentioning

confidence: 99%

Maximizing Lifetime of CDS-Based Wireless Ad Hoc Networks

Wei¹,

Liu²,

Bai³

2016

jcm

View full text Add to dashboard Cite

Connected Dominating Sets (CDS) have been widely used to serve as virtual backbones for the topology control of wireless ad hoc networks. Lifetime is one of the most important characteristics of a wireless ad hoc network since mobile nodes are equipped with energy-limited batteries. In this paper, we propose two CDS construction algorithms, CDS-LL and Extended CDS-LL (E-CDS-LL), to prolong lifetime of a CDS-based wireless network. The CDS-LL algorithm trades CDS size for lifetime by a tunable parameter . When  moves from 1 to 0, a CDS will be constructed with more energy-rich nodes. In the simulation, we show that when  is 0.8, the CDS-LL algorithm increases lifetime at least 6 times through sacrificing around 8% of size. Moreover, since CDS nodes consume more energy than non-CDS nodes, the E-CDS-LL algorithm balances energy consumption of wireless nodes via dynamically selecting energy-rich nodes with the CDS-LL algorithm to reconstruct the CDS before the CDS is disabled. Simulation results show that network lifetime can be prolonged by 66% on average through the E-CDS-LL algorithm compared with the CDS-LL algorithm.

show abstract

Section: Remarksmentioning

confidence: 99%

Maximizing Lifetime of CDS-Based Wireless Ad Hoc Networks

Wei¹,

Liu²,

Bai³

2016

jcm

View full text Add to dashboard Cite

show abstract

“…Also, nodes in MANET may move freely and randomly. Many works [8][9][10][11][12] take energy issue into consideration. A survey [8] of energy efficient scheduling mechanisms in sensor networks is given by Wang and Xiao.…”

Section: Related Work On Finding Mcdsmentioning

confidence: 99%

“…In tabledriven routing protocol, each node maintains route table Create the shortest path via GRAY node; (6) End if (7) If the path is a cycle then (8) Select another short path; (9) Mark the selected GRAY node with BLACK; (10) End if (11) End for (12) consists of all the BLACK nodes…”

Section: Route Discovery Using Son-mcdsmentioning

confidence: 99%

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Yang

Han

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A mobile ad hoc network (MANET) is widely applied in various urgent scenarios, benefiting from its feature that the hosts can communicate with each other without any physical infrastructure. An efficient routing function plays a critical role in MANET, and routing based on CDS is a promising approach. In this paper, a novel approach is proposed to obtain a stable routing path and prolong lifetime of MANET, by integrating three factors such as energy, mobility, and degree for the status of node minimum connected dominating set (SoN-MCDS). Extensive simulations show that the proposed protocol is superior to other classical ones in terms of lifetime and low energy consumption.

show abstract

“…Literatures [8][9][10][11][12][13][14][15] consider energy issue. Wu et al have also proposed two rules based on node degree and node's energy level to construct power aware CDS in [8,9].…”

Section: ) Cds Construction In Ad Hoc Networkmentioning

confidence: 99%

“…Ramalakshmi et al [13] proposed a Multi-Point Relay (MPR) based CDS construction algorithm for stable energy aware backbone construction. Shukla et al [14] have proposed a weighted CDS construction based on energy, degree and ID. Yu et al [15] propose a CDS based topology control algorithm for wireless sensor network.…”

Section: ) Cds Construction In Ad Hoc Networkmentioning

confidence: 99%

Construction of Hexagonal-Based Strategic Connected Dominating Set for mobile ad hoc networks

Sharmila

George

2015

2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)

View full text Add to dashboard Cite

Validation of ad hoc network mobility models almost depends on simulation. However, most of the widely used models are currently very simple and they focus on the ease of implementation rather than soundness of establishment. As an outcome, simulation based mobility models are often randomly generated movement patterns. Various simulators are available to mimic the movement of wireless nodes in a mobile ad hoc network. Even though simulation based models are available, in this paper we propose a novel hexagonal-based algorithm to study the movement of wireless nodes in an ad hoc network through algorithmic approach. Specifically, we use the applications of Graph Theory algorithms to determine connected dominating sets for analyzing the route dissemination in Mobile Ad Hoc Networks (MANETs). Therefore, the focus in this paper is on the Hexagonal-Based Strategic Connected Dominating Set (HBS-CDS). This algorithmic approach authenticates its application for battlefield defence operations.

show abstract

Construction and maintenance of virtual backbone in wireless networks

Cited by 13 publications

References 8 publications

Maximizing Lifetime of CDS-Based Wireless Ad Hoc Networks

Maximizing Lifetime of CDS-Based Wireless Ad Hoc Networks

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Construction of Hexagonal-Based Strategic Connected Dominating Set for mobile ad hoc networks

Contact Info

Product

Resources

About