مدل های برنامه ریزی خطی باینری برای ایستگاه رادیویی قوی در شبکه های ارتباطی

Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In cc-broadcasting, each node having the message completes up to cc transmissions to its neighbors over the communication lines in one time unit. In a kk-fault tolerant cc-broadcast network, the broadcasting process can be accomplished even if kk communication lines fail. This paper presents innovative binary linear programming formulations to construct cc-broadcast graphs, kk-fault-tolerant cc-broadcast graphs, and their time-relaxed versions. The proposed mathematical models are used to generate eight previously unknown minimum cc-broadcast graphs, new upper bounds for eleven other instances of the cc-broadcast problem, and over 30 minimum kk-fault-tolerant cc-broadcast graphs. The paper also provides a construction method to produce an upper bound for an infinite family of kk-fault-tolerant cc-broadcast graphs.