On Wireless Scheduling Using the Mean Power Assignment

In this paper the problem of scheduling with power control in wireless networks is studied: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of concurrently transmitting nodes. The signal interference is modeled by SINR constraints. Approximation algorithms are given for this problem, which use the mean power assignment. The problem of schduling with fixed mean power assignment is also considered, and approximation guarantees are proven

Review - Improve Performance of Efficient Aggregation Scheduling In Multihop Wireless Sensor Network

The aggregated scheduling of data in networks of wireless sensors with interference of signal with SINR limitations is studied. A routing tree is formulated hat provides an overview of scheduling algorithms by which schemas of interlinking that are free of collision for clustering of data. The latency of algorithm that is suggested is improvised of IAS & DAS. The delay counted n every algorithm is O(R + ?) in time-slots, where ? & R are radius of graph & the extreme degree of node in a minimized graph communication of the real network, are optimized in sensors which are wireless. It is observed that throughput of algorithms suggested in enhanced than that of CIAS & CDAS