scholarly journals Performance Metrics for Bluetooth Scatternet Scheduling Using Relays

2021 ◽  
Vol 9 (12) ◽  
pp. 1996-2001
Author(s):  
Ravi Kishore Veluri
Keyword(s):  
Ad Hoc ◽  
Performance Metrics ◽  
Relay Node ◽  
Poor Performance ◽  
Base Station ◽  
Relay Nodes ◽  
Communication Architecture ◽  
Technical Issues ◽  
Bluetooth Communication

Abstract: While various ad hoc mobile wireless networks are already accessible, Bluetooth is one of the most up-to-date. A single-hop connection known as piconet is a simple Bluetooth communication architecture, allowing for just eight functioning electronic equipment, seven of which are operational slaves under a single master. A common hub called a relay links a huge network named Scatternet to a number of piconets. The efficacy of Scatternet design is clearly intrinsically connected to the effectiveness of relay nodes. Because every relay has several piconet transactions to process and manage, a reduction in the number of switches might lead to poor performance instead. The major aim of this research is to examine performance characteristics which impact interplay since the role of the base station is to multiple piconet transitions. In this study, we evaluate and respond to the technical issues that must be optimally solved the Scatternet data flow based on the relay node. Keywords: Bluetooth, Piconet, Scatternet, Relay Node

scholarly journals Relay Based Performance Metrics of Bluetooth Scatternet Scheduling

2018 ◽  
Vol 11 (2) ◽  
pp. 469
Author(s):  
Ramachandran Kanagavalli ◽  
B. Sankaragomathi
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Performance Metrics ◽  
Relay Node ◽  
Poor Performance ◽  
Active Devices ◽  
Communication Topology ◽  
Efficient Data ◽  
Mobile Ad Hoc ◽  
Primary Focus

<p>Bluetooth is an emerging mobile ad-hoc network that accredits wireless communication to connect various short range devices.  A single hop network called piconet is the basic communication topology of bluetooth which allows only eight active devices for communication among them seven are active slaves controlled by one master. Multiple piconets are interconnected through a common node, known as Relay, to form a massive network called as Scatternet. It is obvious that the performance of Scatternet scheduling is highly dependent and directly proportionate with the performance of the Relay node.  In contrary, by reducing the number of Relays, it may lead to poor performance, since every Relay has to perform and support several piconet connections.  The primary focus of this study is to observe the performance metrics that affects the inter-piconet scheduling since the Relay node’s role is like switch between multiple piconets. In this paper, we address and analyze the performance issues to be taken into consideration for efficient data flow in Scatternet based on Relay node.</p>

scholarly journals A Fluid Model for a Relay Node in an Ad Hoc Network: Evaluation of Resource Sharing Policies

2008 ◽  
Vol 2008 ◽  
pp. 1-25 ◽  
Author(s):  
Michel Mandjes ◽  
Werner Scheinhardt
Keyword(s):  
Resource Sharing ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Fluid Model ◽  
Waiting Times ◽  
Relay Node ◽  
Arbitrary Point ◽  
Fluid Particle ◽  
Flow Transfer

Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are users who wish to transmit data through a specific node, each of them obtains a share of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction is used to serve the queue; here is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case has been addressed before; the present paper focuses on the intrinsically harder case , that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i) the stationary workload of the queue, (ii) the queueing delay, that is, the delay of a “packet” (a fluid particle) that arrives at an arbitrary point in time, (iii) the flow transfer delay, (iv) the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.

scholarly journals LoRaWAN Networking in Mobile Scenarios Using a WiFi Mesh of UAV Gateways

Electronics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 630
Author(s):  
Marco Stellin ◽  
Sérgio Sabino ◽  
António Grilo
Keyword(s):  
Unmanned Aerial Vehicle ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Base Station ◽  
Network System ◽  
The Core ◽  
End To End Delay ◽  
Aerial Vehicle ◽  
Connection Recovery

Immediately after a disaster, such as a flood, wildfire or earthquake, networks might be congested or disrupted and not suitable for supporting the traffic generated by rescuers. In these situations, the use of a traditional fixed-gateway approach would not be effective due to the mobility of the rescuers. In the present work, a double-layer network system named LoRaUAV has been designed and evaluated with the purpose of finding a solution to the aforementioned issues. LoRaUAV is based on a WiFi ad hoc network of Unmanned Aerial Vehicle (UAV) gateways acting as relays for the traffic generated between mobile LoRaWAN nodes and a remote Base Station (BS). The core of the system is a completely distributed mobility algorithm based on virtual spring forces that periodically updates the UAV topology to adapt to the movement of ground nodes. LoRaUAV has been successfully implemented in ns-3 and its performance has been comparatively evaluated in wild area firefighting scenarios, using Packet Reception Ratio (PRR) and end-to-end delay as the main performance metrics. It is observed that the Connection Recovery and Maintenance (CRM) and Movement Prediction (MP) mechanisms implemented in LoRaUAV effectively help improve the PRR, with the only disadvantage of a higher delay affecting a small percentage of packets caused by buffer delays and disconnections.

