Showing papers on "Optimized Link State Routing Protocol published in 2018"

Intelligent energy-aware efficient routing for MANET

Abstract: Designing an energy efficient routing protocol is one of the main issue of Mobile Ad-hoc Networks (MANETs) It is challenging task to provide energy efficient routes because MANET is dynamic and mobile nodes are fitted with limited capacity of batteries The high mobility of nodes results in quick changes in the routes, thus requiring some mechanism for determining efficient routes In this paper, an Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed In IE2R, Multi Criteria Decision Making (MCDM) technique is used based on entropy and Preference Ranking Organization METHod for Enrichment of Evaluations-II (PROMETHEE-II) method to determine efficient route MCDM technique combines with an intelligent method, namely, Intuitionistic Fuzzy Soft Set (IFSS) which reduces uncertainty related to the mobile node and offers energy efficient route The proposed protocol is simulated using the NS-2 simulator The performance of the proposed protocol is compared with the existing routing protocols, and the results obtained outperforms existing protocols in terms of several network metrics

MEQSA-OLSRv2: A Multicriteria-Based Hybrid Multipath Protocol for Energy-Efficient and QoS-Aware Data Routing in MANET-WSN Convergence Scenarios of IoT

Abstract: Convergence of typical wireless networks [mobile ad hoc network (MANET) and wireless sensor network (WSN)] is paving the way toward brand-new cooperative platforms for Internet of Things (IoT) communications. The IoT enables the global connectivity of a wide variety of heterogeneous objects in accordance with their battery capacity, processing capabilities, and mobility to serve people in a collaborative manner automatically and intelligently. In such ubiquitous smart environments, efficient and effective data routing among IoT devices represent a real challenge due to nodes heterogeneity. Thus, this paper proposes a hybrid multipath energy and quality of service (QoS)-aware optimized link state routing protocol version 2 (MEQSA-OLSRv2), which is developed to cope with the challenges presented by limited energy resources, mobility of nodes, and traffic congestion during data transmission in the MANET-WSN convergence scenarios of IoT networks. This protocol uses a node rank according to multicriteria node rank metric (MCNR). This MCNR aggregates multiple parameters related to energy and QoS into a comprehensive metric to dramatically reduce the complexity of multiple constrained considerations and avoid the control overhead caused by separately broadcasting multiple parameters. These metrics are the node’s lifetime, residual battery energy, node’s idle time, node’s speed, and queue length. The MCNR metric is utilized by a new link quality assessment function for multiple-route computation. It is also adopted to select a multipoint relay (MPR) set of nodes by using an energy and QoS-aware MPR selection mechanism for flooding topological information. The simultaneous consideration of energy and QoS parameters can benefit the tradeoff between QoS and energy awareness. The performance of the MEQSA-OLSRv2 is evaluated through EXata-based simulations, and its effectiveness is validated by comparing it with the conventional routing protocols. The MEQSA-OLSRv2 is found to outperform existing schemes even in heavy traffic load and high-mobility scenarios. Furthermore, the MEQSA-OLSRv2 considerably enhances QoS, reduces energy consumption, and decreases the energy cost per packet.

Flying Adhoc Network (FANETs): Simulation Based Performance Comparison of Routing Protocols: AODV, DSDV, DSR, OLSR, AOMDV and HWMP

Abstract: In the last few years, new networking paradigms are evolving from MANETs like VANETs, FANETs, SEANETs etc. Flying Adhoc Networks are attracting interests as UAV vehicles are deployed in tremendous real-time applications. UAVs when connected together work cooperatively and in best coordination forming “Flying Adhoc Networks” (FANETs). FANETs are primarily designed to operate in different missions and rapidly changing environments. Therefore, it is utmost requirement to develop efficient routing protocols considering the nature of applications and services for deploying UAVs. However, lots of routing protocols are proposed till date but every protocol has certain limitations. The aim of this research paper is to analyze various routing protocols like AODV, DSDV, DSR, OLSR, AOMDV, HWMP for evaluating FANETs performance in real-time operations. Simulation based testing is done using NS-2 and it is observed that HWMP and OLSR performs suitably well in dynamic environments of FANETs.

