Recent developments offer potential solutions to problems encountered in ad hoc networks including topology control, data communication, and service access.

Ad hoc networks

A survey of Internet of Things communication using ICN: A use case perspective

Active queue management schemes like RED (random early detection) have been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows and packets are lost. When the queue length reaches a certain threshold RED schemes drop/mark incoming packets with a probability that increases as the queue size increases. The objectives are an equitable distribution of packet loss, reduced delay and delay variation and improved network utilization.Here we model multiple connections maintained in the congestion avoidance regime by the RED mechanism. The window sizes of each TCP session evolve like independent dynamical systems coupled by the queue length at the buffer. We introduce a mean-field approximation to one such RED system as the number of flows tends to infinity. The deterministic limiting system is described by a transport equation. The numerical solution of the limiting system is found to provide a good description of the evolution of the distribution of the window sizes, the average queue size, the average loss rate per connection and the total throughput. TCP with RED or tail-drop may exhibit limit cycles and this causes unnecessary packet delay variation and variable loss rates. The root cause of these limit cycles is the hysteresis due to the round trip time delay in reacting to a packet loss.

/pdf/a-mean-field-model-for-multiple-tcp-connections-through-a-1q7erzd2cy.pdf

A mean-field model for multiple TCP connections through a buffer implementing RED

Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. We examine the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. We theoretically quantify the energy savings that network coding can offer for the cases of two regular topologies. We then propose low-complexity distributed algorithms, and demonstrate through simulation that for random networks, network coding can in fact offer significant benefits in terms of energy consumption.

Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding

A Survey on Blockchain in Robotics: Issues, Opportunities, Challenges and Future Directions

Unmanned Aerial Vehicles (UAVs), also known as drones, are a class of aircraft without the presence of pilots on board. UAVs have the ability to reduce the time and cost of deliveries and to respond to emergency situations. Currently, UAVs are extensively used for data delivery and/or collection to/from dangerous or inaccessible sites. However, trajectory planning is one of the major UAV issues that needs to be solved. To address this question, we focus in this paper on determining the optimized routes to be followed by the drones for data pickup and delivery with a time window with an intermittent connectivity network, while also having the possibility to recharge the drones’ batteries on the way to their destinations. To do so, we formulated the problem as a multi-objective optimization problem, and we showed how to use the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to solve this problem. Several experiments were conducted to validate the proposed algorithm by considering different scenarios.

https://www.mdpi.com/2504-446X/5/2/27/pdf

UAVs Trajectory Optimization for Data Pick Up and Delivery with Time Window

We study the performance of several TCP connections through the bottleneck of a slow network accessed via a single queue with high capacity. Using mean-field approximation methology, we establish some asymptotical results about queue length distribution and windo size distribution when the number of user increases proportionally to buffer capacity. We also give an evaluatio- n of TCP fairness under these traffic conditions.

https://hal.inria.fr/inria-00072484/document

Performance Evaluation of a Single Queue under Multi-User TCP/IP Connections

Wireless mesh networks (WMNs) consist of two kinds of nodes: mesh routers which form the backbones of WMNs and mesh clients which associate with mesh routers to access networks. Because of the discrepancy between mesh routers and mesh clients, WMNs have a hybrid structure. Their hybrid structure presents an opportunity to integrate WMNs with different networks such as wireless LAN, Bluetooth and sensor networks through bridging functions in mesh routers. Because of the ability to integrate various networks, WMNs are a potential candidate for ubiquitous networks. Organizing the WMNs to integrate heterogeneous networks requires two level of routing: routing tables for backbones between mesh routers, and association tables for linking mesh clients to mesh routers. In order to organize routing tables containing the computerd paths between mesh routers, mesh routers execute mesh routing protocols. However, the information in these routing tables is insufficient to find paths between mesh clients because they do not execute routing protocols. Hence, to complement routing tables, we store information about mesh clients in ``association tables'' indicating which mesh client is reachable by which router. To organize the association tables for all mesh clients, mesh routers should run an additional protocol. The association discovery protocol (ADP) that we propose operates efficiently. The proposed ADP focuses on decreasing control overhead without prolonging the delay to distribute association information to the entire network. The proposed ADP is evaluated by an analytical model and simulations.

https://hal.inria.fr/inria-00070173/document

Association Discovery Protocol for Hybrid Wireless Mesh Networks

This document describes a Network Coding (NC) based broadcast protocol suitable mainly for wireless networks, including mobile ad hoc networks (MANET). It provides data dissemination from a single source, based on intra-flow network coding and for Internet Protocol (IP). It is designed to minimize the assumptions over the working environment and thus may operates over dynamically evolving environments.

Broadcast With Network Coding: DRAGONCAST

We propose an efficient broadcast algorithm for wireless networks, based on network coding: we introduce a simple rate selection and analyze its performance (through computation of min-cut). By broadcast, we mean sending data from one source to all the other nodes in the network, and our metric for efficiency is the number of transmissions necessary to transmit one packet from the source to every destination. We address this problem, in some special cases of wireless ``homogeneous'' networks contained of the plane: wireless lattice networks, and dense unit disk networks. Our results are based on the simple principle of ``Increased Rate for Exceptional Nodes, Identical Rate for Other Nodes'' (IREN/IRON), for setting rates on the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum broadcast rate of the source: our central result is a proof of the value of the min-cut for such networks. In particular, we show that for our scenarios, network coding is outperforming any method without network coding.

https://hal.inria.fr/inria-00144354/document

Near Optimal Broadcast with Network Coding in Large Homogeneous Wireless Networks

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Cédric Adjih

Author Tools

Chat about Author