Helper Nodes Research Articles

On the Non-Existence of Minimum Storage Regenerating Codes With Repair-by-Transfer Property

Regenerating codes are the family of distributed storage codes that achieve the optimal trade-off between storage overhead and the bandwidth consumption for the repair of a single node failure. Recent research reveals that, with certain regenerating codes, the amount of disk read for the repair can be reduced to as much as the repair bandwidth (i.e., the amount of data to be transferred), which makes encoding at the helper nodes unnecessary. In literature, such a property is often referred to as the repair-by-transfer property. Searching for regenerating codes with the repair-by-transfer property has been of great interest. In this manuscript, we prove that there does not exist a minimum storage regenerating (MSR) code with the repair-by-transfer property for the case of $k\ge 3$ , $\beta , where $k$ is the number of storage nodes required to reconstruct the original file, $d$ is the number of helper nodes, and $\beta$ is the number of symbols transmitted from each helper node.

Helper Feedback based Medium Access Control Protocol: A Reliable Co-operative MAC Scheme for MANET

A novel multirate media access control based co-operative scheme has been proposed. It has been observed that any co-operative scheme gives a better performance only if the helper nodes selected to, relay the transmission from source to destination are reliable enough. Murad Khalid et.al has already proposed a protocol [24] where more than one helper nodes are selected to improve the reliability, so that if one fails the other can be used as a backup. But in this paper focus is on selection of reliable helpers. If a helper node has a high data rate, has successfully relayed traffic in the past and also has some minimum amount of energy left , not only for relaying traffic for others but also to conduct its own transmissions, then it acts as a suitable candidate to be chosen as a helper node. Such a co-operatives scheme enhances the throughput, reliability and overall performance of the network.Simulation has been conducted to show that the proposed scheme performs better than the.

Mitigation of primary user emulation attack in cognitive radio for secured medical body area networks

In recent years, the cognitive radio CR networks have lots of issues during the communication. The main and important issue to be concentrated is the primary user emulation attack PUEA. This primary user emulation attack PUEA is one of the main issues where it compromises the spectrum sensing. So to overcome this primary user emulation attack PUEA issue in the cognitive radio CR we are proposing an approach defence against PUEA attacks in cognitive radio medical body area networks MBANs. In this approach initial authentication of the primary user is done at the helper nodes. Later the network estimates the RSSI, distance and the time of arrival. Based on these parameters, it is possible for the network to have a secure communication between the nodes.

Performance Evaluation of a New Cooperative MAC Protocol with a Helper Node Selection Scheme in Ad Hoc Networks

A new cooperative MAC protocol called the busy tone cooperative medium access control (BT-COMAC) protocol is proposed to overcome the drawbacks and maximize the advantages of existing schemes. This scheme uses a new metric called decibel power to decide an appropriate helper node. Using received power strength is more efficient in selecting an appropriate helper node, especially in a densely populated network, than the effective transmission rates used in conventional schemes. All communication nodes in a communication service area are assumed to move independently. Two performance metrics are used: System throughput and channel access delay. A performance evaluation of the BT-COMAC protocol is conducted using a computer simulation over a slow fading wireless channel, and its performance results are compared with those of four existing schemes. The numerical results show that the BT-COMAC protocol improves the system throughput by approximately 15% as compared to the best existing scheme.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the "help-by-transfer" property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a non-trivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

TDMA-Based Cooperative MAC Protocol for Multi-Hop Relaying Networks

In this letter, we propose and analyze a time division multiple access (TDMA)-based cooperative medium access control (MAC) protocol for wireless multi-hop relaying networks. The fundamental drawback of a reservation-based MAC protocol is channel waste, i.e., the existence of idle slots. The proposed MAC, called cooperative relaying TDMA (CR-TDMA), allows a packet that is pre-assigned to a busy relay node to be reassigned to a neighbor node with an empty queue, i.e., a helper node. With the assistance of helper nodes, the relay node can process multiple packets during only one frame. Furthermore, CR-TDMA does not require additional overhead, such as mini-slots or additional packet header information for negotiations of cooperative communication. The numerical and simulation results show that CR-TDMA can significantly improve performance if helper nodes are available and can also guarantee equivalent or better performance than a conventional TDMA even in the worst cases.

