Particle Positioning System for Ad-hoc Wireless Networks

Wireless Multimedia Sensor Networks (WMSNs) involving camera and Scalar Sensor (SS) nodes provide precise information of events occurring in the monitored region by transmitting video packets. In WMSNs, it is necessary to provide coverage of events occurring in the monitored region for longer durations of time. The Camera Sensor (CS) nodes provide the coverage of an event and transmit the video data to the Base Station (BS), when these nodes are actuated by the associated SS nodes on occurring of an event. Therefore, in the existing pieces of work, distributed actuation focuses on the coverage of an event and prolongation of the lifetime of the CS nodes. However, for distributed actuation of the CS nodes, the SS nodes play a vital role. When the data sent by the associated SS nodes in an event area exceed the preconfigured threshold, the CS nodes start sensing the event and send the video data to the BS. Therefore, in addition to the lifetime of the CS nodes, the lifetime of the SS nodes and their data reporting latencies are important aspects for distributed actuation of the CS nodes, while sending both the video and scalar data to the BS. In this work, we propose a topology management-based distributed camera actuation scheme, named TADA, to prolong the lifetime of SS nodes, and decrease the data reporting latency in event area only. The increased lifetime of the SS nodes, in turn, increases the event coverage and packet delivery ratio. To increase the lifetime of the SS nodes in an event area, the SS nodes with the most residual energies are selected as the packet aggregators. In addition, the transmission range of these nodes is decreased, and in-network packet aggregation is performed, while reporting the happening of an event to the associated CS nodes. The aggregator selection mechanism helps in balancing energy consumption of the SS nodes. Similarly, the decrease in transmission range and aggregation mechanism help in decreasing energy consumption of these nodes. The transmission range of the SS nodes is decreased using social network analysis and Coalition Formation Game (CFG). CFG also helps in decreasing the data reporting latency of an event by the SS nodes to their associated CS nodes. Performance evaluation results show that the proposed scheme, TADA, which is based on the distributed topology management protocol named T-Must, achieves high performance in terms of the lifetime of the SS nodes, data reporting latency, coverage ratio of the event, event reporting credibility index, and packet delivery ratio in an environment affected by shadow fading.

In recent years, with the increasing popularity of Internet technology and the advent of the 5G communication era, the applications related to mobile IoT have exploded, and wireless Ad Hoc network has received more and more attention. In traditional Ad Hoc networks, data are often transmitted between nodes in the form of "multi-hops", and the transmission range and available energy of nodes are limited. Thus, in Ad Hoc networks, a reliable and energy-efficient data transmission protocol is needed. In this paper, we studied the existing multipath routing protocols and proposed a multiple performances based routing protocol E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> LR, ( residual Energy, Energy consumption, Loop, Routing protocol ) for the shortcomings of Ad Hoc networks. This protocol has the following improvements to the existing multi-path routing protocols: (1) In the route discovery process, depending on the energy level of the nodes, the nodes make three different decisions on the received RREQ packets: discard, randomly delayed forwarding, and immediate forwarding, to filter out the nodes with lower energy and thus improve the network performance. (2) When selecting available paths, try to select nodes whose lifetime are close to each other. This can reduce the number of interruptions in the transmission path and improve the stability of the transmission path during data transmission. (3) When transmitting data, multiple paths stored in the source node are recycled to transmit data, thus balancing the node energy. Simulation results show that the E2LR routing protocol can effectively reduce the frequency of route initiation, shorten the data transmission delay, reduce the packet loss rate in the network compared with existing multipath routing protocols.

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

The failure of nodes in an ad hoc network not only alters the network topology but also introduces severe changes in the ad hoc network performances. Based on the ad hoc network connection availability model, in this paper we propose measures of ad hoc network fault tolerance expressed as connection resilience to nodes failures and relative connection resilience to nodes failures. Also qualitative evaluation of these measures is presented and then used to evaluate the effects of real measurable ad hoc networks parameters that concern the resilience to nodes failures like number of participants in the ad hoc network, source destination distance, mobility model, average node speed, transmission range, routing protocol and size of the area wherein the nodes are scattered.

- Ad hoc wireless networks (AHWNs) are decentralized and change without warning; therefore, selecting a good route presents a key problem. Established routing protocols battle to change to many network topology changes. They also have a hard time with diverse link conditions. In this study, we propose an AI-supported method for picking routes that uses a Random Forest Classifier (RFC) to make the best choice of paths in AHWNs. We use network graph modeling, feature extraction, and machine learning to forecast the optimal routes according to node attributes. We use NetworkX to create a network graph; every node is a wireless device and includes location coordinates, number of neighbors, and average shortest path length as features. A Random Forest Classifier is used to train a supervised learning model, and this classifier learns certain routing patterns from a labeled dataset that is produced through shortest path computations. The normalized network data trains a quantity of models, and each model is assessed for its predictive performance regarding routes. Index Terms – Random Forest, Ad Hoc Wireless Networks (AHWNs)