scholarly journals An Efficent Coverage and Maximization of Network Lifetime in WSN Through Metaheuristics

2021 ◽  
Vol 10 (3) ◽  
pp. 159
Author(s):  
A. Nageswar Rao ◽  
B. Rajendra Naik ◽  
L. Nirmala Devi
Keyword(s):  
Network Lifetime ◽  
Sensor Node ◽  
Relay Node ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Relay Node Placement ◽  
Data Forwarding ◽  
Relay Nodes ◽  
Node Placement

<span>In wireless sensor networks (WSNs), energy, connectivity, and coverage are the three most important constraints for guaranteed data forwarding from every sensor node to the base station. Due to continuous sensing and transmission tasks, the sensor nodes deplete more quickly and hence they seek the help of data forwarding nodes, called relay nodes. However, for a given set of sensor nodes, finding optimal locations to place relay nodes is a very challenging problem. Moreover, from the earlier studies, the relay node placement is defined as a non-deterministic polynomial tree hard (NP-Hard) problem. To solve this problem, we propose a multi-objective firefly algorithm-based relay node placement (MOFF-RNP) to deploy an optimal number of relay nodes while considering connectivity, coverage, and energy constraints. To achieve network lifetime, this work adopted energy harvesting capabilities to the sensor nodes and backup relay strategy such that every sensor node is always connected to at least one relay to forward the data. The optimal relay placement is formulated as an objective function and MOFF is applied to achieve a better solution. Extensive Simulations are carried out over the proposed model to validate the performance and the obtained results are compared with state-of-art methods)</span>

scholarly journals Cooperation between Trust and Routing Mechanisms for Relay Node Selection in Hybrid MANET-DTN

2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Jan Papaj ◽  
Lubomir Dobos
Keyword(s):  
Mobile Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Main Idea ◽  
Relay Node ◽  
Critical Factor ◽  
Relay Nodes ◽  
Node Selection ◽  
Relay Node Selection ◽  
Hoc Networks

Today’s mobile networks require integration of the different networks in order to transport data between mobile devices. The main problems of all networks occur if the communication paths are disconnected for a short time. The hybrid MANET-DTN is an evolution of the Mobile Ad Hoc Networks (MANET) and Delay/Disruption Tolerant Network (DTN) and it gives the possibilities of data transport between the disconnected islands of the nodes. The key problem is how to select reliable and secure nodes to transport messages between isolated islands with limited connectivity. The selection of the relay nodes is a critical factor because the data are transported via these devices in hostile environments. Two algorithms for a relay node selection based on trust are introduced. These algorithms are activated if the connections are disrupted. The selected relay nodes transport data across the disconnected environment via store-carry-forward mode. The proposed algorithms enable selecting reliable relay nodes based on collecting routing information and contact history. We introduce the network performance analyses of these algorithms. The main idea of the analyses is studying how the algorithms can affect the behaviour of the routing and forwarding mechanisms in the simulator OPNET modeler.

Interflow Network Coding Approaches for Data Heterogeneous Unicast Sessions in Wireless Networks

2016 ◽  
Vol 8 (1) ◽  
pp. 23-37
Author(s):  
Tuan Tran ◽  
Emmanuel Udoh ◽  
Tung Nguyen
Keyword(s):  
Network Coding ◽  
Network Performance ◽  
Ad Hoc ◽  
Relay Node ◽  
Access Point ◽  
Base Station ◽  
Size Difference ◽  
Bandwidth Efficiency ◽  
Network Bandwidth ◽  
Store And Forward

The authors investigate the problem of reliable unicast transmissions in wireless ad hoc and WLAN/WiMAX networks. Currently, approaches using network coding show several-fold gain in terms of bandwidth efficiency over the traditional technique, “store and forward”. However, most of these approaches have assumed that all the information flows have the same packet size, while the others consider transmission flows with different size packets, then overcome the size-difference issue by padding more dummy data into the smaller size packets. In their approach, by exploiting the size differences of packets on different flows, the authors introduce a new technique at the relay node/access point/base station to improve network bandwidth efficiency. In particular, a symbol-adjusted technique has been proposed in creating coded packets to improve the reliability of transmissions. Both analytical and simulation results show that the proposed technique significantly improves the network performance over the current technique.

