Fermat Point Based Joint Routing in Dual-Aggregation-Points Inter-Backup M2M Communications

2012 ◽  
Vol 546-547 ◽  
pp. 1205-1210
Author(s):  
Yun Kai Wei ◽  
Wei Qiao Li ◽  
Yu Ming Mao ◽  
Su Peng Leng ◽  
Qin Yu
Keyword(s):  
Energy Cost ◽  
Routing Algorithm ◽  
Packet Delay ◽  
Routing Algorithms ◽  
Fermat Point ◽  
M2m Communications ◽  
Communication Efficiency ◽  
Reliable Communications ◽  
Simulation Results ◽  
Ratio Energy

Machine-to-machine (M2M) communications can be widely used in military probing, disasters monitoring, etc., where have rigorous environment and require reliable communications. In order to provide enough reliability, M2M subnet can be deployed with two inter-backup aggregation points. This paper proposed a novel routing algorithm named Fermat Point based Joint Routing (FPJR) for such dual-aggregation-points inter-backup M2M Communications. Taking nodes on Fermat Points as route anchors, FPJR forms joint routes which can decrease energy cost and improve communication efficiency greatly. Further, considering the probability is quite little that there is exactly a node deployed on an appointed Fermat Point, we proposed a new terminology ‘ -Fermat Region’, which denotes the circle area with the Fermat Point as center and as radius. Based on -Fermat Region and through the FPJR interaction protocol, FPJR can act not only separately but also as the aid of other routing algorithms, without any compatibility problem. The simulation results show that FPJR can greatly decrease packet lost ratio, energy cost and packet delay.

A Community-Based Message Transmission Algorithm for Opportunistic Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2333-2337
Author(s):  
Zhi Ren ◽  
Yan Wei Liu ◽  
Shuang Peng ◽  
Ji Bi Li
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Transmission Condition ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Community Based ◽  
Delivery Delay ◽  
Message Transmission ◽  
Simulation Results ◽  
Determination Mechanism

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

RQRT: REDUCE QUERYING ROUTING TABLE FOR MESH-BASED NETWORK-ON-CHIP

2011 ◽  
Vol 20 (08) ◽  
pp. 1529-1545
Author(s):  
MINGHUA TANG ◽  
XIAOLA LIN
Keyword(s):  
Routing Algorithm ◽  
Packet Delay ◽  
Network On Chip ◽  
Average Packet Delay ◽  
Routing Table ◽  
Simulation Results ◽  
Pass Through ◽  
On Chip

Although using table to implement routing algorithm has some advantages in network-on-chip (NoC), the router queries the routing table whenever a packet is to be forwarded. The querying time significantly increases the packet delay even if some methods have been proposed to shorten the table size. In mesh-based NoC, statistics shows that two neighbor routers have the same routing options for over 50% packets, on average. In this paper, we propose a technique to let packets pass through some routers without querying the routing table. Consequently, the time to query the routing table is significantly decreased. Simulation results show that this leads up to 16% decrease of average packet delay.

scholarly journals Least Common Ancestor Networks

VLSI Design ◽  
1995 ◽  
Vol 2 (4) ◽  
pp. 353-364 ◽  
Author(s):  
Isaac D. Scherson ◽  
Chi-Kai Chien
Keyword(s):  
Common Ancestor ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Routing Strategy ◽  
Iterative Analysis ◽  
Simulation Results ◽  
Randomized Routing ◽  
Permutation Routing ◽  
Benes Networks

Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fattrees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0 and the CM-5. Some LCAN properties are stated and the circuit-switched permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an iterative analysis for a randomized routing strategy. These results indicate that the routing strategy provides highly predictable router performance for all permutations. An off-line routing algorithm is also given, and it is shown how to realize certain classes of permutations by adapting Nassimi and Sahni's, and Raghavendra and Boppana's self-routing algorithms for Benes networks.

QoS Routing Algorithm Based on Multi-Parameter Constraints for Wireless Sensor Networks

2012 ◽  
Vol 542-543 ◽  
pp. 869-872
Author(s):  
Lin Lin ◽  
Yi Nian
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Cost ◽  
Path Length ◽  
Simulation Experiment ◽  
Routing Algorithm ◽  
Minimum Cost ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Qos Routing Algorithm ◽  
Parameter Constraints

RBMC—a novel routing algorithm based on multi-parameter constraints for wireless sensor network is proposed. The algorithm finds out the minimum cost path from source sensor to sink by ants with multi-parameter, and the source sensor can transmit information along the shortest path. Thus the transmission path length and the corresponding network delay can be efficiently reduced. We analyzed the performance of RBMC through compared with the existing other routing algorithms in simulation experiment. Results show that the proposed method can reduce energy cost and balance the energy load effectively.

scholarly journals An Adaptive Routing Algorithm Based on Relation Tree in DTN

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7847
Author(s):  
Diyue Chen ◽  
Hongyan Cui ◽  
Roy E. Welsch
Keyword(s):  
Negative Feedback ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Message Delivery ◽  
Average Delay ◽  
Hop Count ◽  
Simulation Results ◽  
Delay Tolerant

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

A STRATEGY OF DESIGNING ROUTING ALGORITHMS BASED ON IDEAL ROUTINGS

1999 ◽  
Vol 10 (01) ◽  
pp. 63-94 ◽  
Author(s):  
K. SHINJO ◽  
S. SHIMOGAWA ◽  
J. YAMADA ◽  
K. OIDA
Keyword(s):  
Routing Algorithm ◽  
Simple Algorithm ◽  
Packet Delay ◽  
Routing Algorithms ◽  
Performance Limits ◽  
Internet Routing ◽  
Average Delay ◽  
Switched Networks ◽  
Design Elements ◽  
The Ideal

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with a maximum degree of performance attainment are realized. By "degree of performance attainment", we mean that we can see how much room is left for the improvement of algorithms. We develop [A] and [B] with the performance measures of throughput and average packet delay and the M/M/1 queuing network. We decide ideal static routings and their performance limits from [A]. We obtain a new simple algorithm from [B] based on the notion of the ideal routings in implementation conditions. The designed algorithm improves the throughput and the average delay, which are comparable to those from ideal static routings. This improvement is contrasted to the adaptive and distributed OSPF (Open Shortest Path First), a standard Internet routing protocol.

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

INVESTIGATING A WIRELESS SENSOR NETWORK OPTIMAL LIFETIME SOLUTION FOR LINEAR TOPOLOGIES

2006 ◽  
Vol 07 (01) ◽  
pp. 91-99 ◽  
Author(s):  
Keith Hellman ◽  
Michael Colagrosso
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Nearest Neighbor ◽  
Analytic Solution ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Global Knowledge ◽  
Alternative Solutions

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors' energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, nearest-neighbor routing algorithm, and an analytic solution to the optimal lifetime of networks meeting certain constraints. Alternative solutions considered range from those requiring global knowledge of the network to solutions using only next-neighbor knowledge. We compare the performance of all the routing algorithms in simulation.

Comparative Performance Analysis of 
Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based 
Network-On-Chip

2021 ◽  
Vol 20 (3) ◽  
pp. 1-6
Author(s):  
Mohammed Shaba Saliu ◽  
Muyideen Omuya Momoh ◽  
Pascal Uchenna Chinedu ◽  
Wilson Nwankwo ◽  
Aliu Daniel
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Injection Rate ◽  
Network On Chip ◽  
Routing Algorithms ◽  
Comparative Performance ◽  
Traffic Pattern ◽  
Mesh Topology ◽  
Similar Vein ◽  
On Chip

Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.

Sign in / Sign up

Export Citation Format

Share Document