Link-Quality and Traffic-Load Aware Routing for UAV Ad Hoc Networks

Abstract: With increasingly popular multi-sized unmanned aerial vehicles (UAVs), also referred to as drones, UAV Ad Hoc Networks (UANETs) play an essential role in the realization of coordinating the access of drones to controlled airspace, and providing navigation services between locations in the context of Internet-of-Drones (IoD). Because of the versatility, flexibility, easy installation and relatively small operating expenses of drones, UANETs are more efficient in completing complex tasks in harsh environments, e.g., search and destroy operations, border surveillance, disaster monitoring, etc. However, due to the high mobility, drastically changing network topology, and intermittently connected communication links, existing routing protocols and communication algorithms in Mobile Ad Hoc Networks and Vehicular Ad Hoc Networks cannot be directly applied in UANETs. In this paper, we propose a link-quality and traffic-load aware optimized link state routing protocol, also called LTA-OLSR, to provide efficient and reliable communication and data transmission in UANETs. A link quality scheme is proposed to differentiate link qualities between a node and its neighbor nodes by using the statistical information of received signal strength indication (RSSI) of received packets. A traffic load scheme is also proposed to assure a light load path by taking account of MAC layer channel contention information and the number of packets stored in the buffer. We evaluate the proposed schemes through extensive simulation experiments using OMNeT++ and compare their performance with the original OLSR and DSR protocols. The simulation results indicate that the proposed routing protocol can be a viable approach in UAV Ad Hoc Networks.

F-Ant: an effective routing protocol for ant colony optimization based on fuzzy logic in vehicular ad hoc networks

Abstract: Vehicular ad hoc networks (VANETs) are a subset of mobile ad hoc networks that provide communication services between nearby vehicles and also between vehicles and roadside infrastructure. These networks improve road safety and accident prevention and provide entertainment for passengers of vehicles. Due to the characteristics of VANET such as self-organization, dynamic nature and fast-moving vehicles, routing in this network is a considerable challenge. Swarm intelligence algorithms (nature-inspired) such as ant colony optimization (ACO) have been proposed for developing routing protocols in VANETs. In this paper, we propose an enhanced framework for ACO protocol based on fuzzy logic for VANETs. To indicate the effectiveness and performance of our proposed protocol, the network simulator NS-2 is used for simulation. The simulation results demonstrate that our proposed protocol achieves high data packet delivery ratio and low end-to-end delay compared to traditional routing algorithms such as ACO and ad hoc on-demand distance vector (AODV).

A Microbial Inspired Routing Protocol for VANETs

Abstract: We present a bio-inspired unicast routing protocol for vehicular ad hoc networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multiattribute decision-making strategy, the technique for order preference by similarity to an ideal solution, to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-to-end delay, and congestion, over the conventional method.

Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions

Abstract: In this paper, we evaluate the performance of two wireless mesh networks (WMNs) architectures considering packet delivery ratio (PDR), throughput, delay and fairness index metrics. For simulations, we used ns-3, distributed coordination function (DCF) and optimised link state routing (OLSR). We compare the performance of transmission control protocol (TCP) Tahoe, Reno and NewReno for normal and uniform distributions of mesh clients by sending multiple constant bit rate (CBR) flows in the network. The simulation results show that the PDR for both distributions and architectures is almost the same, but the PDR of I/B WMN for uniform distribution is a little bit higher than normal distribution. For both WMN architectures, the throughput of normal distribution is better than uniform distribution. The delay of Tahoe is a little bit lower compared with other algorithms for normal distribution and Hybrid WMN, but in case of uniform distribution, the NewReno performs better than other algorithms for both architectures. The fairness index of normal distribution is higher than uniform distribution.

AODVCS, a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Abstract: Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).

On Caching and Routing in Information-Centric Networks

