Heterogeneous Ad Hoc Networks Research Articles

Enlightening Enactment of Cooperative Communication in Heterogeneous Mobile Ad-Hoc Networks Surroundings

Enlightening Enactment of Cooperative Communication in Heterogeneous Mobile Ad-Hoc Networks Surroundings

Heterogeneous LPWAN Communication for Electric Vehicle Charging Infrastructure

Many countries worldwide are set to include Electric Vehicles (EV) as a prime element in transportation policy owing to political polarization to combat climate changes. Circumstances are conducive to a sustainable mobility paradigm and have accelerated the adoption of EVs. The situation demands the deployment of charging infrastructure at a faster pace. Smart Grid provides the pervasive support for the deployment of charge stations. But the charging infrastructure should scale beyond the frontiers of metropolitan geography. The paper proposes a heterogeneous network to support mobility to EV users utilizing the paradigm of the Internet of Things (IoT). A heterogeneous ad-hoc network of Low Power Wide Area Networks (LPWAN) and mobile data communication is proposed to support mobility and scalability of the infrastructure. The proposed ad-hoc communication infrastructure utilizes LoRaWAN, a promising LPWAN technology characterized by a long-range at a narrow bandwidth. LoRaWAN employs Chirp Spread Spectrum (CSS) in its physical layer. The paper peeps into standards and protocols supporting Smart Grid and EV charge infrastructure. An SNR characteristic of LoRaWAN is simulated for suitability and Hardware for communication node is proposed.

Multi-Player Multi-Armed Bandits for Stable Allocation in Heterogeneous Ad-Hoc Networks

Next generation networks are expected to be ultra-dense and aim to explore spectrum sharing paradigm that allows users to communicate in licensed, shared as well as unlicensed spectrum. Such ultra-dense networks will incur significant signaling load at base stations leading to a negative effect on spectrum and energy efficiency. To minimize signaling overhead, an ad-hoc approach is being considered for users communicating in the unlicensed and shared spectrums. For such users, decisions need to be completely decentralized as: 1) No communication between users and signaling from the base station is possible which necessitates independent channel selection at each user. A collision occurs when multiple users transmit simultaneously on the same channel, 2) Channel qualities may be heterogeneous, i.e., they are not same across all users, and moreover, are unknown, and 3) The network could be dynamic where users can enter or leave anytime. We develop a multi-armed bandit based distributed algorithm for static networks and extend it for the dynamic networks. The algorithms aim to achieve stable orthogonal allocation (SOC) in finite time and meet the above three constraints with two novel characteristics: 1) Low complexity narrowband radio compared to wideband radio in existing works, and 2) Epoch-less approach for dynamic networks. We establish convergence of our algorithms to SOC and validate via extensive simulation experiments.

Communication in a Heterogeneous Ad Hoc Network

Communication in a Heterogeneous Ad Hoc Network

Outage Probability Analysis of AF Relaying Systems with Heterogeneous Ad Hoc Networks

In this paper, we analyze the outage probability of AF relaying systems with Heterogeneous Ad Hoc Networks with respect to power allocation. The communicaton system can be decomposed into a a two-tier heterogeneous ad hoc network and a single-input multiple-output (SIMO) system, where the information ad hoc network and the energy ad hoc network coexist and share the same spectrum resource. We firstly establish the end-to-end signal-to-noise ratio (SNR) expression considering that the energy/information signals are transmitted with different power levels, to maximum the SNR at the terminal node, we then investigate a power allocation scheme at the relay node. Closed-form expressions for the outage probability are analytically derived based on special functions, moreover, we propose the outage probability can be tightly lower bounded by a simple expression for the case when the SNR is sufficiently high. Numerical and simulation results are also reported to verfiy our theory. This paper provides a benefical insight into performance optimization for wireless communication networks.

Capture Aware Channel Access Protocol in Wireless Network

Spatial reuse in wireless networks is limited by the SINR threshold and it might be feasible to capture a packet in the presence of ongoing foreign transmission. This work considers a new capture aware channel access protocol by incorporating global channel state information in the decision making process for the channel access jointly with adaptive power framework. The protocol employs power heterogeneous ad-hoc networks; it assigns different transmission power level to individual nodes based on dynamic observation of the network traffic. It exploits spatial heterogeneity of flows at a given channel allocation and sets up either symmetric or asymmetric carrier sensing which in turn schedules the data packets transmission to maintain adequate service quality and fairness enjoyed by a user. It stands atop capture capable PHY to leverage the channel reuse which is of paramount importance in the design of high capacity ad-hoc networks. Through extensive simulations, the paper demonstrates the efficacy of the new protocol. It delivers high network utilization and also provides fair access to the media.

