Enabling End-to-End Communication Between Wireless Sensor Networks and the Internet Based on 6LoWPAN

2015 ◽  
Vol 24 (3) ◽  
pp. 633-638 ◽  
Author(s):  
Bingqing Luo ◽  
Zhixin Sun
2012 ◽  
Vol 16 (4) ◽  
pp. 515-540 ◽  
Author(s):  
Hong Yu ◽  
Jingsha He ◽  
Ting Zhang ◽  
Peng Xiao ◽  
Yuqiang Zhang

Author(s):  
Omkar Singh ◽  
Vinay Rishiwal

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.


Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2417
Author(s):  
Andrzej Michalski ◽  
Zbigniew Watral

This article presents the problems of powering wireless sensor networks operating in the structures of the Internet of Things (IoT). This issue was discussed on the example of a universal end node in IoT technology containing RFID (Radio Frequency Identification) tags. The basic methods of signal transmission in these types of networks are discussed and their impact on the basic requirements such as range, transmission speed, low energy consumption, and the maximum number of devices that can simultaneously operate in the network. The issue of low power consumption of devices used in IoT solutions is one of the main research objects. The analysis of possible communication protocols has shown that there is a possibility of effective optimization in this area. The wide range of power sources available on the market, used in nodes of wireless sensor networks, was compared. The alternative possibilities of powering the network nodes from Energy Harvesting (EH) generators are presented.


2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Jun Huang ◽  
Liqian Xu ◽  
Cong-cong Xing ◽  
Qiang Duan

The design of wireless sensor networks (WSNs) in the Internet of Things (IoT) faces many new challenges that must be addressed through an optimization of multiple design objectives. Therefore, multiobjective optimization is an important research topic in this field. In this paper, we develop a new efficient multiobjective optimization algorithm based on the chaotic ant swarm (CAS). Unlike the ant colony optimization (ACO) algorithm, CAS takes advantage of both the chaotic behavior of a single ant and the self-organization behavior of the ant colony. We first describe the CAS and its nonlinear dynamic model and then extend it to a multiobjective optimizer. Specifically, we first adopt the concepts of “nondominated sorting” and “crowding distance” to allow the algorithm to obtain the true or near optimum. Next, we redefine the rule of “neighbor” selection for each individual (ant) to enable the algorithm to converge and to distribute the solutions evenly. Also, we collect the current best individuals within each generation and employ the “archive-based” approach to expedite the convergence of the algorithm. The numerical experiments show that the proposed algorithm outperforms two leading algorithms on most well-known test instances in terms of Generational Distance, Error Ratio, and Spacing.


2022 ◽  
Vol 18 (1) ◽  
pp. 1-41
Author(s):  
Pamela Bezerra ◽  
Po-Yu Chen ◽  
Julie A. McCann ◽  
Weiren Yu

As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent approach, has been successful in localising complex failures (i.e., observable by end-to-end global analysis) in traditional networks. Applying network tomography to wireless sensor networks (WSNs), however, is challenging. First, WSN topology changes due to environmental interactions (e.g., interference). Additionally, the selection of devices for running network monitoring processes (monitors) is an NP-hard problem. Monitors observe end-to-end in-network properties to identify failures, with their placement impacting the number of identifiable failures. Since monitoring consumes more in-node resources, it is essential to minimise their number while maintaining network tomography’s effectiveness. Unfortunately, state-of-the-art solutions solve this optimisation problem using time-consuming greedy heuristics. In this article, we propose two solutions for efficiently applying Network Tomography in WSNs: a graph compression scheme, enabling faster monitor placement by reducing the number of edges in the network, and an adaptive monitor placement algorithm for recovering the monitor placement given topology changes. The experiments show that our solution is at least 1,000× faster than the state-of-the-art approaches and efficiently copes with topology variations in large-scale WSNs.


2011 ◽  
Vol 7 (1) ◽  
pp. 672313 ◽  
Author(s):  
Jeisa Domingues ◽  
Antonio Damaso ◽  
Rilter Nascimento ◽  
Nelson Rosa

Sign in / Sign up

Export Citation Format

Share Document