Abstract: With the exponential growth of content in recent years, users are primarily interested in obtaining particular content and are not concerned with the host housing the content. By treating content as a first class citizen, information- centric networks (ICN) seek to transform the Internet from a host-to-host communication model to a content-centric model. A key component of ICN is to cache content at storage-enabled routers. By caching content at in-network routers, network performance can be improved by delivering content from routers closer to the user and not from the origin servers (content custodians). In this article, we provide an overview of the state-of-the-art cache management and routing policies in ICN. We present a small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another. Our simulation results demonstrate that it is hard to pick a winner among existing policies. We conclude the article with a discussion of open research questions.

Fuzzy Logic Based Reliable and Real-Time Routing Protocol for Mobile Ad hoc Networks

Abstract: MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they can be quickly implemented in the operational environment. One of the most significant issues in MANETs is concerned with finding a secure, safe and short route so that data can be transmitted through it. Although several routing protocols have been introduced for the network, the majority of them just consider the shortest path with the fewest number of hops. Hop criterion is considered for simple implementation and it is reliable in dynamic environments; however, queuing delay and connection delay in the intermediate nodes are not taken into consideration for selecting route in this criterion. In this paper, a fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic. It is able to optimize system efficiency. The score allocated to routes are based on four criteria: accessible bandwidth, the amount of energy of battery, the number of hops and the degree of dynamicity of nodes. The simulation results obtained from OPNET simulator version 10.5 indicate that the proposed protocol, in comparison with ad hoc on-demand distance vector (AODV) and fuzzy-based on-demand routing protocol (FBORP), was able to better improve packet delivery rate, average end-to-end delay and throughput.

Multi-metric geographic routing for vehicular ad hoc networks

Abstract: Maintaining durable connectivity during data forwarding in Vehicular Ad hoc Networks has witnessed significant attention in the past few decades with the aim of supporting most modern applications of intelligent transportation systems. Various techniques for next hop vehicle selection have been suggested in the literature. Most of these techniques are based on selection of next hop vehicles from fixed forwarding region with two or three metrics including speed, distance and direction, and avoid many other parameters of urban environments. In this context, this paper proposes a Multi-metric Geographic Routing (M-GEDIR) technique for next hop selection. It selects next hop vehicles from dynamic forwarding regions, and considers major parameters of urban environments including, received signal strength, future position of vehicles, and critical area vehicles at the border of transmission range, apart from speed, distance and direction. The performance of M-GEDIR is evaluated carrying out simulations on realistic vehicular traffic environments. In the comparative performance evaluation, analysis of results highlight the benefit of the proposed geographic routing as compared to the state-of-the-art routing protocols.

Chain-Branch-Leaf: a Clustering Scheme for Vehicular Networks Using Only V2V Communications

Abstract: The development of vehicular networks leads to a plethora of new applications that are already becoming essential to the drivers and to cooperative vehicles. One important condition to the continuity of these new services is the existence of an ubiquitous network access, which cannot be completely guaranteed. In this context, developing reliable ad hoc vehicle-to-vehicle communications is a good alternative that also becomes mandatory. This work proposes a clustering scheme that combines the information on road configuration, vehicle mobility and link quality in order to build a structure similar to a vehicular network infrastructure, while relying only on the vehicles. This clustering scheme can be integrated into any reactive, proactive, or geographic ad hoc routing protocol in order to optimize the flooding of messages and simplify routing operations. The evaluations realized through simulation show that the proposed clustering scheme allows creating and maintaining a stable backbone during a significant time. Moreover, the simulation results show that the proposed clustering scheme reduces significantly the impact of broadcast traffic flooding in comparison with well-established techniques such as multipoint relaying, to mention few.

An Adaptive Emergency Broadcast Strategy for Vehicular Ad Hoc Networks