Matched-Filter-based Spectrum Sensing for Secure Cognitive Radio Network Communications

increasing demand for wireless communication introduces efficient spectrum utilization challenge. To address this challenge, Cognitive Radio (CR) has emerged as the key technology, which enables opportunistic access to the spectrum. However, security is a very important issue but not well addressed in CR networks. In this paper, we focus on security problems arising from Primary User Emulation (PUE) attacks in CR networks where the selfish or malicious node emulates primary user's signals to prevent other secondary users from accessing that frequency band. Our system is based on the deployment of multiple stages of nodes, helper nodes in the first stage are stationary, close to primary user and responsible for detecting and authenticating primary user's signal based on matched filter spectrum-sensing technique. However, helper nodes in the next stages are placed within the primary user's coverage area and serve as bridges for forwarding the spectrum status information to enable secondary users to verify the cryptographic signature carried by the helper nodes' signals. Moreover, the effect of PUE attack on the performance of matched-filter-based spectrum-sensing technique is illustrated.

Adaptive Video Streaming for Wireless Networks with Multiple Users and Helpers

We consider the optimal design of a scheduling policy for adaptive video streaming in a wireless network formed by several users and helpers. A feature of such networks is that any user is typically in the range of multiple helpers. Hence, in order to cope with user-helper association, load balancing and inter-cell interference, an efficient streaming policy should allow the users to dynamically select the helper node to download from, and determine adaptively the video quality level of the download. In order to obtain a tractable formulation, we follow a "divide and conquer" approach: i) Assuming that each video packet (chunk) is delivered within its playback delay ("smooth streaming regime"), the problem is formulated as a network utility maximization (NUM), subject to queue stability, where the network utility function is a concave and componentwise non-decreasing function of the users' video quality measure. ii) We solve the NUM problem by using a Lyapunov Drift Plus Penalty approach, obtaining a scheme that naturally decomposes into two sub-policies referred to as "congestion control" (adaptive video quality and helper station selection) and "transmission scheduling" (dynamic allocation of the helper-user physical layer transmission rates).Our solution is provably optimal with respect to the proposed NUM problem, in a strong per-sample path sense. iii) Finally, we propose a method to adaptively estimate the maximum queuing delays, such that each user can calculate its pre-buffering and re-buffering time in order to cope with the fluctuations of the queuing delays. Through simulations, we evaluate the performance of the proposed algorithm under realistic assumptions of a network with densely deployed helper nodes, and demonstrate the per-sample path optimality of the proposed solution by considering a non-stationary non-ergodic scenario with user mobility, VBR video coding.

협력통신용 신규 도움노드 선정기법 설계 및 성능평가

In this paper, we carried out a study on how to find an appropriate helper node for cooperative communications, the role of which is very import to enhance system throughput of wireless communication system. The busy tone cooperative MAC (BT-COMAC) protocol proposed in this paper is a new cooperative MAC protocol with a reactive helper node scheme and maximizes the benefits of existing schemes while making up for their shortcomings. We conducted performance evaluation of this new protocol using computer simulation experiment. System throughput in bps and channel access delay are utilized as performance measures. We used a random way point mobility model where every communication node moves independently one another, and slow fading channel where every communication node decided its transmission rate with received power basis. Numerical results show that the new MAC protocol enhances system throughput as much as 15% of the existing scheme.

Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution

We present a new architecture to handle the ongoing explosive increase in the demand for video content in wireless networks. It is based on distributed caching of the content in femtobasestations with small or non-existing backhaul capacity but with considerable storage space, called helper nodes. We also consider using the wireless terminals themselves as caching helpers, which can distribute video through device-to-device communications. This approach allows an improvement in the video throughput without deployment of any additional infrastructure. The new architecture can improve video throughput by one to two orders-of-magnitude.

Deaf Cooperation for Secrecy With Multiple Antennas at the Helper

