Power efficient broadcasting and multicasting in wireless networks with Directional antennas

Jian Tang, Guoliang Xue, Weiyi Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Broadcasting and multicasting packets in a power efficient way is a critical task in wireless ad hoc networks. In a recent paper , Li et al. study the Minimum Energy Broadcast (MEB) routing problem in a wireless ad hoc network where every node has an omni-directional antenna and a fixed transmission power level. We extend their work to wireless networks with directional antennas in this paper. We formulate the Minimum Power Multicasting/Broadcasting using Directional Antennas (PMDA/PBDA) problems. For each problem, we present an approximation algorithm with worst-case approximation ratio O(log 2 n), where n is the number of nodes in the network. We also present several effective heuristics to solve the problems, the Shortest Path Tree (SPT) heuristic, the Directed Minimum Spanning Tree (DMST) heuristic and a greedy heuristic. Simulation results are presented to show the performance of our algorithms.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages1438-1442
Number of pages5
Volume3
StatePublished - 2005
Event2005 IEEE International Conference on Communications, ICC 2005 - Seoul, Korea, Republic of
Duration: May 16 2005May 20 2005

Other

Other2005 IEEE International Conference on Communications, ICC 2005
CountryKorea, Republic of
CitySeoul
Period5/16/055/20/05

Fingerprint

Multicasting
Broadcasting
Wireless networks
Wireless ad hoc networks
Antennas
Approximation algorithms
Power transmission

Keywords

  • Directional antennas
  • Power efficient broadcasting and multicasting
  • Wireless ad hoc networks

ASJC Scopus subject areas

  • Media Technology

Cite this

Tang, J., Xue, G., & Zhang, W. (2005). Power efficient broadcasting and multicasting in wireless networks with Directional antennas. In IEEE International Conference on Communications (Vol. 3, pp. 1438-1442)

Power efficient broadcasting and multicasting in wireless networks with Directional antennas. / Tang, Jian; Xue, Guoliang; Zhang, Weiyi.

IEEE International Conference on Communications. Vol. 3 2005. p. 1438-1442.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tang, J, Xue, G & Zhang, W 2005, Power efficient broadcasting and multicasting in wireless networks with Directional antennas. in IEEE International Conference on Communications. vol. 3, pp. 1438-1442, 2005 IEEE International Conference on Communications, ICC 2005, Seoul, Korea, Republic of, 5/16/05.
Tang J, Xue G, Zhang W. Power efficient broadcasting and multicasting in wireless networks with Directional antennas. In IEEE International Conference on Communications. Vol. 3. 2005. p. 1438-1442
Tang, Jian ; Xue, Guoliang ; Zhang, Weiyi. / Power efficient broadcasting and multicasting in wireless networks with Directional antennas. IEEE International Conference on Communications. Vol. 3 2005. pp. 1438-1442
@inproceedings{fc8698d8246d4e1aa6f51833dfba5816,
title = "Power efficient broadcasting and multicasting in wireless networks with Directional antennas",
abstract = "Broadcasting and multicasting packets in a power efficient way is a critical task in wireless ad hoc networks. In a recent paper , Li et al. study the Minimum Energy Broadcast (MEB) routing problem in a wireless ad hoc network where every node has an omni-directional antenna and a fixed transmission power level. We extend their work to wireless networks with directional antennas in this paper. We formulate the Minimum Power Multicasting/Broadcasting using Directional Antennas (PMDA/PBDA) problems. For each problem, we present an approximation algorithm with worst-case approximation ratio O(log 2 n), where n is the number of nodes in the network. We also present several effective heuristics to solve the problems, the Shortest Path Tree (SPT) heuristic, the Directed Minimum Spanning Tree (DMST) heuristic and a greedy heuristic. Simulation results are presented to show the performance of our algorithms.",
keywords = "Directional antennas, Power efficient broadcasting and multicasting, Wireless ad hoc networks",
author = "Jian Tang and Guoliang Xue and Weiyi Zhang",
year = "2005",
language = "English (US)",
volume = "3",
pages = "1438--1442",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Power efficient broadcasting and multicasting in wireless networks with Directional antennas

AU - Tang, Jian

AU - Xue, Guoliang

AU - Zhang, Weiyi

PY - 2005

Y1 - 2005

N2 - Broadcasting and multicasting packets in a power efficient way is a critical task in wireless ad hoc networks. In a recent paper , Li et al. study the Minimum Energy Broadcast (MEB) routing problem in a wireless ad hoc network where every node has an omni-directional antenna and a fixed transmission power level. We extend their work to wireless networks with directional antennas in this paper. We formulate the Minimum Power Multicasting/Broadcasting using Directional Antennas (PMDA/PBDA) problems. For each problem, we present an approximation algorithm with worst-case approximation ratio O(log 2 n), where n is the number of nodes in the network. We also present several effective heuristics to solve the problems, the Shortest Path Tree (SPT) heuristic, the Directed Minimum Spanning Tree (DMST) heuristic and a greedy heuristic. Simulation results are presented to show the performance of our algorithms.

AB - Broadcasting and multicasting packets in a power efficient way is a critical task in wireless ad hoc networks. In a recent paper , Li et al. study the Minimum Energy Broadcast (MEB) routing problem in a wireless ad hoc network where every node has an omni-directional antenna and a fixed transmission power level. We extend their work to wireless networks with directional antennas in this paper. We formulate the Minimum Power Multicasting/Broadcasting using Directional Antennas (PMDA/PBDA) problems. For each problem, we present an approximation algorithm with worst-case approximation ratio O(log 2 n), where n is the number of nodes in the network. We also present several effective heuristics to solve the problems, the Shortest Path Tree (SPT) heuristic, the Directed Minimum Spanning Tree (DMST) heuristic and a greedy heuristic. Simulation results are presented to show the performance of our algorithms.

KW - Directional antennas

KW - Power efficient broadcasting and multicasting

KW - Wireless ad hoc networks

UR - http://www.scopus.com/inward/record.url?scp=24144492701&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144492701&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:24144492701

VL - 3

SP - 1438

EP - 1442

BT - IEEE International Conference on Communications

ER -