Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wirel...ijasuc
This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that
satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed
QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can provide a tight QoS
guarantee in terms of delay, delay violation rate and throughput for all types of traffic as defined in the
WiMAX standard, thereby maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the resources are also
encountered to validate the QoS provided by our proposed scheduling scheme.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
This document summarizes a research paper that proposes an Energy Efficient Reserved Path Routing Topology (RPRT) routing scheme for mobile ad hoc networks. The RPRT aims to improve energy efficiency and reduce end-to-end delay compared to the existing M-Trace routing scheme. It allows nodes to use estimated energy levels to make better channel admission control decisions for providing quality of service guarantees. The paper presents the RPRT scheme and its energy level estimation, routing discovery, route maintenance, and path selection mechanisms. Simulation results demonstrate that the RPRT achieves a 16% increase in energy efficiency and 37% reduction in end-to-end delay compared to M-Trace.
The document proposes an Enhanced Heuristic Function based Energy Aware (EHF-EA) routing protocol for wireless sensor networks. EHF-EA aims to extend network lifetime and improve link quality by using a heuristic function to find optimal routes while considering longevity factor, link quality, and bandwidth. It constructs a network of 50 mobile homogeneous sensor nodes in clusters. EHF-EA computes heuristic and cost values to determine the best next hop to the destination, aiming to efficiently transfer data and conserve energy. Simulation results show EHF-EA achieves a 93.85% packet delivery ratio while reducing bandwidth and number of hops compared to other protocols.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wirel...ijasuc
This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that
satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed
QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can provide a tight QoS
guarantee in terms of delay, delay violation rate and throughput for all types of traffic as defined in the
WiMAX standard, thereby maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the resources are also
encountered to validate the QoS provided by our proposed scheduling scheme.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
This document summarizes a research paper that proposes an Energy Efficient Reserved Path Routing Topology (RPRT) routing scheme for mobile ad hoc networks. The RPRT aims to improve energy efficiency and reduce end-to-end delay compared to the existing M-Trace routing scheme. It allows nodes to use estimated energy levels to make better channel admission control decisions for providing quality of service guarantees. The paper presents the RPRT scheme and its energy level estimation, routing discovery, route maintenance, and path selection mechanisms. Simulation results demonstrate that the RPRT achieves a 16% increase in energy efficiency and 37% reduction in end-to-end delay compared to M-Trace.
The document proposes an Enhanced Heuristic Function based Energy Aware (EHF-EA) routing protocol for wireless sensor networks. EHF-EA aims to extend network lifetime and improve link quality by using a heuristic function to find optimal routes while considering longevity factor, link quality, and bandwidth. It constructs a network of 50 mobile homogeneous sensor nodes in clusters. EHF-EA computes heuristic and cost values to determine the best next hop to the destination, aiming to efficiently transfer data and conserve energy. Simulation results show EHF-EA achieves a 93.85% packet delivery ratio while reducing bandwidth and number of hops compared to other protocols.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Higher Throughput Maintenance Using Average Time Standard for Multipath Data ...Eswar Publications
Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc
network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical
Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of
packet delivery over multi-hopbut failed provide higher throughput on the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but
performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher
throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is
proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via
multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best
threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses
the Average Time Standard (ATS) to guarantee the required packet allocationwith higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network. MMTDD mechanism makes use of time scheduling
schemes to discover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD
mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such
as time consumption, data delivery rate,average delivery delay and throughput level.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
An enhanced available bandwidth estimation technique for an end to end networ...redpel dot com
The document describes an enhanced technique for estimating available bandwidth (ABW) of an end-to-end network path. It proposes a unique probing scheme using a probing train structure with a high-density region to detect the turning point more accurately. It also includes a rate adjustment algorithm and a modified excursion detection algorithm to estimate ABW more accurately and less intrusively. Experimental results using an Android device over a 4G/LTE network and a testbed show the technique outperforms other state-of-the-art methods in terms of accuracy, intrusiveness, and convergence time.
FREQUENCY AND TIME DOMAIN PACKET SCHEDULING BASED ON CHANNEL PREDICTION WITH ...ijwmn
1) The document discusses packet scheduling algorithms for LTE downlink systems that must operate under imperfect channel quality information (CQI) due to errors, delays, and other issues.
2) It proposes a new packet scheduling algorithm that uses a Kalman filter-based channel predictor in the frequency domain to estimate the true CQI from erroneous feedback, combined with a time domain grouping technique using proportional fair and modified largest weighted delay first algorithms.
3) Simulation results showed this approach achieves better performance than existing algorithms in terms of system throughput and packet loss ratio under imperfect CQI conditions.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
IRJET- Proactive Neighbor Knowledge-based Hybrid Broadcasting in MANETIRJET Journal
This document presents a proactive neighbor knowledge-based hybrid broadcasting (PNKHB) scheme for routing in mobile ad hoc networks (MANETs). The key goals of PNKHB are to reduce routing overhead and energy consumption compared to existing routing protocols like AODV. PNKHB works by proactively building routing tables using neighbor connectivity information, power levels, and link failure probabilities to select stable routes. Simulation results show that PNKHB decreases average energy consumption by up to 43% and 9% compared to AODV and ANKB respectively. It also increases packet delivery ratio by up to 7% over the other protocols.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Resource Allocation Optimization for Heterogeneous NetworkIOSRjournaljce
The improvement of communication throughput using a cross layer mode of communication is proposed. Due to critical mode of applications of sensor networks, it is required to achieve data at faster rate for high refreshment. As the communicating data’s are sensed or measured data, it is required to have higherthroughput and less interference, to achieve accuracy and optimal resource utilization. In this paper we propose aintegrated cross layer mechanism to achieve higher performance in sensor networks. A new approach of cross layer controlling, based on integrated factor of power allocationand memory blockage is proposed.This mode of communication results at faster data transfer, with lower energy resource consumption over a wirelesssensor network architecture.
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
Design and Implementation of QoS Aware Priority based MAC for Delay Sensitive...Eswar Publications
Networking is a trending research area where the various research took place. Diversified filed of the Network is Sensor Network, which is a centrally adopted due to features and flexibility of sensors. Various disciplines like a military, medical, forest, Industries, Health monitoring and more, where WSN is established. Sensors have various pitfalls like limited lifetime and Storage, installed in misanthropic environments. Frequently power up or replace an energy source is a crucial task. Data communication in WSN is possible in the MAC layer. MAC is responsible for node schedule and sensing task. Collision and retransmission also lead to waste of energy. Variety of MAC protocols are developed for various qualities of service factors like energy, latency, reliability, delay, jitter, etc., however, none of them are given a satisfactory result for various QoS parameters. To overcome some of the pitfalls we need to achieve various QoS parameters. In this Research MAC is designed with a priority mechanism over clusters. Data with the highest priority are sent without or with a very negligible amount of delay. Higher priority packets are transmitted before a no prioritized packet. Using various priorities, the node energy, low delay and high throughput are achieved over standard MAC Protocols.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
Throughput Maximization of Cognitive Radio Multi Relay Network with Interfere...IJECEIAES
In this paper, an Orthogonal Frequency Division Multiplexing (OFDM) based cognitive multi relay network is investigated to maximize the transmission rate of the cognitive radio (CR) with enhanced fairness among CR users with interference to the primary users (PUs) being managed below a certain threshold level. In order to improve the transmission rate of the CR, optimization of the subcarrier pairing and power allocation is to be carried out simultaneously. Firstly joint optimization problem is formulated and Composite Genetic and Ordered Subcarrier Pairing (CGOSP) algorithm is proposed to solve the problem. The motivation behind merging genetic and OSP algorithm is to reduce the complexity of Genetic Algorithm (GA). Further, to have a fair allocation of resources among CR users, the Round Robin allocation method is adopted so as to allocate subcarrier pairs to relays efficiently. The degree of fairness of the system is calculated using Jain‟s Fairness Index (JFI). Simulation results demonstrate the significant improvement in transmission rate of the CR, low computational complexity and enhanced fairness.
AN MINIMUM RECONFIGURATION PROBABILITY ROUTING ALGORITHM FOR RWA IN ALL-OPTIC...sipij
In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the network under changing load conditions, we assess the probability of service and number of light path failures due to link or route failure on Wavelength Interchange(WI) network. The computation complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability
routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.
This document summarizes a research paper that analyzes how pause time and static nodes impact the stability of connected dominating sets (CDS) in mobile ad hoc networks (MANETs). The paper studies two CDS algorithms: a degree-based CDS heuristic and a maximum stable CDS algorithm. Simulations were conducted by varying node velocity, pause time, and percentage of static nodes. The results show that increasing pause time leads to more stable CDSs than having static nodes, especially for the degree-based CDS. Having static nodes only marginally increases the lifetime of the maximum stable CDS.
A SELECTIVE PAGING SCHEME BASED ON ACTIVITY IN CELLULAR MOBILE NETWORKS FOR R...ijwmn
This document presents a selective paging scheme based on activity for location management in cellular networks. An activity-based mobility model is used where mobile terminals move between cells according to daily activity patterns like going to work or school. A simulation is conducted with 49 cells, 100 mobile terminals, and schedules for moving between home, workplaces, colleges and fitness centers. The proposed scheme applies prediction-based selective paging at reporting centers to reduce paging cost without increasing location update cost. Simulation results are analyzed to compare the location management costs of the conventional and proposed schemes.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Higher Throughput Maintenance Using Average Time Standard for Multipath Data ...Eswar Publications
Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc
network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical
Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of
packet delivery over multi-hopbut failed provide higher throughput on the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but
performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher
throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is
proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via
multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best
threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses
the Average Time Standard (ATS) to guarantee the required packet allocationwith higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network. MMTDD mechanism makes use of time scheduling
schemes to discover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD
mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such
as time consumption, data delivery rate,average delivery delay and throughput level.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
An enhanced available bandwidth estimation technique for an end to end networ...redpel dot com
The document describes an enhanced technique for estimating available bandwidth (ABW) of an end-to-end network path. It proposes a unique probing scheme using a probing train structure with a high-density region to detect the turning point more accurately. It also includes a rate adjustment algorithm and a modified excursion detection algorithm to estimate ABW more accurately and less intrusively. Experimental results using an Android device over a 4G/LTE network and a testbed show the technique outperforms other state-of-the-art methods in terms of accuracy, intrusiveness, and convergence time.
FREQUENCY AND TIME DOMAIN PACKET SCHEDULING BASED ON CHANNEL PREDICTION WITH ...ijwmn
1) The document discusses packet scheduling algorithms for LTE downlink systems that must operate under imperfect channel quality information (CQI) due to errors, delays, and other issues.
2) It proposes a new packet scheduling algorithm that uses a Kalman filter-based channel predictor in the frequency domain to estimate the true CQI from erroneous feedback, combined with a time domain grouping technique using proportional fair and modified largest weighted delay first algorithms.
3) Simulation results showed this approach achieves better performance than existing algorithms in terms of system throughput and packet loss ratio under imperfect CQI conditions.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
IRJET- Proactive Neighbor Knowledge-based Hybrid Broadcasting in MANETIRJET Journal
This document presents a proactive neighbor knowledge-based hybrid broadcasting (PNKHB) scheme for routing in mobile ad hoc networks (MANETs). The key goals of PNKHB are to reduce routing overhead and energy consumption compared to existing routing protocols like AODV. PNKHB works by proactively building routing tables using neighbor connectivity information, power levels, and link failure probabilities to select stable routes. Simulation results show that PNKHB decreases average energy consumption by up to 43% and 9% compared to AODV and ANKB respectively. It also increases packet delivery ratio by up to 7% over the other protocols.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Resource Allocation Optimization for Heterogeneous NetworkIOSRjournaljce
The improvement of communication throughput using a cross layer mode of communication is proposed. Due to critical mode of applications of sensor networks, it is required to achieve data at faster rate for high refreshment. As the communicating data’s are sensed or measured data, it is required to have higherthroughput and less interference, to achieve accuracy and optimal resource utilization. In this paper we propose aintegrated cross layer mechanism to achieve higher performance in sensor networks. A new approach of cross layer controlling, based on integrated factor of power allocationand memory blockage is proposed.This mode of communication results at faster data transfer, with lower energy resource consumption over a wirelesssensor network architecture.
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
Design and Implementation of QoS Aware Priority based MAC for Delay Sensitive...Eswar Publications
Networking is a trending research area where the various research took place. Diversified filed of the Network is Sensor Network, which is a centrally adopted due to features and flexibility of sensors. Various disciplines like a military, medical, forest, Industries, Health monitoring and more, where WSN is established. Sensors have various pitfalls like limited lifetime and Storage, installed in misanthropic environments. Frequently power up or replace an energy source is a crucial task. Data communication in WSN is possible in the MAC layer. MAC is responsible for node schedule and sensing task. Collision and retransmission also lead to waste of energy. Variety of MAC protocols are developed for various qualities of service factors like energy, latency, reliability, delay, jitter, etc., however, none of them are given a satisfactory result for various QoS parameters. To overcome some of the pitfalls we need to achieve various QoS parameters. In this Research MAC is designed with a priority mechanism over clusters. Data with the highest priority are sent without or with a very negligible amount of delay. Higher priority packets are transmitted before a no prioritized packet. Using various priorities, the node energy, low delay and high throughput are achieved over standard MAC Protocols.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
Throughput Maximization of Cognitive Radio Multi Relay Network with Interfere...IJECEIAES
In this paper, an Orthogonal Frequency Division Multiplexing (OFDM) based cognitive multi relay network is investigated to maximize the transmission rate of the cognitive radio (CR) with enhanced fairness among CR users with interference to the primary users (PUs) being managed below a certain threshold level. In order to improve the transmission rate of the CR, optimization of the subcarrier pairing and power allocation is to be carried out simultaneously. Firstly joint optimization problem is formulated and Composite Genetic and Ordered Subcarrier Pairing (CGOSP) algorithm is proposed to solve the problem. The motivation behind merging genetic and OSP algorithm is to reduce the complexity of Genetic Algorithm (GA). Further, to have a fair allocation of resources among CR users, the Round Robin allocation method is adopted so as to allocate subcarrier pairs to relays efficiently. The degree of fairness of the system is calculated using Jain‟s Fairness Index (JFI). Simulation results demonstrate the significant improvement in transmission rate of the CR, low computational complexity and enhanced fairness.
AN MINIMUM RECONFIGURATION PROBABILITY ROUTING ALGORITHM FOR RWA IN ALL-OPTIC...sipij
In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the network under changing load conditions, we assess the probability of service and number of light path failures due to link or route failure on Wavelength Interchange(WI) network. The computation complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability
routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.
This document summarizes a research paper that analyzes how pause time and static nodes impact the stability of connected dominating sets (CDS) in mobile ad hoc networks (MANETs). The paper studies two CDS algorithms: a degree-based CDS heuristic and a maximum stable CDS algorithm. Simulations were conducted by varying node velocity, pause time, and percentage of static nodes. The results show that increasing pause time leads to more stable CDSs than having static nodes, especially for the degree-based CDS. Having static nodes only marginally increases the lifetime of the maximum stable CDS.
A SELECTIVE PAGING SCHEME BASED ON ACTIVITY IN CELLULAR MOBILE NETWORKS FOR R...ijwmn
This document presents a selective paging scheme based on activity for location management in cellular networks. An activity-based mobility model is used where mobile terminals move between cells according to daily activity patterns like going to work or school. A simulation is conducted with 49 cells, 100 mobile terminals, and schedules for moving between home, workplaces, colleges and fitness centers. The proposed scheme applies prediction-based selective paging at reporting centers to reduce paging cost without increasing location update cost. Simulation results are analyzed to compare the location management costs of the conventional and proposed schemes.
The document discusses using a window-based smart antenna design to improve routing performance in mobile ad hoc networks (MANETs). It proposes arranging antenna elements in a window configuration to achieve a desired radiation pattern with a minimum number of elements. The design aims to address issues like resource constraints in MANET nodes and different antenna arrangement options. It analyzes how smart antennas can enhance the dynamic source routing protocol by reducing redundant broadcasts, handling route requests/replies more efficiently, and improving data packet delivery and route error messaging. However, smart antennas also increase node complexity and computational overhead.
E NERGY D EGREE D ISTANCE C LUSTERING A LGORITHM FOR W Snsijwmn
This document summarizes a new Energy-Degree Distance (EDD) Clustering Algorithm for wireless sensor networks. The algorithm aims to minimize energy consumption and balance energy usage among nodes. Key aspects of the EDD algorithm include electing cluster heads based on a node's remaining energy, degree, and distance to the base station. Simulation results show the EDD algorithm outperforms the LEACH algorithm in terms of network lifetime and energy efficiency. Both dynamic and static clustering methods are evaluated, with dynamic clustering showing better performance overall.
In this paper, the performances of adaptive noise cancelling system employing Least Mean Square (LMS) algorithm are studied considering both white Gaussian noise (Case 1) and colored noise (Case 2)
situations. Performance is analysed with varying number of iterations, Signal to Noise Ratio (SNR) and tap size with considering Mean Square Error (MSE) as the performance measurement criteria. Results show that the noise reduction is better as well as convergence speed is faster for Case 2 as compared with Case 1. It is also observed that MSE decreases with increasing SNR with relatively faster decrease of MSE in Case 2 as compared with Case 1, and on average MSE increases linearly with increasing number of filter
coefficients for both type of noise situations. All the experiments have been done using computer
simulations implemented on MATLAB platform.
O N THE E VALUATION OF G MSK S CHEME W ITH ECC T ECHNIQUES IN W IRELESS S...ijwmn
Wireless sensor nodes are powered by batteries, for
which replacement is very difficult. That is why,
optimization of energy consumption is a major objec
tive in the area of wireless sensor networks (WSNs)
.On
the other hand, noisy channel has a prominent influ
ence on the reliability of data transmission. There
fore,
an energy efficient transmission strategy should be
considered on the communication process of wireles
s
nodes in order to obtain optimal energy network con
sumption. Indeed, the choice of suitable modulation
format with the proper Error Correcting code (ECC)
played a great responsibility to obtain better ener
gy
conservation.In this work, we aim to evaluate the p
erformance analysis of Gaussian Minimum Shift Keyin
g
(GMSK) modulation with several combinations of codi
ng strategies using various analysis metrics such a
s
Bit Error Rate (BER), energy consumption.Through ex
tensive simulation, we disclose that he gain achiev
ed
through GMSK modulation with suitable channel codin
g mechanism is promising to obtain reliable
communication and energy conservation in WSN.
Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm. Internet traffic,
especially real-time multimedia applications, is bursty in nature . Hence, in addition to the service rate
which is commonly used to isolate service of sessions, other parameters should be involved. In this paper
a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty
(smooth) traffic. We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm
is proficient to compensate an adjustable amount of missed service to each session. The average delay of
the proposed algorithm is evaluated by simulation. An important advantage of our algorithm is that
byselecting correct parameter setting for each session, the average delay of a bursty session can be
reduced. Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional
computation.
LTE is an emerging wireless data communication technology to provide broadband ubiquitous Internet
access. Femtocells are included in 3GPP since Release 8 to enhance the indoor network coverage and
capacity. The main challenge of mobility management in hierarchical LTE structure is to guarantee
efficient handover to or from/to/between Femtocells. This paper focuses, on different types of Handover
and comparison performance between different decision algorithms. Furthermore, a speed based Handover
algorithm for macro-femto scenario is proposed with simulation results
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
The document summarizes a proposed algorithm called MTADF (Multi Hop Traffic-Aware Data Forwarding) for congestion control in wireless sensor networks. The algorithm uses two potential fields - depth potential field and queue length potential field - to route data packets around congested areas along multiple paths. This helps distribute traffic more evenly and utilize less busy nodes, reducing packet drops and improving throughput compared to existing one-hop routing algorithms. The algorithm constructs the two potential fields independently and then combines them to make dynamic forwarding decisions for data packets. Simulations show the MTADF algorithm performs better than previous work in mitigating congestion.
Realisation of awgn channel emulation modules under siso and simo environment...ijwmn
1) The document describes the design and implementation of an additive white Gaussian noise (AWGN) channel emulator for 4G LTE systems under single-input single-output (SISO) and single-input multiple-output (SIMO) environments using an FPGA.
2) The channel emulator consists of transmitter, channel estimation, and receiver modules. In the transmitter, data is QAM modulated and transmitted through the channel. In the channel module, the transmitted data is multiplied by channel coefficients and added with noise.
3) In the receiver, the data is detected using minimum mean square error estimation with a delay of four clock cycles. The designs are implemented on a Virtex-5 FPGA and simulated
Availability is one of the most important concerns in the networking world. For any high available
network, we need to maintain 99.99999% availability. That is why it is one of the most important factors to
find out the single point of failure in the network architecture and eliminate that single point of failure
(SPOF) from physical network and logical network. SPOF in our server infrastructure has been analysed
in terms of communicating with the router for forwarding traffic with multiple routers. We have developed
an algorithm that will automatically select default gateway into the network interface card of virtual
machines. The proposed algorithm will automatically enable Default Gateway Weight settings (DGW)
protocol among routers by configuring Network interface card with default gateway of all routers. The
proposed protocol works based on weight settings for the multiple default gateway configuration in the
host. There will be heartbeat communication and re-convergence will be performed within the shortest
possible time. Lowest weight setting will select the path for packet forwarding through specified routers
related with the default gateway from the virtual machine.
Data gathering in wireless sensor networks using mobile elementsijwmn
The document summarizes a research paper that investigates using a mobile gateway to gather sensor data in wireless sensor networks. It presents an algorithmic approach that partitions the sensor network into clusters, with one sensor from each cluster selected to be visited by the mobile gateway. The algorithm aims to maximize the number of clusters while satisfying constraints on the gateway's tour length and frequency of sensor visits. Simulation results show the proposed approach significantly increases network lifetime compared to networks with static sinks. The quality of the gateway tour obtained is within 3/2 of the optimal solution.
ON THE SUPPORT OF MULTIMEDIA APPLICATIONS OVER WIRELESS MESH NETWORKS ijwmn
This document summarizes research on supporting multimedia applications over wireless mesh networks. It proposes an efficient routing algorithm and a QoS approach at the MAC layer. The routing algorithm aims to transport multimedia traffic with QoS requirements. The MAC layer approach improves 802.11e to better facilitate video transport over the mesh network. Related work on routing protocols, QoS solutions at the network and MAC layers, and clustering approaches are also reviewed.
A novel architecture for sdn based cellular network ijwmn
This document proposes a novel SDN-based cellular network architecture that divides the cellular area into clusters, with each cluster controlled by a separate controller. The controllers communicate through a controller service to share information rather than relying on a single central controller. This architecture aims to minimize traffic overload on a single controller and allow for more efficient utilization of controller services. The document provides background on traditional cellular network architectures, SDN concepts, and related work applying SDN principles to cellular networks.
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
COMPARING THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON...ijwmn
This paper compares the impact of mobile node arrival patterns in mobile ad hoc networks (MANETs) using Poisson and Pareto distribution models. Through MATLAB simulations, the study investigates how the arrival rate and size of the mobile node population are affected by these distributions. The results indicate that higher arrival rates can influence larger mobile node populations in a given area. Additionally, the Pareto distribution is found to better model mobile node mobility in MANETs compared to the Poisson distribution.
This document discusses improving quality of service for connection admission control mechanisms using a two-dimensional queuing model. It proposes a threshold-based connection admission control that prioritizes ongoing connections based on available resources and bandwidth. A two-dimensional queuing model is used for better cross-layer design, modeling traffic arrival processes, and multi-rate transmission. The proposed algorithm aims to provide lower computational complexity, better QoS, increased throughput, and reduced delay compared to other algorithms.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
This document describes a proposed approach called Resource Allocation with Connection Admission Control (RA-CAC) and Adaptive Rate Scheduling (ARS) to improve quality of service for real-time traffic in WCDMA networks. The RA-CAC algorithm determines the optimal number of users to admit while minimizing call rejection rates. The ARS then adjusts transmission rates of admitted sessions based on feedback to better utilize network resources. Simulation results showed this approach increased delivery ratio, throughput and reduced delays compared to other resource allocation methods.
IRJET- Aggregate Signature Scheme and Secured ID for Wireless Sensor Netw...IRJET Journal
This document proposes a cross-layer resource allocation scheme over wireless relay networks to guarantee quality of service (QoS) in terms of delay. The scheme aims to maximize network throughput subject to a given delay constraint, characterized by a QoS exponent θ. Dynamic resource allocation algorithms are developed for amplify-and-forward and decode-and-forward relay networks based on network channel state information and the QoS constraint. Simulations show the scheme efficiently supports diverse QoS requirements over wireless relay networks, and relay networks outperform direct transmissions under stringent delay constraints.
SELFLESS DISTRIBUTED CREDIT BASED SCHEDULING FOR IMPROVED QOS IN IEEE 802.16 ...ijwmn
Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service it offers over a longer range at the MAC level. In our paper, we propose two credit based scheduling schemes one in which completed flows distributes the left over credits equally to all higher priority flows(FDCBSS) and another in which completed flows give away all the excess credits to the highest priority uncompleted flow(SDCBSS). Both the schemes are compatible with 802.16 MAC protocol and can efficiently serve real time bursty traffic with reduced latency and hence improved QOS for real time flows. We compare the two proposed schemes for their latency, bandwidth utilization and throughput for real time burst flows with the basic Deficit Round Robin scheduling scheme.
Selfless Distributed Credit Based Scheduling for Improved QOS In IEEE 802.16 ...ijwmn
Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service it offers over a longer range at the MAC level. In our paper, we propose two credit based scheduling schemes one in which completed flows distributes the left over credits equally to all higher priority flows(FDCBSS) and another in which completed flows give away all the excess credits to the highest priority uncompleted flow(SDCBSS). Both the schemes are compatible with 802.16 MAC protocol and can efficiently serve real time bursty traffic with reduced latency and hence improved QOS for real time flows. We compare the two proposed schemes for their latency, bandwidth utilization and throughput for real time burst flows with the basic Deficit Round Robin scheduling scheme.
Selfless Distributed Credit Based Scheduling for Improved QOS In IEEE 802.16 ...ijwmn
Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the
very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service
it offers over a longer range at the MAC level. In our paper, we propose two credit based scheduling
schemes one in which completed flows distributes the left over credits equally to all higher priority
flows(FDCBSS) and another in which completed flows give away all the excess credits to the highest
priority uncompleted flow(SDCBSS). Both the schemes are compatible with 802.16 MAC protocol and
can efficiently serve real time bursty traffic with reduced latency and hence improved QOS for real time
flows. We compare the two proposed schemes for their latency, bandwidth utilization and throughput for
real time burst flows with the basic Deficit Round Robin scheduling scheme.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Improved qo s support for wimax networks a surveyAlexander Decker
This document summarizes three approaches for improving quality of service (QoS) support in WiMAX networks:
1) A hierarchical scheduling framework that divides scheduling into three tiers to provide QoS support in point-to-point WiMAX networks.
2) A cross-layer optimization framework for resource allocation that exchanges information across protocol layers to optimize performance and maintain end-to-end QoS for users.
3) An on-demand bandwidth allocation technique that allocates bandwidth based on service flow demands to efficiently manage bandwidth utilization.
Civilizing the Network Lifespan of Manets Through Cooperative Mac Protocol Me...IRJET Journal
1) The document discusses a proposed cooperative medium access control (CMAC) protocol for mobile ad-hoc networks (MANETs) that aims to improve energy efficiency and extend network lifetime.
2) Existing CMAC protocols focus on throughput enhancement but fail to adequately consider energy efficiency. The proposed DEL-CMAC protocol aims to extend network lifetime by accounting for energy consumption at both transmitters and receivers.
3) Cooperative communication techniques that employ relay nodes can provide spatial diversity gains to reduce transmission power needs. However, the overhead of cooperation may outweigh these gains, so an efficient CMAC protocol is required to manage medium access for cooperative transmissions.
An efficient reconfigurable geographic routing congestion control algorithm f...IJECEIAES
In recent times, huge data is transferred from source to destination through multi path in wireless sensor networks (WSNs). Due to this more congestion occurs in the communication path. Hence, original data will be lost and delay problems arise at receiver end. The above-mentioned drawbacks can be overcome by the proposed efficient reconfigurable geographic routing congestion control (RgRCC) algorithm for wireless sensor networks. the proposed algorithm efficiently finds the node’s congestion status with the help queue length’s threshold level along with its change rate. Apart from this, the proposed algorithm re-routes the communication path to avoid congestion and enhances the strength of scalability of data communication in WSNs. The proposed algorithm frequently updates the distance between the nodes and by-pass routing holes, common for geographical routing. when the nodes are at the edge of the hole, it will create congestion between the nodes in WSNs. Apart from this, more nodes sink due to congestion. it can be reduced with the help of the proposed RgRCC algorithm. As per the simulation analysis, the proposed work indicates improved performance in comparison to conventional algorithm. By effectively identifying the data congestion in WSNs with high scalability rate as compared to conventional methods
Quality of service adaptive modulation and coding scheme for IEEE 802.11acIJECEIAES
Nowadays, the rising demand for digital communication technologies has contributed to the increase in the volume of traffic. This continuous trend of internet traffic has led to the deterioration of the quality of service (QoS) with reduced throughput and increased latency. This also is due to the proliferation of new broadband applications which require low latency and high throughput such as virtual reality and real-time gaming. Therefore, considering the aforementioned challenge in QoS of wireless networks, a link adaptation method is suggested in this study, in order to enhance the performance of the QoS in IEEE 802.11ac amendment wireless local-area network (WLAN). The proposed technique adaptively changes the transmission data rate by increasing or decreasing the modulation and coding scheme (MCS) level according to the traffic conditions. With the use of an OMNeT++ computer-aided design (CAD)-based simulation model, the effectiveness of the suggested approach is examined. Simulated findings were compared with the link adaptation approach of the default condition. The results of the simulation demonstrate that the proposed technique significantly increases throughput (36.48%) and decreases latency in comparison to the default situation. These findings demonstrate the technique's potential to improve WLAN QoS efficiency, notably in regard to throughput and latency.
Dynamic Traffic Management Services to Provide High Performance in IntelRate ...IJMER
Abstract: Traffic is the chief puzzle problem in which every country faces to elaborate sending a
number of packets throughout the world. This paper proposes a new speculation for distributed traffic
management by availing the presumption of fuzzy logic. The routers are established by using an
IntelRate Controllers to manage the traffic congestion in the networks dynamically. Fuzzy logic is used
to previse the maximum allowable sending rate by observing the queue size of router. The network
traffic control protocol is unique to estimate the network parameter which involves link latency,
bottleneck bandwidth or packet loss rate in order to compute the allowed source sending rate. The fuzzy
logic based controller can measure queue size directly, it neglects various potential performance issues
arising due to parameter estimation as reduce consumption of computation and memory resource in
router. A network parameter, the queue size can be viewed accurately and if action should be taken to
regulate the source sending rate and it increases the resilience of the network to traffic congestion.
Using the fuzzy logic technique, QoS (Quality of Service) can achieve better performance than the
existing protocol that depends on the estimation of network parameter, to make the network more
adaptive for current traffic conditions.
Modified PREQ in HWMP for Congestion Avoidance in Wireless Mesh NetworkIRJET Journal
This document summarizes a proposed technique called Modified PREQ in HWMP for Congestion Avoidance in Wireless Mesh Networks. The technique aims to determine congested paths using CCNF frames and provide rerouting to less congested paths before congestion occurs to reduce burden on congested nodes. It allows continued packet transmission on congested paths until a rerouting path is found during congestion scenarios. When a packet is transmitted on the new path, the previous path is deleted to avoid further delay. Sequence numbers are used to avoid flooding the network. The paper compares this Modified PREQ technique to other congestion avoidance techniques to improve throughput and average delay using an NS-3 simulator.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Adaptive Admission Control and Packet Scheduling Schemes for QoS Provisioning...Perumalraja Rengaraju
This document proposes an adaptive call admission control (CAC) method and two packet scheduling schemes for multihop WiMAX networks to satisfy quality of service requirements. The adaptive CAC reserves bandwidth for handover calls and adjusts the reservation based on recent requests, allocating unused bandwidth to best effort users. Two scheduling algorithms are proposed: (P+E) prioritizes calls and uses earliest due date scheduling, while (P+TB) prioritizes calls and uses token bucket scheduling. Simulation results show the adaptive CAC reduces call drop rates for handovers and admits more new calls compared to fixed bandwidth reservation. Under different loads, the two schedulers provide better quality of service and delay performance than each other.
An Approach using Local Information to Build QoS Routing Algorithminventionjournals
The requirement for quality of service (QoS) is more and more sophisticated, such as the required bandwidth, the value of delay time or packet loss. To assure the network performance, localized QoS routing algorithms have recently been proposed as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to users’ demand in the near future. In this paper, we propose a new localized QoS routing algorithm which can help to assure quality of service, and show our simulations which are better in results against other routing algorithms.
Multiple Downlink Fair Packet Scheduling Scheme in Wi-MaxEditor IJCATR
IEEE 802.16 is standardization for a broadband wireless access in network metropolitan area network (MAN). IEEE 802.16
standard (Wi-Max) defines the concrete quality of service (QoS) requirement, a scheduling scheme and efficient packet scheduling
scheme which is necessary to achieve the QoS requirement. In this paper, a novel waiting queue based on downlink bandwidth
allocation architecture from a number of rtps schedule has been proposed to improve the performance of nrtPS services without any
impaction to other services. This paper proposes an efficient QoS scheduling scheme that satisfies both throughput and delay guarantee
to various real and non-real applications corresponding to different scheduling schemes for k=1,2,3,4. Simulation results show that
proposed scheduling scheme can provide a tight QoS guarantee in terms of delay for all types of traffic as defined in WiMax standards.
This process results in maintaining the fairness of allocation and helps to eliminate starvation of lower priority class services. The
authors propose a new efficient and generalized scheduling schemes for IEEE 802.16 broadband wireless access system reflecting the
delay requirements.
Dynamic Traffic Management Services to Provide High Performance in IntelRate ...IJMER
Traffic is the chief puzzle problem in which every country faces to elaborate sending a
number of packets throughout the world. This paper proposes a new speculation for distributed traffic
management by availing the presumption of fuzzy logic. The routers are established by using an
IntelRate Controllers to manage the traffic congestion in the networks dynamically. Fuzzy logic is used
to previse the maximum allowable sending rate by observing the queue size of router. The network
traffic control protocol is unique to estimate the network parameter which involves link latency,
bottleneck bandwidth or packet loss rate in order to compute the allowed source sending rate. The fuzzy
logic based controller can measure queue size directly, it neglects various potential performance issues
arising due to parameter estimation as reduce consumption of computation and memory resource in
router. A network parameter, the queue size can be viewed accurately and if action should be taken to
regulate the source sending rate and it increases the resilience of the network to traffic congestion.
Using the fuzzy logic technique, QoS (Quality of Service) can achieve better performance than the
existing protocol that depends on the estimation of network parameter, to make the network more
adaptive for current traffic conditions
Similar to Modulation aware connection admission control and uplink scheduling algorithm for wimax networks (20)
MYIR Product Brochure - A Global Provider of Embedded SOMs & SolutionsLinda Zhang
This brochure gives introduction of MYIR Electronics company and MYIR's products and services.
MYIR Electronics Limited (MYIR for short), established in 2011, is a global provider of embedded System-On-Modules (SOMs) and
comprehensive solutions based on various architectures such as ARM, FPGA, RISC-V, and AI. We cater to customers' needs for large-scale production, offering customized design, industry-specific application solutions, and one-stop OEM services.
MYIR, recognized as a national high-tech enterprise, is also listed among the "Specialized
and Special new" Enterprises in Shenzhen, China. Our core belief is that "Our success stems from our customers' success" and embraces the philosophy
of "Make Your Idea Real, then My Idea Realizing!"
AC Atlassian Coimbatore Session Slides( 22/06/2024)apoorva2579
This is the combined Sessions of ACE Atlassian Coimbatore event happened on 22nd June 2024
The session order is as follows:
1.AI and future of help desk by Rajesh Shanmugam
2. Harnessing the power of GenAI for your business by Siddharth
3. Fallacies of GenAI by Raju Kandaswamy
What Not to Document and Why_ (North Bay Python 2024)Margaret Fero
We’re hopefully all on board with writing documentation for our projects. However, especially with the rise of supply-chain attacks, there are some aspects of our projects that we really shouldn’t document, and should instead remediate as vulnerabilities. If we do document these aspects of a project, it may help someone compromise the project itself or our users. In this talk, you will learn why some aspects of documentation may help attackers more than users, how to recognize those aspects in your own projects, and what to do when you encounter such an issue.
These are slides as presented at North Bay Python 2024, with one minor modification to add the URL of a tweet screenshotted in the presentation.
In this follow-up session on knowledge and prompt engineering, we will explore structured prompting, chain of thought prompting, iterative prompting, prompt optimization, emotional language prompts, and the inclusion of user signals and industry-specific data to enhance LLM performance.
Join EIS Founder & CEO Seth Earley and special guest Nick Usborne, Copywriter, Trainer, and Speaker, as they delve into these methodologies to improve AI-driven knowledge processes for employees and customers alike.
The Rise of Supernetwork Data Intensive ComputingLarry Smarr
Invited Remote Lecture to SC21
The International Conference for High Performance Computing, Networking, Storage, and Analysis
St. Louis, Missouri
November 18, 2021
AI_dev Europe 2024 - From OpenAI to Opensource AIRaphaël Semeteys
Navigating Between Commercial Ownership and Collaborative Openness
This presentation explores the evolution of generative AI, highlighting the trajectories of various models such as GPT-4, and examining the dynamics between commercial interests and the ethics of open collaboration. We offer an in-depth analysis of the levels of openness of different language models, assessing various components and aspects, and exploring how the (de)centralization of computing power and technology could shape the future of AI research and development. Additionally, we explore concrete examples like LLaMA and its descendants, as well as other open and collaborative projects, which illustrate the diversity and creativity in the field, while navigating the complex waters of intellectual property and licensing.
Quantum Communications Q&A with Gemini LLM. These are based on Shannon's Noisy channel Theorem and offers how the classical theory applies to the quantum world.
GDG Cloud Southlake #34: Neatsun Ziv: Automating AppsecJames Anderson
The lecture titled "Automating AppSec" delves into the critical challenges associated with manual application security (AppSec) processes and outlines strategic approaches for incorporating automation to enhance efficiency, accuracy, and scalability. The lecture is structured to highlight the inherent difficulties in traditional AppSec practices, emphasizing the labor-intensive triage of issues, the complexity of identifying responsible owners for security flaws, and the challenges of implementing security checks within CI/CD pipelines. Furthermore, it provides actionable insights on automating these processes to not only mitigate these pains but also to enable a more proactive and scalable security posture within development cycles.
The Pains of Manual AppSec:
This section will explore the time-consuming and error-prone nature of manually triaging security issues, including the difficulty of prioritizing vulnerabilities based on their actual risk to the organization. It will also discuss the challenges in determining ownership for remediation tasks, a process often complicated by cross-functional teams and microservices architectures. Additionally, the inefficiencies of manual checks within CI/CD gates will be examined, highlighting how they can delay deployments and introduce security risks.
Automating CI/CD Gates:
Here, the focus shifts to the automation of security within the CI/CD pipelines. The lecture will cover methods to seamlessly integrate security tools that automatically scan for vulnerabilities as part of the build process, thereby ensuring that security is a core component of the development lifecycle. Strategies for configuring automated gates that can block or flag builds based on the severity of detected issues will be discussed, ensuring that only secure code progresses through the pipeline.
Triaging Issues with Automation:
This segment addresses how automation can be leveraged to intelligently triage and prioritize security issues. It will cover technologies and methodologies for automatically assessing the context and potential impact of vulnerabilities, facilitating quicker and more accurate decision-making. The use of automated alerting and reporting mechanisms to ensure the right stakeholders are informed in a timely manner will also be discussed.
Identifying Ownership Automatically:
Automating the process of identifying who owns the responsibility for fixing specific security issues is critical for efficient remediation. This part of the lecture will explore tools and practices for mapping vulnerabilities to code owners, leveraging version control and project management tools.
Three Tips to Scale the Shift Left Program:
Finally, the lecture will offer three practical tips for organizations looking to scale their Shift Left security programs. These will include recommendations on fostering a security culture within development teams, employing DevSecOps principles to integrate security throughout the development
An invited talk given by Mark Billinghurst on Research Directions for Cross Reality Interfaces. This was given on July 2nd 2024 as part of the 2024 Summer School on Cross Reality in Hagenberg, Austria (July 1st - 7th)
Hire a private investigator to get cell phone recordsHackersList
Learn what private investigators can legally do to obtain cell phone records and track phones, plus ethical considerations and alternatives for addressing privacy concerns.
How RPA Help in the Transportation and Logistics Industry.pptxSynapseIndia
Revolutionize your transportation processes with our cutting-edge RPA software. Automate repetitive tasks, reduce costs, and enhance efficiency in the logistics sector with our advanced solutions.
Navigating Post-Quantum Blockchain: Resilient Cryptography in Quantum Threatsanupriti
In the rapidly evolving landscape of blockchain technology, the advent of quantum computing poses unprecedented challenges to traditional cryptographic methods. As quantum computing capabilities advance, the vulnerabilities of current cryptographic standards become increasingly apparent.
This presentation, "Navigating Post-Quantum Blockchain: Resilient Cryptography in Quantum Threats," explores the intersection of blockchain technology and quantum computing. It delves into the urgent need for resilient cryptographic solutions that can withstand the computational power of quantum adversaries.
Key topics covered include:
An overview of quantum computing and its implications for blockchain security.
Current cryptographic standards and their vulnerabilities in the face of quantum threats.
Emerging post-quantum cryptographic algorithms and their applicability to blockchain systems.
Case studies and real-world implications of quantum-resistant blockchain implementations.
Strategies for integrating post-quantum cryptography into existing blockchain frameworks.
Join us as we navigate the complexities of securing blockchain networks in a quantum-enabled future. Gain insights into the latest advancements and best practices for safeguarding data integrity and privacy in the era of quantum threats.
How to Avoid Learning the Linux-Kernel Memory ModelScyllaDB
The Linux-kernel memory model (LKMM) is a powerful tool for developing highly concurrent Linux-kernel code, but it also has a steep learning curve. Wouldn't it be great to get most of LKMM's benefits without the learning curve?
This talk will describe how to do exactly that by using the standard Linux-kernel APIs (locking, reference counting, RCU) along with a simple rules of thumb, thus gaining most of LKMM's power with less learning. And the full LKMM is always there when you need it!
Blockchain and Cyber Defense Strategies in new genre timesanupriti
Explore robust defense strategies at the intersection of blockchain technology and cybersecurity. This presentation delves into proactive measures and innovative approaches to safeguarding blockchain networks against evolving cyber threats. Discover how secure blockchain implementations can enhance resilience, protect data integrity, and ensure trust in digital transactions. Gain insights into cutting-edge security protocols and best practices essential for mitigating risks in the blockchain ecosystem.
Modulation aware connection admission control and uplink scheduling algorithm for wimax networks
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
DOI : 10.5121/ijwmn.2015.7105 75
MODULATION AWARE CONNECTION ADMISSION
CONTROL AND UPLINK SCHEDULING ALGORITHM FOR
WIMAX NETWORKS
Shwetha D1
, Mohan Kumar N M2
and Devaraju J T2
1
Department of Electronics, Tumkur University, Tumkur, India
2
Department of Electronic Science, Bangalore University, Bangalore, India
ABSTRACT
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and
aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS).
However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware
connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC
scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and
QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority
real time services by degrading the bandwidth of admitted lower priority connections on the basis of their
channel status without deteriorating their QoS performance much. The performances of proposed
algorithms are evaluated through simulation by considering the metrics like throughput, delay and number
of connections admitted.
KEYWORDS
Mobile WiMAX, Broadband Wireless Access, Connection Admission Control, channel aware and Uplink
scheduling
1.INTRODUCTION
Quality of service (QoS) guarantee is one of the important requirements in today’s
communication era which is due to the stringent quality requirements of multimedia services. In
communication systems QoS is provided through connection admission control (CAC), traffic
policing and scheduling. These traffic control mechanisms enable a balance between the
utilization of the network resources and the QoS provisioning. This tradeoff between utilization
and QoS is of fundamental importance in WiMAX networks [1], which aggregate different types
of traffic in a limited resources architecture.
The scheduling mechanism aims at guaranteeing the bandwidth required by the subscriber
stations (SS) as well as enabling the efficient wireless link usage. In a WiMAX network, the
downlink scheduling requires a single scheduler at the base station (BS), whereas the uplink
scheduling needs two components, one of them at the BS and the second one at the SS. The BS
scheduler allocates bandwidth for the SSs and the SS scheduler determines which packets will be
sent in the received transmission opportunities. In WiMAX, scheduling will be made on the basis
of scheduling classes (service types) defined. WiMAX defines five scheduling classes, unsolicited
grant service (UGS), extended real time polling service (ertPS), real time polling service (rtPS),
non real time polling service (nrtPS) and best effort (BE) services. The 802.16e standard defines
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
76
uplink scheduling only for UGS services and for all other services scheduling is kept as an open
issue.
In WiMAX network, before an SS initiates a new connection, it must make a request to the BS.
The task of CAC is to accept or reject the arriving requests for a connection in order to maximize
the bandwidth utilization, by accepting as many connections as possible, while maintaining the
QoS level of admitted connections. If the CAC admits too few connections, it results in wastage
of system resources. On the other hand, if CAC admits too many connections, admitted
connections contend for resources and scheduler will not be able to provide QoS. The CAC only
guarantees the bandwidth resources for an admitted connection, the actual allocation of
bandwidth resources for that admitted connection will be made by the BS uplink scheduler based
on the availability of bandwidth.
Awareness of channel status in scheduling and CAC improves the system performance, as there is
a possibility of deterioration of QoS of connections as the channel quality varies [2]. Hence in this
paper, modulation aware BS scheduling and CAC schemes are proposed to improve the network
utilization and QoS. The rest of this paper is organized as follows. Section 2 outlines the related
work in the literature. In Sections 3 and 4, proposed CAC and scheduling algorithms are
presented respectively. Section 5 discusses the simulation results followed by conclusion in
Section 6.
2. RELATED WORK
As the CAC and scheduling are the major issues in providing QoS for WiMAX network, many
researchers have proposed the algorithms for CAC and scheduling. Authors of [3-4] proposed
CAC algorithms which provide the highest priority for UGS flows and maximizes the bandwidth
utilization, in [3] bandwidth borrowing and degradation method is employed and in [4] handoff
connections are given higher priority. In order to avoid the QoS degradation authors of [5] have
proposed a statistical CAC mechanism which considers the traffic variability and overflow.
Authors of [6-8] have proposed CAC algorithms which are based on bandwidth estimation of
connections, in which [8] considers the shadow cluster concept to estimate the resources. Authors
of [9-10] proposed bandwidth degradation scheme for CAC, in which [9] employs interference
ratio (IR) as the criteria of degradation and [10] uses the concept of adaptive bandwidth
degradation. Scheduling and CAC schemes are proposed in [11-12], among which [11] is
concerned with real-time video applications and [12] considers bandwidth polling overhead
incurred by services being requested and fairness in resource allocation. Y. Ge et.al [13] proposed
a CAC scheme for adaptive multimedia services. Authors of [14-16] have proposed CAC scheme
along with packet scheduling algorithm. In [14] dual partition (DP) of the bandwidth for CAC
and priority earliest deadline for packet scheduling is proposed.
3. PROPOSED MODULATION AWARE CONNECTION ADMISSION CONTROL
MECHANISM
In this paper modulation aware connection admission control (CAC) algorithm and BS uplink
scheduling algorithms are proposed to improve the system capacity in terms of number of
connections admitted along with enhancement in QoS.
In WiMAX standard, adaptive modulation and coding (AMC) technique is used to enhance the
system performance in varying channel condition. To aid the AMC process the SS feedbacks the
channel state information (CSI) to the BS. After receiving the CSI, the BS decides the appropriate
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
77
modulation and coding scheme (MCS) for that SS, i.e., based on CSI it selects one of the
modulation schemes among 64-QAM, 16QAM and QPSK modulation. The SS uses this MCS to
transmit its data burst [17-18]. This work makes an attempt to utilize channel information to
design the proposed CAC and scheduling algorithms.
The basic CAC algorithm works as follow. When a new connection request arrives, the basic
algorithm considers maximum sustained rate (MSR) of that connection as an admission criterion
for UGS/ertPS and average rate as an admission criterion for rtPS/nrtPS. If the available
bandwidth ( ) is greater than the admission criterion bandwidth ( ), then that
connection will be admitted by guaranteeing , otherwise will be rejected. The is
updated after admitting a connection as per equation 1. The BE connections are admitted directly
since they do not require QoS guarantee.
The basic algorithm admits the rtPS connections by guaranteeing average rate even though the
network is less congested. This makes the utilization of bandwidth less efficient and leads to the
wastage of resources. Also if low priority connections are already admitted and if there is no
enough bandwidth to admit the high priority UGS/ertPS connection request then the basic
algorithm rejects the high priority UGS/ertPS connection.
In order to overcome the above mentioned drawbacks of basic algorithm, the proposed CAC
algorithm tries to improve the utilization of bandwidth efficiently by providing higher bandwidth
than the to the rtPS connection when the network is less congested. Also an attempt has
been made to improve the admission of higher priority connections when there is no sufficient
bandwidth to admit the request, by degrading the lower priority connections without affecting
their QoS performance based on the modulation scheme adopted by SSs.
When a new connection request belonging to UGS/ertPS seeks for admission, the proposed
algorithm also considers MSR as an admission criterion as that of basic algorithm. When the
network is less congested, the criterion for admission considered for rtPS is 80% of MSR and for
nrtPS is average rate. When the network is congested, the admission criterion for rtPS is average
rate and for nrtPS is minimum reserved rate (MRR). If the is greater than the , that
connection will be admitted by guaranteeing and is updated as per the equation 1.
If the connection request is for a real time service and is less than the , then the
proposed algorithm tries to admit that connection by degrading the lower priority connections.
The additional bandwidth required ) to admit the higher priority connection request is
calculated using equation 3.
In order to avail the to admit the real time services, initially nrtPS connections are
considered for degradation on the basis of modulation scheme used by the SSs, i.e., connections
of SSs with higher order modulation are considered first and then connections of SSs with lower
order modulation schemes.
One of the nrtPS connections of SSs which uses 64QAM modulation scheme is selected for
degradation from the list of connected SSs. Since 64QAM provides the higher data rate and is
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
78
capable to suffice the QoS requirements of nrtPS connection even with the MRR bandwidth
guarantee.
The maximum possible bandwidth ( ) that can be degraded from the nrtPS connection
considered is calculated using the equation 4,
Figure 1. Flow chart of proposed CAC mechanism
If is greater than the , then bandwidth of nrtPS connection is degraded as per the
equation 5 and the requested connection is admitted. The is updated as per the equation
6.
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
79
If is less than the , then bandwidth of nrtPS connection considered for
degradation is degraded to MRR. The and are updated as per the equation 7 and
8 respectively.
Further to avail the to admit the real time services, other nrtPS connections of SSs which
uses 64QAM modulation scheme are considered for degradation one by one and still the available
bandwidth is not sufficient to admit the real time connection request, then nrtPS connections of
SSs which uses 16QAM and QPSK modulation scheme are considered for degradation based on
the order of modulation one by one.
Further if the bandwidth available is not sufficient to admit the requested real time connection and
the request is for UGS/ertPS, to avail the the rtPS connections are considered for
degradation. The guaranteed bandwidth of rtPS connections is degraded till average rate
following the same degradation procedure as that of the nrtPS connection. If the available
bandwidth after degrading nrtPS and rtPS connections is not sufficient to admit the higher priority
connection request that connection request will be rejected. The flow chart of proposed CAC
mechanism is shown in figure 1.
4. PROPOSED MODULATION AWARE UPLINK SCHEDULING MECHANISM
In this paper along with CAC algorithm a modulation aware BS uplink scheduling algorithm is
proposed to improve the QoS performances of ertPS, rtPS and BE services. The proposed
scheduling algorithm tries to improve the performance of ertPS and rtPS services by making an
effort to allocate the requested bandwidth when requested bandwidth is more than the guaranteed
bandwidth. Also the proposed algorithm attempts to improve the performance of BE services by
allocating the requested bandwidth to the BE services in a Round-robin way by considering the
modulation schemes used by the SSs.
In the basic scheduling algorithm, the bandwidth is allocated to the admitted connections on the
basis of service type priority of the connections. That is, bandwidth is allocated to all the UGS
connections first, then to ertPS connections, later to the requested rtPS, nrtPS and BE
connections. Weighted fair queue (WFQ) scheduling algorithm is used to schedule the
connections of same service type. For UGS connections the BS allocates the MSR and for non-
UGS connections BS allocates the bandwidth based on the requested bandwidth ( ). If the
of a connection is less than the guaranteed bandwidth ( ) of that connection, then
BS allocates requested bandwidth for that connection, otherwise that connection is allocated with
the guaranteed bandwidth. The available bandwidth ( ) is updated after allocating the
bandwidth to each connection as per the equation 9.
The proposed algorithm follows same procedure as that of the basic algorithm for allocating the
bandwidth to the connections of all service types, except for ertPS and rtPS connections when
requested bandwidth is more than the guaranteed bandwidth.
When requested bandwidth of ertPS/rtPS connections is more than the guaranteed bandwidth, the
proposed algorithm degrades the nrtPS connections for which requested bandwidth is less than
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
80
the guaranteed bandwidth. To allocate the requested bandwidth for ertPS/rtPS connections,
additional bandwidth required ( ) is calculated using the equation 10.
Figure 2. Flow chart of proposed scheduling algorithm
In order to avail , one of the nrtPS connections of SSs which use 64QAM modulation
scheme is considered from the list of connected SSs for degradation first. If the requested
bandwidth by that nrtPS connection is less than the guaranteed bandwidth for that connection,
then the bandwidth is taken out in that frame.
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
81
The additional bandwidth obtained and the are updated as per the equation
11 and 12 respectively.
Further if the > 0, then to avail , other nrtPS connections of SSs which uses 64QAM
modulation scheme are considered for degradation and further if > 0, then nrtPS
connections of SSs which uses 16QAM and QPSK modulation scheme are considered based on
the order of modulation one by one. After degrading all the nrtPS connections, if still > 0,
no further degradations will be carried out. The additional bandwidth ( ) obtained by
the degradation process is allotted to the considered ertPS/rtPS connection along with the
guaranteed bandwidth. Meanwhile, after each degradation process if , then ertPS/rtPS
connection is allotted with the requested bandwidth.
Further in the proposed algorithm, the BE connections are served in a round robin manner based
on the modulation schemes used. In the first frame, one of the BE connections of SSs which uses
64QAM modulation scheme is considered based on the WFQ algorithm for bandwidth allocation.
If > of the considered connection, then requested bandwidth is allotted to that
connection, otherwise available bandwidth is allotted.
If the bandwidth is available after allocation to considered BE connection, then other BE
connections of SSs which uses 64QAM modulation scheme are considered for bandwidth
allocation one by one in the similar procedure. If the bandwidth is still available, then BE
connections of SSs which uses 16QAM and QPSK modulation schemes are considered for
bandwidth allocation in the similar procedure till available bandwidth exhaust.
In the second frame, similar procedure is followed to allocate bandwidth to the BE connections.
But the BE connections of SSs considered for bandwidth allocation is in the order 16QAM,
QPSK and 64QAM. In the third frame, similar procedure is followed to allocate the bandwidth by
considering the BE connections of SSs in the order of QPSK, 64QAM and 16QAM modulation
schemes.
Further, in the subsequent frames similar procedure is followed to allocate the bandwidth to the
BE connections by considering the modulation scheme used by SSs in Round Robin procedure as
explained. In this way all the BE connections are served by giving equal priority. The figure 2
gives the flow charts of proposed scheduling algorithm.
5. SIMULATION AND RESULTS
The performance of proposed channel aware CAC and BS scheduling algorithm is evaluated
through simulation studies using QualNet 5.0.2 simulator [19]. The performance of proposed
algorithm is compared with the basic algorithm present in simulator. A single WiMAX cell is
considered in the simulation area of 2Km X 2Km working at a frequency 2.4 GHz. The path loss
model selected is two-ray with constant shadowing model of shadowing mean 4dB. The traffic
generated for various service types along with QoS parameters (MSR and MRR) considered are
given in table 1.
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
82
Table 1. Traffic considered for simulation.
Service Type Type of Traffic Data Rate MSR MRR
UGS CBR 64000 64000 64000
ertPS VBR 64000 64000 16000
rtPS VBR 256000 256000 64000
nrtPS VBR 256000 256000 64000
BE FTP 1000000 0
5.1. Scenario 1
This scenario is designed to study the performance of implemented work for different channel
conditions (64QAM, 16QAM and QPSK region). In this scenario, six SSs are placed in each
region, hence total number of SSs considered is eighteen. The SSs have to transmit five traffics
each mapped to UGS, ertPS, rtPS, nrtPS and BE respectively. Hence the total number of
connections can be 90, among which each service type has 18 connections. The snapshot of
scenario is shown in figure 3. The simulation studies have been carried out by considering the
generation of these traffics in four different schemes for both basic and proposed algorithms. The
performances of basic and proposed algorithms are compared by considering the metrics like
number of connections admitted, throughput and delay.
Figure 3. Snapshot of scenario 1
5.1.1 Scheme 1
Simulation study has been carried out by considering the generation of traffic on the priority basis
from highest priority to least priority, i.e., from UGS to BE. The simulator has been programmed
to generate considered traffics at various simulation times as given in the table 2.
Table 2. Traffic generated and Number of connections admitted for scheme 1.
Simulation
time (second)
Number of connections
generated
Service
type
No. of Connections admitted
Basic Proposed
1 18 UGS 18 18
30 18 ertPS 18 18
60 18 rtPS 18 18
90 18 nrtPS 17 17
120 18 BE 0 0
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
83
The table 2 and Figure 4 depict the number of connections of different service types admitted by
basic and proposed algorithms for scheme 1. It is observed from the table 3 and figure 4 that the
number of connections admitted by basic and proposed algorithms is same for scheme 1, since in
this scheme, as the higher priority connections are seeking for admission prior to the low priority
connections, there is no chance for degradation of low priority admitted connections. It is also
observed from the table 3 and figure 4 that the number of BE connections served is zero since BE
connections have least priority and all the available bandwidth may be utilized to higher priority
connections.
UGS ertPS rtPS nrtPS BE
0
2
4
6
8
10
12
14
16
18
NumberofConnections
Admitted
Service Types
Basic
Proposed
Figure 4. Number of connections admitted - scheme 1
As both basic and proposed algorithms perform in similar manner for scheme 1, the throughput
performance is same for all the service types. Hence the throughput performance is not
considered here for scheme 1.
5.1.2 Scheme 2 and Scheme 3
Scheme 2: In this scheme, the simulation study has been repeated by generating all the 90 traffics
(UGS, ertPS, rtPS, nrtPS and BE connections of 18 each) simultaneously at the beginning of
simulation.
Scheme 3: In this scheme the simulation study has been repeated by considering the random
generation of traffic. Connections from each service types of one each are generated at every
interval of 5 seconds.
Table 3. Number of connections admitted - Scheme 2 and Scheme 3.
Service
Types
Number of Connections admitted
Scheme 2 Scheme 3
Basic Proposed Basic Proposed
UGS 13 15 14 16
ertPS 14 15 15 15
rtPS 13 15 14 15
nrtPS 13 14 14 15
BE 5 7 9 8
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
84
UGS ertPS rtPS nrtPS BE
0
2
4
6
8
10
12
14
16
(a)
NumberofConnectionsadmitted
Service Types
Basic
Proposed
UGS ertPS rtPS nrtPS BE
0
2
4
6
8
10
12
14
16
18
(b)
NumberofConnectionsadmitted
Service Types
Basic
Proposed
Figure 5. Number of connections admitted for (a) scheme 2 (b) scheme 3
The table 3 and Figure 5(a-b) depict the number of connections admitted by basic and proposed
algorithms for scheme 2 and scheme 3. It is observed from table 3 and figure 5(a-b) that the
number of connections admitted in proposed algorithm is more compared to the basic algorithm.
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
0.6 (a)
UGSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
(b)
ertPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
2.5
rtPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
(c)
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
2.5
(d)
nrtPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0
2
4
6
8
10
12
14
16
18
(e)
BEThroughput(Kbps)
Simulation time (Sec)
Basic
Proposed
Figure 6. Throughput performance of Scheme -2 for (a) UGS (b) ertPS (c) rtPS (d) nrtPS (e) BE
connections
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
0.6
(a)
UGSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
0.6
(b)
ertPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
2.5
(c)
rtPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
85
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
(d)
nrtPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0
50
100
150
200
250 (e)
BEThroughput(Kbps)
Simulation time (Sec)
Basic
Proposed
Figure 7. Throughput performance of Scheme - 3 for (a) UGS (b) ertPS (c) rtPS (d) nrtPS (e) BE
connections
Figures 6(a-e) and 7(a-e) give the throughput performance of connections of different service
types with respect to simulation time for scheme 2 and scheme 3 respectively. It is observed from
the figures 6(a-d) and 7(a-d) that the throughput performance of UGS, ertPS, rtPS and nrtPS
connections for proposed algorithm is better compared to basic algorithm since the number of
connections admitted in proposed algorithm is more compared to basic algorithm. It is observed
from the figures 6(e) and 7(e) that the throughput performance of BE connections for proposed
algorithm is marginally better compared to basic algorithm.
5.1.3 Scheme 4
In this scheme the simulation study has been repeated by considering the generation of traffic in
reverse order compared to scheme 1, i.e., the connections are generated from low priority (BE) to
high priority (UGS). The traffics generated at various simulation times are given in table 4.
Table 4. Traffic generated and number of connections admitted for scheme 4.
Simulation
time (second)
Number of connections
generated
Service type No. of Connections admitted
Basic Proposed
1 18 BE 0 14
30 18 nrtPS 0 15
60 18 rtPS 18 17
90 18 ertPS 18 16
120 18 UGS 13 13
0
2
4
6
8
10
12
14
16
18
BEnrtPSrtPSertPSUGS
NumberofConnectionsAdmitted
Service Types
Basic
Proposed
Figure 8. Number of connections admitted - scheme 4
The table 4 and Figure 8 depict the number of connections of different service types admitted by
basic and proposed algorithms for scheme 4. It is observed from table 4 and figure 8 that the
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
86
number of connections admitted in proposed algorithm is more compared to the basic algorithm.
The table 4 and figure 8 depict that for scheme 4 the UGS and ertPS connections are not admitted
in basic algorithm, whereas the proposed algorithm successfully admits 14 UGS and 15 ertPS
connections. The proposed algorithm performs better for scheme 4 since in this scheme the
chance to degrade the low priority connections is more than for any other schemes.
Figures 9(a-e) give the throughput performance of connections of different service types with
respect to simulation time for scheme 4. It is observed from figure 9(a) that UGS throughput is
zero till 120th
second for both basic and proposed algorithm, as the UGS connections are started at
120th
second. After 120th
second the throughput of UGS connections for proposed algorithm
increases but the throughput of basic algorithm remains zero. Similarly it is observed from figure
9(b) that ertPS throughput is zero till 90th
second, and after 90th
second the throughput of ertPS
connections for proposed algorithm increases but the throughput of basic algorithm remains zero.
As in this scheme the nrtPS and rtPS connections of higher datarate are started before UGS and
ertPS, in basic algorithm almost all of the resources of admission control are utilized for
admitting the nrtPS and rtPS connections, so the higher priority UGS and ertPS connections are
not admitted. Whereas in proposed algorithm, UGS and ertPS connections are admitted since the
BS degrades the lower priority connections in order to admit higher priority connections.
It is observed from figure 9(c) and 9(d) that the throughput of rtPS and nrtPS connections for
proposed algorithm is less than the basic algorithm, because higher priority connections are get
admitted by degrading lower priority connections in proposed algorithm. It is observed from
figure 9(e) that throughput performance of BE connections for proposed algorithm is marginally
better compared to basic algorithm.
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
(a)
UGSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.1
0.2
0.3
0.4
0.5
0.6 (b)
ertPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
2.5
3.0
(c)
rtPSThroughput(Mbps)
Simulation time (Sec)
Basic
Proposed
0 30 60 90 120 150
0.0
0.5
1.0
1.5
2.0
2.5
3.0
(d)
nrtPSThroughput(Mbps)
Simulation time (Second)
Basic
Proposed
0 30 60 90 120 150
0
200
400
600
800
1000
(e)
BEThroughput(Kbps)
Simulation Time (Sec)
Basic
Proposed
Figure 9. Throughput performance of Scheme - 3 for (a) UGS (b) ertPS (c) rtPS (d) nrtPS (e) BE
connections
5.2. Scenario 2
In this scenario, design of scenario 1 is retained and the performance of basic and proposed
algorithm are studied by considering number of connections admitted, throughput and delay as
13. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
87
performance metrics for varying number of connections. Initially 15 connections are considered
for study among which 5 connections are considered in each channel conditions (i.e., 5
connections each at 64QAM, 16QAM and QPSK region). Five connections of each region are
mapped to UGS, ertPS, rtPS, nrtPS and BE service types. The simulation study has been carried
out by generating all the traffics simultaneously at the beginning of simulation. The simulation
studies are repeated by increasing the number of connections up to 90 connections insteps of 15.
Table 5 and figure 10 give the number of connections admitted for varying number of
connections. It can be observed that for less number of connections (upto 30 connections) the
number of connections admitted in both proposed and basic algorithm are same, since for less
number of connections the bandwidth requirement may be less than the available bandwidth,
hence degradation is not necessary. As the number of connections increases, the proposed
algorithm outperforms basic algorithm. From table 4 and figure 10 it is evident that the number of
connections admitted in each service type is more for proposed algorithm compared to basic
algorithm. It is also noted that the BE connections served is almost same in both proposed and
basic algorithm, as the BE connections do not go through admission control.
Table 5. Number of connections admitted for varying number of connections
(B-Basic algorithm, P – Proposed algorithm)
Total number
of Connections
generated
Total Number
of Connections
admitted
Total Number of Connections admitted in each
service type
UGS ertPS rtPS nrtPS BE
B P B P B P B P B P B P
15 15 15 3 3 3 3 3 3 3 3 3 3
30 29 29 6 6 6 6 6 6 6 6 5 5
45 36 42 7 9 7 9 8 9 7 9 6 6
60 43 57 9 12 8 12 9 12 8 12 9 9
75 64 70 13 15 14 15 14 15 13 15 10 10
90 70 83 14 18 14 18 15 18 13 18 14 12
15 30 45 60 75 90
0
10
20
30
40
50
60
70
80
90
TotalNumberofConnectionsadmitted
Number of Connections
Basic
Proposed
Figure 10. Number of connections admitted for varying number of connections
14. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
88
15 30 45 60 75 90
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0
Troughput-UGS(Mbps)
Number of Connections
Basic
Proposed
15 30 45 60 75 90
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0
Troughput-ertPS(Mbps)
Number of Connections
Basic
Proposed
15 30 45 60 75 90
0.5
1.0
1.5
2.0
2.5
3.0
3.5
4.0
Troughput-rtPS(Mbps)
Number of Connections
Basic
Proposed
15 30 45 60 75 90
0.5
1.0
1.5
2.0
2.5
3.0
3.5
Troughput-nrtPS(Mbps)
Number of Connections
Basic
Proposed
15 30 45 60 75 90
0.4
0.6
0.8
1.0
1.2
1.4
1.6
Troughput-BE(Mbps)
Number of Connections
Basic
Proposed
Figure 11. Throughput performance of (a) UGS (b) ertPS (c) rtPS (d) rtPS (e) BE connections
Figures 11 (a-e) give the throughput performances of UGS, ertPS, rtPS, nrtPS and BE
connections with respect to varying number of connections respectively. It is observed that for
less number of connections the throughput performance is same for both proposed and basic
algorithm. As the number of connections increases, the throughput performances of proposed
algorithm is better compared to basic algorithm, since the number of connections admitted and
served are more in proposed algorithm. It is observed from figure 11(e) that for 90 connections
the throughput of BE for basic algorithm is more because the number of BE connections served is
more in basic algorithm.
15 30 45 60 75 90
0.0
0.2
0.4
0.6
0.8
1.0
1.2
1.4
AverageDelayofrealtimeservices(Second)
Number of Connections
Basic
Proposed
Figure 12. Average delay performance of real time services for varying number of connections
Figure 12 gives the delay performance of real time services for varying number of connections. It
is observed that the delay performances are almost same for proposed and basic algorithm.
5.3. Scenario 3
This scenario is designed to study the performance of the proposed BS uplink scheduling
algorithm for different service types. It is observed from the results of scenario 2 (table 5) that all
the generated connections get admitted for the number of connections less than 30. Hence in this
scenario 20 connections are considered for study. The simulation time considered is 100s.
15. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
89
Initially five connections (one connection from each service type) are considered for simulation
and as the simulation progresses the connections of different service types are generated at the
interval of three seconds. At 3rd
second one UGS connection is generated, at 6th
second one ertPS
connection is generated and so on. In this way 20 connections (4 connections of each service
type) are generated till 45th
second. The performance metrics considered for simulation study are
throughput and delay. As the proposed scheduling algorithm works in similar way to basic
algorithm for UGS and nrtPS cases, the performances of those connections are not considered.
0 20 40 60 80 100
0
20
40
60
80
100
120
140
160
180
ertPSThroughput(Kbps)
Simulation Time (Second)
Basic
Proposed
0 20 40 60 80 100
0
100
200
300
400
500
600
700
rtPSThroughput(Kbps)
Simulation Time (Second)
Basic
Proposed
0 20 40 60 80 100
0
100
200
300
400
500
BEThroughput(Kbps)
Simulation Time (Second)
Basic
Proposed
Figure 13. Throughput performance of (a) ertPS (b) rtPS (c) BE connections
Figures 13 (a-c) show the throughput performance of ertPS, rtPS and BE connections respectively
with respect to simulation time. It is observed from the figures that throughput increases for both
proposed and basic algorithm initially since for every 3 seconds a new connection is get added up.
After 50th
second the throughput becomes almost constant since no new connections get added
after 50th
second. Figures also depict that throughput performance of proposed algorithm is better
compared to basic algorithm since in proposed algorithm the scheduler degrades the bandwidth
guaranteed for nrtPS connections if real time services require more bandwidth, also in proposed
algorithm the scheduler serves the BE services in a round robin manner which gives equal priority
to all connections of different MCS regions.
0 20 40 60 80 100
0
1
2
3
4
ertPSDelay(Second)
Simulation Time (Second)
Basic
Proposed
0 20 40 60 80 100
0.0
0.2
0.4
0.6
0.8
1.0
rtPSDelay(Second)
Simulation Time (Second)
Basic
Proposed
Figure 14. Delay performance of (a) ertPS connections (b) rtPS connections
Figures 14 (a-b) depict the delay performance of ertPS and rtPS connections respectively with
respect to simulation time. It is observed from the figures that delay performance of proposed
algorithm is better compared to basic algorithm since the proposed algorithm allocates more
bandwidth to ertPS and rtPS connections.
6. CONCLUSIONS
In this paper modulation aware CAC scheme and BS uplink scheduling algorithms are proposed.
A connection bandwidth degradation method for lower priority services is proposed to increase
16. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 7, No. 1, February 2015
90
the system capacity to admit more number of higher priority connections without affecting the
QoS performance of lower priority connections much. Also a channel aware BS uplink
scheduling algorithm is proposed to improve the QoS performances of ertPS, rtPS and BE
services. The proposed algorithms are implemented using QualNet simulation tool. It is observed
from the simulation results that the proposed algorithms outperform the basic algorithms.
REFERENCES
[1] IEEE802.16e: IEEE Standard for Local and metropolitan area networks Part 16: Air Interface for
Fixed and Mobile Broadband Wireless Access Systems, 2005.
[2] Byeong Gi Lee and Sunghyun Choi, “Broadband Wireless Access and Local Networks Mobile
WiMAX and WiFi”, Artech House, 2008.
[3] Haitang Wang, Wei Li and Dharma P. Agrawal, “Dynamic admission control and QoS for 802.16
wireless MAN”, Wireless Telecommunications Symposium, 60, 2005.
[4] Kalikivayi Suresh, Iti Saha Misra and Kalpana saha (Roy), “Bandwidth and Delay Guaranteed Call
Admission Control Scheme for QOS Provisioning in IEEE 802.16e Mobile WiMAX”, Proceedings of
IEEE GLOBECOM, 1245, 2008.
[5] Ke Yu, Xuan Wang, Songlin Sun, Lin Zhang and Xiaofei Wu, “A Statistical Connection Admission
Control Mechanism for Multiservice IEEE 802.16 Network”, In Proceedings of VTC Spring, 2009.
[6] R Murali Prasad, “An Efficient Connection Admission Control Mechanism for IEEE 802.16
Networks”, Global Journal of Computer Science and Technology, Vol. 10, Issue 8, 97, 2010.
[7] Sarat Chandra and Anirudha Sahoo, “An Efficient Call Admission Control for IEEE 802.16
Networks”, In Proceedings of the 15th IEEE Workshop on Local & Metropolitan Area Networks,
188, 2007.
[8] David A. Levine, Ian F. Akyildiz and Mahmoud Naghshineh, “A Resource Estimation and Call
Admission Algorithm for Wireless Multimedia Networks Using the Shadow Cluster Concept”,
IEEE/ACM Transactions on Networking, Vol. 5, No. 1, 1, 1997.
[9] Lang Xie and Jie Xiang, “A Novel Bandwidth Degradation Scheme for Admission Control in IEEE
802.16e Networks”, 4th International Conference on Wireless Communications, Networking and
Mobile Computing (WiCOM), 2008.
[10] Romesh Laishram and Iti Saha Misra, “A Bandwidth Efficient Adaptive Call Admission Control
Scheme for QoS Provisioning in IEEE 802.16e Mobile Networks”, International Journal of Wireless
Information Networks, Volume 18 (2), 108, 2011.
[11] Ou Yang and Jianhua Lu, “A New Scheduling and CAC Scheme for Real-Time Video Application in
Fixed Wireless Networks”, IEEE CCNC proceedings, 2006.
[12] Samuel K. Falowo and Neco Ventura, “Admission Control and Packet Scheduling for IEEE 802.16
Standards”, in proceedings of SATNAC, 2010.
[13] Y. Ge and G.S. Kuo, “An Efficient Admission Control Scheme for Adaptive Multimedia Services in
IEEE 802.16e Networks”, IEEE 64th Vehicular Technology Conference (VTC-Fall), 1, 2006.
[14] D. S. Shu’aibu and S. K. Syed Yusof, “Link aware call admission and packet scheduling for best
effort and UGS traffics in mobile WiMAX”, International Journal of the Physical Sciences Vol. 6(7),
pp. 1694-1701, 2011
[15] Wan Kim and Hwangjun Song, “QoS-aware joint working packet scheduling and call admission
control for video streaming service over WiMAX network”, Springer - Wireless Networks,1083,
2011.
[16] Shafaq B. Chaudhry and Ratan K. Guha “Adaptive Connection Admission Control and Packet
Scheduling for QoS Provisioning in Mobile WiMAX”, IEEE International Conference on Signal
Processing and Communications (ICSPC), 2007.
[17] Loutfi Nuaymi, “WiMAX: Technology for Broadband Wireless Access”, John Wiley & Sons Ltd,
2007.
[18] Kwang-Cheng Chen and J. Roberto B. de Marca, “Mobile WiMAX”, IEEE PRESS, IEEE
Communications Society and John Wiley & Sons Ltd, 2008.
[19] http://www.scalablenetworks.comqualnetdocumentation Documentation of QualNet simulation tool