scholarly journals Naming in Multichannel with Beeps in the Strong Model

2020 ◽  
Vol 10 (20) ◽  
pp. 7164
Author(s):  
Layla S. Aldawsari ◽  
Tom Altman

In this paper, a system of anonymous processes is considered that communicates with beeps through multiple channels in a synchronous communication model. In beeping channels, processes are limited to hearing either a beep or a silence from the channel with no collision detection. A strong model is assumed in which a process can beep on any single channel and listen on any specific channel during a single round. The goal is to develop distributed naming algorithms for two models where the number of processes is either known or unknown. A Las Vegas algorithm was developed for naming anonymous processes when the number of processes is known. This algorithm has an optimal time complexity of O(nlogn) rounds and uses O(nlogn) random bits, where n is the number of processes for the largest group. For the model with an unknown number of processes, a Monte Carlo algorithm was developed, which has an optimal running time of O(nlogn) rounds and a probability of success that is at least 1−12Ω(logn). The algorithms solve the naming problem in new models where processes communicate through multiple channels.

2016 ◽  
Vol 755 ◽  
pp. 452-455 ◽  
Author(s):  
Alfred Švarc ◽  
Mirza Hadžimehmedović ◽  
Hedim Osmanović ◽  
Jugoslav Stahov ◽  
Lothar Tiator ◽  
...  

2004 ◽  
Vol 15 (01) ◽  
pp. 73-88
Author(s):  
KOJI NAKANO

A Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by n processing units referred to as stations. The stations can communicate by broadcasting/receiving a data packet to one of k distinct communication channels. We assume that the stations run on batteries and expend power while broadcasting/receiving a data packet. Thus, the most important measure to evaluate algorithms on the BCM is the number of awake time slots, in which a station is broadcasting/receiving a data packet. The main contribution of this paper is to present time and energy optimal list ranking algorithms on the BCM. We first show that the rank of every node in an n-node linked list can be determined in O(n) time slots with no station being awake for more than O(1) time slots on the single-channel n-station BCM with no collision detection. We then extend this algorithm to run on the k-channel BCM. For any small fixed ∊>0, our list ranking algorithm runs in [Formula: see text] time slots with no station being awake for more than O(1) time slots, provided that k≤n1-∊. Clearly, [Formula: see text] time is necessary to solve the list ranking problem for an n-node linked list on the k-channel BCM. Therefore, our list ranking algorithm on the k-channel BCM is time and energy optimal.


1989 ◽  
Vol 238 (1291) ◽  
pp. 155-170 ◽  

Membrane patches usually contain several ion channels of a given type. However, most of the stochastic modelling on which data analysis (in particular, estimation of kinetic constants) is currently based, relates to a single channel rather than to multiple channels. Attempts to circumvent this problem experimentally by recording under conditions where channel activity is low are restrictive and can introduce bias; moreover, possibly important information on how multichannel systems behave will be missed. We have extended existing theory to multichannel systems by applying results from point process theory to derive some distributional properties of the various types of sojourn time that occur when a given number of channels are open in a system containing a specified number of independent channels in equilibrium. Separate development of properties of a single channel and the superposition of several such independent channels simplifies the presentation of known results and extensions. To illustrate the general theory, particular attention is given to the types of sojourn time that occur in a two channel system; detailed expressions are presented for a selection of models, both Markov and non-Markov.


2006 ◽  
Author(s):  
Jiang Zhe ◽  
Ashish Jagtiani ◽  
Nazmul Mamun ◽  
Prashanta Dutta ◽  
Jun Hu ◽  
...  

We describe a micromachined. resistive pulse sensor with multiple sensing microchannels. A unique design placing measurement microelectrodes in the center of the microchannels is demonstrated. This design creates isolation resistances among channels and thus circumvents the crosstalk caused by automatic electrical connection among microchannels. When implemented using microscale channels, the design is appropriate for the sensing of microscale particles in deionized water or in very dilute electrolyte solution; using nanoscale channels, the design is appropriate for the sensing of nanoscale particles in electrolyte solutions of any concentration. The design has multiple channels operating in parallel, but integrated with just one sample reservoir and one power source. The results with a four-channel device show that this device is capable of differentiating and counting micro polymethacrylate particles and Juniper pollens rapidly. The throughput is improved significantly in comparison to a single channel device. The concept can be extended to a large number of sensing channels in a single chip for significant improvement in throughput.


