论文部分内容阅读
本文针对最小广播图问题建立了以下模型,任意两个不同的源网站中的源信息是不相同的,且k个不同的源信息必须全部传递到系统中的任意网站。当源网站的个数k大于等于2时,信息首先在源网站中传播使得每个源网站都具有该系统中的所有的信息,然后再从k个源网站分别以最快的传播过程同时向其他网站传播信息。当使用该模型不能使系统传播的总时间在[log2n]之内,我们可以适当的修改该模型,通过增加边数来使时间满足要求。该模型是建立在简化后的通讯系统上的,虽然与实际的计算机信息传播方式有所不同,但是以图论为基础,在对传播方式有一定了解的情况下进行相应的假设,建立相关模型,仍可求得路径最少的广播图。该简化模型的提出对于解决通讯系统的建立以及无线网络通信信号塔的搭建问题也有很大的帮助。
In this paper, the following model is established for the minimum broadcast graph problem. The source information of any two different source websites is different, and k different source information must all be transmitted to any website in the system. When the number of source websites k is greater than or equal to 2, the information is first transmitted in the source website so that each source website has all the information in the system, and then from the k source websites, respectively, the fastest propagation process simultaneously Other sites to disseminate information. When using this model can not make the system spread within the total time [log2n], we can modify the model as appropriate, by increasing the number of sides to make the time to meet the requirements. The model is based on a simplified communication system. Although it is different from the actual computer information transmission method, based on graph theory, under the condition of having some understanding of the mode of transmission, make corresponding assumptions and establish relevant models , You can still get the least broadcast path map. The proposed simplified model is also helpful to solve the establishment of communication system and the construction of wireless network communication signal tower.