공간 상관성을 갖는 센서장에서 섀플리 값을 이용한 공정한 비트 할당
Fair Bit Allocation in Spatially Correlated Sensor Fields Using Shapley Value
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The degree of contribution each sensor makes towards the total information gathered by all sensors is not uniform in spatially correlated sensor fields. Considering bit allocation problem in such a spatially correlated sensor field, the number of bits to be allocated to each sensor should be proportional to the degree of contribution the sensor makes. In this paper, we deploy Shapley value, a representative solution concept in cooperative game theory, and utilize it in order to quantify the degree of contribution each sensor makes. Shapley value is a system that determines the contribution of an individual player when two or more players work in collaboration with each other. To this end, we cast the bit allocation problem into a cooperative game called bit allocation game where sensors are regarded as the players, and a payoff function is given in the criteria of mutual information. We show that the Shapley value fairly quantifies an individual sensor’s contribution to the total payoff achieved by all sensors following its desirable properties. By numerical experiments, we confirm that sensor that needs more bits to cover its area has larger Shapley value in spatially correlated sensor fields.
Abstract
The degree of contribution each sensor makes towards the total information gathered by all sensors is not uniform in spatially correlated sensor fields. Considering bit allocation problem in such a spatially correlated sensor field, the number of bits to be allocated to each sensor should be proportional to the degree of contribution the sensor makes. In this paper, we deploy Shapley value, a representative solution concept in cooperative game theory, and utilize it in order to quantify the degree of contribution each sensor makes. Shapley value is a system that determines the contribution of an individual player when two or more players work in collaboration with each other. To this end, we cast the bit allocation problem into a cooperative game called bit allocation game where sensors are regarded as the players, and a payoff function is given in the criteria of mutual information. We show that the Shapley value fairly quantifies an individual sensor’s contribution to the total payoff achieved by all sensors following its desirable properties. By numerical experiments, we confirm that sensor that needs more bits to cover its area has larger Shapley value in spatially correlated sensor fields.
참고문헌 (19)
- M. Kaur, "Data Aggregation Algorithms for Wireless Sensor Network: A Review", Ad Hoc Networks, 100(102083) (2020)
- J. Wen, "Energy Efficient Task Allocation for Reliable Parallel Computation of Cluster-Based Wireless Sensor Network in Edge Computing", Digital Communications and Networks (2022)
- S. Li, "A Novel Joint Power and Feedback Bit Allocation Interference Alignment Scheme for Wireless Sensor Networks", Sensors, 17(563), pp.1~13 (2017)
- E. Masazade, "Dynamic Bit Allocation for Object Tracking in Wireless Sensor Networks", IEEE Transactions on Signal Processing, 60(10), pp.5048~5063 (2012)
- J. Luo, "Optimal Bit Allocation for Maneuvering Target Tracking in UWSNs with Additive and Mutplicative Noise", Signal Processing, 164(C), pp.125~135 (2019)
- Y. Wu, "Power Allocation and Relay Selection for Energy Efficient Cooperation in Wireless Sensor Networks with Energy Harvesting", EURASIP Journal on Wireless Communications and Networking, 2017(26), pp.1~11 (2017)
- A. Ponti, "A New Evolutionary Approach to Optimal Sensor Placement in Water Distribution Networks", Water, 13(1625), pp.1~18 (2021)
- M. Ghasemzadeh, "Sensor Placement Optimization for Shape Sensing of Plates and Shells Using Genetic Algorithm and Inverse Finite Element Method", Sensors, 22(9252), pp.1~29 (2022)
- V. AKbarzadeh, "Efficient Sensor Placement Optimization Using Gradient Descent and Probabilistic Coverage", Sensors, 14, pp.15525~15552 (2014)
- R. Soman, "A Real-Valued Genetic Algorithm for Optimization of Sensor Placement for Guided Wave-Based Structural Health Monitoring", Journal of Sensors, (961430), pp.1~10 (2019)
- C. Guestrin, "Near-Optimal Sensor Placement in Gaussian Processes", Proceedings of ACM ICML (2005)
- D. Jung, "Sensor Selection for Fault Diagnosis in Uncertain Systems", International Journal of Control, (1484171), pp.1~11 (2018)
- L. Zhao, "A Modified Cluster-Head Selection Algorithm in Wireless Sensor Networks Based on LEACH", EURASIP Journal of Wireless Communications and Networking, 2018(287), pp.1~8 (2018)
- A. Kulkarni, "Sensor Selection Framework for Designing Fault Diagnostic System", Sensors, 21(6470), pp.1~17 (2021)
- B. Peleg, "Introduction to the Theory of Cooperative Games" (2007), Springer
- E. Winter, "The Shapley Value", Economic Applications, 3, pp.2025~2054 (2002)
- C. Trudeau, "Network Flow Problems and Permutationally Concave Games", Mathematical Social Science, 58(1), pp.121~131 (2009)
- T. M. Cover, "Elements of Information Theory" (2006), Wiley-Interscience
- J. Castro, "Polynomial calculation of the Shapley Value Based on Sampling", Computers and Operations Research, 36(5), pp.1726~1730 (2009)