Research Article Open Access

Local Beam Search Algorithm for Power Saving in Clustered Ad-Hoc Networks

A. Zabian1 and F. Al-Kalani1
  • 1 ,
Journal of Computer Science
Volume 4 No. 10, 2008, 784-791

DOI: https://doi.org/10.3844/jcssp.2008.784.791

Submitted On: 16 August 2008 Published On: 31 October 2008

How to Cite: Zabian, A. & Al-Kalani, F. (2008). Local Beam Search Algorithm for Power Saving in Clustered Ad-Hoc Networks. Journal of Computer Science, 4(10), 784-791. https://doi.org/10.3844/jcssp.2008.784.791

Abstract

An ad-Hoc network is an infrastructures network consisting of mobile moving nodes. Every node in network performs as a router or a package forwarder. Energy consumption of network interfaces can be significant. There is a relationship between the transmission power and the distance traveled by a packet, increasing the transmission power increases the reachable area at the cost of high power consumption. Reducing the transmission power reduces the number of nodes reached but consumes less energy. We propose the use of searching algorithms (local beam search) to organize the nodes of a single cluster in a tree, in a manner that all the nodes are distributed in levels given a determined distance to each other. All the communication was done by levels. Substituting in that long distance communication by a multihop communication. Reducing in the power consumption for each communication. Results showed that power remaining at the destination node inversely related to the distance between the two communicating nodes. Power increased at the destination node if the distance between the two communicating nodes decreased.

  • 1,018 Views
  • 1,175 Downloads
  • 0 Citations

Download

Keywords

  • Searching algorithms
  • power consumption
  • multihop communication
  • local beam search algorithm