Wireless Ad Hoc Networks Research Articles

Flow Aggregation for Energy-Aware Ad-Hoc Wireless Networks Respecting QoS Provisions

Emerging communication technologies are now leading developers to design IT systems taking into count their energy-related considerations. Much research performed in the area of ad-hoc wireless networks tends to distribute the flows over all nodes of the network, which increases the amount of energy consumed by each node and reduces longevity of the network. To overcome these problems, this paper seeks to aggregate a set of flows within a number of nodes that is as low as possible in order to be capable of routing those flows. This proposal allows to maximize the number of network nodes that may be turned off. The proposed solution was formulated as an integer linear programming (ILP) problem using a set of energy and quality of service (QoS) constraints. This formulation minimizes the total energy consumed by the nodes to construct a topology network that is capable of meeting QoS requirement for a set flows inserted into the network. To evaluate the efficiency of the proposed model, a performance-based comparison was conducted with another routing model. The simulation results show that the proposed model offers better performance in terms of global energy consumption and network load

Delay Tolerant Packet Forwarding Algorithm Based on Location Estimation for Micro Aerial Vehicle Networks

In search and rescue mission, micro aerial vehicles (MAVs) are typically used to capture image and video from an aerial perspective and transfer the data to the ground station. Because of the power limitation, a cluster of MAVs are required for a large search area, hence an ad-hoc wireless network must be maintained to transfer data more conveniently and fast. However, the unstable link and the intermittent connectivity between the MAVs caused by MAVs’ movement may challenge the packet forwarding. This paper proposes a delay tolerant packet forwarding algorithm based on location estimation for MAV networks, called DTNest algorithm. In the algorithm, ferrying MAVs are used to transmit data between MAVs and the ground station, and the locations of both searching MAVs and ferrying MAVs are estimated to compute the distances between the MAVs and destination. The MAV that is closest to the destination is selected greedy to forward packet. If a MAV cannot find the next hop MAV using the greedy strategy, the packets will be stored and re-forwarded once again in the next time slot. The experiment results show that the proposed DTNest algorithm outperforms the typical DTNgeo algorithm in terms of packet delivery ratio and average routing hops.

Lifetime Estimation and Measurement for Wireless Ad Hoc Networks

Mobile ad-hoc networks (MANET) is a popular choice for “wireless communication network” due to ease of deployment. Nodes in MANET are battery operated, movable, and compact. They can sense, manipulate and communicate data wirelessly. Limited battery power of the nodes is one of the major constraints of MANET. This paper proposes a network lifetime model that considers residual energy and actual discharge rate of the battery along with the energy consumption in different modes like transmit, receive, sleep, idle, active and processing while calculating the lifetime. A circuit implementation of node with Arduino Mega 2560, ZigBee transceiver, 2100 mAh NiMH rechargeable battery was done to compare lifetime with conventional dynamic source routing (DSR) and modified Least Max Dynamic Source Routing (LMDSR) algorithms. The DSR algorithm always selects the shortest path between source and destination nodes. But the LMDSR algorithm also considers the residual battery levels of the nodes to avoid overuse of the node(s) with low battery. This will prevent the early exhaustion of node(s) which may be the reason for reduced network lifetime. The result analysis shows that the implementation of LMDSR algorithm improves the network lifetime on an average by 31% and reduces the energy consumption by 21% with a slight decrease in throughput.

An Upper Bound Capacity Algorithm for Multi-hop Wireless Ad Hoc Networks

The upper bound capacity based on the SINR model is a very important parameter when evaluating the performance of the multi-hop wireless ad hoc networks. In this paper, a new upper bound capacity algorithm is proposed. Firstly, we analyzed the classical physics SINR model over the Rayleigh fading channels to establish the relationship between density of nodes and path outage probability. Then, we developed the closed-form expression of the upper bound transmission capacity based on the Weber model for the random networks. Finally, we evaluated effects of parameters in the communication range, density, SINR threshold and fading factors, and consequently transmission capacity of the network by sensitivity analysis. The numerical simulation showed that the optimum density of nodes was existed to obtain the upper bound transmission capacity. The capacity increased firstly and then decreased over the density of nodes increasing. It affected by channel fading factor and communication range sensitively.

