Game theory based Ad-hoc On Demand Distance Vector Routing Protocol to Extend the Wireless Sensor Networks Life Time

This paper proposes a solution to increase the energy life time of wireless sensor networks (WSNs) via a concept of game theory enabled ad-hoc on demand distance vector (AODV) routing algorithm. Game theory is an optimal promising candidate for decision making in a wireless networking scenario to find the optimal path for data packets transfer between source node and destination node, where combination with the AODV routing algorithm, a procedure of game theory enabled AODV (GTEAODV) is developed and proposed in this research paper. The developed and proposed methodology is validated through simulation in NS2 environment and the results show an improvement in energy life time of the order of 30-35% in comparison to the existing routing methodology which uses co-operative routing techniques among the nodes in WSN. Further, the throughput of game theory enabled adhoc on demand routing is also highly improved in comparison to existing traditional approaches though obtained results. Though, game theory approach is an existing approach concatenation of it with AODV can provide increased network performance which is significant as portrayed in research results shown in the paper. Hence, by virtue of providing enhanced energy life time and data security through the nature of the algorithm, the proposed GTEAODV algorithm can be employed in defence applications for secure data transmission and reception for forthcoming deployment of 5G systems which are blossoming in world wide scenario

Autonomous Energy Management system achieving piezoelectric energy harvesting in Wireless Sensors

International audienceWireless Sensor Networks (WSNs) are extensively used in monitoring applications such as humidity and temperature sensing in smart buildings, industrial automation, and predicting crop health. Sensor nodes are deployed in remote places to sense the data information from the environment and to transmit the sensing data to the Base Station (BS). When a sensor is drained of energy, it can no longer achieve its role without a substituted source of energy. However, limited energy in a sensor's battery prevents the long-term process in such applications. In addition, replacing the sensors' batteries and redeploying the sensors is very expensive in terms of time and budget. To overcome the energy limitation without changing the size of sensors, researchers have proposed the use of energy harvesting to reload the rechargeable battery by power. Therefore, efficient power management is required to increase the benefits of having additional environmental energy. This paper presents a new self-management of energy based on Proportional Integral Derivative controller (PID) to tune the energy harvesting and Microprocessor Controller Unit (MCU) to control the sensor modes

Game theory based distributed clustering approach to maximize wireless sensors network lifetime

International audienceOne of the most significant difficulty in Wireless Sensors Network (WSN) is the development of an effective topology control method that can support the quality of the network, respect the limited memory and at the same time increase the lifetime of the network. This paper introduces a new approach by mixing a non-cooperative Game Theory technique with a decentralized clustering algorithm to address the problem of maximizing the network lifetime. More precisely, this approach uses Game Theory techniques to control the activities of a sensor node and its neighbors to limit the number of the forwarding messages and to maximize the lifetime of the sensor's battery. In other words, the approach will decrease the energy consumed by the WSN by decreasing the number of forwarded packets and improve the network lifetime by harvesting energy from the environment. The simulations results show that the performances in terms of energy saving and increasing the number of data packets received by base station outperforms those with distributed based clustering algorithms without GT, such as low energy and location based clustering LELC and LEACH algorithms