Research and Solution on Bottleneck Problem in Zigbee

2014 ◽  
Vol 989-994 ◽  
pp. 4115-4118
Author(s):  
Jian Ping Zhang ◽  
Xiao Ling Zeng
Keyword(s):  
Delivery Ratio ◽  
Parallel Transmission ◽  
Tree Network ◽  
Hidden Node ◽  
Beacon Frame ◽  
Centralized Algorithm ◽  
Simulation Results ◽  
Time And Energy ◽  
Entire Network ◽  
Node Problem

When the root is collecting data at a tree-based network, more upper nodes is usually with more packets usually. We called this bottleneck problem. The goal of this paper is to solve the bottleneck problem in ZigBee tree network. We use The Beacon-Only Period Approach which has been proposed by IEEE802.15.4b to avoid the collision caused by beacon frame. Moreover, we propose a centralized algorithm (TDMLF) that enables the nodes to fully use the GTS transmission. TDMLF not only avoides the hidden node problem which occurs in IEEE802.15.4, but also enables the entire network to achieve a more effective parallel transmission. Simulation results show that the TDMLF algorithm effectively reduces the bottleneck problem, and thus achieves a high delivery ratio. Moreover, because of no collision, the TDMLF also reduces the waste of time and energy by retransmission.

scholarly journals Optimized Gateway Placement for Interference Cancellation in Transmit-Only LPWA Networks

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3884 ◽  
Author(s):  
Hongxian Tian ◽  
Mary Weitnauer ◽  
Gedeon Nyengele
Keyword(s):  
Low Power ◽  
Sensor Network ◽  
Interference Cancellation ◽  
Greedy Algorithms ◽  
Sensor Nodes ◽  
Wide Area ◽  
Delivery Ratio ◽  
Large Network ◽  
Packet Delivery ◽  
Simulation Results

We study the placement of gateways in a low-power wide-area sensor network, when the gateways perform interference cancellation and when the model of the residual error of interference cancellation is proportional to the power of the packet being canceled. For the case of two sensor nodes sending packets that collide, by which we mean overlap in time, we deduce a symmetric two-crescent region wherein a gateway can decode both collided packets. For a large network of many sensors and multiple gateways, we propose two greedy algorithms to optimize the locations of the gateways. Simulation results show that the gateway placements by our algorithms achieve lower average contention, which means higher packet delivery ratio in the same conditions, than when gateways are naively placed, for several area distributions of sensors.

scholarly journals Online fault diagnosis of wireless sensor networks

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Diagnosis ◽  
Wireless Sensor ◽  
Transient Faults ◽  
Intermittent Faults ◽  
Detection Latency ◽  
Time Redundancy ◽  
Simulation Results ◽  
Time And Energy

AbstractThis paper proposes an adaptive online distributed solution for fault diagnosis in wireless sensor networks (WSNs). Fault diagnosis is achieved by comparing the heartbeat message generated by neighboring nodes and dissemination of decision made at each node. Time redundancy is used to detect the intermittent faults since an intermittent fault will not occur consistently. The diagnosis performance degradation due to intermittent faults in sensing and transient faults in communication is analyzed. A near optimal trade-off between detection latency and number of tests required to detect intermittent faults is obtained. Simulation results are provided and they show that this work performs better, from both time and energy complexity viewpoint.

Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks

2008 ◽  
Vol E91-B (10) ◽  
pp. 3113-3121
Author(s):  
J. SANGIAMWONG ◽  
K. YAGYU ◽  
T. SUZUKI
Keyword(s):  
Mesh Networks ◽  
Routing Metrics ◽  
Hidden Node ◽  
Node Problem

scholarly journals A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments

Smart Cities ◽  
2020 ◽  
Vol 3 (3) ◽  
pp. 1004-1021
Author(s):  
Lamia EL-Garoui ◽  
Samuel Pierre ◽  
Steven Chamberland
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Smart City ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
End To End Delay ◽  
Dynamic Topology ◽  
New Challenges ◽  
Real Time Applications ◽  
Entire Network

The smart city is an ecosystem that interconnects various devices like sensors, actuators, mobiles, and vehicles. The intelligent and connected transportation system (ICTS) is an essential part of this ecosystem that provides new real-time applications. The emerging applications are based on Internet-of-Things (IoT) technologies, which bring out new challenges, such as heterogeneity and scalability, and they require innovative communication solutions. The existing routing protocols cannot achieve these requirements due to the surrounding knowledge supported by individual nodes and their neighbors, displaying partial visibility of the network. However, the issue grew ever more arduous to conceive routing protocols to satisfy the ever-changing network requirements due to its dynamic topology and its heterogeneity. Software-Defined Networking (SDN) offers the latest view of the entire network and the control of the network based on the application’s specifications. Nonetheless, one of the main problems that arise when using SDN is minimizing the transmission delay between ubiquitous nodes. In order to meet this constraint, a well-attended and realistic alternative is to adopt the Machine Learning (ML) algorithms as prediction solutions. In this paper, we propose a new routing protocol based on SDN and Naive Bayes solution to improve the delay. Simulation results show that our routing scheme outperforms the comparative ones in terms of end-to-end delay and packet delivery ratio.

Hidden-Node Problem in Full-Duplex Enabled CSMA Networks

2020 ◽  
Vol 19 (2) ◽  
pp. 347-361 ◽  
Author(s):  
Shengbo Liu ◽  
Liqun Fu ◽  
Wei Xie
Keyword(s):  
Full Duplex ◽  
Hidden Node ◽  
Node Problem
Sign in / Sign up

Export Citation Format

Share Document