- DCN Tutorial
- Data Comm & Networks Home
- DCN - Overview
- DCN - Computer Network Types
- DCN - Network LAN Technologies
- DCN - Computer Network Topologies
- DCN - Computer Network Models
- DCN - Computer Network Security
- Physical Layer
- DCN - Physical Layer Introduction
- DCN - Digital Transmission
- DCN - Analog Transmission
- DCN - Transmission media
- DCN - Wireless Transmission
- DCN - Multiplexing
- DCN - Network Switching
- Data Link Layer
- DCN - Data Link Layer Introduction
- DCN - Error detection and Correction
- DCN - Data Link Control & Protocols
- Network Layer
- DCN - Network Layer Introduction
- DCN - Network Addressing
- DCN - Routing
- DCN - Internetworking
- DCN - Network Layer Protocols
- Transport Layer
- DCN - Transport Layer Introduction
- DCN - Transmission Control Protocol
- DCN - User Datagram Protocol
- Application Layer
- DCN - Application Layer Introduction
- DCN - Client-Server Model
- DCN - Application Protocols
- DCN - Network Services
- DCN Useful Resources
- DCN - Quick Guide
- DCN - Useful Resources
What is a Dynamic channel allocation in computer networks?
In wireless networks, a channel can be allocated between source and destination, and in between source and destination each router is connected to its neighbour router in peer to peer manner, the whole channel consists of a number of routers.
So some of the channels are used for static routing and some of them are for dynamic routing schemes.
Types of Channel Allocation
The different types of channel allocation schemes are as follows −
- Static channel allocation
- Dynamic channel allocation
- Hybrid channel allocation
Now let us discuss dynamic channel allocation.
Dynamic channel allocation
In this channel an interface can switch from one channel to another channel frequently. The dynamic strategies require frequent channel switching and therefore it has higher overheads than static strategies. The channel allocation can be changed with the changing traffic.
There are some key assumptions in Dynamic channel allocation, which are as follows −
Independent Traffic − This model consists of N independent stations with a program or user that generates frames for transmission. Once a frame has been generated the station is blocked and it does not do anything until the frame has been successfully transmitted.
Single channel − A single channel is available for all communication All stations can transmit on it and all can receive from it.
Observable collision − All stations can detect that a collision has occurred. A collided frame must be transmitted later.
Continuous or slotted time − Time may be assumed continuous; frame transmission can begin at any instant. In other way, time may be slotted or divided into discrete intervals. Frame transmission must then begin at the start of a slot.
Carrier sense or No carrier sense − With the carrier sense assumption, stations can tell if the channel is in use before trying to use it. Station will transmit only when the channel is free.
Let us consider cellular telephone in a city, users move and they can turn a cell phone on and off at any time. Therefore, the set of cell phones are operating in the range of a given cell tower that varies constantly.
In such a situation a dynamic channel allocation scheme is needed where a mapping can be established when a new station appears, and the mapping can be removed when the station disappears.
- Related Articles
- What is a static channel allocation in computer networks?
- Dynamic Channel Allocation in computer network
- What is channel allocation in computer network?
- Assumptions for Dynamic Channel Allocation
- Static Channel Allocation in computer network
- Capacity of a channel in Computer Networks
- What are Dynamic routing algorithms in computer networks?
- What is Dynamic Memory Allocation in C?
- What is IPsec in computer networks?
- What is NAT in computer networks?
- What is Tunnelling in Computer Networks?
- What is a Mesh Topology in Computer Networks?
- What is a MAC Address in Computer Networks?
- What is a Network Socket? (Computer Networks)
- What is bit stuffing in computer networks?