Search

This paper proposes a MAC protocol for ad hoc networks using In-band Full-duplex (IBFD) wireless communications, which are named as AdHoc-FDMAC. To utilize IBFD communications in ad hoc networks, this protocol modifies a number of control frames in the IEEE 802.11 Distributed Coordination Function (DCF) MAC standard. Here, the detailed time sequences for all types of IBFD communications are shown for the data transmission and routing. In this paper, the probability and throughput equations for IBFD communications in different situations have been derived. The performance of the proposed AdHoc-FDMAC has been analysed in terms of probability, throughput, and routing time. The Maximum throughput of AdHoc-FDMAC has been found to be 48.34 Mbps, and it is compared with a recently published ad hoc MAC as well as with the conventional HD MAC. The AdHoc-FDMAC outperforms the recently published ad hoc MAC and conventional HD MAC by 16.80% and 66.50% throughput gain, respectively. AdHoc-FDMAC incorporates the existing Ad hoc On-demand Distance Vector (AODV) routing protocol, but this AODV routing is utilized here using IBFD communications. This paper also compares the routing time of the IBFD-based AODV with the conventional AODV. The result shows that the IBFD-based AODV requires 33.33% less routing time than that of the conventional AODV for 3-hop distance between the transmitter and receiver. This paper suggests that the AdHoc-FDMAC protocol provides much more throughput in ad hoc networks by utilizing IBFD communications. [ABSTRACT FROM AUTHOR]

Summary: A well‐optimized and well‐performed communication network protocol is necessary to build successful underwater acoustic sensor networks (UWASNs). But for wired and wireless communication, medium access control (MAC) has a great effect on network performance and optimization. But unlike land‐based MAC protocols, underwater MAC protocols come with various challenges and issues like high propagation delay, limited bandwidth for communication signals, large attenuation in network signals, and the high noise level in signals. It is very challenging to build a well‐optimized underwater MAC protocol. Also, in UWASN, sensor nodes are generally divided into sub‐network parts to reduce the propagation delay of data signals. But this creates the problem of non‐uniform traffic load in sensor nodes. So, considering these issues, dynamic hold time MAC (DHT‐MAC) protocol is proposed here. In this protocol, depending on the distance from the central node, sensor nodes are divided into two sub‐network zones (parent node and child node). Depending on the traffic load and propagation delay, the child nodes can change their respective parent nodes dynamically. Advantage of the proposed method is that, if any of the parent nodes stops working, the child node will connect to the nearest parent node. When collecting the data signals, it has been observed that child nodes have a light traffic load compared to parent nodes. So dynamic cooperative transmission MAC (DCT‐MAC) protocol which is a contention‐based MAC protocol has been used in child nodes and as parent nodes have high traffic load, reservation‐based MAC protocol has been used. [ABSTRACT FROM AUTHOR]

Most existing network communication systems, such as the Internet, are built around the TCP/IP protocol stack. However, TCP/IP cannot effectively support the upcoming network communication systems with more wireless communication links and higher requirements in terms of throughput, latency, and reliability. In this article, we introduce a general network communication protocol design based on batched network coding (BNC), which includes the existing framework as a special case and whose design can be guided by channel coding theory. BNC-based protocols can have significant throughput gain for single-hop or multihop wireless communications and provide better trade-off among throughput, latency and reliability. [ABSTRACT FROM AUTHOR]

Machine-to-machine (M2M) communication devices communicate and exchange information with each other in an independent manner to perform necessary tasks. The machine communicates with another machine over a wireless network. Wireless communication opens up the environment to huge vulnerabilities, making it very easy for hackers to gain access to sensitive information and carry out malicious actions. This paper proposes an M2M communication system through the internet in Tele-Robotics and provides network performance security. Tele-robotic systems are designed for surgery, treatment and diagnostics to be conducted across short or long distances while utilizing wireless communication networks. The systems also provide a low delay and secure communication system for the tele-robotics community and data security. The system can perform tasks autonomously and intelligently, minimizing the burden on medical staff and improving the quality and system performance of patient care. In the medical field, surgeons and patients are located at different places and connected through public networks. So the design of a medical sensor node network with LEACH protocol for secure and reliable communication ensures through the attack and without attack performance. Finally, the simulation results show low delay and reliable secure network transmission. [ABSTRACT FROM AUTHOR]

