Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Optimal channel probing and transmission scheduling for opportunistic spectrum access
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
WirelessHART: Applying Wireless Technology in Real-Time Industrial Process Control
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Modeling and Analysis of Multi-hop Control Networks
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Design of a Reliable Traffic Control System on City Area Based on a Wireless Network
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
A link scheduling and ad hoc networking approach using directional antennas
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Clear channel assessment in energyconstrained wideband wireless networks
IEEE Wireless Communications
A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
This paper designs and measures the performance of an efficient routing scheme and corresponding slot assignment schedule capable of efficiently handling the difference in the error rate of each link on the wireless mesh network Targeting at the grid topology common in most modern cities, a split-merge operation masks the channel error by making an intermediary node receive a message simultaneously in two directions and then integrating a secondary route, required to have the same length with the primary route, to the communication schedule Adding virtual links from level 1 to level 3 to the 3 × 3 grid and estimating their error rates based on those of the surrounding links, the proposed scheme applies the well-known shortest path algorithm to decide the best route and also to finalize the complete a slot assignment for the WirelessHART protocol The performance measurement result obtained by simulation using a discrete event scheduler demonstrates that the proposed scheme can find the promising path, improving the delivery ratio by up to 5.21 %.