Enhancing and Securing the Routing Techniques in Wireless Sensor Networks

A wireless network node network (WSN) is defined as being composed of a large number of small light weighted nodes called network node nodes with routing, processing and communication facilities, which are densely deployed in physical or environmental condition. Each of these nodes collects data and its purpose is to route this information back to a sink. WSN is highly constrained type of network, having network node nodes with more capabilities. All network node nodes in the wireless network node network are interact with each other by intermediated network node nodes. Physical parameters computations are power, energy, memory, communication range and bandwidth. Wireless ad-hoc networks mainly use broadcast communication. Upon deployment, network node nodes automatically collaborate and form a network, start collecting data without any input from the user. The proposed model has been improved for the route metric calculation along with node and link load availability information module to avoid the connectivity loopholes and link congestions. The proposed model results have been obtained in the form of various network performance parameters such as network load, transmission delay, throughput, energy consumption, etc. In wireless sensor networks, there are many types of attacks that can hinder or obstruct the data to be deliver to the authenticated node so in order to check which node is authenticated various algorithms have been proposed. There are various attacks like Denial of Service, Distributed Denial of Service and various types of Jamming attacks that can disrupt or deny the communication between sender and receiver. It is important to develop some powerful tools for network analysis, design and managing the performance optimization of the network. In this paper some of the most common attacks and threats are explained and the prevention that can be taken by using various tools is implemented. Also the different routes are configured if the particular route is not available. All the nodes and the attacks are been shown by using a simulator NS2.

RETRACTED ARTICLE: Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks

Efficient routing and broadcasting among a set of nodes play a critical role in wireless adhoc networks. for energy efficient routing, a connected dominating set (CDS) based virtual backbone is a promising approach. In the network, one-hop neighbors are selected as multi point relay (MPR) by each node to cover all its two-hop neighbors for the purpose of broadcasting and 2-hop repair. To improve the network lifetime, energy efficient MPR based CDS construction has been proposed by considering the node degree, energy level, node ID and velocity of the node. We also propose a route discovery protocol to relay route request messages, which makes use of the CDS nodes to obtain a stable routing path; 2-hop repair for route maintenance, which reduces the path damage (reduced control packets with lesser consumption of bandwidth) and broadcast storm problem. The simulation results show that the proposed protocol increases the network lifetime up to 30% than other works and effectively repair damaged routes by reducing control packets.

Location‐based data delivery between vehicles and infrastructure

Multi-hop routing in vehicular ad-hoc networks (VANETs) and wireless sensor networks has attracted significant interest of researchers in the wireless ad-hoc networks community. Most multi-hop routing protocols in VANET are based around the idea of choosing the next destination, which will provide the shortest-delay to reach a destination. To ensure better monitoring and reporting of road condition information, this study proposes location-based data forwarding through roadside sensors using k-shortest path routing combined with Q-learning. Q-learning is used for exploration of the sensing field to determine those sensors which have a higher queuing delay during peak hours as well as those which have comparatively lower delays. The use of Q-learning for exploration (sans routing) enables faster convergence for the sensors as compared to those techniques which utilise naive Q-learning for shortest path routing. Secondly, multi-hop routing is being combined with source coding (Huffman and Arithmetic coding) to compress the data payload of packets. This has shown some promising results for the VANETs employing dedicated short-range communication.

Dynamic energy efficient routing protocol in wireless sensor networks

Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support and 11n for high data rates (> 100 Mbps), are still limited as they are dependent on the wired infrastructure backbone and single-hop wireless communication. One major challenge in quality-of-service (QoS) oriented routing in wireless ad-hoc networks is to find a route that satisfies multiple constraints including energy consumption minimization, delay, node failure and throughput maximization. In this paper, we propose a novel Dynamic Energy Efficient Routing (DEER) protocol that guarantees message delivery, maximum network lifetime and message flow. DEER uses those specific nodes on the fly which has maximum residual energy above a defined energy level for relaying message from a source to a destination. Our proposed approach has been evaluated using realistic channel model and it demonstrates improved session lifetime and efficient data flow compared to Probabilistic Energy Profile, Efficient Hop Count Routing, Dijkstra and Random/opportunistic algorithms. In addition, DEER can lend itself easily to battery-based sensor networks or energy-harvested based sensor networks.

