Using PSO to Optimize the Performance of Timeslot Scheduling in Mesh Wireless Network

Article Preview

Abstract:

In IEEE802.15.4 compatible network, TDMA mechanism was used to access the medium and all nodes communicate to each other within one superframe periodically. In order to use the time slot efficiently, graph coloring algorithms are used to schedule the time slots in wireless sensor network. In this paper, the impacts of different assignments on network performance were analyzed and the result was extended to mesh topology network. The proposed data delay model was used to design a PSO algorithm to optimize the assignment schema. Finally, simulation was carried out to verify the practicability of the algorithm and the optimization effect was shown.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1619-1624

Citation:

Online since:

November 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] IEEE 802. 15. 4 standard: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specification for Low-Rate Wireless Personal Area Networks (LR-WPANs) (2003).

DOI: 10.1109/ieeestd.2006.232110

Google Scholar

[2] ZigBee Alliance: http: /www. ZigBee. Org/en/resources, 2007-02-11.

Google Scholar

[3] HART communication foundation. TDMA Data Link Layer, HCF_SPEC-075, Revision 1. 0 [S] (2007).

Google Scholar

[4] Wireless Industry Automation Specification for Porocess Automation. IEC pass/62601 [S] (2008).

Google Scholar

[5] Gandham S, Dawande M and Prakash R: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05). New York, USA: ACM (2005), p.2492–2501.

DOI: 10.1109/infcom.2005.1498534

Google Scholar

[6] M.V. Marathe, A. Panconesi and L. D Risinger: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (SPAA '00). New York, USA: ACM, 2000: 166–175.

DOI: 10.1145/341800.341820

Google Scholar

[7] X.D. Zhang, J. Hong, L. Zhang, X.M. Shan, O.K.L. Victor and CC-TDMA: Proc. of IEEE WCNC 2007. Hong Kong, China: March, 2007: 133-137.

Google Scholar

[8] P. Djukic and S. Valaee: Proc. IEEE INFOCOM'07. Anchorage, AK: May 2007: 28-36.

Google Scholar

[9] C. Gomes and H. Rivano: INRIA: Tech. Rep. 6198, May (2007).

Google Scholar

[10] W. Wang, Y. Wang, X. Li, W. Song and O. Frieder: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MOBICOM '06). Los Angeles, USA. September (2006), pp.262-273.

Google Scholar

[11] C.E. Sinerm and V. Pravin: Berkeley, CA, USA: University of California Berkeley. Department of Electrical Engineering and Computer Science, (2005).

Google Scholar

[12] D.A. Grable and A. Panconesi: In Proc. of the eighth annual ACMSIAM symposium on Discrete algorithms: New Orleans, Louisiana, United States: ACM (1997), pp.278-285.

Google Scholar

[13] T. Aldowaisan and A. Allahverdi: Computer & Operation Research, Vol. 30(2003), pp.1219-1231.

Google Scholar

[14] PAN QuanKe, B.H. Zhao and Y.G. Qu: Chinese Journal of Computers, No. 7(2008), pp.1147-1154 (in Chinese).

Google Scholar