Browse > Article
http://dx.doi.org/10.7840/kics.2012.37A.10.876

Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks  

Cha, Jae-Ryong (아주대학교 전자공학과 무선 인터넷 연구실)
Kim, Jae-Hyun (아주대학교 전자공학과 무선 인터넷 연구실)
Abstract
This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.
Keywords
Multihop; Distributed; Sequential scheduling; WSN;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. V. Madhav, A. Panconesi, and L. D. Risinger, "An experimental study of a simple, distributed edge coloring algorithm," in Proc. 12th annual ACM symposium on Parallel algorithms and architectures, pp. 166-175, Oct. 2000.
2 S. Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks," Wireless Networks, pp. 81-94, Apr. 1999.
3 P. Djukic and S. Valaee, "Delay aware link scheduling for multi-hop TDMA wireless networks," IEEE/ACM Trans. Netw., vol. 17, no. 3, Jun. 2009, pp. 870-883.   DOI   ScienceOn
4 M. Trung and J. H. Mo, "A multichannel TDMA MAC protocol to reduce end-to-end delay in wireless mesh networks," ETRI Journal, vol. 32, no. 5, pp. 819-822, Oct. 2010.   DOI   ScienceOn
5 IEEE 802.11s. Draft Amendment: ESS Mesh Networking, Nov. 2006.
6 S. Gandham, M. Dawande, and R. Prakash, "Link scheduling in sensor networks: distributed edge coloring revisited," in Proc. INFOCOM, pp. 2492-2501, Mar. 2005.
7 A. Panconesi and A. Srinivasan, "Improved distributed algorithms for coloring and Network decomposition problems," in Proc. ACM Symposium on Theory of Computing, pp. 581-592, May 1992.
8 D. A. Grable and A. Panconesi, "Nearly optimal distributed edge colouring in O(log log n) rounds," in Proc. ACM SIAM symposium on Discrete algorithms, Jan. 1997
9 K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie, "Protocols for selforganization of a wireless sensor network," IEEE Personal Communications, vol. 7, no. 5, pp. 16-27, 2000.   DOI   ScienceOn
10 J. Misra and D. Gries, "A constructive proof of vizing's theorem," Information Processing Letter, vol. 41, pp. 131-133, Mar. 1992.   DOI   ScienceOn