Network slicing (NS), a key enabler, plays a crucial role in implementing tactile Internet (TI). This TI promises scalable, customisable, isolated, and logical end-to-end networks (i.e., network slices) by offering dedicated and tailored networking solutions on demand to meet the customer’s need. Research in NS for TI is essential to realise haptic communications to achieve ultra-low latency, high throughput, and high reliability for real-time immersive and interactive environments in fifth-generation (5G) and beyond 5G (B5G). This article proposes a novel network slicing mechanism based on TI communication infrastructure for three different scenarios (TINetS3) leveraging software-defined networking (SDN) with Open vSwitch (OVS) to resolve the issue of provisioning and controlling the network slices on demand. This communication infrastructure is sliced under various traffic/application loads using pre-designed slice configurations. We develop algorithms for three scenarios, i.e., topology slicing, service slicing, and emergency slicing, to have a tailored slice for the physical infrastructure according to the network requirements. We validate the system performance by measuring the key performance indicators (KPIs), such as throughput and round-trip time (RTT), to optimise the network resources by network emulator. These KPIs show the expected experimental results aligned with the preset allocated spectrum for slices and RTT constraint values in various scenarios. The simulation results show the efficacy of our NS algorithms in designing tailored and customised slices as per the network-required KPIs. Finally, we validated our algorithms by comparing them with state-of-the-art algorithms.

Empowered by sufficient robotics and haptic hardware at the edges of a communication network system, tactile Internet (TI) is the upcoming transformation that will empower the control of Internet of Things in real time and facilitate a true paradigm shift in making a dream into a reality. However, one of the most crucial challenges in realizing TI is to achieve round-trip time (RTT) of 1 ms or less. This RTT includes transmission, queuing, processing (operator’s end), and acknowledgement times (controlled end). Another challenge is to achieve ultrahigh reliability for establishing haptic communications for TI. This article proposes a novel fog-based traffic flow framework employing software-defined networking (SDN) and fog computing (FC) to address these challenges. An efficient traffic flow algorithm is developed to effectively manage complex and critical traffic in the network to reduce extra processing and waiting times at each level of clouds. The SDN and FC approaches provide an effective solution to route the traffic efficiently in the system. Hence, the traffic flow paths from the master to slave sections are reduced, and consequently, RTT is also reduced. The performance of the proposed system is evaluated by an iFogSim simulator in terms of throughput, RTT, energy consumption, and reliability. The simulation results obtained show that the proposed system outperforms the existing edge, cloud, and cellular networks.

In distributed cognitive radio (CR) networks, rendezvous (RDV) is one of the most critical issues. Due to the dynamic radio environment, achieving RDV on a predetermined common control channel (CCC) is a challenging task. Channel hopping (CH) provides an effective method to guarantee RDV in cognitive radio ad-hoc networks (CRAHNs). Most of the existing CH schemes utilize the channel quantity as an input to the family of mathematical concepts such as prime number theory, Chinese remainder theory (CRT), quorum system and combinatorial block design to achieve RDV. However, RDV on a channel is rather influenced by channel quality or CR user's preference on which it wants to achieve RDV on available channels. Based on this philosophy, a channel rank based torus quorum CH RDV protocol (TQCH) is proposed which finds a commonly available channel between a pair of CR nodes. We formulate the channel ranking as a linear optimisation problem based on the channel availability under collision constraints. A detailed mathematical formulation is derived to estimate the degree of overlap in terms of expected quorum overlap size. Simulation results show that the proposed TQCH scheme outperforms than that of other CH schemes in terms of average time-to-rendezvous (ATTR) and the degree of overlap in asymmetric channel scenario.

Rendezvous in cognitive radio ad-hoc networks (CRAHNs) is a key step for a pair of unknown cognitive radio (CR) users to initiate communication. Channel hopping (CH) provides an effective method to guarantee rendezvous in CRAHNs. To design a CH scheme, assumption of symmetric channel information is widely used in the literature. This assumption may ease the CH design, but unable to capture the dynamic radio environment. To achieve the rendezvous in the shortest time, most of the existing CH sequences utilized the family of mathematical concepts such as prime number theory, Chinese remainder theory (CRT), quorum system and combinatorial block design and so on. However, rendezvous on a channel is rather influenced by the CR user preference on which it wants to achieve rendezvous. In this paper we address rendezvous problem with asymmetric channel information. This paper proposes an adaptive CH sequence based on local channel sensing information to achieve rendezvous in finite time and guarantees overlap on all available common channels. Results obtained show that variation in channel ranking has a significant influence on CH performance.

In this paper we evaluate the UDP performance of IPv6 in a peer-to-peer Gigabit Ethernet network using the latest four different MS Windows and Linux-based client and server operating systems (OS). The throughput and end-to-end delays are measured empirically to determine which OSs provide the best bandwidth performance over IPv6 networks. The impact of packet length on system performance is also reported. Results show that for IPv6 Linux network using Ubuntu 10.04 performs significantly better than Windows 7.

