P2P Networks Considering Sybil-Proof with the Reputation of Social Link

2013 ◽  
Vol 446-447 ◽  
pp. 1596-1600
Author(s):  
Zong Yuan Guo ◽  
Carlos Madrazo ◽  
Keiichi Koyanag
Keyword(s):  
Random Walk ◽  
Routing Algorithm ◽  
P2p Networks ◽  
Sybil Attack ◽  
Large Size ◽  
Routing Table ◽  
Social Link ◽  
Sybil Attacks

In P2P networks, malice peers forge identity to interrupt routing, called Sybil attack. To avoid it, methods in related works consider routing as random walk. Since the destination of random walk is hard to predict, Sybil-proof P2P networks need large routing information to support routing. However, a large size routing table constrains the scalability of the system. Therefore, we aim to develop a routing algorithm to satisfy the requirement of P2P networks which has a good performance at Sybil-Proof by using a reasonable size of routing table. Social links are useful to prevent a Sybil attack because friend peers have little chance to be a Sybil peer. In this proposed method, reputation of social link is useful for achieving this objective. Considering the distance to destination peers can help for routing efficiency and considering the reputation can make routing to have better performance resisting Sybil-attacks.

Research on MANET Routing Algorithm Based on Ant Colony Algorithm

2011 ◽  
Vol 135-136 ◽  
pp. 781-787
Author(s):  
Yong Feng Ju ◽  
Hui Chen
Keyword(s):  
Network Lifetime ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Ant Colony ◽  
Dynamic Allocation ◽  
Routing Table ◽  
Manet Routing ◽  
Rate Dynamic

This paper proposed a new Ad Hoc dynamic routing algorithm, which based on ant-colony algorithm in order to reasonably extend the dynamic allocation of network traffic and network lifetime. The Algorithm choose path according transmission latency, path of the energy rate, congestion rate, dynamic rate. The Algorithm update the routing table by dynamic collection of path information after path established. The analyse shows that algorithm increases the network throughput, reduces the average end-to-end packet transmission latency, and extends the network lifetime, achieves an improving performance.

scholarly journals Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3

2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Gede Andika Loka
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Dynamic Routing ◽  
Simulation Software ◽  
Small Scale ◽  
Network Dynamic ◽  
Link State ◽  
Routing Table ◽  
Static Routing

Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router configuration. Routing table is anaddress list of source and destination address where the packet will be routed. There are two methods of routing tableconfiguration, static routing and dynamic routing. Static routing is a routing table configuration method where all ofrouting table content is configured manually, usually for a small scale of network. Dynamic network is a routing tableconfiguration method by the router automatically, usually for a big scale of network. A dynamic routing is built fromthe routing information collected by the routing algorithm. There are two routing algorithm, link-state and distancevector algorithm. This simulation will be built in GNS3 simulation software. Goal of this research is to compare theperformance between that two algorithm from two routing protocol that using each of those two algorithm. Thecomparison will be running between OSPF routing protocol on the link state routing protocol and EIGRP on thedistance vector routing protocol side. The result of this analysis and comparison of those two routing protocol isexpected to be a reference of choosing better routing protocol in building a network

scholarly journals A Two-Level Communication Routing Algorithm Based on Vehicle Attribute Information for Vehicular Ad Hoc Network

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Chenguang He ◽  
Guanqiao Qu ◽  
Liang Ye ◽  
Shouming Wei
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Vehicular Ad Hoc Network ◽  
Network Simulator ◽  
Cluster Heads ◽  
Large Size ◽  
Attribute Information ◽  
On The Road

Recently, the research on the vehicular ad hoc network (VANET) has been paid more attention by researchers with the quick development of the autonomous driving technology. In the VANET, vehicles can communicate with everything through the route established by routing algorithms. However, the topology of the VANET changes fast because the vehicles move fast. Also, as the number of vehicles increases, the probability of data collision and the transmission latency will also increase when communicating. Therefore, the VANET needs a stable, low-latency, and efficient route for vehicles to communicate with each other. However, the existing routing algorithms are either unable to aggregate data or are not suitable for the large-size VANET. In this paper, we consider the vehicle attribute information comprehensively and cluster the vehicles on the road by using the cluster algorithm we propose. We dynamically select the cluster heads at each moment according to their attribute information. We consider all kinds of nodes in the network and the vehicle nodes will communicate with each other through the cluster heads under the two-level communicating algorithm we propose. Compared with the existing cluster routing algorithm, the algorithm we propose is much more suitable for the large-size VANET because the cluster heads do not need a gateway to help them communicate. In the simulation part, we set some real street scenes in Simulation of Urban Mobility (SUMO) and the vehicles can move by the traffic rules like in the real world, which is more suitable for the VANET. After analysing the communication performance in Network Simulator version 2 (NS2), we can get a conclusion that the algorithm proposed is superior to the traditional routing algorithm. The route established by the algorithm we propose is much more stable and efficient. And the latency is also lower than the former.

A NEW FAULT-TOLERANT BROADCAST ROUTING ALGORITHM ON MESH NETWORKS

2010 ◽  
Vol 11 (03n04) ◽  
pp. 175-187 ◽  
Author(s):  
GAOCAI WANG ◽  
JIANER CHEN ◽  
CHUANG LIN
Keyword(s):  
Failure Probability ◽  
Mesh Networks ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Success Probability ◽  
Network Size ◽  
Large Size ◽  
Broadcast Routing ◽  
Network Topologies ◽  
High Success Probability

Mesh networks are a kind of very important network topologies in massively multicomputer parallel systems. One-to-all or broadcast communication is one of the most important routing patterns and can be applied in many important applications. With the continuous increment in network size, routing in large size mesh networks with faults is unavoidable. In this paper, we propose a new fault-tolerant, local-information-based, and distributed broadcast routing algorithm based on the concept of k-submesh in all-port mesh networks. We suppose that each node has independent failure probability, under the assumption, we analyze the fault tolerance of our algorithm. We show that our routing algorithm is highly fault tolerant and has a high success probability to broadcast messages. For example, we formally prove that if the node failure probability is bounded by 0.12%, our broadcast routing algorithm works successfully with probability at least 99%. Simulation results show that our algorithm is efficient and effective in practice and theory, and the time steps of our algorithm is very close to the optimum.

scholarly journals A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph

2016 ◽  
Vol 16 (2) ◽  
pp. 46-59 ◽  
Author(s):  
Chuiwei Lu ◽  
Defa Hu
Keyword(s):  
Fault Tolerant ◽  
Low Cost ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
De Bruijn Graph ◽  
Malicious Nodes ◽  
Routing Table ◽  
Topology Information ◽  
De Bruijn

Abstract Wireless Sensor Network (WSNs) nodes with low energy, run out of energy easily and stop working, which results then in routing failures and communication blocking. The paper puts forward a FTRSDDB algorithm based on the structured directional de Bruijn graph to enhance the performance of faulttolerant routing for WSNs. The algorithm randomly deploys some super nodes with abundant energy and powerful performance in WSNs. These nodes are responsible for the collection of topology information from the WSNs to build redundant routing table, and provide data forwarding and routing update service for popular nodes. The FTRSDDB algorithm optimizes network topology structure using de Bruijn graph, and can quickly find neighbor nodes failure and invalid routing path, and then calculate new routing information with low cost, which greatly improves the performance of fault-tolerant routing of WSNs. Experiments show that the FTRSDDB algorithm takes on better performance compared with other faulttolerant routing algorithms, even that exist malicious nodes attack in the WSNs.

Sign in / Sign up

Export Citation Format

Share Document