Nasser Alzeidi

Bandwidth borrowing-based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

SUMMARY This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement-based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation-based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright

A parameterized NoC simulator using OMNet

Wormhole switching with virtual channels has been widely deployed in high-speed interconnects at different scales. Its minimal buffer requirements and simple router design promotes its rapid emergence as a preferred switching technique for networks-on-chips as the power and area are two stringent constrains that needs to be considered in such architectures. In this paper we present a simulation model based on OMNet++ to study the performance of wormhole switched interconnects. The developed simulator allows the designer to vary different parameters including number of virtual channels, buffer size, packet size, and wire parameters. The statistics collected from the proposed simulator were in line with previous studies.

An adaptive bandwidth borrowing-based Call Admission Control scheme for multi-class service wireless cellular networks

This work describes an adaptive Call Admission Control (CAC) scheme for multi-class service wireless cellular networks. The proposed scheme uses complete sharing approach of the available bandwidth among all traffic classes. The proposed adaptive CAC is achieved through call bandwidth borrowing and call preemption techniques based on the priorities of the traffic classes. The CAC scheme achieves the QoS in each class through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on Min-Max and Max-Min policies for fair resource deallocation and allocation. The simulation results of the proposed adaptive CAC scheme show the strength and effectiveness of our proposed scheme compared to other schemes.

EMGGR: an energy-efficient multipath grid-based geographic routing protocol for underwater wireless sensor networks

Routing in underwater wireless sensor networks (UWSN) is an important and a challenging activity due to the nature of acoustic channels and to the harsh environment. This paper extends our previous work [Al-Salti et al. in Proceedings of cyber-enabled distributed computing and knowledge discovery (CyberC), Shanghai, pp 331–336, 2014] that proposed a novel multipath grid-based geographical routing (MGGR) protocol for UWSNs. The extended work, EMGGR, viewed the network as logical 3D grids. Routing is performed in a grid-by-grid manner via gateways that use disjoint paths to relay data packets to the sink node. The algorithm consists of three main components: (1) a gateway election algorithm; responsible for electing gateways based on their locations and remaining energy level (2) a mechanism for updating neighboring gateways’ information; allowing sensor nodes to memorize gateways in local and neighboring cells, and (3) a packet forwarding mechanism; in charge of constructing disjoint paths from source cells to destination cells, forwarding packets to the destination and dealing with holes (i.e. cells with no gateways) in the network. The performance of EMGGR has been assessed using Aqua-Sim, which is an NS2 based simulator for UWSNs. Results show that EMGGR is an energy efficient protocol in all simulation setups used in the study. Moreover, EMGGR can also maintain good delivery ratio and end-to-end delay.

PARALLEL ROUTING IN MOBILE AD-HOC NETWORKS

This paper proposes and evaluates a new position-based Parallel Routing Protocol (PRP) for simultaneously routing multiple data packets over disjoint paths in a mobile ad-hoc network (MANET) for higher reliability and reduced communication delays. PRP views the geographical region where the MANET is located as a virtual 2-dimensional grid of cells. Cell-disjoint (parallel) paths between grid cells are constructed and used for building pre-computed routing tables. A single gateway node in each grid cell handles routing through that grid cell reducing routing overheads. Each node maintains updated information about its own location in the virtual grid using GPS. Nodes also keep track of the location of other nodes using a new proposed cell-based broadcasting algorithm. Nodes exchange energy level information with neighbors allowing energy-aware selection of the gateway nodes. Performance evaluation results have been derived showing the attractiveness of the proposed parallel routing protocol from different respects including low communication delays, high packet delivery ratios, high routing path stability, and low routing overheads.

GEGR: A grid-based enabled geographic routing in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) provide high promises to a wide spectrum of application areas. However, routing packets in WSNs is still facing many obstacles, due to the special characteristics of WSNs. In this work, we propose an energy-efficient and low cost geographic routing algorithm for dense WSNs, called Grid-based Enabled Geographic Routing (GEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region in which the sensor nodes are deployed. Packet forwarding is handled in each grid cell by an elected gateway node. The packet forwarding process depends on the relative location of the destination cell with respect to the source, and the geographic direction of forwarding. The proposed scheme limits the use of broadcasting in the WSN to the process of gateway election, and the process of constructing and maintaining the table of neighboring gateways in adjacent grid cells. Our simulation results show the effectiveness of our routing scheme and its ability to achieve network scalability compared to on-demand routing protocols.

A grid-based MANET routing protocol with simple cell-head election

One promising direction to enhance the performance of routing protocols in mobile ad-hoc networks is to use Global Positioning System GPS location information. Grid-based routing protocol is one type of protocols that use GPS. In this paper, we propose and evaluate a routing protocol called Simple Election Grid-based Routing Protocol SE-GRP which is based on the GRID routing protocol. The main difference between SE-GRP and GRID is that the more efficient cell-head election approach is used in SE-GRP as compared to the GRID cell-head election approach. The SE-GRP cell-head election method allows neighbour nodes to select cell-heads with highest node ids implicitly using a special table called Neighbours Table. Simulation results show that SE-GRP outperforms GRID in terms of average end-to-end delay, number of overhead packets and delivery ratio.

Multipath routing in a 3D torus network on chip

We propose an efficient multipath routing algorithm for routing multiple data packets in parallel over node-disjoint paths on a 3D torus Network-on-Chip. We show how to build node-disjoint paths between any two nodes of the 3D torus topology and how to use these paths to build routing tables. Analytical performance evaluation results for the proposed multipath routing algorithm are derived. The obtained results have shown that using the proposed multipath routing algorithm allows tolerating much higher traffic loads (between 4 times and 6 times higher), compared to single path routing. These results show the effectiveness of the proposed multipath routing algorithm in reducing communication delays and increasing throughput when transferring large amounts of data in a 3D Network-on-Chip based multi-core system.

Realistic offloading scheme for mobile cloud computing

Nowadays, smartphone devices have become very important in our daily life. We carry them everywhere and anytime. This strong dependency has encouraged mobile application developers to develop a wide variety of mobile applications. However, the limitations of smartphone hardware, such as limited processing capacity and limited battery life have become a barrier in front of apps developers. On the other hand, cloud computing is changing the style of delivering IT services. Mobile cloud computing uses the cloud to overcome the mobile device limitations. Many works have been conducted to extend mobile capabilities by offloading intensive application codes to the cloud. However, they did not consider realistic data that dynamically changing in user environment such as processors load, battery level, network bandwidth, etc. in offloading decision. Therefore, this paper aims to propose a new approach that uses realistic data from the user real environment to decide at runtime whether to offload code or not. Our experimental results show that our approach reduces the execution time and battery consumption compared to other approaches that do not take into consideration mobile device condition data.

TGRP: A New Hybrid Grid-based Routing Approach for Manets

Most existing grid-based routing protocols use reactive mechanisms to build routing paths. In this paper, we propose a new hybrid approach for grid-based routing in MANETs which uses a combination of reactive and proactive mechanisms. The proposed routing approach uses shortest-path trees to build the routing paths between source and destination nodes. We design a new protocol based on this approach called the Tree-based Grid Routing Protocol (TGRP). The main advantage of the new approach is the high routing path stability due to availability of readily constructed alternative paths. Our simulation results show that the stability of the TGRP paths results in a substantially higher performance compared to other protocols in terms of lower end-to-end delay, higher delivery ratio and reduced control overhead.