Capacity and Delay Analysis for Large Social-Aware Mobile Ad Hoc Wireless Networks

Most mobile ad hoc wireless networks have social features. It is a fundamental problem how to understand the performances of social-aware mobile ad hoc wireless networks. In this paper, we consider a wireless network area, with restricted mobility model and rank-based social model. On this basis, we investigate the upper bound of throughput capacity in such networks using the protocol interference model. By tessellating the network area into cells spatially and dividing time into slots temporally, we propose a multi-hop relay and slots allocation scheduling strategy. Then, we derive the achieved throughput capacity under this strategy. Results show per-node throughput is related to parameter of social model and range of node motion. In addition, we also study the delay varies by queueing theory in such network. Finally, we discuss capacity-delay tradeoffs in such networks. These results are beneficial to the design of network protocols in large social-aware mobile ad hoc wireless networks.

FCO — Fuzzy constraints applied Cluster Optimization technique for Wireless AdHoc Networks

Efficient energy utilization in wireless adhoc networks is always an open issue. To achieve energy efficiency, clustering technique would be an optimal one. In clustering technique using advanced optimization methods will provide expected results. By considering this, in this research work fuzzy constraints based cluster optimization technique is proposed. This technique considers fuzzy parameters namely device energy, device position, device movement/speed and device hop-count for calculating the fitness value of the nodes. Based on the value cluster head selection happens. This technique is enhanced to handle uncertainty conditions like cluster head failure, topology changes and energy depletion of the cluster head. The proposed technique is compared with four existing systems and the comparison results illustrates that the proposed technique is more optimal than compared LEACH, MPO, EDC, TCACWCA.

Optimization in Secure Routing and Power Efficient Communication in Wireless Adhoc Network

Security and data propagation are the two major concerns in wireless adHoc network. The optimal routing with power conservation and traffic monitoring defines the operational efficiency of the adHoc network. Wherein energy conservation and routing security are used as a measuring parameter in controlling the traffic flow, no two parameters are defined in together to optimize the route selectivity in the network. The monitoring of routing parameter in providing secure route is governed by the characteristic optimization of forwarding link and the approach of link selection. In this paper, an approach for optimal link selection for secure routing using multi attribute monitoring and controlling of traffic flow is presented. The proposed work defines a fairness factor based on multiple monitoring attribute to control the operational efficiency of the network. The multi attribute monitoring offers a more reliable and secure path in adHoc network in traffic flow modeling. The validations of the proposed approach were developed following the energy conservation and security provisioning in adHoc network.

Malicious node detection using heterogeneous cluster based secure routing protocol (HCBS) in wireless adhoc sensor networks

In wireless, every device can moves anywhere without any infrastructure also the information can be maintained constantly for routing the traffic. The open issues of wireless Adhoc network the attacks which are chosen the forwarding attack that is dropped by malicious node to corrupt the network performance then the information integrity exposure. Aim of the problem that existing methods in Adhoc network for malicious node detection which cannot assure the traceability of the node as well as the fairness of node detection. In this paper, the proposed heterogeneous cluster based secure routing scheme provides trust based secure network for detection of attacks such as wormhole and black hole caused by malicious nodes presence in wireless Adhoc network. The simulation result shows that the proposed model is detect the malicious nodes effectively in wireless Adhoc networks. The malicious node detection efficiency can be achieved 96% also energy consumption also 10% better than existing method.

On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks

In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed 319/15k3+116/5k2+29/5kopt+29/3k3+116/5k2+87/5k+13/15, where opt is the size of an MCDAS and k denotes the ratio of rmax to rmin in the ad hoc network with transmission range rmin,rmax. Our simulations show the feasibility of the algorithm proposed in this paper.

Middle-Order Vehicle-Based Clustering Model for Reducing Packet Loss in Vehicular Ad-hoc Networks

