8 research outputs found

    IoT Applications Computing

    Get PDF
    The evolution of emerging and innovative technologies based on Industry 4.0 concepts are transforming society and industry into a fully digitized and networked globe. Sensing, communications, and computing embedded with ambient intelligence are at the heart of the Internet of Things (IoT), the Industrial Internet of Things (IIoT), and Industry 4.0 technologies with expanding applications in manufacturing, transportation, health, building automation, agriculture, and the environment. It is expected that the emerging technology clusters of ambient intelligence computing will not only transform modern industry but also advance societal health and wellness, as well as and make the environment more sustainable. This book uses an interdisciplinary approach to explain the complex issue of scientific and technological innovations largely based on intelligent computing

    A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things

    Full text link
    [EN] The Internet of Things integrates a large number of distributed nodes to collect or transmit data. When the network scale increases, individuals use multiple sink nodes to construct the network. This increases the complexity of the network and leads to significant challenges in terms of the existing methods with respect to the aspect of data forwarding and collection. In order to address the issue, this paper proposes a Shortcut Addition strategy based on the Particle Swarm algorithm (SAPS) for multisink network. It constructs a network topology with multiple sinks based on a small-world network. In the SAPS, we create a fitness function by combining the average path length and load of the sink node, to evaluate the quality of a particle. Subsequently, crossover and mutation are used to update the particles to determine the optimal solution. The simulation results indicate that the SAPS is superior both to the greedy model with small world and the load-balanced multigateway aware long link addition strategy in terms of the average path length, load balance, and number of added shortcuts.This work was supported by the National Natural Science Foundation of China under Grant 61672131 and Grant 61702365. Paper no. TII-19-0511.Qiu, T.; Li, B.; Zhou, X.; Song, H.; Lee, I.; Lloret, J. (2020). A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things. IEEE Transactions on Industrial Informatics. 16(5):3566-3577. https://doi.org/10.1109/TII.2019.29250233566357716

    An Individual Node Delay Based Efficient Power Aware Routing Protocol for Wireless Heterogeneous Sensor Networks

    Get PDF
    Miscellaneous node transmission ranges builds up Wireless Heterogeneous Sensor Networks (WHSNs). Designing an efficient, reliable and scalable routing protocol for WHSNs with intermittent asymmetric links is a challenging task. In this paper, we propose an efficient power aware routing scheme for WHSNs, which can provide loop-free, stateless, source-to-sink routing scheme without using prior information about neighbor. It uses both symmetric and asymmetric links to forward data from source to sink. The source node broadcasts location information to all its neighbor nodes. Each neighbor node calculates a delay slot based on the information obtained from the source to forward its power value to it. The node that has a minimum delay slot forwards the power earlier than the other nodes during contention phase and the delay slot is used to suppress the selection of unsuitable low-power nodes at that time. We also prove that our protocol is loop-free assuming no failures in greedy forwarding. By simulations we show that our protocol significantly outperforms the existing protocols in WHSNs

    Fuelling the zero-emissions road freight of the future: routing of mobile fuellers

    Get PDF
    The future of zero-emissions road freight is closely tied to the sufficient availability of new and clean fuel options such as electricity and Hydrogen. In goods distribution using Electric Commercial Vehicles (ECVs) and Hydrogen Fuel Cell Vehicles (HFCVs) a major challenge in the transition period would pertain to their limited autonomy and scarce and unevenly distributed refuelling stations. One viable solution to facilitate and speed up the adoption of ECVs/HFCVs by logistics, however, is to get the fuel to the point where it is needed (instead of diverting the route of delivery vehicles to refuelling stations) using "Mobile Fuellers (MFs)". These are mobile battery swapping/recharging vans or mobile Hydrogen fuellers that can travel to a running ECV/HFCV to provide the fuel they require to complete their delivery routes at a rendezvous time and space. In this presentation, new vehicle routing models will be presented for a third party company that provides MF services. In the proposed problem variant, the MF provider company receives routing plans of multiple customer companies and has to design routes for a fleet of capacitated MFs that have to synchronise their routes with the running vehicles to deliver the required amount of fuel on-the-fly. This presentation will discuss and compare several mathematical models based on different business models and collaborative logistics scenarios

    Projeto de redes de sensores sem fio heterogêneas utilizando os conceitos de redes small word

    No full text
    Exportado OPUSMade available in DSpace on 2019-08-12T09:12:39Z (GMT). No. of bitstreams: 1 danielludovicoguidoni.pdf: 6254344 bytes, checksum: ff541e456af9c8fdb667ff1f4ce47468 (MD5) Previous issue date: 23Uma Rede de Sensor Sem Fio (RSSF) considera um conjunto de nós homogêneos em termos de hardware. Entretanto, esse tipo de rede possui baixos limites de desempenho em relação à latência durante a comunicação de dados. Outro modelo de RSSF, chamado de Redes de Sensores Sem Fio Heterogêneas (RSSFH), considera um conjunto de nós sensores heterogêneos em termos de hardware, especialmente em relação ao raio de comunicação e reservas de energia. Neste trabalho é proposto modelos baseados na teoria de Small World no projeto de Redes de Sensores Sem Fio Heterogêneas. O primeiro modelo proposto considera o padrão de comunicação em RSSF na criação de atalhos direcionados ao nó monitor da rede com o objetivo de reduzir a latência na comunicação de dados. Os pontos finais desses atalhos são nós com maior capacidade de comunicação e reservas de energia para suportar a comunicação de longo alcance. O modelo proposto foi avaliado e foi verificado que o mesmo apresenta as mesmas características de redes Small World (caminho médio mínimo e coeficiente de agrupamento) observadas nos modelos da literatura. Além disso, quando os atalhos são criados na direção ao nó monitor, depositando uma pequena quantidade de nós com maior capacidade de hardware, o modelo proposto apresenta melhores características de redes Small World e melhores tradeoffs entre latência e energia consumida durante a comunicação de dados quando comparado aos modelos da literatura. O modelo proposto também foi avaliado com relação à resiliência considerando falhas gerais e específicas e, em ambos os casos, o modelo proposto se mostrou mais robusto e apresenta uma baixa degradação da comunicação de dados na presença de falhas nos nós. Entretanto, a comunicação de longo alcance entre os nós com maiores capacidade de comunicação causa uma alta interferência no canal sem fio. Para isso, nós apresentamos um modelo para criação de RSSFH que utiliza múltiplas interfaces sem fio e a capacidade de utilização de múltiplos canais de comunicação da camada MAC para reduzir as colisões durante a comunicação de dados. Resultados de simulação mostraram que quando os atalhos são direcionados ao nó monitor e assinalados a diferentes canais de comunicação sem fio, as colisões são reduzidas e, por conseguinte, a latência na comunicação de dados é reduzida. Finalmente, nós apresentamos um framework baseados nos conceitos de redes Small World no projeto de RSSFH com qualidade de serviço. O framework utiliza três topologias para prover qualidade de serviço em RSSFH. Cada topologia possui o seu objetivo em relação à latência e energia consumida durante a comunicação de dados. Resultados de simulação mostraram que a utilização das topologias do framework proposto reduz o consumo de energia e a latência quando comparado as topologiasutilizadas na literatura para prover qualidade de serviço em redes de sensores sem fio heterogêneas..A typical Wireless Sensor Network (WSN) assumes a homogeneous set of nodes in terms of capabilities. However, this kind of network suffers from poor fundamental limitations of latency during the data communication. Another model of WSN assumes a heterogeneous set of nodes with different capabilities (especially in terms of communication range and energy reserves) called Heterogeneous Sensor Networks(HSN). In this work, we propose small world models to design Heterogeneous Sensor Networks (HSNs). The first model takes into account the communication pattern of this network to create shortcuts directed to the monitoring node, decreasing the data communication latency. The endpoints of these shortcuts are nodes with more powerful communication range and energy reserves to support the long communication range. We evaluate the proposed model and show that they present the same small world features (average path length and clustering coefficient) observed in the literature models. When the shortcuts are created toward the sink node, with a few number of powerful sensors, the network presents better small world features and interesting tradeoffs between energy and latency in the data communication when compared to the literature model. Also, we evaluate the resilience of the proposed model considering general and specific failures and, in both cases, the proposed model is more robust and presents a graceful degradation of the network latency, which shows the resilience of those models. However, the long range communication used to create a shortcut causes a high interference in the wireless channel. For this, we present a model that uses multi-interface and multi-channel capability of the MAC layer to reduce collisions during the data communication. Simulation results showed that when the shortcuts are directed to the sink node and assigned to a different wireless channel, collisions and latency are reduced. We also proposed a framework based on the small world concepts to design heterogeneous sensor networks with QoS. The framework uses three different topologies to provide QoS in sensor networks. Each topology has its own objectives related to latency during communication and energy consumption. Simulation results showed that the proposed framework can reduce latency and energy consumption compared to the topology used in the literature to provide QoS in sensor networks

    Rout: A Routing Protocol Based On Topologies For Heterogeneous Wireless Sensor Networks

    No full text
    In this work, we propose a routing protocol based on topologies for Heterogeneous Wireless Sensor Networks (HSN) named as RouT. The proposed protocol creates different logical topologies considering the same physical topology of a HSN. The heterogeneous network has two types of sensors nodes, called L-sensors and H-sensors. The L-sensors are nodes with Low hardware capabilities where the H-sensors are sensors with High hardware capabilities. The RouT protocol creates different logical topologies and each topology considers a different number of links among H-sensors. In this way, each topology has its tradeoff between energy consumption and latency during data communication. Simulation results showed that the RouT protocol is able to provide different topologies that can be used if the network application has different requirements. © 2012 IEEE.124812817Al-Karaki, J., Kamal, A., Routing techniques in wireless sensor networks: A survey (2004) Wireless Communications IEEE, 11 (6), pp. 6-28Boukerche, A., Fei, X., A coverage-preserving scheme for wireless sensor network with irregular sensing range (2007) Ad Hoc Networks, 5 (8), pp. 1303-1316. , DOI 10.1016/j.adhoc.2007.02.020, PII S1570870507000455Wightman, P.M., Labrador, M.A., Topology maintenance: Extending the lifetime of wireless sensor networks," in (2010) IEEE Latin America Transactions, 8 (4), pp. 469-475Filho, D.F.L., Amazonas, J.R., Tcnet: Trellis coded network-implementation of qos-aware routing protocols in wsns," in (2013) IEEE Latin America Transactions, 11 (3), pp. 969-975Boukerche, A., Das, S.K., Fabbri, A., Swimnet: A scalable parallel simulation testbed for wireless and mobile networks (2001) Wireless Networks, 7 (5), pp. 467-489Duarte-Melo, E., Liu, M., Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks (2002) IEEE Global Telecommunications Conference, pp. 21-25Guilherme, M., Guidoni, D.L., Aquino, A.L.L., Loureiro, A.A.F., Improving and over-The-Air programming protocol for wireless sensor networks based on small world concepts (2009) 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 261-276Gracioli, G., Frohlich, A.A., Pires, R.P., Wanner, L., Evaluation of an rssi-based location algorithm for wireless sensor networks," in IEEE Latin America Transactions, 9 (1), pp. 96-101Yarvis, M., Kushalnagar, N., Singh, H., Rangarajan, A., Liu, Y., Singh, S., Exploiting heterogeneity in sensor networks (2005) Proceedings - IEEE INFOCOM, 2, pp. 878-890. , Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications SocietiesNoori, M., Ardakani, M., Design of heterogeneous sensor networks with lifetime and coverage considerations (2012) Wireless Communications Letters, 1 (3), pp. 193-196Tandon, R., Nandi, S., Crp: Cluster head re-election protocol for heterogeneous wireless sensor networks (2013) International Conference on Communication Systems and Networks, pp. 1-10Gupta, P., Kumar, P., The capacity of wireless networks (2000) IEEE Transactions on Information Theory, 46 (2), pp. 388-404Halder, S., Dasbit, S., A lifetime enhancing node deployment strategy using heterogeneous nodes in wsns for coal mine monitoring (2012) 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 117-124Sevgi, C., Kocyigit, A., On determining cluster size of randomly deployed heterogeneous wsns (2008) Communications Letters, 12 (4), pp. 232-234Luo, H., Ye, F., Cheng, J., Lu, S., Zhang, L., TTDD: Two-tier data dissemination in large-scale wireless sensor networks (2005) Wireless Networks, 11 (1-2), pp. 161-175. , DOI 10.1007/s11276-004-4753-xGuidoni, D., Boukerche, A., Villas, L., Souza, F., Mini, R., Loureiro, A., A framework based on small world features to design hsns topologies with qos (2012) IEEE Symposium on Computers and Communications, pp. 732-737Lin, H., Rushing, J., Graves, S., Criswell, E., A data fusion algorithm for large heterogeneous sensor networks (2007) International Conference on Wireless Algorithms, Systems and Applications, pp. 225-232Kumar, D., Aseri, T., Patel, R.B., A two tier data aggregation and clustering scheme for heterogeneous sensor networks (2009) IEEE International Advance Computing Conference, pp. 841-846Sinha, A., Lobiyal, D., Performance analysis of data aggregation for overlapping clusters in heterogeneous sensor network (2013) International Conference on Contemporary Computing, pp. 143-148Sinha, A., Lobiyal, D., (2014) The Network Simulator ns-2, , http://www.isi.edu/nsnam/nsBoukerche, A., Xin, F., A Voronoi approach for coverage protocols in wireless sensor networks (2007) GLOBECOM - IEEE Global Telecommunications Conference, pp. 5190-5194. , DOI 10.1109/GLOCOM.2007.984, 4411894, IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceeding
    corecore