A coloring based backbone construction algorithm in wireless ad hoc network

Authors:
Zhiwei Lin;Li Xu;Dajin Wang;Jianliang Gao
Affiliations:
School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, P.R. China;School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, P.R. China;Montclair State University, Upper Montclair, NJ;School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, P.R. China
Venue:
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Year:
2006

Citing 7
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Constructing efficient rotating backbones in wireless sensor networks using graph coloring

Computer Communications
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless ad hoc network consists of many mobile hosts communicating with each other without any infrastructure. Virtual backbone plays a key role in a wireless ad hoc network for routing optimization, energy conservation and resource allocation. To construct virtual backbones efficiently, a new distributed method based on coloring algorithm is proposed in this paper. Because the proposed algorithm uses only 1-hop neighbors information, it is proven that this coloring based method can cluster into groups with O(Δ) time complexity and O(nΔ2) message complexity, which are better than referenced work in this paper.