The dynamic topology of a mobile ad hoc network (MANET) poses a real challenge in the design of a MANET routing protocol. Over the last 10 years, a variety of routing protocols have been developed and their performance simulations are made by network researchers. Most of the previous research on MANET routing protocols have focused on simulation study by varying network parameters, such as network size (node density), pause times, or node mobility independently. This paper considers the problem from a different perspective, using a simulation model the combined effect of node density and packet length; node density and mobility on the performance of a typical 802.11 MANET is investigated. This is a common and realistic scenario in MANETs where nodes move around, join and leave the network at any time. Based on the QoS (end-to-end delay, throughput), routing load and packet retransmissions, this paper systematically analyzes the performance of four diverse MANET routing protocols with the different simulation model and configurations, and drew more complete conclusions.

Using indoor propagation measurements, the combined effect of received signal strength (RSS) and traffic type (i.e., voice and video) on the performance of a typical WLAN is investigated. In the investigation, both ad hoc and infrastructure network scenarios are used. Measurement results obtained show that RSS has a significant effect on the playback delays of voice and video traffic, especially under higher bit rates. In addition, we study the relationship between wireless channel state and the user-perceived quality of audio and video streaming applications. Finally, we evaluate (by simulation) the number of simultaneous voice and video clients that an IEEE 802.1 lg AP can support. Results show that the performance of a typical IEEE 802.1 lg AP significantly deteriorates for N > 15 clients. Our findings show the practicality of deploying indoor WLANs for multimedia applications.

One of the limitations of IEEE 802.11b DCF protocol is the low bandwidth utilization in the medium-to-high traffic load conditions, and consequently, it achieves low throughput and high mean packet delay. In this paper we propose an extension of the IEEE 802.11b DCF protocol called the buffer unit multiple access (BUMA) protocol that overcomes these shortcoming of the original IEEE 802.11 protocol. The proposed BUMA scheme achieves higher throughput (up to 35%) and lower mean packet delay (up to 87%) than the IEEE 802.11b DCF protocol at medium-to-high traffic load conditions. In this paper the BUMA scheme is described and simulation results are presented to verify the performance

Until recently, it has been difficult to motivate students to learn about wireless local area networks (WLANs) design because students find the subject dry and theoretical. A Web-based software tool (named WLAN-Designer) has been developed at the Auckland University of Technology (AUT) that gives students an interactive, hands-on experience in WLAN design. The WLAN-Designer is suitable for classroom use in introductory level courses in wireless networking. This paper describes the WLAN-Designer and its effectiveness in teaching and learning about WLAN design. The effectiveness of the WLAN-Designer has been evaluated both formally by students (student evaluation forms) and informally - through discussion within the teaching team. The paper concludes by discussing the strengths and weaknesses of the WLAN-Designer and that the WLAN-Designer has a positive impact on students' performance.

We are developing a series of interesting projects that give students a hands-on introduction to computer hardware concepts. Our projects are designed around the PIC16F84, a powerful 8-bit microcontroller chip that sells for less than $10. The projects are suitable for classroom use in introductory level courses about computer hardware. The effectiveness of these projects has been evaluated both formally by students (student evaluation forms) and informally - through discussion within the teaching team. The feedback from students indicates that the development and implementation of the projects were successful. This paper describes the details of the projects completed to date, their overall effectiveness and our plans for further projects.

We describe the development of a software tool (named LAN-Designer) and its effectiveness in teaching and learning a local area network (LAN) design. The LAN-Designer is developed in Authorware 6.x (from MacroMedia) under MS Windows. The software is suitable for classroom use for courses involving LAN design at an introductory level. We conclude by discussing the strengths and weaknesses of the software and its future development. The feedback from student and staff indicate that the development and the implementation were successful.

The p/sub i/-persistent medium access protocol is an attractive solution for high-speed fiber-optic unidirectional bits networks. Sarkar (1996) investigated the delay versus throughput characteristics and fairness performance of the p/sub i/-persistent protocol, inducting the 1-persistent protocol. The main advantage of 1-persistent protocol over the p/sub i/-persistent protocol is the reduced mean packet delay (network-wide and also for individual stations), but the potential drawback of this protocol is the lack of fairness. In contrast, the p/sub i/-persistent protocol can provide good fairness in the sense that mean delays become almost station position independent, but the main drawback of this protocol is the inevitable increase in packet delay. We propose a new scheme, called p/sub i/-persistent/HH (p/sub i/-persistent protocol with hitch-hiking mechanism for slot pre-use) that can offer the combining advantages of 1-persistent and p/sub i/-persistent protocols (i.e. low mean delay and fairness). The low mean delay as well as fairness is achieved by introducing a special mechanism of slot pre-use, called hitch-hiking (HH). In this paper the p/sub i/-persistent/HH scheme is described and simulation results are presented to verify the projected performance.