In this paper, we investigate the roles of cooperative jamming (CJ) and noise forwarding (NF) in improving the achievable secrecy rates of a Gaussian wiretap channel (GWT) when the helper node is equipped with multiple antennas. We decompose the channel from the helper to the eavesdropper into two orthogonal components: one is aligned in the direction of the channel between the helper and the legitimate receiver (direct component) and the other is in the orthogonal direction to the channel between the helper and the legitimate receiver (orthogonal component). We then propose a strategy in which the helper uses the orthogonal component to transmit pure Gaussian noise as in the CJ strategy while he uses the direct component for either CJ or NF depending on the given channel conditions. We explicitly derive the optimal power control policy for this strategy and give the achievable secrecy rates when the direct component is used to perform CJ or NF. We hence derive the channel conditions where CJ is better than NF over the direct component and vice-versa. Finally, we consider the reversely degraded multiple antenna relay-eavesdropper channel. We show that a simple strategy in which the relay jams with full power along the orthogonal component and transmits nothing in the direct component achieves a secrecy rate that approaches the secrecy capacity of this channel as the relay's average power goes to infinity. Moreover, we show that this result holds almost surely even if the relay-eavesdropper's channel state information is unavailable.

협력통신에서 도움노드 선정방법에 대한 비교연구

협력통신용 MAC 프로토콜은 주파수 자원이 한정된 무선통신망에서 프레임 전송속도를 증가시키는데 매우 중요한 역할을 담당한다. 본 논문에서는 협력통신용 MAC 프로토콜 기법에서 매우 중요한 협력노드를 선정하는 방법에 대하여 연구를 수행하였으며, 선행연구로서 기존에 제안된 도움노드 선정기법들을 컴퓨터 모의실험을 통해 성능평가를 직접 수행하여 성능결과를 서로 비교하였고, 각 기법의 장단점을 분석하였다. 성능평가 척도로는 시스템 처리량을 사용하였으며, 각 통신노드는 IEEE 802.11b 무선 랜 프로토콜을 사용하여 주어진 통신영역 내에서 자유롭게 이동하는 random way point 이동성 모델을 사용하였다. Cooperative communications play a important role in increasing frame transmission rate at wireless communication networks where frequency resource is strictly limited. In this paper, we did a research on how to select the helper nodes that are very import in cooperative communications. As a prelude study in this research field, we carried out performance comparison of three helper node selection schemes using computer simulation. The system throughput was used as the performance measure and the random way point mobility model, where every communicating nodes move around within the designated communication range, was used.

애드혹 네트워크에서 협력통신을 위한 도움노드 선정방법 비교연구

본 논문에서는 애드혹 무선 네트워크에서 채널 전송속도를 높일 수 있는 협력통신 기법에서 도움노드를 선정하는 방법에 대한 연구를 수행하였다. 송수신 노드가 RTS/CTS 제어 프레임을 서로 교환한 이후에 도움노드를 선정하는 사후선정 기법을 채용한 참고문헌 연구결과를 컴퓨터 모의실험을 사용하여 성능비교를 수행하기 위해 시뮬레이터를 구현하였다. 성능평가 척도는 시스템 처리량과 채널 액세스 지연시간을 사용하였으며, 통신노드는 모두 지정된 통신영역 내에서 독립적으로 이동하는 모델을 사용하였다. 성능비교와 장단점 분석을 통해 취합된 결과는 성능이 우수한 새로운 도움노드 선정기법을 설계하는데 귀중한 자료가 될 것으로 판단된다. In this paper, a study on finding an appropriate helper node that can help increase effective frame transmission rate for cooperative communications at ad hoc networks is carried out. Those researches from reference use the reactive helper node selection mechanism which starts its role after exchanging RTS and CTS frames between source and destination nodes, and are implemented into our simulator for performance comparison. System throughput and average channel access delay are used for performance measures and all communicating nodes are assumed to move independently within the communication range. It is anticipated that this research result can be used as basic information for designing a new efficient helper node selection scheme.

Cross-Layer Cooperative MAC Protocol in Distributed Wireless Networks

