A localized algorithm for minimum-energy broadcasting problem in MANET

Chao Peng; Hong Shen

doi:10.1007/11590354_117

A localized algorithm for minimum-energy broadcasting problem in MANET

Chao Peng
, Hong Shen

Japan Advanced Institute of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.

Original language	English
Title of host publication	Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings
Pages	971-977
Number of pages	7
DOIs	https://doi.org/10.1007/11590354_117
Publication status	Published - 2005
Externally published	Yes
Event	4th International Conference on Grid and Cooperative Computing - GCC 2005 - Beijing, China Duration: 30 Nov 2005 → 3 Dec 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3795 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Conference on Grid and Cooperative Computing - GCC 2005
Country/Territory	China
City	Beijing
Period	30/11/05 → 3/12/05

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

Broadcasting
Energy-efficient Routing
MANET

Access to Document

10.1007/11590354_117

Cite this

Peng, C., & Shen, H. (2005). A localized algorithm for minimum-energy broadcasting problem in MANET. In Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings (pp. 971-977). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3795 LNCS). https://doi.org/10.1007/11590354_117

@inproceedings{bdee8ea1f4fe4df2a5db389b5b0219fc,

title = "A localized algorithm for minimum-energy broadcasting problem in MANET",

abstract = "In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.",

keywords = "Broadcasting, Energy-efficient Routing, MANET",

author = "Chao Peng and Hong Shen",

year = "2005",

doi = "10.1007/11590354\_117",

language = "English",

isbn = "3540305106",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "971--977",

booktitle = "Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings",

note = "4th International Conference on Grid and Cooperative Computing - GCC 2005 ; Conference date: 30-11-2005 Through 03-12-2005",

}

Peng, C & Shen, H 2005, A localized algorithm for minimum-energy broadcasting problem in MANET. in Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3795 LNCS, pp. 971-977, 4th International Conference on Grid and Cooperative Computing - GCC 2005, Beijing, China, 30/11/05. https://doi.org/10.1007/11590354_117

A localized algorithm for minimum-energy broadcasting problem in MANET. / Peng, Chao; Shen, Hong.
Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings. 2005. p. 971-977 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3795 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A localized algorithm for minimum-energy broadcasting problem in MANET

AU - Peng, Chao

AU - Shen, Hong

PY - 2005

Y1 - 2005

N2 - In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.

AB - In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.

KW - Broadcasting

KW - Energy-efficient Routing

KW - MANET

UR - https://www.scopus.com/pages/publications/33646854931

U2 - 10.1007/11590354_117

DO - 10.1007/11590354_117

M3 - Conference contribution

AN - SCOPUS:33646854931

SN - 3540305106

SN - 9783540305101

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 971

EP - 977

BT - Grid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings

T2 - 4th International Conference on Grid and Cooperative Computing - GCC 2005

Y2 - 30 November 2005 through 3 December 2005

ER -

A localized algorithm for minimum-energy broadcasting problem in MANET

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this