Keywords:-
Article Content:-
Abstract
Broadcasting plays an important role in the communication protocol design and it acts as a fundamental operation in wireless sensor network (WSN). This paper investigates the Minimum Latency Broadcast Scheduling in Duty Cycled (MLBSDC) problem in WSN. The MLBSDC problem aims to find a broadcast scheduling that minimizes the time in which the last node receives a broadcast message with minimum collision. The focus is mainly on providing minimum collision and finding the lower bound of broadcast latency. In this paper, a novel algorithm Collision Optimized Broadcast Scheduling (COBS) is proposed. COBS allow
nodes in different layers of the broadcast tree to transmit the message simultaneously. It is proved that COBS produces a latency of at most 12 |T|, where T denotes the number of time slots in a scheduling period. In COBS algorithm, latency and the collision is reduced by layered approach. To prevent collision, each node maintains an effective routing table and only one parent node transmits the message to the child node. The results from extensive simulation show that COBS has a better performance than the existing One To All Broadcast (OTAB) algorithm in terms of reduction in latency, number of transmission and collision.
References:-
References
Y Duan, S Ji, Z Cai, in IEEE IPCCC. Generalized broadcast scheduling in duty-cycle
multi-hop wireless networks, Orlando, FL, USA,17–19, Nov 2011.
W Ye, J Heidemann, D Estrin, in IEEE INFOCOM. “An energy-efficient MAC
protocol for wireless sensor networks,” New York, NY, USA, 23–27, Jun 2002.
R. Mahjourian, F. Chen, and R. Tiwari, M. Thai, H. Zhai, Y. Fang, “An approximation
algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks,” in
Proc. of ACM MobiHoc, pp. 331-340, 2008.
D Bozdag, U Catalyurek, AH Gebremedhin, F Manne, EG Boman, in IEEE HPCC. “A
parallel distance-2 graph coloring algorithm for distributed memory computers”.
Sorrento, Italy, 21–23, Sept 2005
I. Stojmenovic, M. Seddigh, and J. Zunnic, “Dominating Sets and Neighbor
Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE
Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, 2002. 6. J. Hong, J. Cao, W. Li, S. Lu, D. Chen, “Sleeping schedule-aware minimum latency
broadcast in wireless ad hoc networks,” in Proc. of IEEE ICC, pp. 69-73, 2009.
C Hua, TSP Yum, “Asynchronous random sleeping for sensor networks”. ACM Trans.
Sensor Network . doi:10.1145/1267060.1267063,2007.
B. Tang, B. Ye, J. Hong, K. You, S. Lu, “Distributed Low Redundancy Broadcast for
Uncoordinated Duty-Cycled WANETs”, in Proc. of IEEE Globecom, pp. 1-5, Dec
F. Wang, J. Liu “On Reliable Broadcast in Low Duty-Cycle Wireless Sensor
Networks,” IEEE Transaction on Mobile Computing, vol. 11, pp. 767-779, 2012.
R. Gandhi, Y. Kim, S. Lee, J. Ryu, P. Wan, “Approximation algorithms for data
broadcast in wireless networks,” IEEE Transactions on Mobile Computing, vol. 11,
no. 7, pp. 1237-1248, 2012.
PJ Wan, SCH Huang, L Wang, Z Wan, X Jia, in ACM MobiHoc. “Minimum-latency
aggregation scheduling in multihop wireless networks,” New Orleans, LA, USA, 18–
, May 2009.