Search

The integration of wireless devices has represented a significant leap forward in Information Technology, substantially enhancing human convenience. A notable subset of these networks is Aerial Mesh Networks (AMNs), akin to Mobile Ad-hoc networks (MANETs) and Vehicular Ad-hoc networks (VANETs), functioning wirelessly with mobility capabilities. AMNs have found increasing utility in remote and challenging environments, particularly in disaster scenarios where swift and effective action is imperative for saving lives. These networks boast traits such as easy deployment, self-configuration, and self-organization, seamlessly integrating with existing networks like cellular networks, WLANs, and WMANs. Despite the myriad benefits of AMNs, there remain unexplored avenues that necessitate further investigation to fully harness their potential. Researchers continue to strive towards optimizing AMNs for diverse application domains, ensuring maximal efficiency and accuracy. A succinct literature review of AMNs encompasses their varied characteristics, addressing issues such as routing, handover, node positioning, security, as well as network considerations like target coverage, robustness, fault tolerance, and load balancing. Additionally, it highlights key application areas including agriculture, civil applications, greenhouse gas monitoring, and disaster management. Finally, it elucidates pertinent open issues and future directions warranting exploration. [ABSTRACT FROM AUTHOR]

With advent of Internet of Things (IoT) an exponential growth has been observed in recent times towards the use of fifth generation (5G) network to share data among anything and even everything around connected in billions. The exchange of large amount of data by these devices or objects accumulates network overhead in the IoT infrastructure in terms of energy, routing, battery charge, data rate, packet delivery/loss rate, availability, interoperability, congestion, scalability, cost and security. Hence it is highly essential to project optimal solutions to uphold thereby the quality of service (QoS) in available network. This study provides a thorough literature survey of diverse optimization techniques in IoT aided wireless networks like Mobile Ad-hoc NETwork (MANET) driven Internet of Mobile Things (IoMobT), Vehicular Ad-hoc NETwork (VANET) driven Internet of Vehicles (IoV), Flying Ad-hoc NETwork (FANET) driven Internet of Flying Things (IoF), Robot Ad-hoc NETwork (RANET) enabled Internet of Robots (IoR), Ship Ad-hoc NETwork (SANET) driven Internet of Ships (IoS) and Underwater or Underground Ad-hoc NETwork (UANET) in Internet of Underwater or Underground Things (IoU). It categorizes papers based on the issues resolved by the examined works and optimization strategies employed and then it contrasts and condenses the salient characteristics of each kind of publication. It also even sketches a preview of IoT along with its evolving trends and cutting-edge-solutions for improving QoS. Our survey attempts to give readers a better grasp of the principles behind various computing models and to examine QoS network optimization strategies across a range of IoT models. [ABSTRACT FROM AUTHOR]

Vehicular ad-hoc network (VANET) is a technique that uses cars moved in cities or highways as nodes in wireless networks. Each car in these networks works as a router and allows cars in the range to communicate with each other. As a result of this movement, some cars will become out of range, but these networks can connect to the internet and the cars in these networks can connect to each other. This research proposes a unique clustering strategy to improve the performance of these networks by making their clusters more stable. One of the biggest problems these networks face is traffic data, which consumes network resources. Agent based modeling (ABM) evaluates better networks. The evaluation showed that the proposed strategy surpasses earlier techniques in reachability and throughput, but ad hoc on-demand distance vector (AODV) (on-demand/reactive) outperforms it in total traffic received since our hybrid approach needs more traffic than AODV. [ABSTRACT FROM AUTHOR]

Enhancing energy efficiency is a pivotal concern in sensor/ad-hoc networks, where devices are often constrained by limited power sources. Dynamic sleep scheduling emerges as a promising strategy to mitigate energy wastage and prolong network longevity. This approach involves orchestrating nodes to periodically transition between active and low-power sleep modes, aligning with data transmission requirements. Dynamic sleep scheduling optimizes energy usage, curbing the power-hungry nature of constant operation. This abstract explores the core concepts and applications of dynamic sleep scheduling, emphasizing its role in addressing the unique energy challenges encountered in sensor/ad-hoc networks. The benefits of dynamic sleep scheduling include extending network lifespan, minimizing interference, and promoting energy balance among nodes. Nevertheless, it also presents challenges like adapting to network dynamics, striking the right balance between energy savings and latency, and ensuring effective coordination among nodes. Various algorithms, including TDMA and LEACH, underpin dynamic sleep scheduling, with ongoing research driving advancements. These networks find application in environmental monitoring, disaster management, and industrial automation, among others. [ABSTRACT FROM AUTHOR]

