A tool for the analysis of reconfiguration and routing algorithms in irregular networks

1998 ◽  
pp. 159-173 ◽  
Author(s):  
Rafael Casado ◽  
Bianca Caminero ◽  
Pedro Cuenca ◽  
Francisco Quiles ◽  
Antonio Garrido ◽  
...  
Keyword(s):  
Routing Algorithms ◽  
Irregular Networks

Multispanning Tree Zone-Ordered Label-Based Routing Algorithms for Irregular Networks

2011 ◽  
Vol 22 (5) ◽  
pp. 817-832 ◽  
Author(s):  
R. Moraveji ◽  
P. Moinzadeh ◽  
H. Sarbazi-Azad ◽  
A.Y. Zomaya
Keyword(s):  
Routing Algorithms ◽  
Irregular Networks

An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks

2007 ◽  
Vol 18 (3) ◽  
pp. 320-333 ◽  
Author(s):  
Akiya Jouraku ◽  
Michihiro Koibuchi ◽  
Hideharu Amano
Keyword(s):  
Routing Algorithms ◽  
Irregular Networks ◽  
Effective Design

Data Object Routing Algorithms for Data Aware Networking

2019 ◽  
Vol 7 (4) ◽  
pp. 644-646
Author(s):  
O.Koteswara Rao ◽  
Y K Sundara Krishna ◽  
G K Mohan Devarakonda
Keyword(s):  
Routing Algorithms ◽  
Data Object

Physical Layer Security in Multi-hop Relay Networks with Modified Dijkstra's Routing Algorithms

2020 ◽  
Author(s):  
Nguyen Thi Yen Linh ◽  
Chan Dai Truyen Thai ◽  
Vo Nguyen Quoc Bao ◽  
Huynh Van Hoa
Keyword(s):  
Physical Layer Security ◽  
Relay Networks ◽  
Physical Layer ◽  
Routing Algorithms

scholarly journals Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan
Keyword(s):  
High Performance ◽  
Geographical Area ◽  
Mobility Model ◽  
Routing Algorithms ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Key Factors ◽  
Network Algorithms ◽  
Music Festival ◽  
Social Metrics

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.

Competitive swarm optimization based unequal clustering and routing algorithms (CSO-UCRA) for wireless sensor networks

2021 ◽  
Author(s):  
P. C. Srinivasa Rao ◽  
Praveen Lalwani ◽  
Haider Banka ◽  
G. Siva Nageswara Rao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Swarm Optimization

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

Sign in / Sign up

Export Citation Format

Share Document