Delay Mitigation Using Link State Dynamic Routing Protocol Techniques

Wireless network is a new standard specifically designed for real-time and reliable communication between sensors and sink devices for industrial process monitoring and control applications. End-to-end communication delay analysis for Wireless networks is required to determine the schedulability of real-time data flows from sensors to sink for the purpose of acceptance test or workload adjustment in response to network dynamics. In this paper, a network model is considered that is based on Wireless, and maps the scheduling of real-time periodic data flows in the network to real-time multiprocessor scheduling. We then exploit the response time analysis for multiprocessor scheduling and propose a novel method for the delay analysis that establishes an upper bound of the end-to-end communication delay of each real-time flow in the network. Simulation studies based on both random topologies and real network topologies of a node physical wireless sensor network test demonstrate that our analysis provides safe and reasonably tight upper bounds of the end-to-end delays of real-time flows, and hence enables effective schedulability tests for Wireless networks

End-to-End Communication Delay Analysis in WirelessHART Networks

WirelessHART is a new standard specifically designed for real-time and reliable communication between sensor and actuator devices for industrial process monitoring and control applications. End-to-end communication delay analysis for WirelessHART networks is required to determine the schedulability of real-time data flows from sensors to actuators for the purpose of acceptance test or workload adjustment in response to network dynamics. In this paper, we map the scheduling of real-time periodic data flows in a WirelessHART network to real-time multiprocessor scheduling. We then exploit the response time analysis for multiprocessor scheduling and propose a novel method for the delay analysis that establishes an upper bound of the end-to-end communication delay of each real-time flow in a WirelessHART network. Simulation studies based on both random topologies and real network topologies of a 74-node physical wireless sensor network testbed demonstrate that our analysis provides safe and reasonably tight upper bounds of the end-to-end delays of real-time flows, and hence enables effective schedulability tests for WirelessHART networks

Levy walk based multi-hop data forwarding protocol for opportunistic mobile phone sensor networks

Unstable link connectivity due to dynamic mobility nature of mobile phone users and error prone wireless link quality increases end-to-end delay for mobile phone based opportunistic network applications. This problem becomes more worse in the presence of large amount of data transmission, like multimedia data. This paper refers to Levy walk based multi-hop data forwarding protocol called Data Transmission Time and Human Walk Velocity (DTT-HWV) for Opportunistic Mobile Phone Sensor Networks (OMPSN). This paper, in particular evaluates the performance of proposed protocol in terms of end-to-end waiting time to receive data, which is an important QoS requirement for data transmission in opportunistic networks. The proposed protocol DTT-HWV reduces end-to-end waiting time to receive data compared to Random Progress (RP) data forwarding method in presence of low battery power and high path loss. Obtained results are helpful in designing and building of large scale data retrieval services for opportunistic networks involving humans in the communication network loop

Modeling and analysis of multi-hop routing in wireless sensor networks by using matlab

Due to the limited energy and the non-equivalence of wireless sensor network nodes, it is imperative to reduce and rationally use the energy consumption of the nodes to prolong the network lifetime. In this project, a random multi-hop routing approach for wireless sensor networks was modeled and simulated. In order to minimize energy consumption and improve the network lifetime, the simulated protocol depends on the selection of specific sensor nodes to be cluster header for the wireless sensor nodes which receive the packets from other normal sensor nodes randomly and then send it to a base station or Sink. This project classifies the network into two sizes, large size and small size and does compression between both networks when applying this protocol in order to assist the improvement of these networks. Simulation results showed improvement when the network size is changed from a large size to a small size. The lifetime is improved by about 76% that means the number of the round is increased from 80 -333, as well as the end to end delay, is improved around 30% from 180 ns – 280 ns to 100 ns – 170 ns. While for throughput, it is improved 85% from 5x106 bits to 2.5x107 bits. The packet loss also showed the improvement from 12000 to 2500 which means the improvement is about 20.83%. Lastly, the residual energy is improved by 73% approximately 3200 s (1200 s ~ 4400)

Journal Staff

