We want to build an ad-hoc wireless network (One Sink node and N normal nodes). Each normal node need to find the optimal routing path (in term of less number of hops) up to sink node (Which collect the data from all network nodes). Each node need to get the optimal number of hops through Q-Factor implementation.
Let suppose, we have ‘N’ nodes deployed in network, each node need to get the optimal number of hop to reach upto sink node.
Each node need shortest path in term of less hops.
I will briefly describe before awarding the project to avoid any future confusion.
Real time implementation is needed (For real time, you can take 4 to 5 raspberries or 4 to 5 PCs)
3 freelancers are bidding on average ₹9092 for this job
Hello! I am a python developer. I looked at your project and it seems interesting. I have all necessary skills required for this project. Ping me to discuss in detail.