Adaptive and intelligent energy efficient routing for transparent heterogeneous ad-hoc network by fusion of game theory and linear programming

In the modern era, the use of transparent Heterogeneous Ad-Hoc NETwork (HANET) has increased due to the numerous two-tier applications. It provides cross platform services. In this network, the concept of energy efficient routing is a vital issue due to the limited energy capacity of batteries. In response to this, the proposed work introduces an adaptive and intelligent energy efficient routing technique based on the fusion of game theory and linear programming methods. The combination of these two help to analyze multi-person decision making in the network, where each decision maker tries to maximize its own utility. The proposed model is simulated using the LINGO optimization software. The performance of the proposed model is validated with the existing approaches in several passes to justify its effectiveness in term of performance metrics.

A Cluster Based Intrusion Detection System for Homogeneous and Heterogeneous Mobile Ad Hoc Network

A Cluster Based Intrusion Detection System for Homogeneous and Heterogeneous Mobile Ad Hoc Network

基于MIMO异构Ad Hoc网络节点调度优化算法

多输入多输出(MIMO)技术在很大程度上提升无线网络的传输可靠性与频谱利用率。异构Ad Hoc网络中的节点不需要有线连接就能够直接通信，从而弥补了固定网络基础设施通信的缺陷。因此，异构Ad Hoc网络结合MIMO技术成为了学术界的一个研究热点。然而，在基于MIMO异构Ad Hoc网络中，不同的发送–接收对之间是通过不同的链路传输数据流，而链路与链路之间会存在共信道干扰的现象。好的节点调度方法对减少链路之间的干扰起很重要的作用。针对异构Ad Hoc网络传输链路特点，本文提出的分布式节点调度优化方法，根据每一条链路与其他链路之间的竞争情况，得到每一条链路的资源分配(rate)。在进行节点调度的过程中，根据不同链路的rate值，发送节点可以选择最优的接受节点传输数据流。实验仿真结果表示，分布式节点调度优化算法能够明显减少共信道干扰现象，从而提升系统的吞吐量。 Multiple-input and multiple-output (MIMO) can obviously improve transmission reliability and bandwidth efficiency in wireless networks. The nodes in heterogeneous Ad Hoc networks enable to communicate directly without wired connections, making up the lack of communication with fixed network infrastructures. Therefore, heterogeneous Ad Hoc networks combined with MIMO techniques becomes one of the research hotspots in academia. However, in heterogeneous Ad Hoc networks based on MIMO, different transmitter-receiver pairs transmit data streams by different links which have the effect of co-channel interference. A good scheduling algorithm plays an important part in reducing the co-channel interference. According to the characteristics of heterogeneous Ad Hoc networks and the contention regions between links, we propose node scheduling optimization algorithm to obtain resource allocation (rate). Based on different rate of different links, transmitters can choose the optimum receivers to transmit data streams via node scheduling. The results of the experience proof that node scheduling optimization algorithm can highly improve the system throughput with reducing the effect of co-channel interference.

Balancing Interference and Delay in Heterogeneous Ad Hoc Networks With MIMO

Heterogeneous ad hoc networks with MIMO links can significantly improve transmission performance of the entire distributed wireless communication system. In this paper, we investigate how to increase total system throughput and decrease end-to-end delay with the help of heterogeneous characteristics of the ad hoc networks. Even if there are lots of references about distributed scheduling control considering multiple antennas, channel state, and so on, it still needs to be addressed how to guarantee destination to receive packets with a short delay. To resolve this issue, we first propose an interference-delay tradeoff method using convex optimization, which adjusts transmission rate and power to balance interference and delay. We then develop a speed power interference-based topology resource control algorithm with delay constraint to further adjust transmission power for reducing energy consumption. Simulation results show that the proposed algorithms can outperform the existing ones in terms of throughput, end-to-end delay, and power consumption.