Trust Modelling and Management (TMM) techniques are frequently applied in ad-hoc Distributed Wireless Networks (DWNs) to stimulate and improve cooperation between network nodes. TMM facilitate DWNs in building a trust network that assures reliability of communication channels, offers an additional layer of security, and enables group decision making processes. Likewise, TMM became in the past decades an attractive solution for solving problems in cooperative ad hoc DWN. The proposed solutions focus on modelling trust in a social-centric approach to maintain a system where nodes trust each other, and detect untrustworthy (malicious) neighbours. The work at hand considers a time span of three years, from 2020 to 2022, where the scientific research in the domain of TMM and DWN is analysed. Our survey aggregates over 130 research papers and investigates the quality of experimental assessment done by each work. Additionally, we establish an indication on the level of experimental analysis done by each study from a TMM security perspective. Lastly, the survey offers a trust ontology, a general overview of a trust models, together with a concise description of trust threats to facilitate the reader’s understanding of TMM.

Data sharing in a ubiquitous mobile ad hoc clouds with peer-to-peer overlays has gained a lot of attention in the recent past. Numerous Distributed Hashing Table based exact key lookup protocols have been proposed for mobile ad hoc networks. However, implementation of range queries in mobile ad hoc networks is a non-trivial task. Though protocols for executing range queries have been developed for static networks, but they cannot be used as such in mobile ad hoc networks due to the mobility of nodes and multi-hop paths between the nodes in the network. This paper proposes a scheme named as Range Query in Mobile ad hoc Data Cloud (RQ_MDC) that enables both exact and range queries over the data stored on mobile devices in large mobile ad hoc clouds. Simulation results demonstrate that the proposed scheme outperforms the state-of-art RQIOT and DST_MADPastry protocols in terms of query success ratio and query access time for the different network sizes, query rates and query-range sizes in a mobile environment. The data migration due to overload on the nodes has also been investigated. The simulation results of the proposed protocol show that range queries can be implemented in P2P mobile ad hoc clouds with high efficiency. The data transfer among nodes owing to their mobility in the proposed protocol RQ_MDC is also within the acceptable limits. [ABSTRACT FROM AUTHOR]

Satellite network layer and aeronautical network layer are treated as important parts of the next generation network, which will lead the world into the era of global interconnection.However, the high mobility and sparse distribution of aircraft limit the application of traditional routing algorithms originally designed for ground-based ad-hoc networks.Therefore, this paper used the aeronautical network to access software defi ned satellite network (Sat-SDN) for realizing real-time communication and state synchronization between aircraft via the inter-satellite and satellite-to-aircraft links.In order to extend the aeronautical networking and transmission mechanism to the global scope, a multiple domain division method was proposed, and an inter domain routing algorithm was presented.By analogy the refl ection principle of light, a routing learning method which limited the broadcasting of routing learning packets into a specifi c area was proposed, and eff ectively avoided severe communication overhead caused by state synchronization and fl ooding learning in large-scale networks.The real aircraft data was used for experimental simulation to compared the performance of proposed low-cost inter-domain routing algorithm (LIRA) with existing solutions.The simulation results showed that LIRA could eff ectively reduced the communication overhead and improved the transmission quality.

This paper presents a novel QoS architecture for IEEE 802.11 multihop broadband ad hoc networks integrated with infrastructure. The authors describe its features, including MAC layer measurements, traffic differentiation, and admission control. The modules required by the network elements as well as their integration are also presented. Additionally, the paper presents results which validate its correct operation and prove its superiority over plain IEEE 802.11. The authors are convinced that the proposed solution will provide QoS support for a variety of services in future mobile ad hoc networks.

