Decentralized Algorithm for Constructing Minimized Connected Dominating Sets by Nominate Algorithms in Mobile Ad-hoc Networks
碩士 === 朝陽科技大學 === 資訊與通訊系 === 107 === Mobile Ad-hoc NETwork (MANET) is a dynamic network topology and their messages are exchanged or forwarding by each mobile node. However, the broadcasting messages in a MANET waste a lot of bandwidth and cause packet collisions. As a result, the routing performanc...
Main Authors: | CHEN, ZE-YU, 陳澤宇 |
---|---|
Other Authors: | Chiang, Mao-Lun |
Format: | Others |
Language: | zh-TW |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72t4x4 |
Similar Items
-
Design and analysis of a connected dominating set algorithm for mobile ad hoc networks
by: Cai, Kan
Published: (2009) -
Design and analysis of a connected dominating set algorithm for mobile ad hoc networks
by: Cai, Kan
Published: (2009) -
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
by: Xuemei Sun, et al.
Published: (2019-04-01) -
Efficient Coloring Algorithms for Constructing Smaller Connected Dominating Sets in Wireless Ad Hoc Networks
by: Po-Yi Wang, et al.
Published: (2009) -
Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks
by: Ceronmani Sharmila, et al.
Published: (2016-06-01)