Dynamic Channel Assignment for Wireless Sensor Networks: A Regret Matching Based Approach
Our Price
₹3,500.00
10000 in stock
Support
Ready to Ship
Description
In wireless sensor networks employed with multiple channels in order to reduce the interference as well as support parallel transmission. Energy usage over the network dramatically increased because of usage of multiple channels. To overcome this problem which was addressed above statement have been achieved by proposed a Regret Matching based Channel Assignment algorithm (RMCA). In this strategy each sensor node elect its choice of channels based on the channel state information which leads to reduce the interference. In RMCA approach is more distributed over network and limited information is exchanged among sensor nodes so that can achieve minimum delivery ratio even less number of flows performed. This algorithm performed well for time-variant flows and network topology. It provided better network performance in the case of delivery ratio and packet latency compared with existing methods such as CONTROL, MMSN and randomized CSMA. Deploy the sensor nodes over network and assign the non-overlapping channel for receiving packets from various sensor nodes. The utility function is derived based on the valid receiving ratio (VRR) and average packet transfer delay (ATD). Based on the utility function all sensor odes are completely measured without exchanging the information among other nodes. At last channel assignment by RMCA to the time-invariant transmission flows to reduce interference efficiently.
Tags: 2015, Communication, Matlab