In this paper, we study medium access control (MAC) protocol design for distributed cooperative wireless networks. We focus on beneficial node cooperation by addressing two fundamental issues of cooperative communications, namely when to cooperate and whom to cooperate with, from a cross-layer protocol design perspective. In the protocol design, taking account of protocol overhead we explore a concept of cooperation region, whereby beneficial cooperative transmissions can be identified. We show that a rate allocation in the cooperation region provides higher link utilization than in a non-cooperation region. To increase network throughput, we propose an optimal grouping strategy for efficient helper node selection, and devise a greedy algorithm for MAC protocol refinement. Analysis of a successful transmission probability with cooperative or direct transmission is presented. Simulation results show that the proposed approach can effectively exploit beneficial cooperation, thereby improving system performance. Further, analytical and simulation results shed some light on the tradeoff between multi-user diversity gain at the physical layer and the helper contention overhead at the MAC layer.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional-repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional-repair is exact-repair where the replacement node is required to store data identical to that in the failed node. Exact-repair is of interest as it greatly simplifies system implementation. The first result of the paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d=n-1. This code has a particularly simple graphical description and most interestingly, has the ability to carry out exact-repair through mere transfer of data and without any need to perform arithmetic operations. Hence the term `repair-by-transfer'. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact-repair, thus pointing to the existence of a separate tradeoff under exact-repair. Specifically, we identify a set of scenarios, termed `helper node pooling', and show that it is the necessity to satisfy such scenarios that over-constrains the system.

DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

CoopMACA: a cooperative MAC protocol using packet aggregation

In this paper we propose a cooperative MAC protocol for Wireless Local Area Networks (WLAN) that involves the concept of cooperation among nodes to avoid the negative effect caused by multi rate modulation employed in IEEE 802.11 standards. In our proposed protocol a low data rate direct transmission link is replaced by two faster transmission links using a relay node. During transmission, each node selects either direct or indirect transmission (through a helper node) in order to minimize the total transmission time and utilizes the packet aggregation concept to improve the system throughput. The new protocol does not violate the inter frame space specified in IEEE 802.11 and shows compatibility with the standard. We give the mathematical analysis that shows that our proposed protocol increases the system throughput considerably in comparison to the existing ones. The analytical results are supported with the help of simulation. We have shown how this protocol can be implemented in combination with others to improve the system throughput in specific network scenarios.

Optimal timer based selection schemes

Timer-based mechanisms are often used to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a monotone non-increasing function of its local suitability metric. The best node is selected successfully if no other node's timer expires within a 'vulnerability' window after its timer expiry, and so long as the sink can hear the available nodes. In this paper, we show that the optimal metric-to-timer mapping that (i) maximizes the probability of success or (ii) minimizes the average selection time subject to a minimum constraint on the probability of success, maps the metric into a set of discrete timer values. We specify, in closed-form, the optimal scheme as a function of the maximum selection duration, the vulnerability window, and the number of nodes. An asymptotic characterization of the optimal scheme turns out to be elegant and insightful. For any probability distribution function of the metric, the optimal scheme is scalable, distributed, and performs much better than the popular inverse metric timer mapping. It even compares favorably with splitting-based selection, when the latter's feedback overhead is accounted for.

CoopMAC: A Cooperative MAC for Wireless LANs

Due to the broadcast nature of wireless signals, a wireless transmission intended for a particular destination station can be overheard by other neighboring stations. A focus of recent research activities in cooperative communications is to achieve spatial diversity gains by requiring these neighboring stations to retransmit the overheard information to the final destination. In this paper we demonstrate that such cooperation among stations in a wireless LAN (WLAN) can achieve both higher throughput and lower interference. We present the design for a medium access control protocol called CoopMAC, in which high data rate stations assist low data rate stations in their transmission by forwarding their traffic. In our proposed protocol, using the overheard transmissions, each low data rate node maintains a table, called a CoopTable, of potential helper nodes that can assist in its transmissions. During transmission, each low data rate node selects either direct transmission or transmission through a helper node in order to minimize the total transmission time. Using analysis, simulation and testbed experimentation, we quantify the increase in the total network throughput, and the reduction in delay, if such cooperative transmissions are utilized. The CoopMAC protocol is simple and backward compatible with the legacy 802.11 system. In this paper, we also demonstrate a reduction in the signal-to-interference ratio in a dense deployment of 802.11 access points, which in some cases is a more important consequence of cooperation