Method for electing aggregator nodes in a network
A method for electing aggregator nodes in a network, wherein the network includes a plurality of sensor nodes to measure data, and at least one of the sensor nodes functioning as aggregator node to aggregate sensored data obtained by at least a subset of the sensor nodes, the network further including at least one sink node to collect data aggregated by the aggregator nodes, the method including: establishing pairwise secret keys between a current aggregator node and each sensor node of the subset of sensor nodes; at each of the sensor nodes of the subset, choosing a random number and encrypting the random number using the established key; providing a communication chain between the sensor nodes of the subset and summing the encrypted random numbers of all sensor nodes of the subset; and determining a new aggregator node on the basis of the resulting sum according to a predefined calculation scheme.
1. A method for electing aggregator nodes in a network, wherein the network ( 1 ) comprises a plurality of sensor nodes (S i ) to measure data, and wherein at least one of the sensor nodes (S i ) functions as aggregator node (A) to aggregate sensored data obtained by at least a subset of the sensor nodes (S i ), and wherein the network further comprises at least one sink node ( 2 ) to collect data aggregated by the aggregator nodes (A), the method comprising:
establishing pairwise secret keys (k i ) between a current aggregator node (A t ) and each sensor node (S i ) of the subset of sensor nodes from which the current aggregator node (A t ) obtains sensored data;
at each of the sensor nodes (S i ) of said subset, choosing a random number (r i ) and encrypting the random number (r i ) using the established key (k i );
providing a communication chain between the sensor nodes (S i ) of said subset and summing the encrypted random numbers (r i ) of all sensor nodes (S i ) of said subset; and
determining a new aggregator node (A t+1 ) on the basis of the resulting sum according to a predefined calculation scheme.
2. The method according to claim 1 , wherein the current aggregator node (A t ), in the context of the key establishment, broadcasts a multitude of data pairs, each data pair comprising a key (k i ) and an identifier (ID i ), respectively, in a concealed manner to all sensor nodes (S i ) of said subset.
3. The method according to claim 2 , wherein each sensor node (S i ) of said subset chooses randomly one data pair from the multitude of data pairs and breaks the concealment to obtain the key (k i ).
4. The method according to claim 2 , wherein the concealment of the broadcasted data pairs is achieved by way of a preferably lightweight encryption.
5. The method according to claim 4 , wherein the broadcasted data pairs are encrypted with a weak block cipher or using a short key.
6. The method according to claim 4 , wherein each sensor node (S i ) of said subset chooses randomly one data pair from the multitude of data pairs and breaks the concealment to obtain the key (k i ).
7. The method according to claim 2 , wherein the number of data pairs broadcasted by the current aggregator node (A t ) is specified according to given security requirements.
8. The method according to claim 7 , wherein each sensor node (S i ) of said subset chooses randomly one data pair from the multitude of data pairs and breaks the concealment to obtain the key (k i ).
9. The method according to claim 2 , wherein each sensor node (S i ) broadcasts the identifier (ID i ) of its chosen data pair as a commitment.
10. The method according to claim 9 , wherein each sensor node (S i ) of said subset chooses randomly one data pair from the multitude of data pairs and breaks the concealment to obtain the key (k i ).
11. The method according to claim 1 , wherein the order of the sensor nodes (S i ) within the communication chain is determined according to a well defined rule.
12. The method according to claim 1 , wherein an encryption scheme E used for encrypting the random numbers (r i ) under the keys (k i ) is homomorphic both with respect to the random numbers (r i ) and to the keys (k i ).
13. The method according to claim 12 , wherein, after completing the summation of the encrypted random numbers (r i ), the current aggregator node (A t ) broadcasts the established keys (k i ) to all sensor nodes (S i ) of said subset.
14. The method according to claim 13 , wherein a maximum allowed time Δt is defined between the moment of broadcasting the data pairs and the moment of broadcasting the established keys (k i ).
15. The method according to claim 13 , wherein each sensor node (S i ) of said subset sums the established keys (k i ) and applies the resulting sum (k) to decrypt the sum of the encrypted random values (r i ).
16. The method according to claim 12 , wherein each sensor node (S i ) of said subset sums the established keys (k i ) and applies the resulting sum (k) to decrypt the sum of the encrypted random values (r i ).
17. The method according to claim 16 , wherein a maximum allowed time Δt is defined between the moment of broadcasting the data pairs and the moment of broadcasting the established keys (k i ).
18. The method according to claim 1 , wherein the sensor node (S i ) of said subset for which it holds that i=R mod n, with R denoting the sum of the random values (r i ) is determined as new aggregator node (A t+1 ) wherein R mod n represents the remainder when R is divided by n, in accordance with modular arithmetic.
19. The method according to claim 18 , wherein a maximum allowed time Δt is defined between the moment of broadcasting the data pairs and the moment of broadcasting the established keys (k i ).
20. The method according to claim 1 , wherein the election process is aborted and restarted from the beginning if at least one sensor node (S i ) registers any irregularities.