The efficiency to which a wireless multi node network is connected is generally measured by the probability that all the nodes are connected to a master node or connected to a master node via other connected node. The grade of connectivity measures how easily and reliably a packet sent by a node can reach another node. Our thesis work is aimed to find connectivity measurement between the nodes in a wireless multi node network. The result is investigated by randomly placing all the nodes in a given area of 38*38 meters and by estimating the connectivity of the whole network. The sub goals of the thesis are To Design a link metric To Find a Routing algorithm which provides information about neighboring nodesAchieving the expected results from this thesis work, it can be a contribution to the research in the measure of connectivity for a wireless multi-node network. By using the available routing algorithm and by setting up appropriate threshold for (i) Good connectivity (ii) Average connectivity (iii) bad connectivity, the status (connectivity measure) is informed to the master node (teacher node) in the network, so that the life time of the whole network is enhanced. Various results and solutions are provided and discussed for the above stated problem from the practical experiments.