JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks
Cha, Jae-Ryong; Kim, Jae-Hyun;
  PDF(new window)
 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;
 Language
Korean
 Cited by
1.
에너지 생산이 가능한 무선 센서 네트워크에서 잔여 에너지 인지 듀티-사이클 스케줄링 기법,이성원;유홍석;김동균;

한국통신학회논문지, 2014. vol.39B. 10, pp.691-699 crossref(new window)
 References
1.
S. Gandham, M. Dawande, and R. Prakash, "Link scheduling in sensor networks: distributed edge coloring revisited," in Proc. INFOCOM, pp. 2492-2501, Mar. 2005.

2.
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.

3.
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

4.
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. crossref(new window)

5.
J. Misra and D. Gries, "A constructive proof of vizing's theorem," Information Processing Letter, vol. 41, pp. 131-133, Mar. 1992. crossref(new window)

6.
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.

7.
S. Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks," Wireless Networks, pp. 81-94, Apr. 1999.

8.
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. crossref(new window)

9.
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. crossref(new window)

10.
IEEE 802.11s. Draft Amendment: ESS Mesh Networking, Nov. 2006.