According to the communication ability of sensor nodes, each cluster is divided into many concentric coronas with the center of gateway, denoted as.
In the example, there are 5 mesh routers, 2 of which are also gateways, denoted by and.
In Section 3.2, an algorithm to obtain the optimal sharing efficiency on all the gateways, denoted by, is provided and a traffic scheduling scheme satisfying the above two conditions is also constructed.
In the first step of the algorithm, a variable called gateway radius, denoted by, is decided.
The gateway or decoder node, denoted by v0, v 0 ∈ V, has high computational resources and is usually in charge of forwarding the information to a next level network, e.g., a wired backbone network.
Therefore, the throughput of the th mesh client when gateways are deployed, denoted by, is generally constrained by both and.
Let A d v P, D a k e - u o d a ( A ) denotes the success probability of the gateway.
Let and denote the senor node, and the gateway,, in the network, respectively.
where denotes the number of the associated gateways with the mesh router.
Let p x 1 denote the probability that the malicious gateway can recover the integer x1.
where denotes the encryption function using the public key of gateway.
