scholarly journals Energy-Efficient and Reliable Face-Routing Scheme in Wireless Networks

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2746
Author(s):  
Hyunchong Cho ◽  
Sangdae Kim ◽  
Seungmin Oh ◽  
Euisin Lee ◽  
Sang-Ha Kim
Keyword(s):  
Energy Efficiency ◽  
Geographic Routing ◽  
Data Delivery ◽  
Data Packets ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Success Ratio ◽  
Transmission Reliability ◽  
Face Routing ◽  
Recovery Schemes

Face-routing is one of the reliable recovery schemes when geographic routing fails to transmit data packets. Although studies on face-routing can overcome the failure of the data transmission, they lead to much energy consumption due to frequent data transmissions between adjacent nodes for carrying out the rule of face-routing. To avoid the frequent data transmissions, several face-routing schemes have been recently proposed to transmit data packets to the farthest-neighbor node. However, they happen with many data retransmissions because the farthest-neighbor node has a relatively low transmission success ratio. To solve this problem, we propose a new face-routing scheme that determines the most appropriate neighbor node to balance the trade-off between energy efficiency and transmission reliability with two viewpoints. The first viewpoint focuses on how to increase the distance progress of the data delivery in one-hop range to enhance energy efficiency. After that, the second viewpoint focuses on how to increase the success ratio of the data delivery to enhance the transmission reliability. As a result of the simulation, it was confirmed that the proposed method achieves better performance in terms of energy efficiency than existing face-routing research, and it is better than recent face-routing research in terms of reliability and retransmission.

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.

scholarly journals Evaluating CRoS-NDN: a comparative performance analysis of a controller-based routing scheme for named-data networking

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
João Vitor Torres ◽  
Igor Drummond Alvarenga ◽  
Raouf Boutaba ◽  
Otto Carlos Muniz Bandeira Duarte
Keyword(s):  
Distribution Networks ◽  
Content Distribution Networks ◽  
Named Data Networking ◽  
Comparative Performance ◽  
Delay Performance ◽  
Data Packets ◽  
Routing Scheme ◽  
Wide Range ◽  
New Locations ◽  
Data Networking

Abstract The huge amount of content names available in Named-Data Networking (NDN) challenges both the required routing table size and the techniques for locating and forwarding information. Content copies and content mobility exacerbate the scalability challenge to reach content in the new locations. We present and analyze the performance of a proposed Controller-based Routing Scheme, named CRoS-NDN, which preserves NDN features using the same interest and data packets. CRoS-NDN supports content mobility and provides fast content recovery from copies that do not belong to the consumer-producer path because it splits identity from location without incurring FIB size explosion or supposing prefix aggregation. It provides features similar to Content Distribution Networks (CDN) in NDN, and improves the routing efficiency. We compare our proposal with similar routing protocols and derive analytical expressions for lower-bound efficiency and upper-bound latency. We also conduct extensive simulations to evaluate results in data delivery efficiency and delay. The results show the robust behavior of the proposed scheme achieving the best efficiency and delay performance for a wide range of scenarios. Furthermore, CRoS-NDN results in low use of processing time and memory for a growing number of prefixes.

scholarly journals Inter-UAV Routing Scheme Testbeds

Drones ◽  
2020 ◽  
Vol 5 (1) ◽  
pp. 2
Author(s):  
Georgios Amponis ◽  
Thomas Lagkas ◽  
Panagiotis Sarigiannidis ◽  
Vasileios Vitsas ◽  
Panagiotis Fouliras
Keyword(s):  
Signal To Noise Ratio ◽  
Real Life ◽  
Simulation Software ◽  
Propagation Models ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Related Information ◽  
Efficient Control ◽  
Communication Architectures ◽  
Scheme Evaluation

With the development of more advanced and efficient control algorithms and communication architectures, UAVs and networks thereof (swarms) now find applications in nearly all possible environments and scenarios. There exist numerous schemes which accommodate routing for such networks, many of which are specifically designed for distinct use-cases. Validation and evaluation of routing schemes is implemented for the most part using simulation software. This approach is however incapable of considering real-life noise, radio propagation models, channel bit error rate and signal-to-noise ratio. Most importantly, existing frameworks or simulation software cannot sense physical-layer related information regarding power consumption which an increasing number of routing protocols utilize as a metric. The work presented in this paper contributes to the analysis of already existing routing scheme evaluation frameworks and testbeds and proposes an efficient, universal and standardized hardware testbed. Additionally, three interface modes aimed at evaluation under different scenarios are provided.

scholarly journals Energy-Efficient and Disjoint Multipath Using Face routing in Wireless Sensor Networks

Energies ◽  
2021 ◽  
Vol 14 (22) ◽  
pp. 7823
Author(s):  
Hyunchong Cho ◽  
Seungmin Oh ◽  
Yongje Shin ◽  
Euisin Lee
Keyword(s):  
Energy Consumption ◽  
Average Energy ◽  
Packet Transmission ◽  
Destination Node ◽  
Path Generation ◽  
Data Packets ◽  
Hole Area ◽  
Face Routing ◽  
Multiple Routes ◽  
Average Energy Consumption

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