Abstract: In recent years, since the adoption of the IEEE 802.11p and IEEE 1609 standards, Vehicular Ad hoc Networks (VANETs) have received a significant amount of attention in Ad hoc Network studies. Vehicular safety applications have thus played an important role in VANETs, and many emergency broadcast systems have been proposed. However, some of these broadcast mechanisms might result in the broadcast storm problem. The emergency broadcast strategy proposed in this paper is that when a car accident occurs, the vehicle’s sensors detect impacts and immediately send emergency messages to inform other vehicles nearby. In addition, we propose a way to eliminate redundant broadcasts and to ensure that emergency messages can be transmitted properly. We propose a stability function to estimate the reliability of the transponder. The backoff procedure of this proposed method assigns appropriate waiting times to different forwarders. The proposed scheme is implemented with NS2 simulator based on WAVE/DSRC standards. Simulation results show that the proposed protocol exhibits outstanding performance in terms of forwarding counts, packet loss rate, and delay time in different environments. In addition, our protocol maintains stability in different vehicle density scenarios so that each vehicle receives emergency messages and holds a low latency to ensure that the driver has adequate safety response time to enhance traffic safety.

Performance analysis and comparison of the DSDV, AODV and OLSR routing protocols under VANETs

Abstract: Vehicle-to-Vehicle (V2V), Vehicle-to-Road Infrastructure (V2R) and Vehicle-to-Pedestrian (V2P) communications are paramount for paving the way for smarter, cleaner and safer cities and roads. We investigate on how three state-of-the-art Mobile Ad-Hoc Network (MANET) routing protocols behave over the IEEE 802.11p/WAVE stack, which has been recently been specified for Vehicular Ad-hoc Networks (VANETs): Ad-hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV). Based on ns-3 and BonnMotion simulations, we evaluate Packet Delivery Rate, Goodput, Routing Overhead and End-to-End Delay for different trajectories, average speeds, and network densities. Our results show that the DSDV and OLSR protocols have a better performance than AODV, for low-density and low-speed scenarios. Additionally, we have observed that when the number of Nodes (network density) or Nodes’ velocity increases, the OLSR protocol performs better than the other two.

A Review on VANET Routing Protocols and Wireless Standards

Abstract: The vehicular ad hoc network (VANET) is an ad hoc network system based on the concept of mobile ad hoc network (MANET) in which nodes (vehicle) that are being connected with each other by wireless technologies. But due to the non deterministic mobility behavior and high velocity of automobiles, the topology is unpredictable. Such types of system can work independently and can also be interconnected through internet with in its infrastructure. The system characteristics such as multi-hop paths, node mobility, huge network, device heterogeneity, congestion and bandwidth are the constraints in designing the routing protocols for VANET. The present routing protocols that have been deployed for MANET are used to test the VANET accuracy and performance. Present research efforts are strongly emphasized on designing a novel routing algorithm and its implementations. Recent VANET research are majorly focused on predefined areas such as broadcasting and routing, security, quality of service (QoS) and infotainment with information dissemination during emergencies. In this paper authors present a detailed review of wireless standards used in VANET with a number of trials in VANET and its deployment in many of the developed countries. As a conclusion we conceptualized some of the issues and research challenges in VANET that had not yet addressed so that industry can opt for widespread adoption of scalable, reliable, secure and robust VANET protocols, architectures services and technologies and enable the ubiquitous deployment of it.

Benefits of Using Mobile Ad-Hoc Network Protocols in Federated Satellite Systems for Polar Satellite Missions

Abstract: The operational network of individual observation nodes project evaluated the benefits of applying distributed satellite system (DSS) architectures to Earth observation One of its outcomes is the identification of Arctic services as top priority current user needs that require near-real-time observations Using inter-satellite communications (ISC) capabilities, a federated satellite system (FSS) can establish a win-win collaboration between two spacecrafts to provide these services However, as a FSS is established during the contact between two satellites, the service duration is limited Therefore, the Internet of satellites (IoSat) paradigm promotes the use of multi-hop sporadic networks to deploy FSS In this paper, the routing protocol (which identifies routes between a source-destination pair) becomes crucial One of the most extended networks is the mobile ad-hoc network (MANET), in which nodes are constantly moving and changing the network topology In principle, applying MANET technologies in the IoSat context would provide self-organization, self-configuration, and flexibility to satellite systems The optimized link-state routing (OLSR) protocol is the predominant solution in MANET, because it quickly reacts against topology changes This paper aims at studying the benefits of using satellite networks with MANET solutions (eg OLSR) for polar satellite missions The results presented in this article demonstrate that the access time is significantly improved, and thus these new Arctic services can be achieved