Effect of CSI Imperfection on Cognitive Underlay Transmission over Nakagami-m Fading Channel

2015 ◽  
Vol 1 ◽  
pp. 59
Author(s):  
Nguyen Hong Giang ◽  
Vo Nguyen Quoc Bao ◽  
Hung Nguyen-Le
Keyword(s):  
Fading Channels ◽  
System Performance ◽  
Performance Metrics ◽  
Maximal Ratio Combining ◽  
Relay Nodes ◽  
Channel State ◽  
Primary Network ◽  
Secondary Network ◽  
System Designs ◽  
Approximate Expressions

This paper analyzes the performance of a cognitive underlay system over Nakagami-m fading channels, where maximal ratio combining (MRC) is employed at secondary destination and relay nodes. Under the condition of imperfect channel state information (CSI) of interfering channels, system performance metrics for the primary network and for the secondary network are formulated into exact and approximate expressions, which can be served as theoretical guidelines for system designs. To verify the performance analysis, several analytical and simulated results of the system performance are provided under various system and channel settings.

A Split Network based Routing Approach in Wireless Sensor Network to Enhance Network Stability

2019 ◽  
Vol 9 (4) ◽  
pp. 480-487 ◽  
Author(s):  
Hardeep S. Saini ◽  
Dinesh Arora
Keyword(s):  
Energy Consumption ◽  
Sensor Network ◽  
Energy Efficient ◽  
Cluster Head ◽  
Base Station ◽  
Operating Efficiency ◽  
Network Stability ◽  
Major Factors ◽  
Ch Selection

Background & Objective: The operating efficiency of a sensor network totally relies upon the energy that is consumed by the nodes to perform various tasks like data transmission etc. Thus, it becomes mandatory to consume the energy in an intelligent way so that the network can run for a long period. This paper proposed an energy efficient Cluster Head (CH) selection mechanism by considering the distance to Base Station (BS), distance to node and energy as major factors. The concept of volunteer node is also introduced with an objective to reduce the energy consumption of the CH to transmit data from source to BS. The role of the volunteer node is to transmit the data successfully from source to destination or BS. Conclusion: The results are observed with respect to the Alive nodes, dead nodes and energy consumption of the network. The outcome of the proposed work proves that it outperforms the traditional mechanisms.

Writing and Ritual in Deuteronomy 28

2017 ◽  
Author(s):  
Laura Quick
Keyword(s):  
Ad Hoc ◽  
Comparative Method ◽  
Literary Texts ◽  
History Of ◽  
Important Means ◽  
Written Word ◽  
Ritual Process ◽  
Different Cultures ◽  
Ritual Context

This chapter argue that ritual behaviours might be just as good a source as literary texts for the diffusion of traditional cursing and treaty material across different cultures in the ancient Near East. In particular, the role of ad hoc oral Targum in the ritual process could have been an important means by which traditions were shared between different language communities. Recognition of the ritual context of this material also provides insights for the comparative method, the dating and authorship of Deuteronomy 28, and the subversive impetus thought to have stood behind its composition. Ultimately, the function of the written word in a largely oral world is shown to be fundamental to understanding the composition, function and the early history of the curses in the book of Deuteronomy.

The African Union and Universal Jurisdiction

2017 ◽  
Author(s):  
Martin Mennecke
Keyword(s):  
Ad Hoc ◽  
Criminal Court ◽  
Universal Jurisdiction ◽  
African Union ◽  
Government Officials ◽  
African Government ◽  
Double Standards ◽  
Legal Principle ◽  
The Status

Universal jurisdiction permits states to investigate and prosecute perpetrators of certain widely condemned offences, irrespective of whether they possess any of the traditional territorial, nationality, or other jurisdictional links to the offence. As a legal principle, African states accept the principle of universal jurisdiction, but in the past decade they have pushed back against it due to the perception that the courts of various European states have unfairly targeted African government officials that they perceive as enemies. Against this background, the chapter examines the status of the universal jurisdiction debate and how it relates to the role of the International Criminal Court and that of the African Union and its member states, in addition to evaluating the proposals made by African states within the framework of the United Nations to address the African government concerns about double standards in the application of universal jurisdiction through a special ad hoc committee of the General Assembly.

Sign in / Sign up

Export Citation Format

Share Document