LoRa is a new low data-rate modulation technology for wireless communication, which uses spread spectrum communications to increase transmission distance. At present, sub-GHz LoRa is mainly used to build LoRaWAN and is applied to the monitoring and data collection of the Internet of Things (IoT). Focusing on the latest 2.4 GHz LoRa technology, this study introduces the characteristics of 2.4 GHz LoRa in the physical layer and experimentally analyzes the basic performance of communication, energy consumption, and ranging. Meanwhile, for the deficiencies of time on air in the evaluation of effective data rate, this study proposes the concepts of time on PHY and time of transmission (ToT). Then, the ToT duration of 2.4 GHz LoRa under different parameter configurations is calculated. Finally, combined with the physical-layer characteristics of 2.4 GHz LoRa, four potential networking topologies of the 2.4 GHz LoRa are listed, and their characteristics and application scenarios are analyzed. Compared with sub-GHz LoRa, 2.4 GHz LoRa is more applicable for building self-organized networks and worldwide IoT solutions. [ABSTRACT FROM AUTHOR]

Routing in a mobile ad hoc network (MANET) is a difficult task due to the constantly changing network topology and the absence of a fixed infrastructure. In such a scenario, mobile hosts can act as both hosts and routers, forwarding packets for other mobile nodes in the network. Routing protocols used in MANETs must be able to adapt to frequent changes in topology, while minimizing the impact on wireless resources. The AODV, DSR, ZRP and DYMO protocol are specifically designed for mobile nodes in wireless multihop ad hoc networks. It is capable of adapting to the changing network topology and determining unicast routes between nodes within the network. This paper presents a comparative analysis of commonly used routing protocols in terms of key performance metrics, including packet delivery ratio, throughput, end-to-end delay, and network overhead. The study's findings demonstrate that the routing protocols' performance is influenced by the network's size, node density, and mobility patterns. These routing protocols showing the simulation performance using random waypoint model on qualnet simulator. [ABSTRACT FROM AUTHOR]

Mobile adhoc networks are the only way for communication when we have catastrophic situations in remote areas. There is typically no central authority responsible for maintaining and configuring the Mobile ad-hoc network. Designing a MANET is fraught with difficulty due to the network's weakness and control overhead. The topology of the network changes due to the mobility of the nodes. Further link instability issues are also encountered. The aim of this work is to propose efficient yet light weight protocols with the help of fuzzy logic namely Stable On-Demand Multiple-Path Routing Protocol (SODRP) for MANET. By enhancing the performance and efficiency of packet delivery ratio, delay, and control overhead, the proposed protocols provide a new method for overcoming stability on demand. The experimental results show that SODRP gives packet delivery ratio improves on an average by 10.74% on 10 nodes test bed, packet delivery ratio improves on an average by 11.87% on 20 nodes, and throughput increases on an average by 12.64% as compared with Ad hoc On-Demand Distance Vector (AODV) protocol. The objective is to increase the network's delivery ratio and throughput. [ABSTRACT FROM AUTHOR]

In general, the biggest problem with a mobile ad-hoc network is the threat to its security. This is because the mobile ad-hoc network is dismantled after a certain period of time, which spends a lot of time calculating its stability and greatly wastes its security dimensions. Thus the security features on these temporary networks need to be strengthened as they pose the most threats. In this paper, a security algorithm designed in SID mode is proposed to fix security vulnerabilities in the wireless mobile ad-hoc network module. Its main feature is that its security definitions are defined according to the number of Service Package Identification assigned to it. The definition of numbers based on its importance is to make a list of related devices in order and, accordingly, bring those devices into the security module. Its security features have been improved so that the security modules remain active as long as the network is active.