2014 ◽  
Vol 31 (1) ◽  
pp. 118-135 ◽  
Author(s):  
Yuepeng Wang ◽  
Yuexuan Wang ◽  
Dongxiao Yu ◽  
Jiguo Yu ◽  
Francis C. M. Lau

2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Jungmin So ◽  
Joosang Lee

As the density of wireless LANs increases, performance degradation caused by hidden terminals and exposed terminals becomes significant. These problems come from carrier sensing based medium access control used in current wireless LANs. Hidden terminals are created if carrier sense threshold is too high, whereas exposed terminals are created if carrier sense threshold is too low. A good threshold depends on how far nodes are placed from their destinations, but that cannot be controlled by the system. In this paper, we propose a simple scheme that makes use of multiple channels. Multiple channels could be utilized by equipping multiple radios or using advanced hardware such as SDR to divide a single channel into multiple channels. Nodes are assigned channels based on their estimated distance from the AP. Once the assignment is done, carrier sense threshold for the channel is selected so that as many concurrent transmissions take place as possible, while preventing hidden terminals. Simulation results show that the proposed mechanism achieves significantly higher throughput without causing starvation at the edge nodes.


2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Li-Wei Ko ◽  
S. S. K. Ranga ◽  
Oleksii Komarov ◽  
Chung-Chiang Chen

Numerous EEG-based brain-computer interface (BCI) systems that are being developed focus on novel feature extraction algorithms, classification methods and combining existing approaches to create hybrid BCIs. Several recent studies demonstrated various advantages of hybrid BCI systems in terms of an improved accuracy or number of commands available for the user. But still, BCI systems are far from realization for daily use. Having high performance with less number of channels is one of the challenging issues that persists, especially with hybrid BCI systems, where multiple channels are necessary to record information from two or more EEG signal components. Therefore, this work proposes a single-channel (C3 or C4) hybrid BCI system that combines motor imagery (MI) and steady-state visually evoked potential (SSVEP) approaches. This study demonstrates that besides MI features, SSVEP features can also be captured from C3 or C4 channel. The results show that due to rich feature information (MI and SSVEP) at these channels, the proposed hybrid BCI system outperforms both MI- and SSVEP-based systems having an average classification accuracy of 85.6 ± 7.7% in a two-class task.


2017 ◽  
Vol 41 (S1) ◽  
pp. S145-S145
Author(s):  
S. Yariv ◽  
G. Shahaf ◽  
B. Bloch ◽  
A. Reshef ◽  
Y. Bloch

IntroductionThe evaluation of response to pharmacological treatment in MDD requires 6–8 weeks. Therefore, the ability to predict response, and especially lack of response to treatment, as early as possible after treatment onset or change, is of major significance. Many studies demonstrated significant results regarding the ability to use EEG and ERP markers. However, these markers are derived from long EEG/ERP samples, often from multiple channels, which render them impractical for frequent sampling.MethodsWe developed a new electrophysiological attention-related marker from a single channel (2 electrodes) and 1 minute samples. This work presents an initial evaluation of the ability to harness this marker, for early differentiation between responders and non-responders to anti-depressive treatment, in 26 patients with various levels of depression and heterogeneous treatment interventions and 10 healthy controls. Subjects who initiated treatment for depression were followed clinically through their Hamilton depression scores as well as their EEG activity twice a week for a period of 8 weeks. Any acceptable anti-depressive treatment been included. The improvement in Hamilton scores at the end of 8 weeks used to discriminate responders and non-responders.ResultsWithin two weeks, we could differentiate between non-responders and responders to anti-depressive treatment, with absolute discrimination between subjects with moderate to severe depression, and with 0.71 sensitivity and 0.96 specificity within the whole depressed subjects.ConclusionsThis is a proof of concept for an easy to use, cheap and quick marker for the lack of respond to anti-depressive treatment within two weeks of anti-depressive treatment.


Sign in / Sign up

Export Citation Format

Share Document