scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

scholarly journals Analisis Performansi Perubahan RAW Slot Pada Standar IEEE 802.11ah

2017 ◽  
Vol 9 (3) ◽  
Author(s):  
Ana Oktaviana ◽  
Doan Perdana ◽  
Ridha Muldina Negara
Keyword(s):  
Energy Consumption ◽  
Ieee 802.11 ◽  
Communication Technology ◽  
Network Performance ◽  
Delivery Ratio ◽  
Average Delay ◽  
Coverage Area ◽  
Packet Delivery ◽  
Ieee 802.11Ah ◽  
Ieee 802.11 Standard

The increasing needs and demands of diverse services by the users to be able to exchange and obtain information in real time, reliable, and flexible to be one of the problems faced by existing communication technology. WLAN on the IEEE 802.11 standard is one of the wireless technologies that can be the solution of the problem. It has a relatively small area of ??communication that is between 20-70 meters only, only able to serve up to 2007 stations, and has considerable energy consumption, causing some systems contained in the WLAN in IEEE 802.11 standard less work maximally. With these shortcomings, the WLAN on the IEEE 802.11 standard introduces a new task group called IEEE 802.11ah. IEEE 802.11ah is a new WLAN standard working on the 900 MHz frequency spectrum, a 1 kilometer communications coverage area, capable of serving 8192 stations with new AID hierarchies, has lower energy consumption and can increase throughput value by RAW mechanism. This study will make changes to the number of RAW slots in the IEEE 802.11ah to see how they affect the network performance. In this research it is found that the change of RAW slot number influence to network performance, in this case is throughput, average delay, packet delivery ratio and energy consumption.

scholarly journals AOCR: adaptive on chip router algorithm for multicore domain controller platform

2018 ◽  
Vol 7 (4) ◽  
pp. 2246
Author(s):  
T Shanmuganathan ◽  
U Ramachandraiah
Keyword(s):  
Energy Efficient ◽  
Cost Reduction ◽  
Network Performance ◽  
Rapid Development ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Core Domain ◽  
Latency Reduction ◽  
Increasing Demand ◽  
On Chip

In the recent years, with the rapid development of semiconductor technologies and increasing demand for more effective multi-Core Domain Controller platforms, there is a clear demand for effective routing algorithms that can be used to route the packets between these platforms, while enhancing an on chip network performance, achieving a better latency and throughput. This paper proposes an adaptive on Chip Router algorithm with a simple adaptive routing algorithm based on runtime weighted arbitration and resource allocation methodology, where the routing decisions are minimized for applications-specific MDCU platforms. The proposed scheme is evaluated by simulations and its performance in terms of latency, area, power consumption and cost reduction per vehicle are presented. The results show that, 24.5% of latency reduction, 62.25% area utilization optimization and 63.76% of energy efficient compare with existing methods.  

scholarly journals Swarm Intelligence based efficient routing algorithm for platooning in VANET through Ant Colony Optimization

2019 ◽  
Vol 8 (9) ◽  
pp. 1238-1244
Keyword(s):  
Ant Colony Optimization ◽  
Swarm Intelligence ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimization Technique ◽  
Ant Colony ◽  
Delivery Ratio ◽  
Average Delay ◽  
Size Number

Today’s era is of smart technology, Computing intelligence and simulations. Many areas are now fully depended on simulation results for implementing real time workflow. Worldwide researchers and many automobile consortium are working to make intelligent Vehicular Ad hoc Network but till yet it is just a theory-based permutation. If we take VANET routing procedures then it is mainly focussing on AODV, DSDV and DSR routing protocols. Similarly, one more area of Swarm Intelligence is also attained attention of industry and researchers. Due the behavior of dynamic movement of vehicle and ants, Ant Colony Optimization is best suited for VANET performance simulations. Much of the work has already done and in progress for routing protocols in VANET but not focused on platooning techniques of vehicle nodes in VANET. In our research idea, we came up with a hypothesis that proposes efficient routing algorithm that made platooning in VANET optimized by minimizing the average delay waiting and stoppage time. In our methodology, we have used OMNET++, SUMO, Veins and Traci for testing of our hypothesis. Parameters that we took into consideration are end-to-end delay as an average, packet data delivery ratio, throughput, data packet size, number of vehicle nodes etc. Swarm Intelligence has proved a way forward in VANET scenarios and simulation for more accurate results. In this paper, we implemented Ant Colony Optimization technique in VANET simulation and proved through results that if it integrates with VANET routing scenarios then result will be at its best.