CSMA/CAP (Carrier-Sense Multiple Access with Collision Avoidance and Pilots) is introduced for ad-hoc networks in which each node has a single half-duplex radio. Using carrier sensing to access the common channel, a node with a data packet to send transmits a request-to-send (RTS) packet. If the RTS is sent without interference, the receiver sends a clear-to-send (CTS) packet followed by a pilot. A sender that receives a CTS for itself sends its data packet after a delay to let the pilot be heard and and then transmits its own pilot to make the total transmission time equal to a maximum data-packet length. The receiver sends its ACK after receiving the data packet and pilot from the sender. It is shown that no channel-access protocol based on the traditional RTS-CTS handshake over a single channel can guarantee collision-free transmissions of variable-length data packets and ACK’s, and that CSMA/CAP does ensure that data packets and their ACK’s are sent without multiple-access interference. The throughput of CSMA/CAP is compared with the throughput of CSMA in networks with and without hidden terminals, and the results show that the overhead of CSMA/CAP to eliminate collisions is small and that CSMA/CAP performs far better than CSMA when hidden terminals are present.

Mobile Ad hoc Networks (MANET) is a collection of mobiles and smart devices that communicates using wireless links. These types of networks are growing at the lightning speed and are being used at a large scale than ever before because of their high availability and mobility. As the usage of MANET devices increase, the challenges also increase for example the proper delivery of data or information to every mobile node. Traditionally, transmission control protocol (TCP) is used for delivery but it does not fit in all scenarios due to some of its limitations such as network congestion and quick recovery in case of link failure. In this, a comparative analysis of TCP is performed with the stream control transmission protocol (SCTP) and a TCP variant called TCP VEGAS. Several ad hoc scenarios are proposed with varying numbers of mobile nodes, i.e. 11, 21 and 31. The results obtained indicate that SCTP outperforms TCP and VEGAS in throughput. While using SCTP the packet lifetime is also small i.e. 0.19 seconds. The link utilization of SCTP is better than TCP and VEGAS. However, TCP increases its link utilization more than VEGAS for the nodes in MANET of large delay.

Copyright of Space-Integrated-Ground Information Networks is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Data Acquisition & Processing / Shu Ju Cai Ji Yu Chu Li is the property of Editorial Department of Journal of Nanjing University of Aeronautics & Astronautics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Because of the reliability of deployment, cost efficiency, and flexibility of ad-hoc wireless local networks (WLAN). These wireless networks have grown to be the everywhere connection solution in residential and public access networking protocols. It is important to know which strategy performs better with the least amount of delay. The Multiple Access Control protocols (MAC) that are relied on ALOHA, and Carrier Sense Multiple Access with collision avoidance (CSMA/CA) as random access techniques, have substantially aided the rapid growth of such wireless access networks. This work provides a model-based design approach for modeling CSMA/CA and ALOHA random-access protocols for packetizing wireless networks. We analyze the TX and Back-off waveforms of the PHY/MAC transceiver of three radio nodes under CSMA/CA and ALOHA operation modes and compare the obtained results of the PHY/MAC Transceiver for the network nodes according to these modes. Every node is within a range such that the communication between each couple of nodes can be interfered with and received data from the third node. The MAC layer and the logical link control function composed the data link layer. Since the same radio band is used for TX and RX, the MAC function employed here is CSMA/CA and ALOHA, which had also called a random back-off. The MAC layer sends a control signal to the TX block to transmit either a data frame or an acknowledgment frame. The frame contents are loaded in the look-up tables. The contents can be changed in the workspace. The output of this block is a complex baseband IQ signal. The obtained results show the effectiveness of CSMA/CA over ALOHA modes when comparing the corresponding Back-off waveforms and when calculating the throughput values of the three network nodes. [ABSTRACT FROM AUTHOR]

Nowadays, most recommender systems are based on a centralized architecture, which can cause crucial issues in terms of trust, privacy, dependability, and costs. In this paper, we propose a decentralized and distributed MANET-based (Mobile Ad-hoc NETwork) recommender system for open facilities. The system is based on mobile devices that collect sensor data about users locations to derive implicit ratings that are used for collaborative filtering recommendations. The mechanisms of deriving ratings and propagating them in a MANET network are discussed in detail. Finally, extensive experiments demonstrate the suitability of the approach in terms of different performance metrics. [ABSTRACT FROM AUTHOR]

