Question: in QT project; c + + ; please solve the following project: TP Routing Algorithms We are interested in a sensor network composed of heterogeneous

in QT project; c++;
please solve the following project:
TP Routing Algorithms We are interested in a sensor network composed of heterogeneous sensors with adjustable trans mission ranges. The datasensors file provides the geographical position (x, y) and transmission range (Tx) in meters for each sensor, as well as the data transmission time (in meter per second) which varies depending on the technical characteristics of the sensors.1. Based on this file, it is possible to establish the directional communication graph of the network. If possible, provide a visual representation of the communication network or, alternatively, the adjacency matrix of the resulting graph. Clearly specify what the nodes and arcs of this graph represent. 2. A cluster of sensors refers to a set of sensors capable of pairwise communication (poten tially by relaying information through intermediate sensors). Show that this problem of identifying clusters relates to a classical problem in graph theory. Apply an algorithm (which one?) to provide the list of clusters along with the sensors composing them for the studied network. 3. Within each cluster, we wish to calculate the minimal time for message diffusion from one sensor to another and identify the relaying sensors used and their order. Which classic graph problem do you recognize? Apply an algorithm (which one?) to provide the time and transmission path between two nodes within the same cluster. 4. In each cluster, the failure of one or more sensors can lead to a communication breakdown. For each cluster, identify the minimum number of nodes (which ones?) that, if they were to fail, would result in the termination of message propagation within the cluster. Explain the algorithm used. 5. Lets assume that it is possible to modify the transmission range of some sensors to achieve a fully connected network (allowing bi-directional message exchange between any pair of nodes in the network). What is the minimum number of sensors on which you must act to achieve this total connectivity? Explain your reasoning and provide the list of relevant sensors.6. Write a brief report (2 pages) which gives : resume of the project, choice of data structures, choice of appropriate algorithms, answers to questions.
data sensors file:
1.4007662640614038,10.289565548673885,120,0.4293176344830848
6.015093601776722,188.13317814911267,117,0.6582682366761007
134.31149714571876,63.77839630204684,45,0.8922971080274289
59.945024388360004,186.15527090176607,78,0.3092777087214991
170.44042657926403,64.54889941756214,21,0.5341268278001268
78.73518962350036,83.40087119172708,105,0.45781006175690453
110.51800392414125,97.68972829374908,81,0.395338552624271
79.6078631618272,33.99563062246636,106,0.3139300427064613
103.31568265463795,24.00429263047601,148,0.8174736804732196
154.62774665586667,166.69034760223224,144,0.6729420522387158

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!