Construction of a GAI Tree with Hypergraph Decompositions

Abstract

A wireless sensor network (WSN) which is generally consisted of a few or several dozens or hundreds or even thousands, where each node just like an Agent is used widely to monitor some digital signal and analog parameters. When the quantity of wireless senor is becoming larger and larger, some sensors are included some zone or clique to work cooperatively. The aim of this paper is to turn the group technology in WSN into GAI models which can represent multi-objective combinatorial optimization problems and then construct a GAI tree with hypertree decompositions. GAI (generalized additive independence) is very important in decision making system because of interactions between attributes. The paper focuses on the construction of a GAI tree with hypergraph decompositions. We show how the GAI tree is constructed by an instance. More precisely, in Section 2, we introduce concepts and examples linked to the notion of GAI. In Section 3, we show how to construct a GAI tree with hypergraph decompositons. Finally, in Section 4, we point out some conclusions and interesting work in the future.

Keywords

• WSN
• GAI
• Hypergraph decompositions
• Algorithm.