The number of vehicles in the world's cities increases exponentially, this is the case of Latin American cities, and particularly in the city of Portoviejo, province of Manabí in Ecuador, has been growing considerably in recent years, the city has been expanding towards its surroundings. Due to this big number of vehicles, which also adds little planning to improve the use of public transport, little planning to improve urban vehicular flow, the centralization of administrative area and main shops in the city, are the main reasons why in certain times of the day the traffic can become a little slow. Universidad Técnica de Manabí, has the objective of modernizing the improvement of vehicular flow in its surroundings and in addition to automating the vehicular entrance to its facilities through the automation of the respective permit for visiting drivers and staff. In this paper we show the methodology and tools necessary to create a system to control vehicles entry and exit using a Raspberry Pi, an analysis of the different technologies that can be used to improve vehicular flow is also included, approaching the Internet of Things.

The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol’s performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional flooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc ondemand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes’ speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths – a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes.

Infrastructure-less (sometimes known as ad-hoc) networking paradigm is very appealing and potentially shaping its future into almost all emerging networks (i.e., IoT, wireless sensor networks, vehicular ad-hoc networks, emergency, and tactical radio networks, etc.). However, when conventional networking protocols are used, such networks often perform poorly, mainly because of interference within the network and limited network throughput. Recent advancements in wireless communications have enabled full-duplex (FD) operation by suppressing self-interference, which can theoretically double the network throughput. However, conventional medium access control (MAC) protocols like carrier-sense multiple access with collision avoidance (CSMA/CA) favor half-duplex (HD) operation and fail to benefit from FD transmission opportunities. This article proposes a novel hybrid MAC protocol for full-duplex ad-hoc networks. The proposed MAC combines time division multiple access (TDMA) and IEEE 802.11 distributed coordination function (DCF) strengths in chains of time-slotted contention-based control frames and collision-free data frames. The aim is to fully utilize FD transmission opportunities to increase network throughput. The proposed protocol modifies request-to-send (RTS) and clear-to-send (CTS) frames in IEEE 802.11 DCF MAC to form FD-RTS/CTS frames. These frames are used to enable collision-free FD communications among neighbors. The proposed scheme mitigates conventional MAC issues like hidden-node problem (HNP) and exposed-node problem (ENP). It also allows concurrent FD data transmissions in a collision-free manner. The model is generic and can be applied to any ad-hoc wireless network. In this article, the design is applied to a single channel ad-hoc network with FD transceivers. We compared the proposed design with IEEE 802.11 CSMA/CA protocol with both HD and FD transceivers. The simulation results show a 30% gain in throughput, reduced latency, and fairness among participating wireless nodes.

Localization is one of the major problems in mobile wireless sensor networks, since it provides the location of an event occurrence. This paper evaluates the performance of range-based localization algorithms: the multilateration algorithm, the weighted multilateration algorithm, the maximum likelihood algorithm and the multilateration algorithm with a correcting factor. We also propose the weighted multilateration algorithm with a correcting factor through which the localization error is decreased through the addition of a factor that corrects the distance between the node of interest and the reference nodes. Our proposal includes the analysis of noise in the environment due to the time of arrival and the analysis of node of interest’s mobility in the calculation of the correlation matrix of the weighted multilateration algorithm and the calculation of the correcting factor. The localization algorithms analyzed in this study are evaluated in a single-hop scenario and a multi-hop scenario considering a well-defined distribution of the reference nodes and a random distribution of these in both scenarios. The results we obtained varying the number of reference nodes and noise proportion prove that the algorithm we propose yields a better performance than the other analyzed algorithms do, according to the normalized root mean squared error.

