Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In wireless sensor networks, minimizing por consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work,  present a distributed algorithm for assigning minimum possible por to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum por information from all the nodes in its vicinity, and then it adjusts the pors of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths.  prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum por G max  is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant por saving can be achieved by using this algorithm.
['Indranil Saha', 'Lokesh Kumar Sambasivan', 'Ranjeet Kumar Patro', 'Subhas Kumar Ghosh']
I am writing a research paper on a idea Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks
[{"from": "human", "value": "I am writing a research paper on a idea Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In wireless sensor networks, minimizing por consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work,  present a distributed algorithm for assigning minimum possible por to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum por information from all the nodes in its vicinity, and then it adjusts the pors of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths.  prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum por G max  is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant por saving can be achieved by using this algorithm."}]