An Enhanced OLSR Routing Protocol based on Node Link Expiration Time and Residual Energy in Ocean FANETS

Abstract: Due to complex and varied environment in the sea and high mobility of nodes, establishing a communication connection between UAVs is a difficult point. In addition, these existing routing protocols designed for mobile ad hoc networks (MANETs) or vehicle ad hoc networks (VANETs) could not play a good role in communication in Flying ad hoc Networks (FANETs). In this paper, we put forward a new form of the Optimized Link-State Routing (OLSR) protocol: it can suit rapid dynamic topology changes and prevent the interruption of communication. The key idea is to make full use of Global Positioning System (GPS) information to calculate node link expiration time and take into account residual energy. The improved multi metric ETX (Expected Transmission Count) simulation in OLSR is carried out in the NS-3 simulator. So, this paper reports the experimental results of routing protocols carried by small flying robots in marine scenes, and these numerical results show that the new protocol is significantly superior to the traditional OLSR in terms of packet transmission rate, End-to-End delay and routing overheads, providing reliable communication in the ocean FANETs.

Reliable low latency wireless mesh networks — From Myth to reality

Abstract: The massive increase in the number of connected devices with the advent of the Internet of Things era calls for self-organizing and dynamic networks. The state-of-the-art wireless mesh networking protocols that provide self-organizing networks like BATMAN and OLSR do not address the demands of 5G networks such as low latency and high reliability. In this demonstration, we exhibit how we build a reliable low latency network out of a chaotic and dynamic wireless mesh network. We combine the principles of opportunistic routing and network coding to achieve this. We let the audience to interact with the nodes of the wireless mesh networks, i.e. causing node failures, link changes, etc. We demonstrate how our mesh network retains all of its flows intact without any service interruption despite these interactions and node failures.

Congestion Control in Vehicular Ad Hoc Network: A Review

Abstract: Vehicular ad hoc network is a network of moving vehicles in which a set of road side units (RSUs) are used over vehicular networks to assist and communicate with moving vehicles. Numbers of vehicles are increasing day by day, and the numbers of motor vehicle accidents are also increasing. Therefore, quality of service (QoS) has become very crucial and challenging aspect for safe and convenient driving. Congestion control is one of them that provide quality of service (QoS) in vehicular network. Lots of research has been done in congestion control, and lots of research is to be done to ensure safe and reliable communication. Over the last decades, several algorithms have been proposed to address congestion problem in vehicular ad hoc networks (VANETs). In this paper, various congestion control techniques have been reviewed. These algorithms are compared on different parameters.

Multipath Security Aware Routing Protocol for MANET Based on Trust Enhanced Cluster Mechanism for Lossless Multimedia Data Transfer

Abstract: The dynamic nature of mobile nodes of ad hoc network is mostly affected by security problems which reduce data forwarding rate in multimedia sources Due to the rapid growth of wireless applications, the different multitalented routing protocols are proposed in recent years But the recent protocols are not efficient for multimedia applications, till now, specific security aware routing protocols are not proposed for multimedia data transfers In this paper, we proposed trust enhanced cluster based multipath routing (TECM) algorithm We use energy efficient PSO algorithm used to create cluster formation and cluster head, super cluster head are selected from trust values, which compute form proposed TECM algorithm The multi trust factors are used for trust computation, such as frame/packet loss ratio, frame/packet forward energy, frame/packet receiving energy, routing overhead, received signal strength, frame/packet forward rate, average forward delay and protocol deviation flag We then combine proposed TECM algorithm with standard multipath OLSR protocol (TECM-OLSR) to analyze the performance of proposed algorithm The simulated results show that proposed TECM-OLSR protocol is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR

Stochastic Programming Methods for Workload Assignment in an Ad Hoc Mobile Cloud

