Traffic Aware Research Articles

Subnetwork Based Traffic Aware Rerouting for CMesh Bufferless Network-on-Chip

On-chip interconnection networks are primarily designed for efficient, high-performance Tiled Chip Multi-Processors (TCMP) architectures. Bufferless Network-on-Chip (NoC) is a better design option owing to their simpler router structure, area and power efficiency. Deflection routers have similar network performance of buffered designs at low to medium network traffic as deflections are minimal. But when network load increases, deflections also rise rapidly leading to poor network performance because of increased latency, power dissipation and unbalanced traffic. In this work, we propose a subnetwork based adaptive Concentrated Mesh (CMesh) bufferless router where deflections are considerably reduced by redirecting competing flit in one subnetwork to vacant port of the other subnetwork without any additional cycle latency. Simulations conducted over two-dimensional and multidimensional CMesh networks show that our topologically independent, adaptive deflection routing mechanism provides better network load balance and improves performance by minimizing unbounded deflections when compared to designs under consideration.

TRASH: Traffic Aware Hybrid-CRAN Scheme for V2I Connectivity Enhancement

TRASH: Traffic Aware Hybrid-CRAN Scheme for V2I Connectivity Enhancement

Cooperative Hyper-Scheduling based improving Energy Aware Life Time Maximization in Wireless Body Sensor Network Using Topology Driven Clustering Approach

The Wireless Body Sensor Network (WBSN) is an incredible developing data transmission network for modern day communication especially in Biosensor device networks. Due to energy consumption in biomedical data transfer have impacts of sink nodes get loss information on each duty cycle because of Traffic interruptions. The reason behind the popularity of WBSN characteristics contains number of sensor nodes to transmit data in various dense regions. Due to increasing more traffic, delay, bandwidth consumption, the energy losses be occurred to reduce the lifetime of the WBSN transmission. So, the sensor nodes are having limited energy or power, by listening to the incoming signals, it loses certain amount of energy to make data losses because of improper route selection. To improve the energy aware lifetime maximization through Traffic Aware Routing (TAR) based on scheduling. Because the performance of scheduling is greatly depending on the energy of nodes and lifetime of the network. To resolve this problem, we propose a Cooperative Hyper-scheduling (CHS) based improving energy aware life time maximization (EALTM) in Wireless Body sensor network using Topology Driven Clustering Approach (TDCA).Initially the method maintains the traces of transmission performed by different Bio-sensor nodes in different duty cycle. The method considers the energy of different nodes and history of earlier transmission from the Route Table (RT) whether the transmission behind the Sink node. Based on the RT information route discovery was performed using Traffic Aware Neighbors Discovery (TAND) to estimate Data Transmission Support Measure (DTSM) on each Bio-sensor node which its covers sink node. These nodes are grouped into topology driven clustering approach for route optimization. Then the priority is allocated based on The Max-Min DTSM, the Cooperative Hyper-scheduling was implemented to schedule the transmission with support of DTSM to reduce the energy losses in WBSN. This improves the energy level to maximization the life time of data transmission in WBSN than other methods to produce best performance in throughput energy level.

Energy efficient two-stage capacity allocation scheme for WBAN healthcare applications

Co-channel interference occurs in coexisting Wireless Body Area Networks (WBANs) and has an impact on the capacity allocation of the networks. The proposed Two Stage Capacity Allocation (TSCA) mitigates interference and maximizes the capacity of poor channel quality WBANs with high priority data. It uses traditional interference mitigation schemes such as transmission power level control, channel switching and relay-aided transmission in each instant of pause time. The proposed work introduces a metric called Emergency Residual Index (ER-Index) and chooses any one of the mitigation schemes. The ER Index value provides a trade-off between residual energy, emergency factor and channel metrics. Further, TSCA executes a two-stage capacity allocation method. The TSCA scheme is a combination of the Nash bargaining solution and the Min-Max algorithm. The mitigated interference is 45% compared to Dynamic link quality-based Sub Channel Allocation (DSCA) and 60% compared to Traffic Aware Medium Access Control (TA-MAC). The average energy consumption is decreased up to 37.82% compared to TA-MAC and 25.59% compared to the DSCA algorithm.

Traffic-Aware 6TiSCH Routing Method for IIoT Wireless Networks