We investigate the performance of delay constrained data transmission over wireless networks without end-to-end feedback. Forward error-correction coding (FEC) is performed at the bit level to combat channel distortions and random linear network coding (RLNC) is performed at the packet level to recover from packet erasures. We focus on the scenario where RLNC re-encoding is performed at intermediate nodes and we assume that any packet that contains bit errors after FEC decoding can be detected and erased. To facilitate explicit characterization of data transmission over network-coded wireless systems, we propose a generic two-layer abstraction of a network that models both bit/symbol-level operations at the lower layer (termed PHY-layer) over several heterogeneous links and packet-level operations at the upper layer (termed NET-layer). Based on this model, we propose a network reduction method to characterize the throughput-reliability function of the end-to-end transmission. Our approach not only reveals an explicit tradeoff between data delivery rate and reliability, but also provides an intuitive visualization of the bottlenecks within the underlying network. We illustrate our approach via a point-to-point link and a relay network and highlight the advantages of this method over capacity-based approaches.Accepted for publication in IEEE Globecom 2014. Copyright will be transferred to IEEE without notice.QS22014</p

End to End Delay and Energy Consumption in a Two Tier Cluster Hierarchical Wireless Sensor Networks

[EN] In this work it is considered a circular Wireless Sensor Networks (WSN) in a planar structure with uniform distribution of the sensors and with a two-level hierarchical topology. At the lower level, a cluster configuration is adopted in which the sensed information is transferred from sensor nodes to a cluster head (CH) using a random access protocol (RAP). At CH level, CHs transfer information, hop-by-hop, ring-by-ring, towards to the sink located at the center of the sensed area using TDMA as MAC protocol. A Markovian model to evaluate the end-to-end (E2E) transfer delay is formulated. In addition to other results such as the well know energy hole problem, the model reveals that for a given radial distance between the CH and the sink, the transfer delay depends on the angular orientation between them. For instance, when two rings of CHs are deployed in the WSN area, the E2E delay of data packets generated at ring 2 and at the ¿west¿ side of the sink, is 20% higher than the corresponding E2E delay of data packets generated at ring 2 and at the ¿east¿ side of the sink. This asymmetry can be alleviated by rotating from time to time the allocation of temporary slots to CHs in the TDMA communication. Also, the energy consumption is evaluated and the numerical results show that for a WSN with a small coverage area, say a radio of 100 m, the energy saving is more significant when a small number of rings are deployed, perhaps none (a single cluster in which the sink acts as a CH). Conversely, topologies with a large number of rings, say 4 or 5, offer a better energy performance when the service WSN covers a large area, say radial distances greater than 400 m.The work of V. Casares-Giner (ITACA research institute) is partly supported by the Spanish national projects TIN2013-47272-C2-1-R and TEC2015-71932-REDT. The work of Tatiana Navas, Dolly Florez, and Tito R. Vargas H., and the collaboration between the two institutions, is supported by the Universidad Santo Tomas under Master Degree's research and academic projects.Casares-Giner, V.; Navas, TI.; Smith Flórez, D.; Vargas Hernández, TR. (2019). End to End Delay and Energy Consumption in a Two Tier Cluster Hierarchical Wireless Sensor Networks. Information. 10(4):1-29. https://doi.org/10.3390/info10040135S129104Sari, A. (2015). Two-Tier Hierarchical Cluster Based Topology in Wireless Sensor Networks for Contention Based Protocol Suite. International Journal of Communications, Network and System Sciences, 08(03), 29-42. doi:10.4236/ijcns.2015.83004Haibo Zhang, & Hong Shen. (2009). Balancing Energy Consumption to Maximize Network Lifetime in Data-Gathering Sensor Networks. IEEE Transactions on Parallel and Distributed Systems, 20(10), 1526-1539. doi:10.1109/tpds.2008.252Wieselthier, J. E., Ephremides, A., & Michaels, L. A. (1989). An exact analysis and performance evaluation of framed ALOHA with capture. IEEE Transactions on Communications, 37(2), 125-137. doi:10.1109/26.20080Liu, W., Zhao, D., & Zhu, G. (2012). End-to-end delay and packet drop rate performance for a wireless sensor network with a cluster-tree topology. Wireless Communications and Mobile Computing, 14(7), 729-744. doi:10.1002/wcm.2230Alabdulmohsin, I., Hyadi, A., Afify, L., & Shihada, B. (2014). End-to-end delay analysis in wireless sensor networks with service vacation. 2014 IEEE Wireless Communications and Networking Conference (WCNC). doi:10.1109/wcnc.2014.6952872Park, J., Lee, S., & Yoo, S. (2015). Time slot assignment for convergecast in wireless sensor networks. Journal of Parallel and Distributed Computing, 83, 70-82. doi:10.1016/j.jpdc.2015.05.004Yang, X., Wang, L., Xie, J., & Zhang, Z. (2018). Energy Efficiency TDMA/CSMA Hybrid Protocol with Power Control for WSN. Wireless Communications and Mobile Computing, 2018, 1-7. doi:10.1155/2018/4168354Sgora, A., Vergados, D. J., & Vergados, D. D. (2015). A Survey of TDMA Scheduling Schemes in Wireless Multihop Networks. ACM Computing Surveys, 47(3), 1-39. doi:10.1145/2677955Martin, E., Liu, L., Covington, M., Pesti, P., & Weber, M. (2010). Positioning Technologies in Location-Based Services. Location-Based Services Handbook, 1-45. doi:10.1201/9781420071986-c1PAL, A. (2010). Localization Algorithms in Wireless Sensor Networks: Current Approaches and Future Challenges. Network Protocols and Algorithms, 2(1). doi:10.5296/npa.v2i1.279Kusdaryono, A., & Lee, K.-O. (2011). A Clustering Protocol with Mode Selection for Wireless Sensor Network. Journal of Information Processing Systems, 7(1), 29-42. doi:10.3745/jips.2011.7.1.029Donald, V. H. M. (1979). Advanced Mobile Phone Service: The Cellular Concept. Bell System Technical Journal, 58(1), 15-41. doi:10.1002/j.1538-7305.1979.tb02209.xCasares-Giner, V., Wuchner, P., Pacheco-Paramo, D., & de Meer, H. (2012). Combined contention and TDMA-based communication in wireless sensor networks. Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012. doi:10.1109/ngi.2012.6252158Ranganathan, P., & Nygard, K. (2010). Time Synchronization in Wireless Sensor Networks: A Survey. International Journal of UbiComp, 1(2), 92-102. doi:10.5121/iju.2010.1206Sahoo, A., & Chilukuri, S. (2010). DGRAM: A Delay Guaranteed Routing and MAC Protocol for Wireless Sensor Networks. IEEE Transactions on Mobile Computing, 9(10), 1407-1423. doi:10.1109/tmc.2010.107Wu, Y.-C., Chaudhari, Q., & Serpedin, E. (2011). Clock Synchronization of Wireless Sensor Networks. IEEE Signal Processing Magazine, 28(1), 124-138. doi:10.1109/msp.2010.938757Casares-Giner, V., Sempere-Payá, V., & Todolí-Ferrandis, D. (2014). Framed ALOHA Protocol with FIFO-Blocking and LIFO-Push out Discipline. Network Protocols and Algorithms, 6(3), 82. doi:10.5296/npa.v6i3.5557Tello-Oquendo, L., Pla, V., Leyva-Mayorga, I., Martinez-Bauset, J., Casares-Giner, V., & Guijarro, L. (2019). Efficient Random Access Channel Evaluation and Load Estimation in LTE-A With Massive MTC. IEEE Transactions on Vehicular Technology, 68(2), 1998-2002. doi:10.1109/tvt.2018.2885333Adan, I. J. B. F., van Leeuwaarden, J. S. H., & Winands, E. M. M. (2006). On the application of Rouché’s theorem in queueing theory. Operations Research Letters, 34(3), 355-360. doi:10.1016/j.orl.2005.05.012Casares-Giner, V., Martinez-Bauset, J., & Portillo, C. (2019). Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks. Computer Networks, 155, 15-30. doi:10.1016/j.comnet.2019.02.02