<reponame>chinmaydd/RouteSense
###########################
# Minimum Cost Field Setup#
# Author: chinmay_dd            #
###########################

# Using the local development version of pymote
import sys
sys.path.append("../pymote2.1")
from pymote.message import Message
from pymote.algorithm import NodeAlgorithm
import pdb
# Using infinity from the numpy module
# Although, we will be using a infinity-like value in the actual implementation,
# this particular logic helps in algorithm implementation.
from numpy import inf
from math import isinf

# MCF Algorithm implementation (along with optimization)
class MCFSetup(NodeAlgorithm):
    # Key for data being updated in the node.
    required_params = ('sinkKey',)
    default_params = {}

# Helper method to check if the message is an advertisement
    def check_if_adv(self, message):
        return (message.header == self.ADV or message.header == NodeAlgorithm.INI)

    # Header used to advertise the lowest cost.
    ADV = "advertisement"

    # Status initializer for each node.
    def initializer(self):
        for node in self.network.nodes():
            node.memory["Timer"] = inf
            # If the node is a sink node, broadcase the message and set it to done.
            if self.sinkKey in node.memory:
                self.network.outbox.insert(0, Message(header=NodeAlgorithm.INI,
                            source=node, data=node.memory[self.sinkKey]))
                node.status = "DONE"
            else:
                # Set all other nodes to "IDLE"
                node.status = "IDLE"
                node.memory["BCost"] = inf

    # Method to calculate link cost from A->B
    # Cost of the link maybe a composite of:
    # hop count
    # consumed wireless energy
    # delay between source and sink
    # function of received signal strength (we can use the snr component, 
    # i.e signal to noise ratio
    # number of retransmissions
    def calculate_cost(self, message):
        # Energy consumed during receving the message
        # consumed_wireless_energy = message.destination.power.energy_consumption
        # Closer the SNR is to 0 ==> Better the signal received
        # SNR contains all the params. We can choose it to calculate link_cost
        signal_to_noise_ratio = message.destination.snr[0]
        # Normalizing the snr value as (0-snr/10) and adding the already existing
        # message cost(received from the message) to the same.
        link_cost = float(message.data) + (0-(signal_to_noise_ratio/10))

        return link_cost

    def calculate_other_cost(self, message):
        return float(message.data) + message.destination.distance[0]

    # After the initialization process, each node is set to an idle state.
    # On receiving the first "ADV", the node should transition itself to the
    # listening state. 
    # This implies that further messages are received but not broadcasted.
    # The broadcast duration will depend on a "backoff" algorithm as mentioned in
    # the reference paper.
    def idle(self, node, message):
        # Now, depending on the header of the message we can make two choices:
        # If the header is NodeAlgorithm.INI, this implies that the node is a
        # neighbor to the sink node.
        # Otherwise, the node is just another node in the network.
        # Either way, we will have the node transition into the "LISTENING" state
        # and implement the backoff algorithm.
        if self.check_if_adv(message):
            message_cost = self.calculate_other_cost(message)
            node.memory["BCost"] = message_cost
            node.memory["Timer"] = int(message_cost/2)
            node.status = "LISTENING"
        else:
            # This implies that the algorithm is now in operational mode.
            pass

    def listening(self, node, message):
        pass

    def done(self, node, message):
        pass

    def step(self, node):
        # Standard step code
        message = node.receive()
        if message:
            if (message.destination == None or message.destination == node):
                # when destination is None it is broadcast message
                return self._process_message(node, message)
            elif (message.nexthop == node.id):
                self._forward_message(node, message)

        # Timer-like code.
        if message and node.status == "LISTENING":
                if self.check_if_adv(message):
                    message_cost = self.calculate_other_cost(message)
                # Check if the advertised cost is less than the existing.
                if message_cost < node.memory["BCost"]:
                    # Set the new cost.
                    node.memory["BCost"] = message_cost
                    # Restart the timer.
                    node.memory["Timer"] = int(message_cost/2)
        elif not isinf(node.memory["Timer"]) and node.status == "LISTENING":
            node.memory["Timer"] -= 1
            if node.memory["Timer"] == 0:
                # Broadcast the new message and set the status as done.
                node.send(Message(header=self.ADV, data=str(node.memory["BCost"])))
                node.status = "DONE"

    STATUS = {
                "IDLE": idle,
                "DONE": done,
                "LISTENING": listening
            }

###########################
# Minimum Cost Field Setup#
# Author: chinmay_dd            #
###########################

# Using the local development version of pymote
import sys
sys.path.append("../pymote2.1")
from pymote.message import Message
from pymote.algorithm import NodeAlgorithm
import pdb
# Using infinity from the numpy module
# Although, we will be using a infinity-like value in the actual implementation,
# this particular logic helps in algorithm implementation.
from numpy import inf
from math import isinf

# MCF Algorithm implementation (along with optimization)
class MCFSetup(NodeAlgorithm):
    # Key for data being updated in the node.
    required_params = ('sinkKey',)
    default_params = {}