Heterogeneous ad hoc networks: Architectures, advances and challenges

The Heterogeneous Ad Hoc Networks (HANETs) are important components of the Internet of things, which become an inevitable trend in the future researches and applications. In recent years, the ad hoc networks have been widely employed in many fields, especially in environment monitoring, weapon control, intelligent transportation, smart city and other domains. HANETs consist of wireless sensor networks, smart ad hoc networks, wireless fidelity networks, telecommunication networks, vehicular ad hoc networks, etc. The digital information and physical objects are integrated through appropriate communication methods, thus new applications and services are created. Different applications use the independent network structures, which form a heterogeneous network platform and increase operational complexity of communication between each other. This paper presents a typical architecture of the large-scale HANETs, and investigates research advances of the current key technologies. To address existing issues, we suggest some potential solutions to deal with the current challenges, such as self-organization, big data transmission, privacy protection, data fusion and processing for large-scale HANETs.

English

English

Maximal Independent Sets in Heterogeneous Wireless Ad Hoc Networks

In ad hoc wireless networks, a Connected Dominating Set (CDS) has been extensively used as a Virtual Backbone (VB) for routing. The majority of approximation algorithms for constructing a small CDS in wireless ad hoc networks follow a general two-phased approach. The first phase is to construct a Dominating Set (DS) and the second phase is to connect the nodes in it. Generally, in the first phase, a Maximum Independent Set (MIS) is used as the DS. The relation between the size of a Maximum Independent Set and a Minimum Connected Dominating Set (MCDS) plays the key role in the performance analyses of these two-phased algorithms. In homogeneous wireless ad hoc networks modeled as Unit Disk Graphs (UDG) and Unit Ball Graphs (UBG), the relation between them has been well studied. However, in heterogeneous wireless networks which generally modeled as Disk Graphs with Bidirectional links (DGB) and Ball Graphs with Bidirectional links (BGB), upper bounds for the size of MISs have seldom been studied. In this paper, we give tighter upper bounds for the size of MISs in heterogeneous wireless ad hoc networks. When the maximum and minimum transmission range are relatively close, our result is much better. In DGB, when the transmission range ratio is (1,1.152], (1.152,1.307], (1.307,1.407], (1.407,1.462], (1.462,1.515], (1.515,1.618], (1.618,1.932], we prove that the size of any Maximal Independent Set (MIS) is upper bounded by 6opt + 1, 7opt + 1, 8opt + 1, 9opt + 1, 10opt + 1, 11opt + 1, 16.7778opt + 1.2222, where opt denotes the size of an optimal solution of the CDS problem.

Simulation-based performance comparison of two routing protocols for aircraft ad-hoc networks

Recently, new emerging research challenge, aircraft ad-hoc networks, has attracted considerable attention from the research community. Due to unique properties of aircraft ad-hoc networks, new routing protocols including geographical routing protocol for heterogeneous aircraft ad-hoc networks GRHAA and aeronautical routing protocol AeroRP have been proposed and analysed through simulation. However, since these protocols were compared with typical routing protocols for ad-hoc networks with simulation scenarios that were configured with unrealistic parameters for aircraft ad-hoc networks AANETs, more reliable and credible simulation studies are essentially needed. Based on this demand, in this paper, we conduct simulation-based performance evaluation for two mentioned protocols with new relevant parameters. Based on simulation results, we can identify that two routing protocols are suitable for AANETs. Furthermore, GRHAA shows better performance than AeroRP in the aspects of packet delivery ratio and similar delay by the help of hierarchical architecture as well as more accurate position prediction scheme in heterogeneous environments.

Adaptive Scheduling in MIMO-Based Heterogeneous Ad Hoc Networks