Wireless sensor network establishes a network with randomly distributed sensor devices that are connected together through some types of wireless communication networks. Such sensors are responsible for recognizing the physical or environmental conditions for multi-purpose usability and ease of deployment. This network has some limitations such as prone to network failure, and limited power and capacity of sensor devices. Several routing strategies have been originated by the researchers to improve many applications for such a network. Among the routing techniques, the clustering algorithm can increase the life span and efficiency of the network. The main feature of a cluster-based network is to minimize energy dissipation and delay of the system. This paper investigates the performance of two cluster-based routing protocols namely homogeneous Energy-Aware Multi-Hop Multi-Path Hierarchical (EAMMH), and Low-Energy Adaptive Clustering Hierarchy (LEACH) routing strategies for homogeneous nodes, sink nodes, dead nodes and other common scenarios. In this research paper, we observe that LEACH works better for small networks where there is a small number of nodes, while EAMMH works better for larger networks consisting of a large number of nodes. [ABSTRACT FROM AUTHOR]

In this paper, we consider a three-hop relay system based on interference cancellation technique in Underlay cognitive radio (CR) network. Although underlay CR has been shown as a promising technique to better utilize the source of primary users (PUs), its secondary performance will be severely degraded. On one hand, by adapting the Underlay spectrum sharing pattern, secondary users (SUs) would observe the strict power constraints and be interfered by primary users. On the other hand, limited transmit power results in limited transmission range, which greatly degrade the secondary transmission capacity. To solve the problems above, we propose an interference cancellation protocol for multi-hop wireless communication networks in underlay CR, which could develop the long-distance transmission performance and improve the transmission efficiency significantly. As simulation results shows, proposed scheme significantly reduce the secondary outage probability and increase the secondary diversity than the traditional cases. [ABSTRACT FROM AUTHOR]

Malfunctions of a mobile ad hoc network (MANET) protocol caused by a conceptual mistake in the protocol design, rather than unreliable communication, can often be detected only by considering communication among the nodes in the network to be reliable. In Restricted Broadcast Process Theory, which was developed for the specification and verification of MANET protocols, the communication operator is lossy. Replacing unreliable with reliable communication invalidates existing results for this process theory. We examine the effects of this adaptation on the semantics of the framework with regard to the non-blocking property of communication in MANETs, the notion of behavioral equivalence relation and its axiomatization. To utilize our complete axiomatization for analyzing the correctness of protocols at the syntactic level, we introduce a precongruence relation which abstracts away from a sequence of multi-hop communications, leading to an application-level action preconditioned by a multi-hop constraint over the topology. We illustrate the applicability of our framework through a simple routing protocol. To prove its correctness, we introduce a novel proof process, based on our precongruence relation. [ABSTRACT FROM AUTHOR]

Global Mobility Networks(GLOMONETs) in wireless communication permits the global roaming services that enable a user to leverage the mobile services in any foreign country. Technological growth in wireless communication is also accompanied by new security threats and challenges. A threat-proof authentication protocol in wireless communication may overcome the security flaws by allowing only legitimate users to access a particular service. Recently, Lee et al. found Mun et al. scheme vulnerable to different attacks and proposed an advanced secure scheme to overcome the security flaws. However, this article points out that Lee et al. scheme lacks user anonymity, inefficient user authentication, vulnerable to replay and DoS attacks and Lack of local password verification. Furthermore, this article presents a more robust anonymous authentication scheme to handle the threats and challenges found in Lee et al.’s protocol. The proposed protocol is formally verified with an automated tool(ProVerif). The proposed protocol has superior efficiency in comparison to the existing protocols. [ABSTRACT FROM AUTHOR]

Driven by the increasing demand on marine exploration, UWANs are confronted with the rigorous challenge of improving network throughput. To deal with this challenge, this article proposes to apply the IBFD technique to UWANs. The IBFD technique can potentially double link capacity by simultaneously transmitting and receiving on the same frequency band, which has been recently demonstrated to be feasible for wireless communications. In this article, novel MAC protocols are specifically proposed for the acoustic IBFD network to overcome the inherent issues in underwater acoustic communications, such as long packet delay, large node collision probability, and high power consumption. Numerical results verify that our proposals can effectively mitigate these effects and improve the overall performance of the UWANs. [ABSTRACT FROM AUTHOR]

