An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach
Game theory has emerged as a brand new approach to model and analyse several problems of wireless sensor networks, such as routing, data collection, and topology control. Recently, a novel clustering mechanism called clustered routing for selfish sensors (CROSS) has been proposed based on game theor...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/476313 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547233746124800 |
|---|---|
| author | Dongfeng Xie Qi Sun Qianwei Zhou Yunzhou Qiu Xiaobing Yuan |
| author_facet | Dongfeng Xie Qi Sun Qianwei Zhou Yunzhou Qiu Xiaobing Yuan |
| author_sort | Dongfeng Xie |
| collection | DOAJ |
| description | Game theory has emerged as a brand new approach to model and analyse several problems of wireless sensor networks, such as routing, data collection, and topology control. Recently, a novel clustering mechanism called clustered routing for selfish sensors (CROSS) has been proposed based on game theory. The sensor nodes, which are modelled as players, join in a clustering game to campaign for cluster heads with an equilibrium probability. However, the CROSS algorithm needs the global information of how many nodes participate in the game at every round. Considering that this global way introduces much more packets exchange and energy consumption, we present a Localized game theoretical clustering algorithm (LGCA). In our protocol, each node selfishly plays a localized clustering game only with its neighbours within a communication radius R c . Moreover, exactly one node can successfully bid for a position of the cluster head in one district, thus achieving an optimal payoff. Simulation results show that our method achieves a better result compared with CROSS and LEACH in terms of network lifetime. |
| format | Article |
| id | doaj-art-80211fe5d3dc42ecb0d97176707ffad5 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-80211fe5d3dc42ecb0d97176707ffad52025-02-03T06:45:34ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-08-01910.1155/2013/476313An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical ApproachDongfeng XieQi SunQianwei ZhouYunzhou QiuXiaobing YuanGame theory has emerged as a brand new approach to model and analyse several problems of wireless sensor networks, such as routing, data collection, and topology control. Recently, a novel clustering mechanism called clustered routing for selfish sensors (CROSS) has been proposed based on game theory. The sensor nodes, which are modelled as players, join in a clustering game to campaign for cluster heads with an equilibrium probability. However, the CROSS algorithm needs the global information of how many nodes participate in the game at every round. Considering that this global way introduces much more packets exchange and energy consumption, we present a Localized game theoretical clustering algorithm (LGCA). In our protocol, each node selfishly plays a localized clustering game only with its neighbours within a communication radius R c . Moreover, exactly one node can successfully bid for a position of the cluster head in one district, thus achieving an optimal payoff. Simulation results show that our method achieves a better result compared with CROSS and LEACH in terms of network lifetime.https://doi.org/10.1155/2013/476313 |
| spellingShingle | Dongfeng Xie Qi Sun Qianwei Zhou Yunzhou Qiu Xiaobing Yuan An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach International Journal of Distributed Sensor Networks |
| title | An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach |
| title_full | An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach |
| title_fullStr | An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach |
| title_full_unstemmed | An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach |
| title_short | An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach |
| title_sort | efficient clustering protocol for wireless sensor networks based on localized game theoretical approach |
| url | https://doi.org/10.1155/2013/476313 |
| work_keys_str_mv | AT dongfengxie anefficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT qisun anefficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT qianweizhou anefficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT yunzhouqiu anefficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT xiaobingyuan anefficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT dongfengxie efficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT qisun efficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT qianweizhou efficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT yunzhouqiu efficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach AT xiaobingyuan efficientclusteringprotocolforwirelesssensornetworksbasedonlocalizedgametheoreticalapproach |