Broadcast analysis of spanning tree flooding algorithm for mobile ad hoc networks

  • Authors:
  • Haklin Kimm;Adam Engle;Fenglien Lee

  • Affiliations:
  • East Stroudsburg University, East Stroudsburg, PA;East Stroudsburg University, East Stroudsburg, PA;University of Guam, Mangilao, GU

  • Venue:
  • Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In mobile ad hoc networks, wireless nodes communicate each other, such as exchanging data or signals, over multiple hops in autonomous way. But the mobile nodes can only transmit data within the limited signal range that depends on transmission power of each wireless device. A mobile wireless node is characterized by its limited power and bandwidth. The topology of wireless network is changed frequently since each node can move freely so that the node would be hidden to other nodes in mobile ad hoc networks. The infrastructure of a wireless network is built upon the position information of all the nodes after the distances between nodes are estimated. There have been techniques computing the position of a node of the ad hoc networks. In this paper, spanning tree flooding algorithm is revisited and analyzed in order to improve the algorithm, especially regarding to the broadcast problem.