Random Scheduling for Exploiting Throughput and TSMA Scheduling for Alleviating Interference in Wireless Systems

(*) Corresponding author

Authors' affiliations

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


Wireless systems schedule communicates resourcefully by allocating the shared band among associations in the identical geographic region. The lack of central control in wireless networks calls for the design of distributed scheduling algorithms. We present a distributed framework that guarantees maximum throughput. The framework is based on random scheduling which reflect best throughput power distribution in multi-hop wireless systems. The revision of this difficulty has been restricted due to the non-convexity of the primary optimization complications that forbids a well-organized answer. We yield a randomization method to agree with this trouble. We demonstrate the power distribution result through mathematical analysis and perform numerous extensions for the measured difficulty. Also, we examine how fast data can be composed from a Wireless Sensor (WS) system structured as tree. We discover and estimate a method by means of accurate simulation prototype under join cast. We reflect period setting up on a single occurrence channel with the goal of reducing the number of period slits needed to complete a join cast. We associate Time Separation Multiple Access (TSMA) scheduling with broadcast power controller to lessen the properties of interference and demonstrate that while power controller aids in decreasing the plan distance under a single occurrence, arrangement broadcasts by means of numerous occurrences is well-organized. We estimate the performance of several channel task techniques and discovery experientially that for reasonable extent systems of many nodes, the use of multiple occurrence scheduling can be sufficient to reject maximum intervention. Graphical representations are given for Mean life time, Packet Delivery Rate (PDR), throughput and time delay.
Copyright © 2013 Praise Worthy Prize - All rights reserved.


Gossip Procedure; Power Distribution; TSMA Scheduling; Information Gathering; Euclidean Distance

Full Text:



H.W. Lee, E. Modiano, L.B. Le, Distributed Throughput Maximization in Wireless Networks via Random Power Allocation, IEEE Transactions on Mobile Computing, Vol. 11, n. 4, pp. 577-590, April 2012.

M. Chiang, Balancing Transport and Physical Layers in Wireless Multi-hop Networks: Jointly Optimal Congestion Control and Power Control, IEEE Journal Selected Areas Communication, Vol. 23, no. 1, pp. 104-116, Jan. 2005.

X. Lin and N. Shroff, The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks, IEEE/ACM Transaction Networking, Vol. 14, n. 2, pp. 302-315, Apr. 2006.

S. Boyd, A. Ghosh, B. Prabhakar, Randomized gossip algorithms, IEEE Transaction Information Theory, Vol. 52, n. 6, pp. 2508–2530, June 2006.

E. Modiano, D. Shah, G. Zussman, Maximizing Throughput in Wireless Networks via Gossiping, Proceedings of the Joint International Conference on Measurement and Modelling of Computer Systems (SIGMetrics/Performance), (Page: 27-38 Year of Publication: 2006 ISBN: ACM 1-59593-320-4).

X. Lin, N.B. Shroff, R. Srikant, A Tutorial on Cross-Layer Optimization in Wireless Networks, IEEE Journal Selected Areas Communication, Vol. 24, n. 8, pp. 1452-1463, Aug. 2006.

G. Sharma, N.B. Shroff, R.R. Mazumdar, On the Complexity of Scheduling in Wireless Networks, EURASIP Journal on Wireless Communications and Networking, 2010, doi:10.1155/2010/418934.

A. Eryilmaz, A. Ozdaglar, E. Modiano, Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks, Proceedings of 26th IEEE International conference on computer communications (Page: 499 - 507 Year of Publication: 2007 ISBN: 1-4244-1047-9 ).

S. Sanghavi, L. Bui, R. Srikant, Distributed Link Scheduling with Constant Overhead, IEEE/ACM Transactions on Networking, Vol. 17, No. 5, pp. 1467 - 1480, Oct. 2009.

C. Joo, X. Lin, N.B. Shroff, Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks, IEEE/ACM Transactions on Networking (TON), Vol. 17, n. 4, pp. 1132-1145, Aug. 2009.

H. Dai, R. Han, A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks, Proceedings of the IEEE Conference on Global Telecommunication (Page: 548-552 Year of Publication: 2003).

O.Durmaz Incel, B. Krishnamachari, Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks, Proceedings of the IEEE Communication Society Conference on Sensor, Mesh and Ad Hoc Communication and Networks (Page: 569-577 Year of Publication: 2008).

Feng Wang and Jiang chuan Liu, Networked Wireless Sensor Data Collection: Issues, Challenges, and Approach, IEEE Communications Surveys and Tutorials, Vol. 13, No. 4, 2011.

A.Ghosh, O.Durmaz Incel, V.A. Kumar, B. Krishnamachari, Multi-Channel Scheduling Algorithms for Fast Aggregated Convergecast in Sensor Networks, Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (Page: 363-372 Year of Publication: 2009).

Wen-Zhan Song, Richard La Husen, Time-Optimum Packet Scheduling for Many-to-One Routing in Wireless Sensor Networks, Proceedings of the IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (Page: 81-90 Year of Publication: 2008).

Y. Wu, J.A. Stankovic, T. He, S. Lin, Realistic and Efficient Multi-Channel Communications in Wireless Sensor Networks, Proceedings of the IEEE INFOCOM, (Page: 1193-1201 Year of Publication: 2008).

K. Kalai Kumar, E. Baburaj, Performance Analysis of Cross Layer Communication in Wireless Sensor Network to Improve Throughput and Utility Maximization, (2013) International Review on Computers and Software (IRECOS), 8 (11), pp. 2634-2641 .

Marwan Al-Jemeli, Fawnizu A. Hussin, Energy Efficient and High Throughput Composite Routing Metric for Mobile Wireless Sensor Networks, (2013) International Review on Computers and Software (IRECOS), 8 (9), pp. 2269-2277.

S. G. Santhi, K. Venkatachalapathy, Collision Free Scheduling and Rejoin Procedure for Multiple Cluster Tree in 802.15.4 Sensor Networks, (2013) International Review on Computers and Software (IRECOS), 8 (6), pp. 1279-1286.


  • There are currently no refbacks.

Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize