Data Routing Algorithms in Extended Lucas Cube Networks

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.

Download Full-text

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

Multimedia Tools and Applications ◽

10.1007/s11042-021-10901-4 ◽

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

Download Full-text

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

Wireless Networks ◽

10.1007/s11276-021-02569-3 ◽

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.

Download Full-text