Current networking technologies are not perfectly equipped to support Quality of Service (QoS), which is vital for real-time multimedia applications in Wireless Community Mesh Networks (WCNs). Therefore, there is a need to devise innovative routing algorithms to support QoS on top of existing standards. Thus, this paper presents a cross layer relay node selection model for routing protocols in order to offer optimal routes to real-time applications. To the best of our knowledge, our two proposed routing metrics, Packet Priority-Oriented routing metric (PPO) and Packet Priority-oriented QoS routing metric (PP-QoS) , are the first to provide differentiated priorities and service levels to applications with different needs. PPO considers the application priority. Moreover, PP-QoS also considers the channel busy level to improve the performance of path selection. The simulation confirms the superiority of the proposed model against a number of existing counterparts. [ABSTRACT FROM AUTHOR]

We have designed the Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation (HIMALIS) network architecture to natively support sessions transfer from one link to another independently of the network and transport layer protocols. However, lack of a prompt path failure detection mechanism in HIMALIS cannot well utilize multiple links to protect against path failures. In this paper, we propose a complete path recovery mechanism that consists of path failure detection, lively path exploration, and path recovery processes. In particular, the failure detection mechanism is based on monitoring of data sending and receiving instances in end hosts by employing two timers, probe timer and keepalive timer. In case of path failure caused by gateway's upstream link down, the gateway provides the link failure notification to the host for expediting the detection process. We also present an overview of implementation of the mechanism. The implemented functions are verified by using both TCP and UDP applications and evaluated in a 21-node-scale network-emulation environment. The results show that the proposed mechanism provides fast failure detection, about 7 s which is much faster than the failure detection carried out based on TCP retransmission timeout which may take 5 min in the worst case, under both site- and host-multihoming configurations. The results also show that the proposed mechanism takes only about 200 ms to detect gateway's upstream link down. [ABSTRACT FROM AUTHOR]

Liu, Y.; Xu, Y.; Zhang, K., and Feng, Y., 2019. Hardware design of marine buoy data communication terminal based on the 1st generation Beidou navigation positioning system. In: Guido-Aldana, P.A. and Mulahasan, S. (eds.), Advances in Water Resources and Exploration. Journal of Coastal Research, Special Issue No. 93, pp. 639–645. Coconut Creek (Florida), ISSN 0749-0208. Aiming at the actual situation of marine buoy data monitoring and the problems of poor anti-interference performance, low fault tolerance coefficient and high energy consumption in current communication system, the hardware design of marine buoy data communication terminal based on the 1st generation Beidou navigation positioning system is proposed. Based on the marine buoy system, the overall structure of communication terminal is designed. The main components of the hardware are Beidou communication module and wireless network communication module, and the auxiliary parts are antenna and power supply module. The long-distance part uses the inherent data transmission mode of Beidou navigation system to communicate, while the short-range part uses the radio network communication protocol to complete the data transmission. There are two UART interfaces in the hardware, one is connected with the auxiliary cabin, which is responsible for receiving the related data of the auxiliary cabin, including azimuth, attitude and pressure sensing, and the other UART interface is connected with the Beidou communication module, which is responsible for receiving positioning and navigation data and transmitting remote data. The experimental results show that the design has high signal-to-noise ratio, strong fault-tolerant performance, high positioning accuracy and communication success rate, low energy consumption and perfect performance. [ABSTRACT FROM AUTHOR]

With rapid development and massive deployment of handheld mobile devices, people in modern societies heavily enjoy and depend on the convenience and efficiency of instant information access and data processing through wireless Internet connection capability of their own mobile devices. In consequence, how to securely communicate with remote servers and access inquired data through insecure wireless channel, and to keep low energy consumption on handheld mobile devices, while performing these security computing operations, has become a major challenge for designers of secure authentication protocol. This study proposes a provably secure and efficient ID-based authentication protocol using bilinear pairings for mobile user environment. Formal security analyses show the proposed protocol is secure against well-known attacks under random oracle model. Comparisons on performance efficiency and security among existing pairings based protocols and ours are conducted to evaluate our protocol. The results indicate that our protocol has the less computation cost at the mobile user side and supports more security properties in comparison with others. [ABSTRACT FROM AUTHOR]