Nowadays vehicles on the roads can communicate using a special type of wireless network called Vehicular Ad-hoc Networks (VANETs). It has been demonstrated by the researchers that because of the unique features such as high density of vehicles and frequent change of network topology, VANETs are not supported by the traditional routing protocols. The routing consistency of such highly dynamic networks must be taken into account in VANETs as communication links are disintegrated in VANETs more often than Mobile ad-hoc Networks (MANETs). The nature of VANET communication can bring extreme routing overhead to the network, therefore to increase network performance, the overhead issue must be tackled. The proposed protocol is focused on reducing the overhead to get the improved PDR performance of the network. The improvement is achieved by permitting communication amongst only those nodes which are considered reliable in terms of availability and geographical position. The reliability factor simply reduces unnecessary nodes from the communication process and selects a set of reliable nodes that are discovered with the help of clustering technique throughout the routing process. Simulation experiments using the network simulator are presented to demonstrate the efficacy of the proposed protocol. The results show that the proposed protocol has enhanced network performance effectively compared to prior approaches.

The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol's performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional ooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc on-demand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes' speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths - a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes. [ABSTRACT FROM AUTHOR]

In general, the biggest problem with a mobile ad-hoc network is the threat to its security. This is because the mobile ad-hoc network is dismantled after a certain period of time, which spends a lot of time calculating its stability and greatly wastes its security dimensions. Thus, the security features on these temporary networks need to be strengthened as they pose the most threats. In this paper, a security algorithm designed in SID mode is proposed to fix security vulnerabilities in the wireless mobile ad-hoc network module. Its main feature is that its security definitions are defined according to the number of Service Package Identification assigned to it. The definition of numbers based on its importance is to make a list of related devices in order and, accordingly, bring those devices into the security module. Its security features have been improved so that the security modules remain active as long as the network is active. [ABSTRACT FROM AUTHOR]

For many wireless ad-hoc network (WANET) applications, including wireless sensor, robotic, and flying ad-hoc networks, area coverage is a major challenge. This challenge, which may include the number of required nodes, cumulative energy consumption, or total distance travelled, involves covering the largest possible area with the least cost. Whatever the scenario and cost functions, efficiently deploying the nodes throughout their entire missions is an important factor. For larger networks, this can best be performed using proper topology formations that are essentially designated geometric graph patterns. As a network topology formation and node deployment strategy, this study presents a unique tree-formed geometric graph pattern. With any given number of nodes, it guarantees the maximum possible combined area coverage. Considering its graph theory and Euclidean characteristics, the pattern is then described as both algebraic and algorithmic relations. The formation is remarkably scalable because it may include an unlimited number of nodes while ensuring connectivity in a tree topology. In addition to presenting a breakdown of multiple features and attributes, including symmetry and fractality, we will make a comparative analysis with six known regular lattices and a line formation. Our analyses then show that MAX-Tree covers up to twice as much area compared to all other regular lattices of the same node cardinalities while being more robust and reliable than a line formation. MAX-Tree can be extremely beneficial for drone networks, smart industry and agriculture applications, ocean-bed monitoring systems, and many other WANET scenarios. [ABSTRACT FROM AUTHOR]

Message forwarding schemes allow vehicles to exchange messages for various purposes such as safety, entertainment and traffic efficiency in vehicular ad hoc networks (VANETs). This paper addresses the problem of message dissemination under emergency situations in the context of vehicle-to-vehicle communication along the roads. The paper proposes a new forwarding scheme for both hazardous and normal traffic messages. The proposed scheme improves the irresponsible forwarding probability in case of both emergency and non-emergency situations. Furthermore, the scheme uses adaptive broadcast range rather than using static one and thus more appropriate for practical applications. In our work Veins-SUMO-OMNeT simulation platform has been used. The simulation results show that the proposed forwarding algorithm outperforms the other dissemination techniques in terms of message losses and data dissemination success for normal messages and emergency messages.

This paper details a hardware implementation of a distributed Θ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks in a constant time regardless the number of devices in the same cluster. The algorithm allows each device to automatically detect its own status; master or slave; based on identifier without adding extra overheads or exchanging packets that slow down the network. We propose a baseband design that implements algorithm functions and we detail the hardware implementation using Matlab/Simulink and Ettus B210 USRP. Tests held in laboratory prove that algorithm works as expected.