The 6TiSCH network is a key technology of the Industrial Internet of Things (IIoT), providing high reliability and deterministic features. However, IIoT sensors and facility applications generate heavy traffic loads. Various time-slotted channel hopping (TSCH) medium access layer (MAC) and routing protocols for low-power and lossy network (RPL) methods have been studied at each network layer to address this issue. Although TSCH MAC is standard for IIoT low-rate wireless networks, it has not been adequately considered in conventional RPL studies. Conventional RPL methods do not effectively utilize the characteristics of the TSCH MAC in heavy-traffic networks and may hinder performance. In this article, we introduce a traffic-aware (TA) RPL method that utilizes the cell allocation information of TSCH MAC. The number of allocated TSCH cells determines the bandwidth reserved by each node and includes the link quality and traffic information measured by the MAC layer. TA RPL facilitates efficient load balancing using cell allocation information and improves the bandwidth utilization of the network. Additionally, the proposed method can improve the deterministic features of the IIoT wireless network because the effect of the routing decision of each device can be predicted. Moreover, the packet delivery ratio and bandwidth utilization are improved by up to 31% and 20%, respectively, compared with the conventional methods based on simulation and testbed evaluations.

A Network Traffic Aware Tuning Algorithm in Wireless Sensor Networks

Wireless sensor networks (WSNs) are being widely deployed in many areas such as smart homes and Internet of Things. A main concern in WSNs is energy conservation because battery operated sensor nodes are expected to run for a long period of time without human intervention. The backoff mechanism implemented in the WSNs communication protocol is a key element to ensure energy efficient communication between sensor nodes. Many previous backoff schemes perform well in light or medium loaded networks. However, on a heavily loaded network, performance degrades significantly. Also, most of the proposed schemes in the literature are based on the assumption that the number of nodes is given. In this paper, we propose an adaptive scheme that estimates the number of competing nodes in wireless sensor networks by using the collision probability and adapts the backoff window parameters accordingly, such that higher throughput and energy efficiency are obtained. The numerical results show that the proposed scheme could achieve much higher throughput and energy efficiency than the standard and previous methods for almost all the different competing number of nodes.

Retracted: A smart transportation system in VANET based on vehicle geographical tracking and balanced routing protocol

SummaryIn present scenario, Vehicular Ad‐hoc Network (VANET) has obtained extensive attention because of its unique characteristics that handle high mobility of vehicles, reaping topological changes and frequent route breakages or failures. Hence, for providing smart transportation with enhanced traffic regulation and safety, a new position‐based routing protocol called Traffic Dynamism‐Balanced Routing Protocol (TDBRP) for VANET has been proposed in this paper. Moreover, the work concerns the instantaneous scenario of urban cities with the bidirectional and multilane roads. Efficient junction selection algorithm (EJSA) has been incorporated based on the traffic dynamism for establishing optimal route paths between nodes, hence, forwarding the data packets efficiently. Furthermore, the novel EJSP and the route framing between junctions are established on the basis of information gained from two‐hop neighbors, which tends to reduce end‐to‐end delay and enhances packet delivery ratio (PDR). The TDBRP has been implemented and evaluated in Network Simulator (NS 2.34). And the results are examined and compared with some existing protocols like Geographic Source Routing (GSR), Enhanced Greedy Traffic Aware Routing protocol (E‐GyTAR), and Anchor‐based Street and Traffic‐Aware Routing (A‐STAR). The outcomes outperform the existing works by minimizing the routing overhead and end‐to‐end delay by an average of 16% and 13%, respectively, and increase the PDR value by an average of 25% than others. The proposed protocol also evidences that the two‐hop neighbor information‐based packet forwarding provides better result and efficient routing than neighbor information.

Routing With Traffic Awareness and Link Preference in Internet of Vehicles

Considering the high mobility and uneven distribution of vehicles, an efficient routing protocol should avoid that the sent packets are forwarded within road segments with ultra-low density or serious data congestion in vehicular networks. To this end, in this paper, we propose a Traffic aware and Link Quality sensitive Routing Protocol (TLRP) for urban Internet of Vehicles (IoV). First, we design a novel routing metric, i.e., Link Transmission Quality (LTQ), to account for the impact of the number, quality and relative positions of communication links along a routing path on the network performance. Then, to adapt to the dynamic characteristics of IoV, a road weight evaluation scheme is presented to assess each road segment using the real-time traffic and link information quantified by the LTQ. Next, the path with the lowest aggregated weight is selected as the routing candidate. Extensive simulations demonstrate that our proposed protocol achieves significant performance improvements compared to the state-of-the-art protocol MM-GPSR, the typical junction-based scheme E-GyTAR, and the classic connectivity-based routing iCAR, in terms of packet delivery ratio and average transmission delay.

Renewable Energy Assisted Sustainable and Environment Friendly Energy Cooperation in Cellular Networks