The demands for data rate and transmission reliability constantly increase with the explosive use of wireless devices and the advancement of mobile computing techniques. Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising wireless technologies that can significantly improve transmission capacity and reliability. Many emerging mobile wireless applications require peer-to-peer transmissions over an ad hoc network, where the nodes often have a different number of antennas, and the channel condition and network topology vary over time. It is important and challenging to develop efficient schemes to coordinate transmission resource sharing among a heterogeneous group of nodes over an infrastructure-free mobile ad hoc network. In this work, we propose a holistic scheduling algorithm that can adaptively select different transmission strategies based on the node types and channel conditions to effectively relieve the bottleneck effect caused by nodes with smaller antenna arrays, and avoid the transmission failure due to the violation of lower degree of freedom constraint resulted from the channel dependency. The algorithm also takes advantage of channel information to opportunistically schedule cooperative spatial multiplexed transmissions between nodes and provide special transmission support for higher priority nodes with weak channels, so that the data rate of the network can be maximized while user transmission quality requirement is supported. The performance of our algorithm is studied through extensive simulations and the results demonstrate that our algorithm is very effective in handling node heterogeneity and channel constraint, and can significantly increase the throughput while reducing the transmission delay.

Error Control for Local Broadcasting in Heterogeneous Wireless Ad Hoc Networks

Local (single-hop) broadcasting is widely employed in distributed protocols (e.g., neighbor discovery, local information exchange in distributed network optimization and gossip-based algorithms) in wireless ad hoc networks. The performance of local broadcasting is characterized by the mean number of neighbors and the probability distribution of the number of neighbors of a broadcasting node. In this paper, we study the performance of local broadcasting in heterogeneous wireless ad hoc networks in which inter-system interference dominates signal reception quality, considering general fading distributions of both the desired signal and the interfering signals. In addition, we investigate the impacts of different error control techniques (e.g., simple retransmission, Chase combining, and incremental redundancy) on the performance of local broadcasting. The increase in the mean number of neighbors of a broadcasting node with respect to the number of retransmissions of a message is clarified, facilitating QoS provisioning in reliable local broadcasting in interference-limited heterogeneous wireless ad hoc networks.

A Small World Based Routing Approach in Heterogeneous Strategy Ad-Hoc Networks in Future Internet of Things Environments

A Small World Based Routing Approach in Heterogeneous Strategy Ad-Hoc Networks in Future Internet of Things Environments

Active Cooperation Between Primary Users and Cognitive Radio Users in Heterogeneous Ad-Hoc Networks

In this paper, we consider a heterogeneous ad-hoc network where primary users may cooperate with cognitive radio (CR) users for the transmission of their data. We propose a new cooperation protocol that allows CR users to relay primary user signals in exchange for some spectrum. The spectrum released by primary users is used by CR users for their own data transmission. The proposed protocol maximizes the primary user power savings and the CR users' own data transmission rate. In addition, it provides more robust (potentially continuous) service for CR users, compared to the conventional practice in cognitive networks where cognitive users transmit in the spectrum holes of primary users (i.e., their service is interrupted when primary users need to transmit and no spectrum holes are available). More specifically, we propose a CR user power allocation scheme that maximizes the rate of transmission of CR user own data, for any given CR user power budget and a given bandwidth released from the primary user. Furthermore, we determine a range of possible transmission power levels that can be used by the primary user during cooperation without sacrificing its target transmission rate, and we derive a necessary condition on the quality of the channel between the primary user and the CR user that enables cooperation. Extensive numerical and simulation studies illustrate our theoretical developments and show that cooperation between a primary and CR user may lead, for example, to up to 80% savings of primary user power when compared to a noncooperation scheme at the same transmission power level.

Improving Energy Efficiency and Throughput in Heterogeneous Mobile Ad Hoc Networks

The nodes are expected to transmit at different power levels in heterogeneous mobile adhoc networks, thus leading to communication links of different length. Conventional MAC protocols that unconditionally presume that links are bi-directional and with unvarying energy distribution may not succeed or execute badly under such circumstances. Interference and signal loss resulting out of distance and fading diminish the entire throughput attained in heterogeneous networks to a greater extent. This article presents a MAC protocol, which adaptively transmits data frames using either the energy efficient nodes or a list of high data rate assistant nodes. In addition, a cross-layer based energy level on-demand routing protocol that adaptively regulates the transmission rate on basis of congestion is projected as well. Simulation results illustrate that the proposed protocols considerably diminish energy consumption and delay, and attain high throughput in contrast with the Hybrid MAC and traditional IEEE 802.11 protocols.

A two-tier heterogeneous mobile Ad Hoc network architecture and its load-balance routing problem

The mobile ad hoc network (MANET) has attracted a lot of interest recently. However, most of the existing works have assumed a stand-alone MANET. In this paper, we propose a two-tier, heterogeneous...