Vehicular Adhoc Network (VANET) is the emerging technology which enables the vehicles to communicate using wireless technologies. VANET is developed for providing the safety purpose and driving comfort to the people. VANET use the vehicle as moving nodes as in MANET (Mobile Adhoc Network). The communication among vehicles is done by using the efficient routing protocols which direct the routes. This communication can be direct within the vehicles or it can be between vehicles and road side units (RSUs). In this paper we exploit three routing protocols of VANET which are GPSR, DSDV and BMFR by comparing their three parameters throughput, end to end delay and number of packets dropped during communication. As we study out of this three protocols BMFR and GPSR are position based routing protocol and DSDV is topology based routing. In this paper we also simulate these protocols using NS2 simulator and using the standard protocol i.e. IEEE 802.11 p in Vehicular Adhoc Network. [ABSTRACT FROM AUTHOR]

Smart homes and environments will consist of a large number of low power wireless devices such as sensors and actuators. Recently IETF standardized a network protocol called RPL that is designed to run on these nodes. In this article, we study the performance of RPL on a variety of scenarios that these nodes will encounter when they are deployed in practice. We deploy a network of 23 sensor nodes in a computer lab to monitor energy used by each computer across the applications and users. We subject the network to four different levels of interference that are representative of the types and levels of interference that these networks might encounter in deployment. Our study finds that RPL?s reliability degrades even with an access point in overlapping channel under normal network traffic. With high interference, the packet delivery reliability goes down to 10 percent. The scenario that resulted in this performance is not unimaginable in smart home or environment. This performance degradation is partly due to lack of coordination across the layers of the protocol stack: RPL is unaware of the changes in the wireless environment underneath and proceeds as usual. As other research has shown, coordination across the network stack is essential for network protocols to work reliably in the presence of interference. This will require a more coordinated approach to standards across the bodies. [ABSTRACT FROM PUBLISHER]

Medium access control overhead is the primary reason for low throughput in wireless networks. Performing blind contentions, contentions without any information of other contenders, and exchanging control message are time-consuming control operations. In this study, we propose a new MAC protocol called distributed sequential access MAC (DSA-MAC) which provides the transmission order without any explicit control operations. It may induce very light control overhead; therefore, compared to existing wireless MAC protocols, DSA-MAC can remarkably enhance network throughput. [ABSTRACT FROM AUTHOR]

In this paper, a proposed new wireless protocol so-called wireless controller area network is introduced. WCAN is an adaptation of its wired cousin, controller area network protocol. The proposed WCAN uses token frame scheme in providing channel access to nodes in the system. This token frame method follows the example used in wireless token ring protocol which is a wireless network protocol that reduces the number of retransmissions as a result of collisions. This scheme based on CAN protocol allows nodes to share a common broadcast channel by taking turns in transmitting upon receiving the token frame that circulates around the network for a specified amount of time. The token frame allows nodes to access the network one at a time, giving 'fair' chance to all nodes instead of competing against one another. This method provides high throughput in a bounded latency environment. The proposed WCAN protocol has been developed and simulated by means of QualNet simulator. The performances of this proposed protocol are evaluated from the perspective of throughput, end-to-end delay and packet delivery ratio, and are compared against the IEEE 802.11 protocol. Simulation results show that the proposed WCAN outperforms IEEE 802.11 based protocol by 62.5 % in terms of throughput with increasing network size. Also, it shows an improvement of 6 % compared to IEEE 802.11 standard at a higher data interval rate. [ABSTRACT FROM AUTHOR]

