We remember utility maximization in networks the place the sources do not employ go with the flow manage and may just accordingly overload the group. Inside the absence of go-with-flow manipulation on the sources, some packets will inevitably have got to be dropped when the neighborhood is in overload. To that end, we first advance a disbursed, threshold situated packet-shedding protection that maximizes the weighted sum throughput. Subsequently, we don't forget utility maximization and strengthen a receiver-headquartered waft manipulate scheme that, when combined with threshold-situated packet shedding, achieves the best utility. The glide manipulation scheme creates digital queues on the receivers as a push-back mechanism to optimize the number of talents dropped at the destinations by means of again-strain routing. A wi-fi sensor neighborhood can get separated into a few associated add-ons due to the failure of some of its nodes, which is known as a cut-down. In this article, we recollect the mission of detecting cuts with the aid of the remaining nodes of a wi-fi sensor community. We suggest an algorithm that allows for (i) each and every node to realize when the connectivity to a specially detailed node has been misplaced, and (ii) a number of nodes (that are connected to the targeted node after the scale down) to understand the incidence of the cut. The algorithm is allotted and asynchronous: each node desires to hold up a correspondence with excellent those nodes which will also be inside its verbal trade range. The algorithm is established on the iterative computation of a fictitious electrical knowledge of the nodes.