scholarly journals Optimizations for Energy Efficiency in Software-Defined Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4779
Author(s):  
Sorin Buzura ◽  
Bogdan Iancu ◽  
Vasile Dadarlat ◽  
Adrian Peculea ◽  
Emil Cebuc
Keyword(s):  
Energy Efficiency ◽  
Network Performance ◽  
Wireless Sensor ◽  
Management Approach ◽  
Control Plane ◽  
Data Broadcast ◽  
Data Packets ◽  
Similar Work ◽  
And Performance ◽  
The Individual

Software-defined wireless sensor networking (SDWSN) is an emerging networking architecture which is envisioned to become the main enabler for the internet of things (IoT). In this architecture, the sensors plane is managed by a control plane. With this separation, the network management is facilitated, and performance is improved in dynamic environments. One of the main issues a sensor environment is facing is the limited lifetime of network devices influenced by high levels of energy consumption. The current work proposes a system design which aims to improve the energy efficiency in an SDWSN by combining the concepts of content awareness and adaptive data broadcast. The purpose is to increase the sensors’ lifespan by reducing the number of generated data packets in the resource-constrained sensors plane of the network. The system has a distributed management approach, with content awareness being implemented at the individual programmable sensor level and the adaptive data broadcast being performed in the control plane. Several simulations were run on historical weather and the results show a significant decrease in network traffic. Compared to similar work in this area which focuses on improving energy efficiency with complex algorithms for routing, clustering, or caching, the current proposal employs simple computing procedures on each network device with a high impact on the overall network performance.

scholarly journals Erasure channel modelling–based secure bit allocation schemes for multipath routing in wireless sensor networks

2016 ◽  
Vol 12 (12) ◽  
pp. 155014771668360
Author(s):  
Zhenhua Yuan ◽  
Chen Chen ◽  
Ye Jin
Keyword(s):  
Energy Efficiency ◽  
Channel Model ◽  
Multipath Routing ◽  
Optimal Solution ◽  
Wireless Channel ◽  
Bit Allocation ◽  
Wireless Sensor ◽  
Routing Scheme ◽  
Erasure Channel ◽  
Binary Erasure Channel

In this article, we study secure multipath routing with energy efficiency for a wireless sensor network in the presence of eavesdroppers. We consider two objectives: (1) the multipath routing scheme for maximising the energy efficiency with security constraints and (2) the multipath routing scheme for maximising the secrecy capacity. The binary erasure channel model is adopted to describe the wireless channel states among neighbouring nodes. Based on the binary erasure channel model, the problem of multipath routing degrades to a problem of bit allocation for each path. We formulate the problems and find that the problems are both quasi-convex. For the first one, it is a linear fractional optimisation problem. The optimal solution is obtained by the Charnes–Cooper transformation. For the second one, we propose an iterative algorithm to obtain the [Formula: see text]-optimal solution. The performance analysis shows that the probability of the secure bit allocation increases along with the number of multipaths and decreases along with the number of hops per path and eavesdroppers. Simulation results are presented to illustrate the proposed algorithms.

scholarly journals Fault-Tolerant Energy-Efficient Priority-Based Routing Scheme for the Multisink Healthcare Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Ather Saeed ◽  
Andrew Stranieri ◽  
Richard Dazeley
Keyword(s):  
Sensor Networks ◽  
Shortest Path ◽  
Fault Tolerant ◽  
Cost Effective ◽  
Well Being ◽  
Habitat Monitoring ◽  
Data Packets ◽  
Routing Scheme ◽  
Multiple Paths ◽  
Timely Dissemination

Wireless sensor networks (WSNs) are widely used in battle fields, logistic applications, healthcare, habitat monitoring, environmental monitoring, home security, and variety of other areas. The existing routing algorithms focus on the delivery of data packets to the sink using the shortest path; however, calculating the shortest path is not a cost-effective solution while disseminating datasets of interest to the nearest sink node. The approach presented in this paper extends the existing PBR (priority-based routing) protocol by providing a new fault-tolerant multipath priority-based routing (FT-MPPBR) scheme, which not only balances the energy consumption while selecting multiple paths but also balances the workload of the node closest to the sink. The nodes closer to the sink dissipate more energy and can become the source of a communication bottleneck. Simulation results for the proposed routing scheme are encouraging and clearly show that the FT-MPPBR has outperformed the existing PBR schemes in terms of prolonging the network lifetime and reliability. In healthcare sensor networks, timely dissemination of datasets is critical for the well-being of a patient. This research further extends the PBR architecture for supporting computational intensive analysis by transferring datasets of interest to the sensor grid node for improved communication and better throughput.

Sign in / Sign up

Export Citation Format

Share Document