In this paper, an energy cost minimization framework is presented for a green cellular network. The proposed novel energy cooperation scheme ensures optimal energy cooperation among grid-connected green cellular base stations (BSs). The framework is both economical and environment-friendly where the energy is saved by cutting down on the grid energy and sharing surplus green energy among the BSs. The intended scenario requires knowledge of harvested energy as well as traffic awareness to determine energy demand of a BS and inter-BS connectivity for incorporating energy transfer. A realistic utility function is developed to minimize energy cost under various constraints which entail energy borrowing from neighboring BSs (offering their surplus energy which is cheaper than grid and diesel generator), thereby reducing the overall energy cost of the network. The proposed framework for energy cooperation has bilinear non-convex structure. We use McCormick envelopes to convexify the optimization problem and transform the bilinear non-convex optimization into a linear optimization problem. The numerical results verify the effectiveness of the proposed traffic aware sustainable and environmental friendly BS operation through energy cooperation.

A Reliable Path Selection and Packet Forwarding Routing Protocol for Vehicular Ad hoc Networks

Vehicular ad hoc networks (VANETs) have earned a gigantic consideration in the recent era. Wide deployment of VANETs for enhancing traffic safety, traffic management, and assisting drivers through elegant transportation system is facing several research challenges that need to be addressed. One of the crucial issues consists of the design of scalable routing algorithms that are robust to rapid topology changes and frequent link disconnections caused by the high mobility of vehicles. In this article, first of all, we give a detailed technical analysis, comparison, and drawbacks of the existing state-of-the-art routing protocols. Then, we propose a novel routing scheme called a Reliable Path Selection and Packet Forwarding Routing Protocol (RPSPF). The novelty of our protocol comes from the fact that firstly it establishes an optimal route for vehicles to send packets towards their respective destinations by considering connectivity and the shortest optimal distance based on multiple intersections. Secondly, it uses a novel reliable packet forwarding technique in-between intersections that avoids packet loss while forwarding packet due to the occurrence of sudden link ruptures. The performance of the protocol is assessed through computer simulations. Simulation outcomes specify the gains of the proposed routing scheme as compared to the earlier significant protocols like GSR (Geographic Source Routing), GPSR (Greedy Perimeter Stateless Routing), E-GyTAR (Enhanced Greedy Traffic Aware Routing), and TFOR (Traffic Flow-Oriented Routing) in terms of routing metrics such as delivery ratio, end-to-end delay, and routing overhead.

Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment

VANET (Vehicular Ad-hoc Network) is an emerging offshoot of MANETs (Mobile Ad-hoc Networks) with highly mobile nodes. It is envisioned to play a vital role in providing safety communications and commercial applications to the on-road public. Establishing an optimal route for vehicles to send packets to their respective destinations in VANETs is challenging because of quick speed of vehicles, dynamic nature of the network, and intermittent connectivity among nodes. This paper presents a novel position based routing technique called Dynamic Multiple Junction Selection based Routing (DMJSR) for the city environment. The novelty of DMJSR as compared to existing approaches comes from its novel dynamic multiple junction selection mechanism and an improved greedy forwarding mechanism based on one-hop neighbors between the junctions. To the best of our knowledge, it is the first ever attempt to study the impact of multiple junction selection mechanism on routing in VANETs. We present a detailed depiction of our protocol and the improvements it brings as compared to existing routing strategies. The simulation study exhibits that our proposed protocol outperforms the existing protocols like Geographic Source Routing Protocol (GSR), Enhanced Greedy Traffic Aware Routing Protocol (E-GyTAR) and Traffic Flow Oriented Routing Protocol (TFOR) in terms of packet delivery ratio, end-to-end delay, and routing overhead.

Demonstration of the Traffic Aware Planner

NASA has been developing and testing the Traffic Aware Strategic Aircrew Requests (TASAR) concept for aircraft operations featuring a NASA-developed cockpit automation tool, the Traffic Aware Planner (TAP), which computes traffic/hazard-compatible route changes to improve flight efficiency. The TAP technology is anticipated to save fuel and flight time and thereby provide immediate and pervasive benefits to the aircraft operator, as well as improving flight schedule compliance, passenger comfort, and pilot and controller work-load. Previous work has indicated the potential for significant benefits for TASAR-equipped aircraft, and a flight trial of the TAP software application in the National Airspace System has demonstrated its technical viability. As part of ongoing software research, development, and testing of the TAP software, we developed the capability to run the current build of the TAP software using the NASA Airspace and Traffic Operations Simulator (ATOS) with preloaded flight scenarios. Our demonstration is fully interactive and will allow participants to operate the TAP software on an iPad Air themselves, or observe the demonstrators operating it. The purpose of developing this capability is not only to assist with testing during software development, but also to acquaint researchers and potential stakeholders with the TAP human machine interface and the functionality and capabilities of the software itself.

