Bounds on the delay-constrained capacity of UWB communication with a relay node

2009 ◽  
Vol 8 (5) ◽  
pp. 2265-2273 ◽  
Author(s):  
Zolfa Zeinalpour-Yazdi ◽  
Masoumeh Nasiri-Kenari ◽  
Behnaam Aazhang ◽  
Joachim Wehinger ◽  
Christoph Mecklenbrauker
2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.


2009 ◽  
Vol 29 (7) ◽  
pp. 1877-1879
Author(s):  
Lin SUN ◽  
Wen-hua QIN ◽  
Jian-ping ZHAO
Keyword(s):  

Author(s):  
Arvind Kakria ◽  
Trilok Chand Aseri

Background & Objective: Wireless communication has immensely grown during the past few decades due to significant demand for mobile access. Although cost-effective as compared to their wired counterpart, maintaining good quality-of-service (QoS) in these networks has always remained a challenge. Multiple-input Multiple-output (MIMO) systems, which consists of multiple transmitter and receiver antennas, have been widely acknowledged for their QoS and transmit diversity. Though suited for cellular base stations, MIMO systems are not suited for small-sized wireless nodes due to their hardware complexity, cost, and increased power requirements. Cooperative communication that allows relays, i.e. mobile or fixed nodes in a communication network, to share their resources and forward other node’s data to the destination node has substituted the MIMO systems nowadays. To harness the full benefit of cooperative communication, appropriate relay node selection is very important. This paper presents an efficient single-hop distributed relay supporting medium access control (MAC) protocol (EDSRS) that works in the single-hop environment and improves the energy efficiency and the life of relay nodes without compensating the throughput of the network. Methods: The protocol has been simulated using NS2 simulator. The proposed protocol is compared with energy efficient cooperative MAC protocol (EECOMAC) and legacy distributed coordination function (DCF) on the basis of throughput, energy efficiency, transmission delay and an end to end delay with various payload sizes. Result and Conclusion: The result of the comparison indicates that the proposed protocol (EDSRS) outperforms the other two protocols.


Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.


Sign in / Sign up

Export Citation Format

Share Document