Impact of Node Speed and Transmission Range on the Hello Interval of AODV Routing Protocol

In hierarchical networks, the efficient choices of cluster-head as well as the cluster update interval is important to keep the established cluster structure stable and improve the communication quality. In this paper, we establish a cluster update interval model and use this model to determine a reliable update interval for the cluster structures in MANETs. This update interval is affected by two main factors: nodes' relative mobility and transmission range. We establish a cluster update interval model which uses the expected link lifetime with respect to the cluster-head (CH) as the update interval. The proposed model takes all of the above mentioned factors into consideration and no weights combination is needed. Simulation results shows that our proposed model can help to determine a dynamic cluster update interval adapting to various scenarios and achieve better stability in the cluster structure.

The objective of the paper is to propose trust aware routing method for cooperative and resilient geographic routing in Wireless Ad-hoc and Sensor Networks (WASNs). The proposed method calculates the trust value on the basis of node behavior in routing the packets. The proposed method is designed to have the features such as self-adaptability, low overhead, and dependability which are missing in the existing trust models. With the trust values, the proposed method detects and isolates the malicious nodes dynamically during the routing process. The simulation results obtained using the network simulator ns-2 shows the efficiency of the proposed trust model.

This paper study the secure optimal QoS routing (SOQR) in wireless ad hoc networks (WANETs) based on the physical layer security techniques. Specifically, we consider a multi-hop WANET with malicious eavesdroppers and cooperative jammers, and formulate the SOQR as an optimization problem. To deal with this problem, we first derive the closed-form expressions of connection outage probability (COP) and secrecy outage probability (SOP) for any given end-to-end path, which serve as the performance metrics of communication QoS and transmission security, respectively. Then, we explore the minimum COP conditioned on that SOP is below a pre- specified threshold and obtain the corresponding achievable power allocation strategy. With the help of analysis of a given path, we further propose the SOQR algorithm which selects the secure path between a pair of source and destination nodes in a distributed manner to achieve the optimal QoS performance. Finally, numerical simulations are conducted to validate the efficiency of our theoretical results, as well as to illustrate the QoS-security tradeoffs.

This paper investigates the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of wireless nodes, a QoS multicast call will be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. We propose a new QoS multicast routing scheme that uses multiple trees. The aggregate bandwidth of multiple trees can meet the bandwidth requirement and the delay from the source to the farthest destination node shall not exceed a pre-specified bound. Two strategies for constructing multiple trees are studied. The simulation results show that the new scheme significantly improves the request success rate and makes a better use of network resources.KeywordsDestination NodeNetwork LoadSuccess RatioBandwidth RequirementMulticast TreeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Ad Hoc network is one of the popular wireless multi-hop networks. Nodes or Users in Ad Hoc network can move randomly and freely to maintain communication without the control of the fixed infrastructure. Due to the limited transmission power and wireless coverage of the terminal, if two terminals that are beyond their respective transmission radius need communicate, they must use other intermediate or relay nodes for packet forwarding, so that a wireless Ad Hoc network is formed among these nodes. In this paper, the current state-of-the-art multipath routing protocols for Ad Hoc networks are reviewed. Particularly, the pros and cons of them are analyzed. Finally, they are summarized and compared.

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

In this paper, we present a methodology employing statistical analysis and stochastic geometry to study geometric routing schemes in wireless ad hoc networks. In particular, we analyze the network-layer performance of one such scheme, the random [ 1/ 2]disk routing scheme, which is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. The techniques developed in this paper enable us to establish the asymptotic connectivity and the convergence results for the mean and variance of the routing path lengths generated by geometric routing schemes in random wireless networks. In particular, we approximate the progress of the routing path toward the destination by a Markov process and determine the sufficient conditions that ensure the asymptotic connectivity for both dense and large-scale ad hoc networks deploying the random [ 1/ 2]disk routing scheme. Furthermore, using this Markov characterization, we show that the expected length (hop count) of the path generated by the random [ 1/ 2]disk routing scheme normalized by the length of the path generated by the ideal direct-line routing, converges to 3π/4 asymptotically. Moreover, we show that the variance-to-mean ratio of the routing path length converges to 9π <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> /64-1 asymptotically. Through simulation, we show that the aforementioned asymptotic statistics are in fact quite accurate even for finite granularity and size of the network.

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.