In the world of networked system, average consensus is an important dimension of co-ordinate control and cooperation. Since the communication medium is digital, real value cannot be transmitted and we need to perform quantization before data transmission. But for the quantization, error is introduced in exact value and initial average is lost. Based on this limitation, my 16 bit quantization method (sending MSB in 1-4 cycle and MSB+LSB in 5th cycle) reduces error significantly and preserves initial average. Besides, it works on all types of graphs (star, complete, ring, random geometric graph). My other algorithm, distributing averaging algorithm (PQDA) with probabilistic quantization also works on random geometric graph, star, ring and slow co-herency graph. It shows significant reduced error and attain strict consensus.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc271874 |
| Date | 05 1900 |
| Creators | Parvez, Imtiaz |
| Contributors | Wan, Yan, Fu, Shengli, Namuduri, Kamesh |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | Text |
| Rights | Public, Parvez, Imtiaz, Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved. |
Page generated in 0.0021 seconds