scholarly journals Impact of buffer size and TTL on DTN routing protocols in intermittently connected mobile networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1735 ◽  
Author(s):  
Md. Sharif Hossen ◽  
Md. Masum Billah ◽  
Suraiya Yasmin
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Network Performance ◽  
Performance Metrics ◽  
Limited Resources ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
The Impact ◽  
Intermittently Connected

Delay-Tolerant Networks (DTNs) are kinds of networks where there does not exist any complete end-to-end route from source to destination. Such networks can also be referred to as Intermittently Connected Mobile Networks (ICMNs), which are featured by asymmetric data rates, large delay, limited resources and high error rates. In this network, size of buffer and Time-to-Live (TTL) for fixed number of nodes and message generation rates contribute to the network performance because of limited resources and short life span of a packet in the net-work. Therefore, investigating efficient routing for altering TTL and size of buffer is very important for overall network performance. This paper presents a performance analysis based on simulation of the impact of buffer size and TTL for several DTN routing protocols in ICMNs scenario. ONE, i.e., Opportunistic Network Environment is used to simulate the routing protocols considering three performance metrics: delivery ratio, mean latency and overhead ratio. Investigated results mention that Spray-and-Focus (SNF) routing exhibits the best performance for altering TTL and size of buffer than other DTN routing protocols, i.e., Epidemic, PRoPHET, PRoPHETv2, MaxProp, RAPID, and Binary-SNW in the considered performance metrics and simulation scenario. 

scholarly journals Genetic Optimized Location Aided Routing Protocol for VANET Based on Rectangular Estimation of Position

2020 ◽  
Vol 10 (17) ◽  
pp. 5759 ◽  
Author(s):  
Ravie Chandren Muniyandi ◽  
Faizan Qamar ◽  
Ahmed Naeem Jasim
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Network Performance ◽  
Performance Metrics ◽  
Average Energy ◽  
Search Space ◽  
Location Information ◽  
Destination Node ◽  
Delivery Ratio ◽  
Routing Overhead

Vehicle Ad-Hoc Network (VANET) is a dynamic decentralized network that consists of various wireless mobile vehicles with no individual user management. Several routing protocols can be used for VANETs, for example, the Location-Aided Routing (LAR) protocol that utilizes location information provided by the Global Positioning System (GPS) sensors. It can help to reduce the search space for the desired route—limiting the search space results in fewer route discovery messages. However, two essential aspects are ignored while applying the LAR protocol in the VANET-based environment. Firstly, the LAR does not exploit the fact that nodes in VANET do not have pure random movement. In other words, nodes in LAR predict the position of destination node by ignoring the fact that the pre-defined constraint on the destination node navigation is met. Secondly, the nodes in the conventional LAR (or simply stated as LAR) protocol use the location information of the destination node before selecting the route location, which is most likely to expire because of the fast movement of the nodes in the VANET environment. This study presents an estimation based on a heuristic approach that was developed to reject weak GPS location data and accept accurate ones. The proposed routing protocol stated as Rectangle-Aided LAR (RALAR) is based on a moving rectangular zone according to the node′s mobility model. Additionally, the proposed RALAR protocol was optimized by using the Genetic Algorithm (GA) by selecting the most suitable time-out variable. The results were compared with LAR and Kalman-Filter Aided-LAR (KALAR), the most commonly utilized protocols in VANET for performance metrics using Packet Delivery Ratio (PDR), average End-to-End Delay (E2E Delay), routing overhead and average energy consumption. The results showed that the proposed RALAR protocol achieved an improvement over the KALAR in terms of PDR of 4.7%, average E2E delay of 60%, routing overhead of 15.5%, and 10.7% of energy consumption. The results proved that the performance of the RALAR protocol had outperformed the KALAR and LAR protocol in terms of regular network performance measures in the VANET environment.

Improving AODV route recovery mechanism using PSO in WSN

2019 ◽  
Vol 09 ◽  
Author(s):  
Sunil Kumar K N ◽  
Shiva Shankar
Keyword(s):  
Particle Swarm Optimization ◽  
Network Performance ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Delivery Ratio ◽  
Swarm Optimization ◽  
Packet Delivery ◽  
Control Overhead ◽  
Route Failure