Opportunistic Spectrum Access (OSA) in distributed cognitive radio networks (CRNs) has been well studied in the literature from a theoretical perspective. However, such theoretically-optimized distributed OSA approaches are challenged by several practical implementation issues. In this paper, we design a custom cross-layer framework that enables the: (i) clean-slate implementation of a wide variety of OSA mechanisms; (ii) experimental evaluation of the individual practical OSA components of the Rate-Adaptive Probabilistic (RAP) framework; and (iii) detailed comparison of the performance of such a practical OSA approach against theoretical OSA approaches developed for fully-capable CRNs. Our evaluation reveals the multi-fold goodput improvement and remarkable fairness characteristics of the practical RAP OSA approach compared to the OSA approaches that overlook the OSA and CR practical limitations. However, the superior performance of practical OSA comes at the expense of more outages to the primary licensed networks but within the permissible bounds. Another key finding is that the wide family of existing theoretically-optimized OSA protocols can benefit from the gains available to the individual components of the practical RAP approach, namely, the random spectrum sensing and the probabilistic non-greedy access. [ABSTRACT FROM AUTHOR]

In this paper, we describe a framework for designing a discrete-bandwidth nonblocking network. The theoretical foundation of the framework combines theories from both networking and switching. While the conventional Clos theory must assume a particular topology, the new theory allows us to design a nonblocking network with an arbitrary topology. Thus it can be considered as a generalization of the Clos theory. In addition to the design of WDM or SONET networks, applications such as grid computing and supercomputing can also benefit from the results developed in the paper. [ABSTRACT FROM AUTHOR]

We consider an erasure multi-way relay channel (EMWRC) in which several users share their data through a relay over erasure links. Assuming no feedback channel between the users and the relay, we first identify the challenges for designing a data sharing scheme over an EMWRC. Then, to overcome these challenges, we propose practical low-latency and low-complexity data sharing schemes based on fountain coding. Later, we introduce the notion of end-to-end erasure rate (EEER) and analytically derive it for the proposed schemes. EEER is then used to calculate the achievable rate and transmission overhead of the proposed schemes. Using EEER and computer simulations, the achievable rates and transmission overhead of our proposed schemes are compared with the ones of one-way relaying. This comparison implies that when the number of users and the channel erasure rates are not large, our proposed schemes outperform one-way relaying. We also find an upper bound on the achievable rates of EMWRC and observe that depending on the number of users and channel erasure rates, our proposed solutions can perform very close to this bound. [ABSTRACT FROM AUTHOR]

The groundbreaking transformations triggered by the Industry 4.0 paradigm have dramatically reshaped the requirements for control and communication systems within the factory systems of the future. The aforementioned technological revolution strongly affects industrial smart and distributed measurement systems as well, pointing to ever more integrated and intelligent equipment devoted to derive accurate measurements. Moreover, as factory automation uses ever wider and complex smart distributed measurement systems, the well-known Internet of Things (IoT) paradigm finds its viability also in the industrial context, namely Industrial IoT (IIoT). In this context, communication networks and protocols play a key role, directly impacting on the measurement accuracy, causality, reliability and safety. The requirements coming both from Industry 4.0 and the IIoT, such as the coexistence of time-sensitive and best effort traffic, the need for enhanced horizontal and vertical integration, and interoperability between Information Technology (IT) and Operational Technology (OT), fostered the development of enhanced communication subsystems. Indeed, established technologies, such as Ethernet and Wi-Fi, widespread in the consumer and office fields, are intrinsically non-deterministic and unable to support critical traffic. In the last years, the IEEE 802.1 Working Group defined an extensive set of standards, comprehensively known as Time Sensitive Networking (TSN), aiming at reshaping the Ethernet standard to support for time-, mission- and safety-critical traffic. In this paper, a comprehensive overview of the TSN Working Group standardization activity is provided, while contextualizing TSN within the complex existing industrial technological panorama, particularly focusing on industrial distributed measurement systems. In particular, this paper has to be considered a technical review of the most important features of TSN, while underlining its applicability to the measurement field. Furthermore, the adoption of TSN within the Wi-Fi technology is addressed in the last part of the survey, since wireless communication represents an appealing opportunity in the industrial measurement context. In this respect, a test case is presented, to point out the need for wirelessly connected sensors networks. In particular, by reviewing some literature contributions it has been possible to show how wireless technologies offer the flexibility necessary to support advanced mobile IIoT applications. [ABSTRACT FROM AUTHOR]

