A Distributed Intrusion Detection Scheme about Communication Optimization in Smart Grid

Table 1

The notation and definitions used in the rest of this paper.

Notation	Definition
𝑒	A link of the network
𝐶(𝑒)	All channels of a link 𝑒
𝐶(𝑎∣𝑒)	The maximum number of active channels that can be activated on the link 𝑒
𝐶𝑖(𝑒)	The transmission capacity of the 𝑖th channel in data link 𝑒
𝑑𝑖(𝑒)	The information flow currently transmitting on channel 𝑖 of link 𝑒
𝑣𝑖(𝑒∣𝑡)	The Boolean variable when information is transmitted on channel 𝑖 of link 𝑒 during time slot 𝑡
𝑆𝑖	The constraining set belongs to channel 𝑖 of link 𝑒
𝑛	The number of sets of link and channel constraining pairs (𝑆1, 𝑆2, 𝑆3, …, 𝑆𝑛) between each pair of nodes which are allowed to communicate with each other directly
(𝑠(𝑚),𝑑(𝑚))	The communication pair of information 𝑚 between source node and destination node
𝐻(𝑆𝑗)	The right hand side constant of the pair which includes the set 𝑆𝑗
𝑀	The number of communication pairs
𝑝𝑖(𝑒|𝑚)	The number of information flow m allowed on channel 𝑖 of link 𝑒
𝑟(𝑚)	The total number of information flows m allowed on a link
𝑤(𝑗)	The weight of the constraining pair of channel 𝑖 of link e
𝑏(𝑗)	The weight of each set 𝑆𝑖 whose value is calculated by the distance between two nodes
𝐹	The maximum scaling factor where its value denotes the total slack capacity needed in the network