DRTL: A heat-balanced deadlock-free routing algorithm for 3D topology network-on-chip

Heat balance is of critical importance on the design of network-on-chip (NoC). In a 3D topology NoC, routing algorithm should take considerations of each layer's peak temperature and traffic to prolong chip's service life. In this paper, we propose a heat-balanced, deadlock-free routing algorithm named Direct Ratio Transport Layer (DRTL). DRTL distributes and arranges traffics according to the source layer and destination layer in order to achieve heat balance in the chip. In this algorithm, if a transition layer is needed, the probability of choosing a layer as the transition layer is inversely proportional to the distance between this layer and the heat sink. Simulation results showed that, compared with Traffic Aware Downward Routing (TADR), congestion is alleviated and the chip achieves good network performance when DRTL is used. Moreover, DRTL gets almost the same network performance as Transport Layer Assisted Routing (TLAR) does while the chip temperature can be lowered by 2K.

ETEEM- Extended Traffic Aware Energy Efficient MAC Scheme for WSNs

Idle listening issue arises when a sensor node listens to medium despite the absence of data which results in consumption of energy. ETEEM is a variant of Traffic Aware Energy Efficient MAC protocol (TEEM) which focuses on energy optimization due to reduced idle listening time and much lesser overhead on energy sources. It uses a novel scheme for using idle listening time of sensor nodes. The nodes are only active for small amount of time and most of the time, will be in sleep mode when no data is available. ETEEM reduces energy at byte level and uses a smaller byte packet called FLAG replacing longer byte SYNC packets of S-MAC and SYNCrts of TEEM respectively. It also uses a single acknowledgement packet per data set hence reducing energy while reducing frequency of the acknowledgment frames sent. The performance of ETEEM is 70% better comparative to other under-consideration MAC protocols.

MTADF : Multi Hop Traffic Aware Data for Warding for Congestion Control in Wireless Sensor Networks

In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.

Traffic-and-resource-aware intrusion detection in wireless mesh networks

As the interest in Wireless Mesh Networks (WMN), as an infrastructureless wireless network, grows, security issues, especially intrusion detection, become of paramount importance. The diversity in hardware along with a variety of WMN applications, have resulted in WMN with different network characteristics (e.g., resource levels, system and security models, etc.). Consequently, different intrusion detection mechanisms have been proposed by the research community. Recently, the community has proposed several monitoring techniques for intrusion detection where each considers different assumptions and presents a different problem formulation for optimal monitoring. This article proposes a taxonomy that categorizes existing solutions in this research area and identifies the similarities and differences in their optimal monitoring problem formulations. We then concentrate on two classes of monitoring techniques for intrusion detection in WMN: Traffic Agnostic and Resourceful and Traffic Aware and Resourceful and present centralized and distributed algorithms for solving optimal monitoring problem in these networks. Through extensive simulations and a real implementation, we demonstrate the effects of different network characteristics on the problem formulation and consequently the performance (e.g., intrusion detection rate and resource consumption) of proposed solutions for optimal monitoring in WMN.

A new routing scheme to reduce traffic in large scale mobile ad-hoc networks through selective on-demand method

Wireless ad-hoc networks have many different characteristics from previous centralized networks. While the infrastructure based networks usually employ the simple routing protocol because every node can reach the coordinator in a single hop, some specific situations, i.e., unplanned dynamic links and multi hop environment, were required in ad-hoc networks. In mobile ad-hoc network, all nodes engaging in communication under the ad-hoc networks should be operated as a router. For this, two routing approaches are previously designed for ad-hoc networks; proactive and reactive routing, and they differently have pros and cons from each other. Moreover, to integrate their advantages in case by case, hybrid approach is consistently researched, and Zone Routing Protocol (ZRP) was motivating many recent hybrid protocols. In ZRP, a node uses proactive routing if it is located within the zone defined by the specific number of hops, but it uses reactive routing in otherwise case. However, ZRP always forms the proactive zone considering only the number of hops, regardless of whether real data communication occurred frequently or not. In this paper, we propose a new routing scheme called Traffic Aware Dynamic Zone Routing (TA-DZR) protocol which employs the zone method but forms customized zone using traffic load, by a new decision method named Dynamic Zone Decision (DZD). The DZD selects nodes that are good to use proactive routing based on the traffic load and forms the proactive zone with them. By considering traffic awareness, TA-DZR can decrease the number of transmissions and can reduce the total energy consumption. After the description of TA-DZR, the performance is demonstrated with simulation results which show that the number of transmissions decreases in overall network, and that the energy consumption is also reduced. Additionally, we validate that the end-to-end delivery delay is reduced and that the packet delivery ratio is improved. These enhancements are caused by reducing overall network congestion.