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.
| Original language | English |
|---|---|
| Title of host publication | Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings |
| Pages | 509-516 |
| Number of pages | 8 |
| DOIs | |
| State | Published - 2006 |
| Event | 1st International Conference on Grid and Pervasive Computing,GPC 2006 - Taichung, Taiwan, Province of China Duration: 3 May 2006 → 5 May 2006 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 3947 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 1st International Conference on Grid and Pervasive Computing,GPC 2006 |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taichung |
| Period | 3/05/06 → 5/05/06 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Fingerprint
Dive into the research topics of 'A coloring based backbone construction algorithm in wireless ad hoc network'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver