Static Channel Versus Dynamic Channel Allocation Systems Computer Science Essay

unmoving rail line Versus combat-ready p bentage apportioning Systems Computer Science EssayAbstract- street assignation Schemes have endlessly held a bouncy role in achieving die transaction of piano tuner ne devilrks. This paper has studied the comparing mingled with cardinal of the most known techniques of line of merchandise par cubicleing namely soundless ravish storage allocation and propellant bloodline tryst. The equivalence is made everywhere two types of meshs ace communicate net profit, in which severally of piano tuner inspissation is equipped with exclusively whizz piano tuner receivercommunication port, and multi radio cyberspace, in which all(prenominal) of the lymph gland is equipped with at least two transceivers. This paper registers the item survey of all the existing comparison made between these two final causes.Keywords- business line apportionment Scheme, slashing Channel tryst, Static Channel Allocation, iodin ra dio net piss, Multi-radio profitsIntroductionGrowth in the customers of the tuner earningss, allow it be boothular arrangings or apiece other radio set net mold, has amplified the walk out on to have the mesh topologys which trick have much might and accommodate more than and more users. Enlargement of wireless market has made expertness of the wireless network a scarce resource. Methods to improve effective mental ability usage of the wireless network atomic flesh 18 under amity and in 4, it is know that these methods involve source coding projects, power bind, give way modulation proposals, better antennas. Other then these methods competency of wireless system sack be improved by installing more bas stations i.e increasing fleck of pass alongting equipment or improving hardw are equipment of current system. Using better add storage allocation schemes is also nonpareil of the methods to improve capacity manipulation of wireless network.The aim of this paper is to focus on line of merchandise allocation schemes. These transfer allocation schemes are non a great deal of importance in the wired networks because their analysis situs is stable and they do non offer some(prenominal) mobility to the users/ pommels. more everywhere in the wireless networks, get allocation of key importance. The vital role of the wireless networks is that they offer mobility to users hence, the direct allocation algorithmic rule has to deal bring to ports and portables so that best trade-off between the quality of helper and system feat is master(prenominal)tained 3.A presumptuousness spectrum of relative frequency, can be divided into several independent sets, these independent sets are completely break up with each other. Hence even if they are used concurrently, they departing not interfere with each other. So splitting the frequency spectrum into independent melodic line and then using all the conduct for communicat ion simultaneously present improvement in the capacity utilization 6.The business allocation scheme is considered to be the core of mobile networks because it not only affects the quality and the handiness of the transmit to the user but changes the distribution of the job and hence, boilers suit shapes the capacity of the network 3.Two of the most common delight allocation schemes are considered in this paper namely, FCA- frigid Channel Assignment or Fixed Channel Allocation and DCA- Dynamic Channel Allocation.Fixed Channel Allocation (FCA)Fixed Channel Allocation is also known as Static Channel Allocation. It is known as Fixed or Static because at one measure the contain is allocated to a port or a user it does not change for the entire course of operation. It is used in all TDMA/FDMA digital cellular mobile networks 5 as look of frequency carriers in each cell stays doctor and does not depend on concern load. It is a judgment of conviction insensitive solution, as with the passage of prison term allocation of the channel to inspissations does not change. Although in real-time, occupation load in a cell varies, at that place are peak hours when the concern load reaches to virtually 100% and then thither are quiet hours in a cell when traffic load is very low. This limitation dispirits the use of the FCA. entirely if a static condition is considered at that place is most likely a find to get good accomplishment with this channel allocation algorithm 3.In a cellular system based on the FCA, impart are partitioned among the cells permanently so that if all the cells use all the take assigned to them simultaneously, there depart be no interference 1. shape cell pattern for Static Channel Allocation with N = 7With more complex systems other channel strategies can achieve higher(prenominal) efficiency but they require processors with more memory. But it is an essential grant to make as in 4 it is discussed that in each cell there are no static conditions, space traffic imbalance varies from 10% to 70%, and this imbalance in the traffic depends on the size of the cell or service area and type of the environment, whether its urban, suburban or campestral area 4.Dynamic Channel Allocation (DCA)In DCA, frequency impart are not fixed for any invitee or user. Depending upon knowledge of the environment, take are assigned to the user. The distribution of the frequency carriers in a cell depends upon distribution of the users/ bosss in the cell and also on offered traffic load. DCA is currently supported by the GSM 5. In Dynamic Channel Allocation Scheme all the channels which are available for a system, are kept in a queue or a spool. These channels are allocated to any cell temporarily. The only constraint is to fulfil the blank criteria, so that interference can be minimized 2.The existing schemes for the Dynamic Channel Allocation can be categorized into three main types IA-DCA (Interference adaptative Dynam ic Channel Allocation), LA-DCA (Location Adaptive Dynamic Channel Allocation) and TA-DCA (Traffic Adaptive Dynamic Channel Allocation), these schemes are based on the type of network dynamics they consider succession making decision 4. All DCA schemes fundamentally evaluate the cost of using each available channel and opts the channel which introduces lowest cost 2.For most accurate and good decision for channel allocation, the algorithm should have accurate knowledge of the environment 3. The main algorithms which are considered under the ingest of Dynamic Channel Allocation are DCET, Bellcore and requisition DCA 3. In DCET and Bellcore DCA algorithms, the decision of channel allocation is based on only integrity measurement of channel dynamics, while in the Segregation DCA, a radio interface acquires the channel depending upon its learning through past take care of channel usage. With the past knowledge, channel which has highest probability of success is chosen for operatio n. Although this algorithm requires processors with memory yet as decision is more meaningful so its performance is better than the DCET and Bellcore DCA algorithms 3.In epithet of speech 2, in 7 results of performance of varied type of DCA schemes are compared. range of a function Performance of Different DCA methodsSection II of the paper compares both of the channel allocation schemes in a single radio network and Section III shares the comparison done of channel allocation schemes in multi-radio network. Section IV shares the identified regions in which time to come work can be done and Section V concludes the paper. parity of DCA and FCA in adept Radio profitsA single radio network a network in which all of the lymph inspissations of the wireless network consist of maximum of one radio interface and this single radio interface is used for the communication purposes. In this section the comparison of the DCA and FCA in single radio network is presented. pick up Algorith ms for Dynamic Channel AllocationIn a given cell, if a thickening requests a outcry, it testament be served only and only if the cell has an unused channel available, which fulfils the utilise criteria, otherwise the bitch impart be jam 1. Such is the effect with Static Channel Allocation Scheme. But this is not the font with the Dynamic Channel Allocation Schemes, as for each of the bring forward that is to be served channel is interpreted from the overall pool that holds all the channels available for wireless system.In any channel allocation strategy, main aim is to insure the best possible way to reuse the channels to maximize the systems capacity, while keeping interference in the system at minimum and submit quality of service to the user 4. From another view, for allocating channel, the objective is taken as to allocate the channel to a peal so that offspring of blocked calls is minimized and the heel of dropped calls is also minimized. In the end, the channel allocation scheme finds the best trade-off between these two objectives because generally priority is given to minimize the fall of dropped calls, as having a call dropped is more unwanted then not having the call connected at all 1. twain schemes for channel allocation FCA and DCA are compared under the assumption that the call reach distribution is Poisson 5. For the purpose of modelling in FCA it is considered that there are z numbers of channels per frequency carrier and y is the number of control channels. In a given cell i, let total number of frequency carrier be Ci and the total number of channels in the cell, which will be used to serve a call will be ci. The expression for ci is given as(1) piece of music this will not be the case for DCA, as frequency carriers are not permanently assigned to any of the cell. As the channel ap channelment depends on environment so, if we take n as the number of active calls in any cell, then frequency carriers allocated to that cell wi ll be(2)Total number of channels required, for any cell should be friction match to the number of active calls and the control channels. But the number of frequency carriers which has z number of channels each should be either more or equal than actually required 5.In equation (2), shows that value is always taken equal or great than a 5.For the first feigning, the stretch rate of the calls is set at the clot value this means that the overload period is considered where the numbers of calls initiated per minute are more than the actual capacity of the system.The observation made over here is that, under heavy traffic load, efficiency of the network or the channel utilization and capacity of the network does not improve by using DCA instead of FCA. Although it was considered as the accompaniment that DCA will always perform better than FCA.Figure act of the handover on FCA and DCAIn visualise 4, the phenomenon observe is known as phenomenon of low capacity island 5. Under h eavy load, no benefit is achieved by using DCA, as in much(prenominal) a scenario both of the schemes will be utilizing capacity to the full extent. Rather DCA may perform worse than FCA. The reason is that due to dynamic channel allocation, a cell may take rough of the frequency channels form the neighbouring cells during the low traffic period and the neighbouring cell does not get the channel back. The cell which has obtained the channel is let us say known as the lucky cell, and the cell which donated the channel and in the end, was unable to get it back is known as unlucky cell 5. Now during the high load traffic period, if lucky cell wants to handover the call to a neighbouring unlucky cell. But as the unlucky cell would already be out of available channels to be able to serve the call, call will be dropped. Hence under such a scenario the drop out probability of dynamic channel allocation scheme would be higher than static channel allocation algorithm.Other simulation is to find out the effect of the arrival rate on call blocking probability. Arrival rate is the number of calls initiated per minute.Through simulation, it is concluded that DCA performed better if the traffic load is within the range 0.6 to 0.9 Erlang/BS/Channel. (figure 5)Figure compendium of DCA and FCA, call blocking ratio with lever to the arrival rate of the callsDuring the coterminous case it was considered that arrival rate is Poisson and the other parameters like handover rate and call holding time etc are evenly distributed all over the cell.From the figure 6 it is clear that as probability of call blocking holds with the gain in the arrival rate of calls. Which is fairly obvious, more are the number of the users which are to be served, there is more likely a chance that some of them may not be able to get a free channel.Figure Performance analysis of FCA and DCA, Arrival rate of calls with respect to the over all blocking probabilityUnder such consideration as can be observed from the figure 6, DCA performs better than FCA, as in case of congestion in a cell, DCA can borrow channels from the neighbouring cells but in case of FCA, the scheme has no pickaxe but to reject the oncoming calls in case of congestion.Figure 7 shows the amount of traffic carried by FCA and DCA according to the traffic load.Figure comparison between FCA and DCA with respect to the carried traffic under the traffic loadFigure 8 shows the performance of the channel allocation schemes when traffic imbalance is considered. It is observed that network capacity to carry info, in case of FCA, reduces really when info imbalance is considered. But in case of DCA, there is no important abasement in networks capacity to carry the data. There is also significant enlarge in the number of calls blocked by FCA, because of the increase in the traffic imbalance. But as the carried capacity does not decrease much in case of the DCA, there is not much of the maturation in number o f the blocked calls.Figure FCA Vs. DCA, effect of the traffic imbalance on the both channel allocation techniquesComparison of DCA and FCA in Multi Radio NetworkA multi radio network is the type of the network where each node is equipped with at least two or more than two transceivers.Fixed Channel Allocation in Multi-radio networkIt is pointed out in 14, throughput and overall performance of wireless networks decreases with increased density of radios, but study reason for this problem is that these radios do not transmit the data simultaneously as the nodes are generally configured with single radios only and this federal agent basically limits the forwarding capacity of the network. In 15, the authors have emphasized that with the institution of more than one NIC (Network interface cards) in wireless networks, performance of the system can be improved 6 to 7 times, instead of in force(p) doubling the performance. The same phenomenon has been confirmed in 16.There has been mu ch work done, in which the performance gain in wireless mesh networks with quadruplicate interfaces is discussed as compared to single radio interface network. In 13, capacity gain between single radio, dual radio and multi-radio wireless mesh networks is compared and realistically the gain achieved by having dual radio interfaces in the network has been discussed. apart(predicate) from that, in 17, authors have proposed that with writ of execution of multi-radio Diversity approximately 2.3 times performance gain is measured in the single radio network.Under the multi-radio scenario, one important factor is to consider proper channel date. Each of the radios should be tuned to a frequency through which the throughput of the whole network is maximized. The introduction of aggregate radios is not without the trade off of increased complexity of channel assignment schemes and the traffic allocation methods 20 and apart from that, more work is done in this domain. In 10, 8, 19, the authors have proposed some approaches to get maximum possible throughput by several(predicate) channel assignment algorithms.The concept of the Static Channel Allocation in this section is extended to Wireless Mesh Networks, as out front the start of the operation in the wireless mesh networks the channels are properly allocated and then bank the end of the operation, the channel assignment does not change. In this section, multi-radio wireless mesh network is considered and it is observed that how by having quadruplex radio interfaces the performance of the network improves.Figure Performance of the FCA algorithms with 3 channelsFigure 9 shows the impact of the different algorithms for the channel allocation in the three channel scheme 8.Figure performance of the FCA algorithms with 12 channelsFigure 10 shows the impact of the different algorithms for the channel allocation in the twelve channel scheme 8.Figure 11 shows that with different channel allocation algorithms, how the increment in number of interfaces per node impacts the performance of network. In all algorithms it is observed that with the increase in number of radio interfaces per node, throughput of wireless networks improves 9.Figure FCA algorithm comparison with different number of radio interfaces per nodeFigure effect of increased number of interfaces per node on the over all normalized broadcast response timeIn figure 12, it is shown that with different channel allocation schemes for multi-interface wireless mesh network, normalized latency for broadcast decreases with the increase in number of radio interfaces per node 9.In figure 13, it is simulated that with the increase in the number of interfaces per node, there is not an unlimited increment in capacity utilization. Multi radios are used so that in a network there could be as many concurrent infections as possible. But even this has a limit to it. In 10, it is shown that after achieving the maximum take aim of capacity uti lization, even after by adding more number of radio interfaces in a network, no advantage is gained.Figure capacity degradation with increase in the number of radio interfaces per nodeFigure Effect of the number of channels and three-fold radio interfaces on the throughputIn figure 14, it is shown that as long as the number of the available channels in a cell are more than the number of interfaces per node, with increase in number of radios per node, throughput of the network will increase 11.Figure throughput increment of a network by increased number of the interfaces per nodeIn figure 15, it is shown that under a proper channel assignment and routing method, with more number of interfaces per node, the throughput of the system improves considerably 12.In 13, as shown in figure 16 and 17, performance of fixed channel allocation scheme is compared in peak with respect to single radio network and the multi-radio network.Figure overall network capacity increment with more numbe r of radio interfaces present at each nodeIn figure 16, it is proved that the capacity of the overall system improves with the usage of multiple radios per node.Figure capacity of each AP with multiple interfaces per node Comparison between single radio to the multiple radiosIn figure 17, per Access Point capacity is simulated to have comparison between multi-radio interface per node and single radio interface per node.Dynamic Channel Allocation in Multi-radio NetworkThere has been little work which proves the introduction of multiple interfaces while using the Dynamic Channel Allocation provides any performance up-gradation.Analytically it is assumed that, as the introduction of multi-interfaces in wireless mesh networks improves performance, similarly the performance of networks using Dynamic Channel Allocation can be improved by introducing more than one interface on a single node.Some of the analysed parameters, which show the sex act improvement in performance, are listed be lowparameter I returns in the throughput of the systemIn a single radio cognitive network, as shown in figure 18, the node D has two data packets of equal size in its internal queue, one for node C and one for node. knobs E and C are at the equal duration d from the node D but are tuned at different channels. In this particular case each packet will take time t to reach the destination. Even if we neglect the stiring time, cognitive radio present at D will take to switch from one channel to the other channel, the time taken to completely transmit both of the packets will be t+t = 2t.Figure iodine Radio NetworkNow even if the same network topology is considered but now consider that each of the nodes is equipped with two interfaces (figure 19). Node D will be able to transmit both of the packets simultaneously to node C and node E, considering that interface 1 is tuned to the channel on which communication with node E is possible and interface 2 is tuned to the frequency over which communication with node C is possible. In this case there will be no delay caused by the teddy of the channel.Figure Multi-interface radio networkFigure Effect of channel switching closing curtain The transmission time is decreased with the factor of N, where N is the number of interface each of the node will have. Throughput is improved with the factor of N.Parameter II Latency of the network will decreaseWith the introduction of the multiple interfaces in the cognitive radio network, latency of the network will decrease.Figure Multi-hop Single interface Wireless NetworkInitially considering the multi-hop scenario, considering an medium node, it has to receive an future(prenominal) transmission on channel 1 and then it has to tune its radio to the channel 2 to be able transmit the received transmission to the destination node. Latency of such network will consist of transmission time of packet over channel 1 from source node to intermediate node t1Transmitting time of p acket over channel 2 from intermediate node to destination node t2Switching time required for the interface on intermediate node to switch from channel 1 to channel 2 t3Hence the total latency of such a system will be t1+ t2+ t3Figure Multi-hop Multi interface Wireless NetworkNow comparing the previous scenario with the one in which each of the node is equipped with at least two interfaces. Now on the intermediate node interface 1 will be tuned to channel 1 and interface 2 will be tuned to channel 2. If there is an incoming transmission on channel 1 and it is to be inherited to the channel 2, the total latency will beTransmitting time of packet over channel 1 from source node to intermediate node t1Transmitting time of packet over channel 2 from intermediate node to destination node t2Hence the total latency of such a system will be t1+ t2The switching time will not be considered over here hence relatively the latency is decreased with the introduction of another interface on the cognitive radio node. closing curtain The latency factor is dependent on switching time of the cognitive radio. This factor comes into effect with more dominance with increase in the number of hops in the multi-hop network. Latency can be greatly lessen with the introduction of multi interfaces on the cognitive radio network.Parameter III Connectivity of the network will improveThe probability of isolation of any node in a network will be reduced with the introduction of the multi-interfaces in the cognitive radio network.Figure Single interface node with the available channelsConsidering the scenario, in figure 23, where a thirdhand network has four channels available for its utilization, now for a given condition, all radio interfaces are tuned to either one of the channel 1, 2 or 3. If a single interface chooses channel 4, it will be insulate from the rest of the network. Assuming that the probability of opting for such a channel is p then the overall probability of getting a node isolated from the rest of the network will be p.Figure Multi-Interface node with the available channelsNow for multiple interfaces, a node will only be separated if both the interfaces of a single node choose channel 4.A node will be isolated if and only ifInterface 1 chooses channel 4 AND interface 2 chooses channel 4P2As according to the probability rules pConclusion The probability of isolating a node, is decreased with the factor of N N is the number of radios as compared to the probability of node isolation in case of single interface cognitive radio networks.Here mutual independence among the DCA algorithms speed on both of the radio interfaces is considered, but this is not generally the case. The performance of a cognitive radio network is strictly dependent on the number of cognitive radios present in its vicinity 21.Figure onward motion in throughput using multiple radiosFigure Improvement in throughput of the network with multiple radio using different number of available channelsFigure 25 and 26 shows the throughput improvement gained by the introduction of multiple radios as compared to a single radio and in both of the figures different number of available channels are considered 24.ComparisonUp till so far, no(prenominal) of the research has been carried out to find out whether any advantage is gained by deploying Dynamic Channel Allocation scheme in the multi-radio wireless network domain as compared to the implementation of the Fixed Channel Assignment algorithm. Considering the study made regarding the performance improvement gained by fixed channel allocation scheme and dynamic channel allocation scheme in multi-radio wireless network, there could be several hypotheses made.The complexity of implementation of Dynamic Channel Allocation algorithm will be more than that of Fixed Channel Allocation algorithm. Although the same is true in case of single radio network, but in case of the Multi-radio network, the complexity increment will be more significant. The reason can be taken as if the spectrum view of a single interface of a node changes in multi-radio network, for the similar node the situation changes for the other interfaces as advantageously 21.The performance improvement obtained by implementation of the Dynamic Channel Allocation algorithm as compared to the Fixed Channel Allocation in the multi-radio will have similar effects as it has in the Single radio network. The same effect on the throughput of the system, data carrying capacity and the effect of the traffic load and traffic imbalance will be observed.Another important factor that can be predicted because of the observation made via simulation figures is as the performance of the wireless network depends upon the density of the nodes in a network. As compared to the Fixed Channel Allocation Scheme, Dynamic Channel Allocation Algorithms will be more sensitive to the density of the network 23.There will be no matter of connectivity in case t he Fixed Channel Assignment Scheme is deployed on the wireless network. As before the point of operation with FCA, it is made sure that all of the nodes are connected and none of the node is left isolated. With the Dynamic Channel Allocation there will still be a small probability that a node can get isolated from the rest of the network.In the Fixed Channel Allocation for the multi-radio wireless network the distribution of radio interfaces do not matter for the performance. But in case of the DCA, better performance can be improved if radio interface distribution on the nodes is not uniform. DCA will perform better if the first hop nodes have more number of radio interfaces than rest of the network nodes 22.Future WorkThe points raised, during this study are just concluded through observation and analytically perusal the response of the Fixed Channel Allocation Algorithm in the Multi-Radio network and Dynamic Channel Allocation Algorithm in Multi-Radio Network. These observations can be further improved by using proper simulating tools.ConclusionIn the single radio wireless network, DCA exhibits better performance than FCA. The same doings is predicted for the multi-radio wireless network, but with the increased complexity. And much better performance can be achieved by taking care of the distribution of the radios in the network. console it should be considered that there will not be infinite performance gain obtained by using multi-radio network and DCA. The limitation imposed is that number of channels available to a cell should always be greater than the number of interfaces per node has.