In this paper, we investigate the delay performance of ad hoc broadcast networks in which random linear network coding is used to support M-to-N information dissemination. Multiple source nodes may inject coded packets for the same message, while multiple destination nodes decode the message after collecting a sufficient number of innovative degrees of freedom. Because broadcast forwarding does not rely on predetermined end-to-end routes, the packet-level relay sequence is generally random and depends on propagation delay, queueing delay, and prior reception history. We first prove that, when queueing, contention, processing, and retransmission delays are ignored, the first-reception time under fastest-only broadcast is exactly equal to the multi-source shortest-path distance, which provides a lower bound on propagation delay. We then develop an equivalent fixed-route queueing approximation to estimate relay-node load, stability, and end-to-end delay under M/D/1 and G/D/1 models. To account for route diversity under congestion, we further introduce a congestion-cost path approximation that penalizes heavily loaded relays. Simulation results on random and structured topologies show that the proposed framework captures the main delay trends under different traffic intensities and network densities while remaining simple for tractable analytical evaluation.
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to achieve since it has to take into account some parameters related to the network environment, for example, the network density, in order to avoid causing radio interferences. In this paper, we propose a novel Autonomic Dissemination Method (ADM) which delivers messages in accordance with given priority and density levels. The proposed approach is based on t…
In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomial time (O(N^12)), a near-optimal algorithm with linear complexity (O(N)), and a distributed algorithm with complexity O(1). To the best of our knowledge, this is the first study presenting an optimal solution for the minimum-energy broadcasting problem for a 2-D network (with cross configuration). We compare our algorithms with the broadcast incremental powe…
We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet l…
Low throughput has been the biggest obstacle of large-scale blockchain applications. During the past few years, researchers have proposed various schemes to improve the systems' throughput. However, due to the inherent inefficiency and defects of the Internet, especially in data broadcasting tasks, these efforts all rendered unsatisfactory. In this paper, we propose a novel blockchain protocol which utilizes the satellite broadcasting network instead of the traditional Internet for data broadcasting and consensus tasks. An automatic resumption mechanism is also proposed to solve the unique com…
In Mobile Ad-Hoc networks, broadcasting is a fundamental operation in the network layer. A node transmits a rebroadcast message to any or all other nodes whenever it receives for the first time. It will generate several redundant transmissions and it ends up in a significant downside Broadcast Storm problem. Within the literature, researchers have proposed 2-Hop Neighbour based protocol like DP, TDP, PDP and APDP to reduce broadcast storm in MANETs by choosing the minimum number of forwarding nodes from 1-Hop nodes to cover all 2-Hop nodes.
The new type of Mobile Ad hoc Network which is called Vehicular Ad hoc Networks (VANET) created a fertile environment for research. In this research, a protocol Particle Swarm Optimization Contention Based Broadcast (PCBB) is proposed, for fast andeffective dissemination of emergency messages within a geographical area to distribute the emergency message and achieve the safety system, this research will help the VANET system to achieve its safety goals in intelligent and efficient way.
In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting introduces unnecessary retransmissions of same message. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. In this paper, the goal is to reduce the number of forward nodes which will reduce redundant transmission as a result.…
Network coding has been successfully used in the past for efficient broadcasting in wireless multi-hop networks. Two coding approaches are suitable for mobile networks; Random Linear Network Coding (RLNC) and XOR-based coding. In this work, we make the observation that RLNC provides increased resilience to packet losses compared to XOR-based coding. We develop an analytical model that justifies our intuition. However, the model also reveals that combining RLNC with probabilistic forwarding, which is the approach taken in the literature, may significantly impact RLNC's performance. Therefore, w…
Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the "termination criterion". To tackle the probl…
Modern tactical operations have complex communication and computing requirements, often involving different coalition teams, that cannot be supported by today's mobile ad hoc networks. To this end, the emerging Software Defined Networking (SDN) paradigm has the potential to enable the redesign and successful deployment of these systems. In this paper, we propose a set of novel architecture designs for SDN-enabled mobile ad hoc networks in the tactical field. We discuss in detail the challenges raised by the ad hoc and coalition network environment, and we present specific solutions to address …
Broadcast is a fundamental operation in networks, especially in wireless Mobile Ad Hoc NETworks (MANET). For example, some form of broadcasting is used by all on-demand MANET routing protocols, when there is uncertainty as to the location of the destination node, or for service discovery. Being such a basic operation of the networking protocols, the importance of efficient broadcasting has long been recognized by the networking community. Numerous papers proposed increasingly more efficient implementation of broadcasting, while other studies presented bounds on broadcast performance. In this w…
Network coding is a recently proposed method for transmitting data, which has been shown to have potential to improve wireless network performance. We study network coding for one specific case of multicast, broadcasting, from one source to all nodes of the network. We use network coding as a loss tolerant, energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our contribution is the proposal of DRAGONCAST, a protocol to perform network coding in such a dynamically evolving environment. It is based on three building blocks: a method to permit real-time decoding of network…
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs will participate in route discovery process, update routing table and rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT…
The dissemination of vehicle position data all over the network is a fundamental task in Vehicular Ad Hoc Network (VANET) operations, as applications often need to know the position of other vehicles over a large area. In such cases, inter-vehicular communications should be exploited to satisfy application requirements, although congestion control mechanisms are required to minimize the packet collision probability. In this work, we face the issue of achieving accurate vehicle position estimation and prediction in a VANET scenario. State of the art solutions to the problem try to broadcast the…
Ad-hoc Social Networks have become popular to support novel applications related to location-based mobile services that are of great importance to users and businesses. Unlike traditional social services using a centralized server to fetch location, ad-hoc social network services support infrastructure less real-time social networking. It allows users to collaborate and share views anytime anywhere. However, current ad-hoc social network applications are either not available without rooting the mobile phones or don't filter the nearby users based on common interests without a centralized serve…
Security in Mobile Ad hoc Network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional security methods are not applicable in MANET due to its special properties. In this paper, a novel approach called Detecting and Eliminating Black Holes (DEBH) is proposed that uses a data control packet and an additional Black hole Check (BCh) table for detecting and eliminating malicious nodes. Benefiting from trustable nodes, the processing overhead of the sec…
A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network perfor…
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 updat…
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of th…
In this paper, we present Context-Adaptive PARRoT (CA-PARRoT) as an extension of our previous work Predictive Ad-hoc Routing fueled by Reinforcement learning and Trajectory knowledge (PARRoT). Short-term effects, as occurring in urban surroundings, have shown to have a negative impact on the Reinforcement Learning (RL)-based routing process. Therefore, we add a timer-based compensation mechanism to the update process and introduce a hybrid Machine Learning (ML) approach to classify Radio Environment Prototypes (REPs) with a dedicated ML component and enable the protocol for autonomous context …
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the …
In vehicular ad hoc networks, the dynamic change in transmission power is very effective to increase the throughput of the wireless vehicular network and decrease the delay of the message communication between vehicular nodes on the highway. Transmission range is directly proportional to the transmission power the moving node. If the transmission power will be high, the interference increases that can cause higher delay in message reception at receiver end, hence the performance of the network decreased. In this paper, it is analyzed that how transmission power can be controlled by considering…
Swarms of collaborating Unmanned Aerial Vehicles (UAVs) that utilize ad-hoc networking technologies for coordinating their actions offer the potential to catalyze emerging research fields such as autonomous exploration of disaster areas, demanddriven network provisioning, and near field packet delivery in Intelligent Transportation Systems (ITSs). As these mobile robotic networks are characterized by high grades of relative mobility, existing routing protocols often fail to adopt their decision making to the implied network topology dynamics. For addressing these challenges, we present Predict…
A Mobile Ad hoc NETwork (MANET) is a type of wireless network without any infrastructure, where nodes must adapt to the changing dynamic situations that result from their mobility. Because of the decentralization of nodes and the security needs of communications, management of MANETs must be self-organized, which is a major research challenge. In order to cope with the intrinsic properties of MANETs, a new decentralized management system for MANETs called Self-organizing Life Cycle Management (SLCM), is here fully described and evaluated. Regarding security, node authentication is the most cri…
We propose the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from their location of origin (called the Risk Zone) to vehicles approaching the Risk Zone. RNMDP assumes each node is aware of its current location in the network. The protocol works as follows: A RNM is broadcast in the neighborhood of the Risk Zone. A node receiving the RNM from another node waits for a Rebroadcast-Wait-Time before deciding to rebroadcast the message. The Rebroadcast-W…
The technology related to networking moves wired connection to wireless connection.The basic problem concern in the wireless domain, random packet loss for the end to end connection. In this paper we show the performance and the impact of the packet loss and delay, by the bit error rate throughput etc with respect to the real world scenario vehicular ad hoc network in 3-dimension space (VANET in 3D). Over the years software development has responded to the increasing growth of wireless connectivity in developing network enabled software. In this paper we consider the real world physical proble…
Mobile Advertisement is a location-aware dissemination solution built on top of a vehicular ad-hoc network. We envision a network of WiFi access points that dynamically disseminate data to clients running on the car's smart device. The approach can be considered an alternative to the static advertisement billboards and can be useful to business companies wanting to dynamically advertise their products and offers to people driving their car. The clients can subscribe to information based on specific topics. We present design solutions that use access points as emitters for transmitting messages…
The real world scenario has changed from the wired connection to wireless connection.Over the years software, development has responded to the increasing growth of wireless connectivity in developing network enabled software.The problem arises in the wireless domain due to random packet loss in transport layer and as well as in data link layer for the end to end connection. The basic problem has been considered in this work is to convert the real world scenario of Vehicular ad hoc network into a lab oriented problem by used the APS-system and study the result to achieve better performance in t…
Benefited from the widely deployed infrastructure, the LTE network has recently been considered as a promising candidate to support the vehicle-to-everything (V2X) services. However, with a massive number of devices accessing the V2X network in the future, the conventional OFDM-based LTE network faces the congestion issues due to its low efficiency of orthogonal access, resulting in significant access delay and posing a great challenge especially to safety-critical applications. The non-orthogonal multiple access (NOMA) technique has been well recognized as an effective solution for the future…
Rogue nodes broadcasting false information in beacon messages may lead to catastrophic consequences in Vehicular Ad Hoc Networks (VANETs). Previous researchers used either cryptography, trust scores, or past vehicle data to detect rogue nodes; however, these methods suffer from high processing delay, overhead, and False-Positive Rate (FPR). We propose herein Greenshield's traffic model-based fog computing scheme called Fog-based Rogue Nodes Detection (F-RouND), which dynamically utilizes the On-Board Units (OBUs) of all vehicles in the region for rogue node detection. We aim to reduce the data…
Multiple-Input Multiple-Output (MIMO) based Medium Access Control (MAC) protocols have received a good deal of attention as researchers look to enhance overall performance of Ad Hoc networks by leveraging multi antenna enabled nodes. To date such MAC protocols have been evaluated through comparative simulation based studies that report on the number of concurrent links the protocol can support. However, a bound on the maximum number of concurrent links (MNCL) that a MIMO based MAC protocol should strive to achieve has hitherto been unavailable. In this paper we present a theoretical formulatio…
Natural and man-made disasters have been causing destruction and distress to humanity all over the world. In these scenarios, communication infrastructures are the most affected entities making emergency response operations extremely challenging. This invokes a need to equip the affected people and the emergency responders with the ability to rapidly set up and use independent means of communication. Therefore, in this work, we present a complete end-to-end solution that can connect survivors of a disaster with each other and the authorities using a completely self-sufficient ad hoc network th…
Augmenting ground-level communications with flying networks, such as the high-altitude platform system (HAPS), is among the major innovative initiatives of the next generation of wireless systems (6G). Given HAPS quasi-static positioning at the stratosphere, HAPS-to-ground and HAPS-to-air connectivity frameworks are expected to be prolific in terms of data acquisition and computing, especially given the mild weather and quasi-constant wind speed characteristics of the stratospheric layer. This paper explores the opportunities stemming from the realization of cloud-enabled HAPS in the context o…
Recently, there has been growing research on developing interference-aware routing (IAR) protocols for supporting multiple concurrent transmission in next-generation wireless communication systems. The existing IAR protocols do not consider node cooperation while establishing the routes because motivating the nodes to cooperate and modeling that cooperation is not a trivial task. In addition, the information about the cooperative behavior of a node is not directly visible to neighboring nodes. Therefore, in this paper, we develop a new routing method in which the nodes' cooperation information…
Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be reinje…
A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a node can successfully receive an incoming message only if exactly one of its neighbors sent a message in that step. It is this semantics of how ports at nodes send and receive messages that defines the networks rather than the fact that only radio waves are used as a medium of communication; but if that is the case then just a single frequency is used. We dis…
Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemina- tion framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be rein…
The growing diffusion of wireless-enabled portable devices and the recent advances in Mobile Ad-hoc NETworks (MANETs) open new scenarios where users can benefit from anywhere and at any time for impromptu collaboration. However, energy constrained nodes, low channel bandwidth, node mobility, high channel error rates, channel variability and packet loss are some of the limitations of MANETs. MANETs presents also security challenges. These networks are prone to malicious users attack, because any device within the frequency range can get access to the MANET. There is a need for security mechanis…
TRUAV: Distributed Multi-Agent Reinforcement Learning for Trajectory Planning and Routing Enhancement in UAV-Aided IoT-Enabled VANETs
Hangzhou International Innovation Institute of Beihang University（北京航空航天大学杭州国际创新研究院）；School of Automation Science and Electrical Engineering at Beihang University（北京航空航天大学自动化科学与电气工程学院）；State Key Laboratory of Intelligent Manufacturing Systems Technology（智能制造系统技术国家重点实验室）；School of Transportation, Southeast University（东南大学交通学院）；Digital Health Research Center, Haihe Lab of ITAI（海河信息技术与人工智能实验室数字健康研究中心）；School of Cyber Science, Nankai University（南开大学网络空间科学学院）；China-SCO Digital Intelligence Applications (DIA) Joint Laboratory（中国-上海合作组织数字智能应用联合实验室）；College of Engineering, Abu Dhabi University（阿布扎比大学工程学院）；Faculty of Engineering and Architecture, Nisantasi University（尼桑塔西大学工程与建筑学院）；School of Information Engineering, Guangdong University of Technology（广东工业大学信息工程学院）
