Showing papers on "Ad hoc wireless distribution service published in 2019"
01 Jan 2019-Cluster Computing
TL;DR: A novel routing protocol is proposed that aims to minimize routing overhead in route discovery procedure, and guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs.
Abstract: In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.
15 Feb 2019
TL;DR: Three new routing approaches for mobile ad hoc networks within the context of the previously described situations are developed to study the behaviour of a routing protocol when only the "self-dependent" parameter exists for routing information.
Abstract: AbstTact Mobile Ad hoc NETworks (MANET) are envisioned to become key components in the architecture of the next generation network. In contrast to wired and cellular networks, a MANET is an infrastructureless network that does not depend on any established infrastructure or centralised administration such as a base station. It is an autonomous system of wireless mobile nodes that move freely, randomly and organise themselves arbitrarily. Therefore, the network topology of an ad hoc network is dynamic in nature and may change rapidly and in unpredicted manner. Hence, the intercommunications among nodes are changing continuously. Generally, communication between a source node and a destination node in MANETs are established through multiple intermediate nodes. As a result, any link breaks between any two directly communicating nodes of the established path will result in a break of the complete connection between the source and the destination nodes. In addition, the mobility of nodes results in route loss, poor longevity of established routes, asymmetric communications links, increase in the control traffic overhead and affects the performance of the routing protocol. Moreover, using a number of routing parameters for routing such as geographical location, speed, and signal strength requires a number of resources to provide these parameters. These resources are unlikely to be always available at the same time. The aim of this research is to develop three new routing approaches for mobile ad hoc networks within the context of the previously described situations. One objective of developing these approaches is to study the behaviour of a routing protocol when only the "self-dependent" parameter exists for routing information. Other information is absent in the network, such as location information, speed, etc. Another objective is to exploit the mobility of nodes to establish long-lived routes by using the heading direction information of mobile hosts. As third objective, the scope of route requests is to be limited in order to reduce the overhead in the network. The three new approaches