# Helper method to check if the message is an advertisement
    def check_if_adv(self, message):
        return (message.header == self.ADV or message.header == NodeAlgorithm.INI)

    # Header used to advertise the lowest cost.
    ADV = "advertisement"

    # Status initializer for each node.
    def initializer(self):
        for node in self.network.nodes():
            node.memory["Timer"] = inf
            # If the node is a sink node, broadcase the message and set it to done.
            if self.sinkKey in node.memory:
                self.network.outbox.insert(0, Message(header=NodeAlgorithm.INI,
                            source=node, data=node.memory[self.sinkKey]))
                node.status = "DONE"
            else:
                # Set all other nodes to "IDLE"
                node.status = "IDLE"
                node.memory["BCost"] = inf

    # Method to calculate link cost from A->B
    # Cost of the link maybe a composite of:
    # hop count
    # consumed wireless energy
    # delay between source and sink
    # function of received signal strength (we can use the snr component, 
    # i.e signal to noise ratio
    # number of retransmissions
    def calculate_cost(self, message):
        # Energy consumed during receving the message
        # consumed_wireless_energy = message.destination.power.energy_consumption
        # Closer the SNR is to 0 ==> Better the signal received
        # SNR contains all the params. We can choose it to calculate link_cost
        signal_to_noise_ratio = message.destination.snr[0]
        # Normalizing the snr value as (0-snr/10) and adding the already existing
        # message cost(received from the message) to the same.
        link_cost = float(message.data) + (0-(signal_to_noise_ratio/10))

        return link_cost

    def calculate_other_cost(self, message):
        return float(message.data) + message.destination.distance[0]

    # After the initialization process, each node is set to an idle state.
    # On receiving the first "ADV", the node should transition itself to the
    # listening state. 
    # This implies that further messages are received but not broadcasted.
    # The broadcast duration will depend on a "backoff" algorithm as mentioned in
    # the reference paper.
    def idle(self, node, message):
        # Now, depending on the header of the message we can make two choices:
        # If the header is NodeAlgorithm.INI, this implies that the node is a
        # neighbor to the sink node.
        # Otherwise, the node is just another node in the network.
        # Either way, we will have the node transition into the "LISTENING" state
        # and implement the backoff algorithm.
        if self.check_if_adv(message):
            message_cost = self.calculate_other_cost(message)
            node.memory["BCost"] = message_cost
            node.memory["Timer"] = int(message_cost/2)
            node.status = "LISTENING"
        else:
            # This implies that the algorithm is now in operational mode.
            pass

    def listening(self, node, message):
        pass

    def done(self, node, message):
        pass

    def step(self, node):
        # Standard step code
        message = node.receive()
        if message:
            if (message.destination == None or message.destination == node):
                # when destination is None it is broadcast message
                return self._process_message(node, message)
            elif (message.nexthop == node.id):
                self._forward_message(node, message)

        # Timer-like code.
        if message and node.status == "LISTENING":
                if self.check_if_adv(message):
                    message_cost = self.calculate_other_cost(message)
                # Check if the advertised cost is less than the existing.
                if message_cost < node.memory["BCost"]:
                    # Set the new cost.
                    node.memory["BCost"] = message_cost
                    # Restart the timer.
                    node.memory["Timer"] = int(message_cost/2)
        elif not isinf(node.memory["Timer"]) and node.status == "LISTENING":
            node.memory["Timer"] -= 1
            if node.memory["Timer"] == 0:
                # Broadcast the new message and set the status as done.
                node.send(Message(header=self.ADV, data=str(node.memory["BCost"])))
                node.status = "DONE"

    STATUS = {
                "IDLE": idle,
                "DONE": done,
                "LISTENING": listening
            }
########################### # Minimum Cost Field Setup# # Author: chinmay_dd            # ########################### # Using the local development version of pymote # Using infinity from the numpy module # Although, we will be using a infinity-like value in the actual implementation, # this particular logic helps in algorithm implementation. # MCF Algorithm implementation (along with optimization) # Key for data being updated in the node. # Helper method to check if the message is an advertisement # Header used to advertise the lowest cost. # Status initializer for each node. # If the node is a sink node, broadcase the message and set it to done. # Set all other nodes to "IDLE" # Method to calculate link cost from A->B # Cost of the link maybe a composite of: # hop count # consumed wireless energy # delay between source and sink # function of received signal strength (we can use the snr component, # i.e signal to noise ratio # number of retransmissions # Energy consumed during receving the message # consumed_wireless_energy = message.destination.power.energy_consumption # Closer the SNR is to 0 ==> Better the signal received # SNR contains all the params. We can choose it to calculate link_cost # Normalizing the snr value as (0-snr/10) and adding the already existing # message cost(received from the message) to the same. # After the initialization process, each node is set to an idle state. # On receiving the first "ADV", the node should transition itself to the # listening state. # This implies that further messages are received but not broadcasted. # The broadcast duration will depend on a "backoff" algorithm as mentioned in # the reference paper. # Now, depending on the header of the message we can make two choices: # If the header is NodeAlgorithm.INI, this implies that the node is a # neighbor to the sink node. # Otherwise, the node is just another node in the network. # Either way, we will have the node transition into the "LISTENING" state # and implement the backoff algorithm. # This implies that the algorithm is now in operational mode. # Standard step code # when destination is None it is broadcast message # Timer-like code. # Check if the advertised cost is less than the existing. # Set the new cost. # Restart the timer. # Broadcast the new message and set the status as done.