Cross Layer Based Dynamic Traffic Scheduling Algorithm for Wireless Multimedia Sensor Network

Abstract

The data traffic volume is generally huge in multimedia networks since it comprises multimodal sensor nodes also communication takes place with variable capacity during video transmission. The data should be processed in a collision free mode. Therefore, the packets should be scheduled and prioritized dynamically. Dynamic traffic scheduling and optimal routing protocol with cross layer design is proposed here to select the energy efficient nodes and to transmit the scheduled data effectively. At first, the optimal routes are discovered by selecting the best prime nodes then the packets are dynamically scheduled on the basis of severity of data traffic. The proposed method works in two stages such as (i) Selection of chief nodes and (ii) Dynamic packet scheduling. The first stage of this mechanism is chief node selection and these chief nodes are selected for optimal routing. Selection of chief nodes is done by estimating the distance between the nodes, and energy value of the nodes. This stage makes the network energy efficient. The second stage is involved with dynamic scheduling of packets and sending the packets with respect to the Packet Priority of queue index key value. Real-time data packets (PQP1) have very high priority and it is scheduled using Earliest Deadline First Scheduling (EDFS) algorithm when compared to non-real time data packets (PQP2 and PQP3) which is scheduled on basis of First Come First Serve (FCFS) manner. This process minimizes the congestion and avoids the unnecessary transmission delay. Therefore, the results are analyzed through the simulation process and the efficiency of the proposed methodology is 56% better than the existing methodologies.