Objective: The conventional Ad Hoc On-Demand Distance Vector (AODV) routing algorithm, route discovery methods pose route failure resulting in data loss and routing overhead. In the proposed method, needs significant low energy consumption while routing from one node to another node by considering the status of node forwards the packet. So that while routing it avoids unnecessary control overhead and improves the network performance. Methods: Particle Swarm Optimization (PSO) algorithm is a nature- inspired, population-based algorithm. Particle Swarm Optimization (PSO) is a Computational Intelligence technique which optimizes the objective function. It works by considering that every member of the swarm contributes in finding the ideal solution by keeping a track of their own best known location and the best-known location of the group and keeps updating them whenever there is a change and hence minimizes the objective fitness function. The fitness function which we considered here is the Node lifetime, Link Lifetime and available Bandwidth. If these parameters are with good then status of node will be strong and hence routing of packet over those nodes will reduce delay and improves network performance. Result: To verify the feasibility and effectiveness of our proposal, the routing performance of AODV and PSO-AODV is compared with respect to various network metrics like Network Lifetime, packet delivery ratio and routing overhead and validated the result by comparing both routing algorithm using Network Simulator 2. The results of the PSO-AODV has outperformed the AODV in terms of low energy, less end to end delay and high packet delivery ratio and less control overhead. Conclusion: Here we proposed to use Particle Swarm Optimization in order to obtain the more suitable parameters for the decision making. The existing AODV protocol was modified to make a decision to recover from route failure; at the link failure predecessor node implementing PSO based energy prediction concept and using weights for each argument considered in the decision function. The fitness values for each weight were found through PSO basic form. We observed that the PSO showed satisfactory behaviour improvement than the performance of AODV for all metrics on the investigated scenarios.

scholarly journals An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes

2018 ◽  
Vol 8 (8) ◽  
pp. 1344 ◽  
Author(s):  
Kyung Min Baek ◽  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Average Distance ◽  
Mobile Node ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Context Information ◽  
Delivery Ratio ◽  
Mobile Nodes

Delay tolerant network (DTN) protocol was proposed for a network where connectivity is not available. In DTN, a message is delivered to a destination node via store-carry-forward approach while using opportunistic contacts. Probabilistic routing protocol for intermittently connected networks (PRoPHET) is one of the widely studied DTN protocols. In PRoPHET, a message is forwarded to a contact node, if the contact node has a higher delivery predictability to the destination node of the message. In this paper, we propose an improved opportunistic routing protocol, where context information of average distance travelled and average time elapsed from the reception of a message to the delivery of the message to the destination node is used. In the proposed protocol, the average distance and average time are updated whenever a message is delivered to a destination node. Then, both average distance and average time as well as delivery predictability of PRoPHET protocol are used to decide a message forwarding. The performance of the proposed protocol is analyzed and compared with that of PRoPHET and reachable probability centrality (RPC) protocol, which is one of the latest protocols using the contact history information of a mobile node. Simulation results show that the proposed protocol has better performance than both PRoPHET and RPC, from the aspect of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771875787 ◽  
Author(s):  
Hezhe Wang ◽  
Guangsheng Feng ◽  
Huiqiang Wang ◽  
Hongwu Lv ◽  
Renjie Zhou
Keyword(s):  
Buffer Management ◽  
Network Routing ◽  
Routing Algorithms ◽  
Destination Node ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Resources ◽  
Hop Count ◽  
Management Algorithm ◽  
Disruption Tolerant Network

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES

2012 ◽  
Vol 22 (01) ◽  
pp. 1250003
Author(s):  
IAIN A. STEWART
Keyword(s):  
Computational Complexity ◽  
Interconnection Networks ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Source Node ◽  
Destination Node ◽  
Underlying Graph

We equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links potentially usable by this routing algorithm as it attempts to route the packet. This gives rise to a naturally defined problem, parameterized by this routing algorithm, relating to whether a packet can be routed from a given source node to a given destination node in one of our interconnection networks in which there are (possibly exponentially many) faulty links. We show that there exist such problems that are PSPACE-complete (all are solvable in PSPACE) but that there are (existing and popular) routing algorithms for which the computational complexity of the corresponding problem is significantly easier (yet still computationally intractable).

Sign in / Sign up

Export Citation Format

Share Document