Evaluating the performance of WCDMA wireless networks is important because it allows determining the types of applications that can be supported on such networks. BER of an average multi-hop route directly affects the ability of wireless network to support applications requiring a specific BER, for a given node transmission power and node spatial density. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets. In this work, an attempt has been made to compare the performance of two prominent on demand reactive routing protocols and one proactive routing protocol for WCDMA scheme & these protocols are DSR, DSDV & AODV protocols. DSR and AODV is a reactive gateway discovery algorithm whereas DSDV comes under proactive category. A WCDMA scheme connects by gateway only when it is needed. our simulation results for all the three protocols based on metrics such as packet delivery rate, throughput, routing overhead and average end to end delay by using NS-2 simulator. [ABSTRACT FROM AUTHOR]

In this paper we raise and discuss a problem from the analysis done in Moen et al. (ACM SIGMOBILE Comput Commun Rev 8(2):76-83, ) about some weaknesses in the key scheduling in Wi-Fi protected access (WPA). [ABSTRACT FROM AUTHOR]

We propose and analyze a cross-layer integrated mobility and service management scheme called DMAPwSR in Mobile IPv6 environments with the goal to minimize the overall mobility and service management cost for serving mobile users with diverse mobility and service characteristics. The basic idea of DMAPwSR is that each mobile node (MN) can utilize its cross-layer knowledge to choose smart routers to be its dynamic mobility anchor points (DMAPs) to balance the cost associated with mobility services versus packet delivery services. These smart routers are just access routers for MIPv6 systems except that they are capable of processing binding messages from the MN and storing the current location of the MN in the routing table for forwarding service packets destined to the MN. The MN's DMAP changes dynamically as the MN roams across the MIPv6 network. Furthermore the DMAP service area also changes dynamically reflecting the MN's mobility and service behaviors dynamically. Unlike previous mobility management protocols such as HMIPv6 that focus only on mobility management, DMAPwSR considers integrated mobility and service management. We develop an analytical model based on stochastic Petri nets to analyze DMAPwSR and compare its performance against MIPv6 and HMIPv6. We validate analytical solutions obtained through extensive simulation including sensitivity analysis of simulation results with respect to the network coverage model, the MN's residence time distribution and the DMAP service area definition. [ABSTRACT FROM AUTHOR]

The heterogeneous mobile terminals coexist in the next generation wireless networks. The most common routing schemes for mobile ad hoc networks are designed for homogeneous wireless networks. The heterogeneous wireless network routing protocols are needed urgently in many important applications. This paper im- proves the routing scheme utilizing different capability of terminals and the Hybrid Grid Routing Protocol (HGRP) is proposed. The network is organized in the grid form, that is, the network deployment area is divided into square cells according to the location. Each cell contains one backbone node and several ordinary nodes. This proposed protocol consists of four parts: grid construction, local routing, global routing, and routing correction. Analysis and simulation results indicate that the proposed protocol has the advantages of lower routing cost, lower energy consumption, smaller delay and higher throughput, compared to AODV and ZRP. [ABSTRACT FROM AUTHOR]

The use of anonymous channel tickets was proposed for authentication in wireless environments to provide user anonymity and to probably reduce the overhead of re-authentications. Recently, Yang et al. proposed a secure and efficient authentication protocol for anonymous channel in wireless systems without employing asymmetric cryptosystems. In this paper, we will show that Yang et al.'s scheme is vulnerable to guessing attacks performed by malicious visited networks, which can easily obtain the secret keys of the users. We propose a new practical authentication scheme not only reserving the merits of Yang et al.'s scheme, but also extending some additional merits including: no verification table in the home network, free of time synchronization between mobile stations and visited networks, and without obsolete anonymous tickets left in visited networks. The proposed scheme is developed based on a secure one-way hash function and simple operations, a feature which is extremely fit for mobile devices. We provide the soundness of the authentication protocol by using VO logic. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: Localization protocol is important for estimating node positions in a wireless multi-hop network. Routing protocol is also important for controlling paths. In previous research, localization and routing protocols have been discussed and evaluated separately. In this paper, we propose an integrated protocol for optimized link state routing (OLSR) and OLSR based localization (ROULA). Our protocol enables simultaneous localization and routing. ROULA’s localization is performed using OLSR overhead such as hello packets and routing tables. The routing overheads and the processing procedures can be efficiently integrated. We demonstrate that the integrated protocol for ROULA and OLSR enables simultaneous localization and routing. [Copyright &y& Elsevier]