Abstract: In order to achieve better system performance, the concept of an ad-hoc mobile cloud, whereby a mobile device can access resources such as processing, data or storage at other neighbouring nodes, has been proposed. The difficulty that arises with this concept is the mobility of nearby devices, i.e., a neighboring device may move out of range before it can communicate its results back to the source device. In this paper, we propose a workload assignment scheme between a source device and nearby mobile devices that takes into account the randomness of the connection time between these devices. In order to cope with this randomness, we adopt a multi-stage stochastic programming approach which is able to take posterior recourse actions to compensate for inaccurate predictions. Moreover, in order to motivate the available mobile devices to cooperate, we formulate a distributed multi-stage stochastic buyer-seller game (MSSBSG) in which different mobile devices attempt to maximize their utilities. Our results show that the stochastic programming approach outperforms several baseline schemes and the MSSBSG approach effectively promotes cooperation between mobile devices and achieves the best overall performance compared to simpler approaches that do not take stochastic operating conditions into account.

Performance Evaluation of Ad-Hoc On-Demand Distance Vector and Optimized Link State Routing Protocols in Mobile Ad-Hoc Networks

Abstract: Mobile Ad-hoc Networks (MANETs) are self-sufficient networks that can work without the need for centralized controls, pre-configuration to the routes or advance infrastructures. The nodes of a MANET are autonomously controlled, which allow them to act freely in a random manner within the MANET. The nodes can leave their MANET and join other MANETs at any time. These characteristics, however, might negatively affect the performance of the routing protocols and the overall topology of the networks. Subsequently, MANETs comprise specially designed routing protocols that reactively and/or proactively perform the routing. This paper evaluates and compares the performance of two routing protocols which are Ad-Hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) in MANET environment. The study includes implementing a simulation to examine the performance of the routing protocols based on the variables of the nodes’ number and network size. The evaluation results show that the AODV outperforms the OLSR in most of the simulated cases. The results further show that the number of nodes and network size have a great impact on the Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E) of the network.

A Mobility Prediction and Delay Prediction Routing Protocol for UAV Networks

Abstract: The emerging Unmanned Aerial Vehicles (UAV) adhoc networks play more and more important roles in modern military affairs as well as civil fields. However, due to the high mobility of UAVs, there are several challenges in UAV networks such as routing path failure and the packet loss. So conventional routing algorithms can't accommodate this communication environment efficiently. To cope with these issues, in this paper, we proposed an enhanced optimized Link State Routing protocol (OLSR) based on mobility prediction and delay prediction (OLSR_PMD) for UAV networks. More specifically, a mobility prediction model based on Kalman filter algorithm is employed to choose stable neighbor nodes as MultiPoint Relay (MPR) nodes, which can improve stability of the routing protocol. Then, to meet the requirement of UAV networks on delay performance, by taking the queuing delay as a routing metric, a cross-layer queuing delay prediction model is introduced to achieve traffic load balance and reduce the end-to-end delay. The simulation results confirm that OLSR_PMD significantly outperforms the original OLSR protocol and DSDV protocol on delay performance and packet delivery performance in UAV networks.

An Analysis of the Optimum Node Density for Simultaneous Wireless Information and Power Transfer in Ad Hoc Networks

Abstract: This paper investigates simultaneous wireless information and power transfer (SWIPT) in the ad hoc network, where access points (APs) with multiple antennas can transfer energy as well as information using a common spectrum resource. The receiving nodes decode the incoming information data (information decoding, ID) and/or harvest the RF energy (energy harvesting, EH), where two different receiving node architectures—time switching (TS) and power splitting (PS)—are considered. By using a stochastic geometry approach, we aim to analyze the transmission capacity and the harvested energy per unit area as performance measures of the SWIPT in the ad hoc network. From the analytical results, we can derive the optimal node densities of ID nodes and EH nodes for TS architectures and, furthermore, optimize the power splitting ratio jointly with the node density for the PS architectures such that the harvested energy per unit area is maximized when the target transmission capacity is given. The proposed node density optimization gives us a useful insight into the design of SWIPT-based ad hoc network, where we can show how densely the APs/nodes can be deployed in a given area and furthermore, find that the ad hoc network with PS receiving nodes outperforms that with TS receiving nodes for a large target transmission capacity, and vice versa.