Minimum forwarding routing tree algorithm in emergency sensor network
Author:
Affiliation:

College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101, China

Clc Number:

TP393;TN915.02

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In disaster rescue and emergency situations, node energy in sensor network is especially limited. In order to reduce unnecessary forwarding consumption, this paper presents a MANET multicast routing tree algorithm with least forwarding nodes, which is based on shortest routing tree and subtree deletion. The algorithm is proved and analyzed in detail. Its practical distributed version is also presented. The simulation comparison shows that this distributed algorithm reduces the forwarding transmission in improved ODMRP, especially there are much more receivers in MANET. Minimum forwarding routing tree has the minimum network overhead. It is an effective way to extend the network lifetime.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: July 20,2017
  • Published: