Multi-hop Wireless Networks Research Articles

Stabilization of Non-Linear Networked Control Systems Closed Over a Lossy WirelessHART Network

This letter studies the stabilization of non-linear networked control systems (NCSs) where the information between plant and controller is sent over a lossy wireless multi-hop network under a carrier-sense multiple access with collision avoidance (CSMA-CA) scheme. We present a hybrid model for the overall NCS that captures time-varying transmission instants, both inter-and at-transmission behavior, packet dropouts, field device dynamics, and CSMA-CA scheduling. We then use this model to provide sufficient conditions in terms of the intensity of transmission that ensure closed-loop $ \mathcal {L}_{p}$ stability-in-expectation. In doing so, we exploit the mathematical structure of our NCS model to improve previous results in the literature.

Bandwidth-Based Real-Time Streaming in Information-Centric Hybrid Multihop Wireless Networks

The “data-oriented” property of information-centric networking (ICN) makes that any container with the same content can respond the request. However, different providers of content may provide different quality of service (QoS) for the same request. In this letter, we propose a bandwidth-based real-time streaming (BRTS) for information-centric hybrid multihop wireless networks. A request for a real-time streaming content is admitted according to the network bandwidth condition, and the request packet is forwarded to the optimal content provider based on a widest-shortest path principle. Simulation results demonstrate the effectiveness and efficiency of the proposed mechanism.

Performance Evaluation and Comparison of GRP and OLSR Routing Protocols for Video Streaming Over Mobile Ad Hoc Networks Using OPNET 14.5

Due to the increased use of mobile devices with the high demand for applications such as video application, most companies have tended to pay attention to Mobile Ad hoc Networks. This type of network is characterized by multi-hop wireless networks where data packets are sent in a "store and forward" manner from the source to an arbitrary destination via intermediate nodes. The mobile nodes are connected by multi-routes routing as the nodes in this network not only serve as hosts but also as routers where data is routed to and from other nodes in the network and therefore the mobile node not only sends its data packets but also sends data packets of other mobile nodes. The network architecture changes dynamically, mainly because of Mobility of nodes, so we need routing protocols to establish the connection. Routing protocols are categorized into proactive routing protocols, reactive routing protocols and hybrid routing protocols. So in this research, we has been studied Geographical Routing Protocol (GRP ), Optimized Link State Routing Protocol (OLSR) routing protocols which is one of proactive routing protocols and hybrid routing protocols respectively on the basis of Throughput, Delay and Load..etc and evaluated the performance in a large mobile ad hoc network and in a small mobile ad hoc network as well as for different video resolutions, the OPNET 14.5 network simulator was used to obtain research results. It was found that the GRP protocol performs better for a small number of nodes whether the video resolution is low or high while its performance decreases when the number of nodes increases in the network but the OLSR protocol improves when the number of nodes is increased.

Local P2P group (LPG) communication in structured mobile P2P networks

With the onset of the digital era and the availability of the internet, the need for digital data in a huge manner can be fulfilled by peer-to-peer (P2P) network instead of a traditional client server-based solution. Generally, mobile communication is based on cellular networks or multi-hop wireless networks. Cellular networks have adequate fixed infrastructure whereas multi-hop wireless networks have limited infrastructure and hence there are many limitations. The P2P systems are mainly designed for wired networks and the routing is based on IP infrastructure. Chord based protocols are widely deployed in the structured P2P networks but it can not perform well when implemented for mobile P2P networks due to the mobility of the users. Mobility pattern of mobile users plays an important role in locating users and delivering data packets seamlessly. Today, many of the mobile users follow a fixed mobility pattern in urban cities and mobility pattern of the mobile users can be utilized to reduce table update cost and increase Lookup Success Rate (LSR). We have proposed Local P2P Group (LPG) based communication scheme for structured mobile P2P networks. We are focussed on the mobility pattern of the mobile users in urban cities. We have analytically evaluated the proposed scheme using fluid-flow and RWP (Random Waypoint) mobility models and found that the proposed scheme performs better than the existing schemes like MR-Chord and MobiStore. Our proposed scheme has up to 40% higher Lookup Success Rate and 81% less table update cost than existing schemes, MR-Chord and MobiStore.

Joint Traffic Routing and Virtualized Security Function Activation in Wireless Multihop Networks

Decentralized security function deployment (activation) is an important solution to achieve reliable and secure operations of wireless networks. In this paper, we consider the joint problem of security function activation and traffic routing in a wireless multihop network with the aim of minimizing total energy consumption of all nodes in the network while meeting the security requirements of the users. Firstly, we analyze the tradeoff of energy consumption between preventing security damages with protection functions and remedying it with recovery functions. The analysis takes the uncertainty of attacks and network capacity availability into account. Secondly, if the protection function is to be activated, the activation has to be performed along the route of traffic flows, which means that the traffic routing should also be jointly optimized. Therefore, we formulate this problem as a stochastic optimization model. To obtain the optimal solution, we apply a distributed algorithm, i.e., accelerated distributed augmented Lagrangian algorithm which is ensured to converge. Furthermore, we analytically demonstrate that the solution obtained by the accelerated distributed augmented Lagrangian algorithm is optimal to our stochastic optimization model. Based on the setting from real experiments, the performance evaluation reveals that the optimal solution depends largely on the energy budget and energy consumption of the nodes for transferring traffic and running security functions.

Optimal Task Allocation Algorithms for Energy Constrained Multihop Wireless Networks

In recent years, multihop wireless networks have been playing a key role in many Internet of Things applications. Due to the limited resources of wireless nodes, extending the network lifetime is one of the most crucial issues, which needs to be concerned. This paper aims to maximize the network lifetime by appropriately distributing the tasks of the applications for each node in the network. First, a centralized optimal task allocation algorithm for multihop wireless networks (COTAM) is proposed by modeling the problem of maximizing the network lifetime as a linear programming (LP) problem. As the centralized algorithm requires knowing all the network parameters in advance, COTAM is mostly restricted to the off-line optimization in known environments. To extend the usability of the approach, this paper further proposes a distributed optimal task allocation algorithm (DOTAM) based on Dantzig–Wolf decomposition. DOTAM divides the centralized large-sized LP problem into small-sized subproblems, which are independently executed by each node. The proposed COTAM and DOTAM are tested by applying both the artificially generated applications and a realistic application. The extensive results demonstrate that DOTAM achieves the same performance as COTAM. Comparing with existing methods, they provide significant improvements on extending the network lifetime.

Shortest‐path‐based back‐pressure routing with single‐FIFO queueing in ad hoc networks'

Owing to the limited network resources in ad hoc networks, improving network throughput is the key to solve network congestion and increase network transmission efficiency. Back-pressure routeing, as an optimal routeing strategy for throughput, has recently received substantial attention for joint routeing and scheduling over multi-hop wireless networks. However, the inefficient routeing decision and complex queueing management of back-pressure routeing make it unsuitable for practical applications. This study proposes an improved back-pressure routeing algorithm with one first-input-first-output (FIFO) queueing structure using the shortest-path decision. By making use of the shortest-path knowledge, the feasible routes quickly converge to the shortest path when the network is lightly loaded. On the other hand, when the network load is heavy, the proposed algorithm remains optimal for exploring all the feasible paths between each source and destination. The back-pressure routeing design based on a single-FIFO queue architecture greatly simplifies the complexity of packet queueing management. The authors' results indicate that the proposed routeing algorithm achieves lower end-to-end delay than that of some other back-pressure algorithms without reducing the network throughput performance.

Video Transmission In Wireless Multihop Networks

Multi hop wireless networks are being deployed in many video streaming applications because they have several potential features for next generation wireless communications. Though optimal encoding techniques offers significant quality retention in video transmission still it is insufficient to overcome the challenges ahead over wireless network transmission. In order to support wide range video communications in an efficient way certain Quality of service has to be retained in multi hop wireless network. To address this issue, this paper investigates several encoding and routing protocols video delivery over multi hop wireless networks. Specifically, we first investigate several encoding framework for videos and wireless data transmission over WMNs through individual paths; we then investigate the challenges ahead to formulate resistant routing model for least possible video quality dictions which incorporate channel status as well as the encoder properties over video characteristics. In this framework, routing techniques which can maximally used to achieve good video traffic with improved system performance. However, video streaming also have very stringent delay requirements, which makes it difficult to find optimal routes with the least possible distortions. To address this problem, we investigate several enhanced version of packet scheduling techniques for video communications over multi path multi hob multi user wireless network environment.

Decentralized Energy-Aware Co-Planning of Motion and Communication Strategies for Networked Mobile Robots

In this article, a decentralized planning scheme is proposed to determine simultaneously communication and motion strategies for a team of mobile robots. These robots accomplish a collection of target visiting tasks in a complex environment with optimal energy consumption and guaranteed end-to-end connectivity. Information generated during the team deployment is transmitted to an operation center via a multihop wireless network whose channels are modeled by stochastic variables. For each announced task, mobile robots adopt different roles depending on the task’s nature and the team’s current configuration; then, each robot determines its communication and motion policies by solving a convex optimization problem. Avoiding inter-robot collisions and obstacles is also taken into account. The suggested approach leads to the efficient use of available robots and their energy resources compared to the rival methods in the literature. Effectiveness of the proposed algorithm is illustrated by computer simulations.

Iterative multipacket detection with FDE based MAC protocol in vehicular ad hoc networks

Wireless access in vehicular environments (WAVE), is especially designed to support vehicular ad hoc networks (VANETs) requirements, where rapidly changing channel conditions introduces unsynchronized transmissions. In such networks, instead of dealing with interferences in medium access control (MAC) layer or physical layer alone, both layers should be considered to cooperate and complement each other. In this paper, multipacket detection (MPD) technique with frequency domain equalization (FDE) is proposed for VANETs, with cyclically shifted different interleavers for different nodes, to remove interference and reducing the information exchange between nodes. These promising multi-hop wireless networks are used in situations, where temporary network connectivity is needed. Therefore, to improve the communication between vehicles (V2V) and from vehicles to roadside infrastructure (V2I), MPD-FDE with interference cancellation (IC) schemes can be used iteratively to successfully decode and receive even colliding packets. For designing such a protocol, different key aspects are discussed with an emphasis on iterative MPD-FDE. Numerical results with different network nodes, show the MPD-FDE performances for coded and uncoded transmissions with different IC schemes, where successive IC (SIC) is much better than parallel IC (PIC) schemes. It is also shown that the proposed protocol provide reliable detection and excellent throughput improvements, with much less resource consumption compared to multiple random interleavers.

Revisiting the Current State-of-the-art Multipath Routing in Ad Hoc Networks

Ad Hoc network is one of the popular wireless multi-hop networks. Nodes or Users in Ad Hoc network can move randomly and freely to maintain communication without the control of the fixed infrastructure. Due to the limited transmission power and wireless coverage of the terminal, if two terminals that are beyond their respective transmission radius need communicate, they must use other intermediate or relay nodes for packet forwarding, so that a wireless Ad Hoc network is formed among these nodes. In this paper, the current state-of-the-art multipath routing protocols for Ad Hoc networks are reviewed. Particularly, the pros and cons of them are analyzed. Finally, they are summarized and compared.

Embedding and re-embedding of virtual links in software-defined multi-radio multi-channel multi-hop wireless networks

There is rising interest in applying Software Defined Networking (SDN) principles to wireless multi-hop networks, as this paves the way towards bringing the programmability and flexibility that is lacking in today’s distributed wireless networks (ad-hoc, mesh or sensor networks) with the promising perspectives of better mitigating issues such as scalability, mobility and interference management and supporting improved controlled QoS services.This paper investigates this latter aspect and proposes an Integer Linear Programming (ILP) based wireless resource allocation scheme for the provision of point-to-point and point-to-multipoint end-to-end virtual links with bandwidth requirements in software-defined multi-radio multi-channel wireless multi-hop networks. The proposed algorithm considers the peculiarities of wireless communications: the broadcast nature of wireless links which can be leveraged for point-to-multipoint links resource allocations, and, the interference between surrounding wireless links. It also considers switching resource consumption of wireless nodes since, for the time being, the size of SDN forwarding tables remains quite limited. We also consider the case where the requirements of already embedded virtual links evolve over time and propose a re-embedding strategy that meets the new requirements while minimizing service disruption. Genetic Algorithms derived from the ILP formulations are also proposed to address the case of large wireless networks. Our simulation results show that our proposed methods work effectively compared to shortest path based heuristics.

A Survey on Multi hop Wireless Network for efficient schedule algorithms

International Journal of Computer Sciences and Engineering (A UGC Approved and indexed with DOI, ICI and Approved, DPI Digital Library) is one of the leading and growing open access, peer-reviewed, monthly, and scientific research journal for scientists, engineers, research scholars, and academicians, which gains a foothold in Asia and opens to the world, aims to publish original, theoretical and practical advances in Computer Science,Information Technology, Engineering (Software, Mechanical, Civil, Electronics & Electrical), and all interdisciplinary streams of Computing Sciences. It intends to disseminate original, scientific, theoretical or applied research in the field of Computer Sciences and allied fields. It provides a platform for publishing results and research with a strong empirical component. It aims to bridge the significant gap between research and practice by promoting the publication of original, novel, industry-relevant research.

Autonomous Navigation Control of UAV Using Wireless Smart Meter Devices

In preparation for the upcoming home delivery services that rely on Unmanned Aerial Vehicles (UAVs), we developed a new multi-hop radio network that is laid over a smart meter network transferring electric energy information only. In this network, a UAV follows, for navigation purposes, the topology of a virtual network overlaid on the physical smart meter network. We established a service management control method which does not rely on image analysis or map information processing, i.e. processes that consume precious power resources of the UAV. Instead, navigation is based on the routing technology. The current distance between the UAV and a node of the smart meter network is measured by means of the radio transmission loss value, therefore determining the position of the UAV. A two-layer network model has been proposed. One layer consists of a network of nodes in a residential area with scattered buildings – a location that is safer to navigate – while the other is an access network of nodes in a densely populated area. Then, we proposed methods to determine the direction of movement towards the next hop node on the data-link layer and the end node on the network layer, which is the target destination. We implemented a software-based test system and verified the effectiveness of the proposed methods.

Control-Guided Communication: Efficient Resource Arbitration and Allocation in Multi-Hop Wireless Control Systems

In future autonomous systems, wireless multi-hop communication is key to enable collaboration among distributed agents at low cost and high flexibility. When many agents need to transmit information over the same wireless network, communication becomes a shared and contested resource. Event-triggered and self-triggered control account for this by transmitting data only when needed, enabling significant energy savings. However, a solution that brings those benefits to multi-hop networks and can reallocate freed up bandwidth to additional agents or data sources is still missing. To fill this gap, we propose control-guided communication, a novel co-design approach for distributed self-triggered control over wireless multi-hop networks. The control system informs the communication system of its transmission demands ahead of time, and the communication system allocates resources accordingly. Experiments on a cyber-physical testbed show that multiple cart-poles can be synchronized over wireless, while serving other traffic when resources are available, or saving energy. These experiments are the first to demonstrate and evaluate distributed self-triggered control over low-power multi-hop wireless networks at update rates of tens of milliseconds.

Energy-Efficient Multi-User Routing in a Software-Defined Multi-Hop Wireless Network

Software-defined networking (SDN) is an innovative architecture that designs a logical controller to manage and program the network based on the global view, providing more efficient management, better performance, and higher flexibility for the network. Therefore, applying the SDN concept in a multi-hop wireless network (MWN) has been proposed and extensively studied to overcome the challenges of MWN. In this paper, we propose an energy-efficient global routing algorithm for a software-defined multi-hop wireless network (SDMWN), which is able to get transmission paths for several users at the same time to minimize the global energy consumption with the premise of satisfying the QoS required by users. To this end, we firstly propose a Lagrange relaxation-based aggregated cost (LARAC) and K-Dijkstra combined algorithm to get the top K energy-minimum paths that satisfy the QoS in polynomial time. Then, we combine the alternative paths of each user obtained by K-LARAC and propose an improved genetic algorithm to solve the global routing strategy. The simulation results show that the proposed K-LARAC and genetic algorithm combined method has the ability to obtain an approximate optimal solution with lower time cost.

An effective positive transmission routing algorithm based on social relationships in opportunistic social networks

Opportunistic social network enables users to form an instant network for information sharing, which is a type of multi-hop wireless network in nature, thus relies on cooperation between nodes to complete message transmission. At present, most traditional routing algorithms require relay nodes to unconditionally forward received data. However, due to the limited of network resources, not all nodes are willing to forward data for other nodes, which is manifested as refusing to accept or even discarding messages, leading to deterioration of network performance. In this regard, this paper proposes an effective positive transmission routing algorithm (EPTR) based on social relationships in opportunistic social networks. This technology optimizes the method of community division by modularity, which not only considers the tightness of networks, but also discusses the social attributes of nodes. In this scheme, nodes with high relationship strength are selected to participate in data forwarding process, which makes packets are transmitted in the direction of increasing forwarding capability of nodes to the destination community. Simulation results show that the proposed algorithm can discover most abnormal nodes including malicious nodes and selfish nodes. Besides, compared with EIMCT algorithm, ITPCM algorithm and Spray and Wait algorithm, the proposed scheme has the highest transmission success rate and the lowest network load.

Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network

Network coding–based routing has been widely considered as a promising technology to improve the network throughput of wireless multihop network. However, existing network coding aware routings have the problem of failure decoding and usually neglect the transmission scheduling, which degrades the gain of network coding. In this article, a common network coding condition and traffic matching supported network coding aware routing is proposed for wireless multihop network. In this, common network coding condition is proposed to avoid the problem of failed decoding. In addition, traffic matching mechanism is presented to promote the occurrence of network coding. Besides, a coding and load aware routing metric, which jointly considers the network coding opportunity and node load, is designed to evaluate the discovered paths. Extensive simulations on NS2 demonstrate that CTNR increases the number of coding opportunities and network coding occurrence, and improves network throughput.

Cooperative secrecy transmission in multi‐hop relay networks with interference alignment

In this study, the authors consider the secrecy communication of one source-destination pair in a wireless multi-hop relay network, where each node is equipped with multiple antennas. They use the method of interference alignment for secrecy transmission in the presence of an eavesdropper. Firstly, they propose a decode-and-forward (DF) relaying protocol and give a new result on the joint probability density function of the first, second, horizontal ellipsis , kth ($k=1, 2,\ldots $k=1,2, horizontal ellipsis ) largest eigenvalues of the complex Wishart matrices $\boldsymbol{H} \boldsymbol{H}H$HHH, where $\boldsymbol{H}$H is an matrix whose elements are independent identically distributed complex Gaussian variables with zero mean and unit variance. They then utilise this result to characterise the legitimate outage probability and the diversity order of the proposed DF protocol. The case where the relay works in the amplify-and-forward (AF) mode is considered at last, and the diversity order of the proposed AF protocol is given.

Integrating power assignment into energy‐efficient routing in E2E retransmission systems

Routing design is an effective mechanism to improve the energy-efficiency in packet transmissions for wireless multihop networks. Meanwhile, the total energy consumption for packet transmissions over a path comprising of several unreliable links depends on the power assignment on each link. In this study, the authors address the energy-efficient routing, which integrates with the optimal power assignment, in end-to-end (E2E) retransmission systems. The process of packet transmission across a path in E2E systems is modelled as a random walk. The expected energy consumed for the packet transmission is then calculated. As the expected energy consumption closely relies on the transmit power assigned on the path, it is necessary to integrate the power assignment into the energy-efficient routing. The optimal power assignment on the candidate path is analytically derived for minimising the expected energy consumption. Specially, the energy-efficient routing integrated with power sssignment (EERPA) algorithm is developed to find the optimal path among all candidate paths with all possible power assignments. Simulations demonstrate the efficiency of the authors' EERPA algorithm.