Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2011-03-15
2011-03-15
Ho, Duc C (Department: 2465)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S328000, C370S338000, C370S252000, C713S189000
Reexamination Certificate
active
07907548
ABSTRACT:
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.
REFERENCES:
patent: 2006/0098594 (2006-05-01), Ganesh
patent: 2007/0064625 (2007-03-01), Lim et al.
Al-Karaki J N et al : “Routing techn1ques 1-14 in Wireless sensor networks : a survey”, IEEE Wireless Communications , IEEE Service Center , Piscataway , NJ , US, vol. 11, No. 6, Dec. 2004 , pp. 6-28, XPOO1217358 ISSN: 1536-1284.
Dirk westhoff et al.: . “Concealed data aggregation for reverse multicast traffic in sensor networks: encryption, key distribution, and routing adaptation”, IEEE Transactions on Mobile Computing, [Online] vol. 5, no. tu, Aug. 16, 2006, pp. 1417-1431, XP002444145.
Boukerche A et al: “HPEQ A Hierarchical Periodic ; Event-driven and Query-based Wireless Sensor Network Protocol”; Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on Sydney, Australia Nov. 15-17, 2005, Piscataway, NJ, USA,IEEE Nov. 15, 2005, pp. 560-567, XPOI0859256.
Levente Buttyan et al: “Spontaneous Cooperation in Multi-domain Sensor Networks”; Security and Privacy in AD-HOC and Sensor Networks Lecture Notes in Computer Science;;LNCS, Springer-Verlag, BE, vol. 3813, 2005, pp. 42-53, XP019026275.
Deng et al: “INSENS: Intrusion-tolerant routing for wireless sensor networks” Computer Communications, Elsevier Science Publishers BV , Amsterdam, NL , vol. 29, No. 2, Jan. 10, 2006 , pp. 216-230 , XP005237935.
Castelluccia C et al : “Efficient Aggregation of encrypted data in Wireless Sensor Networks”; Mobile and Ubiquitous Systems: Networking and Services, 2005. Mobiquitous 2005 . The Second Annual International Conference on San Diego, CA, USA Jul. 17-21, 2005, Piscataway, NJ, USA ,IEEE, Jul. 17, 2005, pp. 109-117 , XPOI085389.
Acharya M et al: “Secure Comparison of Encrypted Data in Wirless Sensor Networks”; Modeling and Optimization in Mobile, AD HOC , Andwireless Networks, 2005 . WIOPT 2005. Third International Symposium on Riva Del Garda, Trentino, Italy Apr. 4-6, 2005, Piscataway , NJ, USA, IEEE, Apr. 4, 2005 , pp. 47-53, XP010789159.
International Search Report dated Aug. 6, 2007, in PCT application.
Armknecht Frederik
Westhoff Dirk
Ho Duc C
NEC Europe Ltd.
Young & Thompson
LandOfFree
Method for electing aggregator nodes in a network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for electing aggregator nodes in a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for electing aggregator nodes in a network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2750145