Vehicular Ad-hoc NETworks (VANETs) are typically termed as a wireless ad-hoc network that contains extreme node mobility and also the network carries a great significance in various traffic-oriented commercial applications and safety services. Due to its high mobility, routing in VANET has been a challenging work and also proving a higher rate of packet delivery ratio with reduced packet loss has been more important to be considered in route formations. With that note, this paper contributes to developing a clustering model called Middle-Order Vehicle-based Clustering (MOVC) model for managing the frequent topological change and high vehicle mobility, and efficiently handling the typical road traffic scenario. Moreover, the algorithm is intended to maintain the cluster to be constant for managing the vehicles in effective ways and also to provide uninterrupted communication between the vehicles. An algorithm for Effective Cluster Head Election (ECHE) is also derived in this paper for proficiently handling the frequency variation on the highways. Further, the model is simulated and evaluated on the basis of various metrics of VANET routing, specifically packet loss, packet delivery ratio, network lifetime and throughput. The results show that the proposed mechanism outperforms the results of existing models.

Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks

Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to being in the same vicinity, and this interference is modeled by a conflict graph. Given the conflict graph and link bandwidth requirements, the objective is to determine, using only localized information, whether the demands of all the links can be satisfied. At one extreme, each node knows the demands of only its neighbors; at the other extreme, there exists an optimal, centralized scheduler that has global information. The present work interpolates between these two extremes by quantifying the tradeoff between the degree of decentralization and the performance of the distributed algorithm. This open problem is resolved for the primary interference model, and the following general result is obtained: if each node knows the demands of all links in a ball of radius $d$ centered at the node, then there is a distributed algorithm whose performance is away from that of an optimal, centralized algorithm by a factor of at most $(2d+3)/(2d+2)$. The tradeoff between performance and complexity of the distributed algorithm is also analyzed. It is shown that for line networks under the protocol interference model, the row constraints are a factor of at most $3$ away from optimal. Both bounds are best possible.

Machine Learning-Based Driving License Management through Wireless Ad-Hoc Networks using NFC

Electronic Driving Record Frameworks (EDR) have been utilized in embracing essential consideration of the policing system; few additionally utilize such a framework by and by. To reducing ought and ensuring quality licensing service, a mobile ad hoc offline policing have the duty of maintaining law and order system can be applied through utilizing Near Field Communication (NFC) an innovative technique is built up to utilizations essential engineering aimed at driving license control facilities and predict their activities through classifier. For the benefit of the people's prerequisite the moveable license maintenance framework has been utilized comprehensively. The work features bringing drivers' records by the police in a solitary tap with an NFC tag to the NFC device. By way of the assistance of Near Field Communication (NFC), these succeeding plod should be embraced employing great need all together just as provisioning the license control of the drivers whenever and any place through the short-range wireless protocol. Presenting such technologies will stay away from license books and paper used for keeping up drivers' records physically. The system provides to maintain digitized information for every driver individually, easy access to the server, a database for the driver with archive data. A machine learning approach will focus for the prediction of the driver attitude basis on several parameters.

A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors

novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.

A review on network security risk assessment and techniques

A network is defined as a group of two or more computers which share resources and communicate among themselves. The most common example of network is internet by which millions of people are connected all over the world. Networks which configure itself on the fly are wireless ad hoc network that is not centralized. It is an infrastructure less network based on IP. Network security is very important and it needs to be maintained because information is getting shared between computers and is vulnerable to attack. We live in a digital world where the need to protect data from hackers is very important. In this paper we are doing a comprehensive survey on network security, wireless ad-hoc network (MANET) and vampire attack.

An Energy based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.

Selection of Jammer and Analysis on Secrecy Outage Probability for WANETs

Abstract In this paper, we investigate the physical layer security (PLS) in wireless ad hoc networks (WANETs). For fixed transmission distance model, we introduce the jammer selection scheme to enhance the secrecy transmission capacity. The jammer can prevent the eavesdropper from stealing information by sending the interference signal to the eavesdropper, thereby improving the security of the system. Based on the probability density function (PDF) and cumulative distribution function (CDF) of a random variable, we establish the expression of secrecy outage probability (SOP), a main metric in PLS. Finally, simulated results validate the effectiveness of selecting the appropriate jammer and theoretical analysis.