One current trend for providing delay-tolerant communications under highly-dynamic routing conditions is to form ad hoc OppNets with the exploitation of smart mobile devices carried by people. Modern smartphones hide a great potential for emergency monitoring and management: they are truly pervasive, they can establish peer-to-peer wireless links using short-range communication technologies, thus guaranteeing coverage even when fixed infrastructures are unavailable, they can define the location with high accuracy through several embedded sensors and send messages without global connectivity. The paper examines the possibility of creating a mobile ad hoc network based on smartphones running the iOS 10 operating system and higher in emergencies, providing that each smartphone is equipped with transmitters for working with Wi-Fi, Bluetooth, GPS, and GLONASS interfaces. To solve this problem, a transparent automatic system for selecting alternative communication channels is organized with the possibility of localizing neighboring reachable nodes to broadcast coordinates to them with further reporting the available information to the appropriate special (rescue) services. The article describes the mechanism of nodes' interaction based on the Multipeer Connectivity framework. With this framework and the Bonjour software module, giving a protocol for automatic detection of services, an emergency informing system has been developed. This system provides the ability to deploy ad hoc network without directly accessing the global network of each of its participants, to localize the emergency zone, and to send an SOS- message to all connected peers. If there were no peers in the current session, the broadcast is pushed back in time until any peer is connected to this session.

Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to scale network resources independently, increase the quality of service, and facilitate the autonomy of networks. In this study, we leverage this concept to design a plane-separated routing algorithm, CUPS-based hierarchical routing algorithm (CHRA), as an energy-efficient and low-latency end-to-end communication scheme for clustered ad-hoc networks. In CHRA, while cluster heads constitute the control plane to conduct network discovery and routing, ordinary nodes residing in the user plane forward packets according to the routing decisions taken by the control plane. Exploiting the CUPS, we avoid exhausting cluster heads by offloading packet-forwarding to ordinary nodes and improve the quality of service by utilizing alternative paths other than the backbone of cluster heads. Our simulation results show that CHRA offers a better quality of service in terms of end-to-end latency and data-to-all ratio, and promotes fairness in energy-consumption in both stationary and mobile scenarios. [ABSTRACT FROM AUTHOR]

Edge computing has become a major trend in networking research. The rapid growth in the number of data analytics based mobile applications has resulted in an exponential rise in processing demand. One way to cope with this increased processing demand is to use edge networks (EN), which is a wireless ad-hoc network of mobile cloudlets, vehicular cloudlets, dedicated edge devices, and cloud platforms. Typically these devices have different owners and service providers. In this work, we propose a distributed incentive mechanism for an EN, which does not require a trusted third party (TTP). We consider a multi hop EN where a user offloads tasks to neighboring nodes, which may further offload them to their neighbours or the cloud. Our scheme is computationally efficient and helps each node decide on the incentives and workload distribution. We conducted simulations to study the performance of our scheme in different scenarios, including those of untruthful behavior by some nodes. Results show the benefit of using multi hop offloading and that our scheme discourages the untruthful behavior of nodes by assigning them lesser workload. We also propose a partially distributed incentive mechanism and compared its performance to our fully distributed scheme. [ABSTRACT FROM AUTHOR]

Localization is one of the main problems in Mobile Wireless Sensor Networks, since it provides the location of an event occurrence. This paper presents a performance evaluation of the localization algorithms: Multilateration Algorithm, Weighted Multilateration Algorithm and Probabilistic Multilateration Algorithm (PMA). In addition, we propose an Improved Probabilistic Multilateration Algorithm that decreases the localization error of the interest node by using an approach that computes iteratively the position of a node of interest until it reaches the solution that minimizes the localization error. The proposed approach regards the noisy environment by its impact on a correlation matrix that involves the variance of the separation distance between the node of interest and the respective reference nodes (RNs). Furthermore, we also introduce a constant parameter called damping factor; which enhances the convergence of the localization algorithm providing the solution that minimizes the localization error. In this study, we evaluate localization algorithms in a single-hop and multi-hop scenarios considering a distribution with solid geometry of the RNs and randomly distributed RNs in both scenarios. The results we obtained show that our proposed algorithm Improved PMA presents a better performance according to the Normalized Root Mean Squared Error varying the number of reference nodes and noise proportion.