Releasing network isolation problem in group-based industrial wireless sensor networks

In this paper, we propose a cross-layer optimization scheme named Adjusting the Transmission Radius (ATR), which is based on the Energy Consumed uniformly Connected K-Neighborhood (EC-CKN) sleep scheduling algorithm in wireless sensor networks (WSNs). In particular, we discovered two important problems, namely, the death acceleration problem and the network isolation problem, in EC-CKN-based WSNs. Furthermore, we solve these two problems in ATR, which creates sleeping opportunities for the nodes that cannot get a chance to sleep in the EC-CKN algorithm. Simulation and experimental results show that the network lifetime of ATR-Connected-K-Neighborhood-based WSNs increases by 19%, on average, and the maximum increment is 41%. In addition, four important insights were discovered through this research work and presented in this paper

Geographic routing in duty-cycled industrial wireless sensor networks with radio irregularity

Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged, the two-phase geographic greedy forwarding (TPGF) geographic routing algorithm has attracted attention due to its unique transmission features: multi path, shortest path, and hole bypassing. However, the performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity is not well investigated in the literature. In this paper, we first evaluate the impact of radio irregularity on CKN-based duty-cycled IWSNs. Furthermore, we investigate the routing performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity, in terms of the number of explored routing paths as well as the lengths of the average and shortest routing paths. Particularly, we establish the upper bound on the number of explored routing paths. The upper bound is slightly relaxed with radio irregularity compared with without radio irregularity; however, it is bounded by the number of average 1-hop neighbors in always-on IWSNs. With extensive simulations, we observe that the cross-layer optimized version of TPGF (i.e., TPFGPlus) finds reliable transmission paths with low end-to-end delay, even in CKN-based duty-cycled IWSNs with radio irregularity

Progressive Sleep Scheduling For Energy Efficient Wireless Sensor Network

Increasing the network efficiency & reducing the power consumption are important issues in the design of applications & protocols for wireless sensor network. Sleep scheduling & routing protocol provides efficient communication with less power consumption. In this paper, we address the routing protocol for static network which reduces the computation time & power consumption. Proposed system, in practice, suitable for small & medium sized networks. In this proposed work the first module incorporates the communication between node to node & node to base station. DOI: 10.17762/ijritcc2321-8169.150313

Collaborative Approach for Improving the Scheduling and Providing Advanced Security in Wireless Sensor Network

Recent advances in Wireless Sensor Networks (WSN) have focused towards Geographic forwarding mechanism. It is a promising routing scheme in wireless sensor networks, in which the forwarding decision is determined purely based on the location of each node. Such type of Routing in Geographic domain is also useful for large multi-hop wireless networks where the nodes are not reliable and network topology is frequently changing. This routing requires propagation of single hop topology information that is the best neighbor, to make correct forwarding decisions. The research of Geographic routing has now moved towards duty cycled wireless sensor networks (WSNs). In such type of network, sensors are sleep scheduled which helps in reduction of energy consumption. It works by dynamically putting the nodes to sleep when not in use and reactivate it, when required, by using some sleep scheduling algorithms. Geographic routing is usually based on distance which is considered as its main parameter. This routing uses geographic routing oriented sleep scheduling (GSS) algorithm & geographic-distance-based connected-k neighborhood (GCKN) algorithm. The existing research was done to find out the shortest path from source to destination in Duty-Cycled Mobile sensor networks along with geographic routing, using distance as a parameter. But there may be the case when shortest path is available and the nodes are heavily loaded. Therefore, load balancing also proves to be equally important factor. Hence, this research work proposes the system that will calculate the best optimal path from source node to destination by taking into consideration the load on each node and delay incurred by each node in Duty-Cycled Mobile sensor networks along with geographic routing. The experimental results and performance analysis shows that the newly proposed approach achieves the best results in comparison with the existing system

Sleep scheduling for unbalanced energy harvesting in industrial wireless sensor networks

Energy harvesting from ambient energy sources has gained increased attention due to its advantage of less maintenance and for removing the dependency on batteries in IWSNs. However, due to the dynamic nature of ambient energy sources and the position of harvesting nodes, energy-harvesting is not always available, resulting in unbalanced energy-harvesting in IWSNs. Although, some battery operated nodes are used, the limited lifetime problem still exists due to the non-harvesting nodes. In this article, we propose a scheme that combines the advantages of energy-harvesting and sleep-scheduling in hybrid solar energy-harvesting IWSNs and non-harvesting nodes. We present a model of the harvesting-node using a three-state Markov chain. The proposed harvest-use-store type architecture aims to guarantee an energy-neutral condition to avoid energy harvesting nodes from early energy exhaustion. The proposed approach allows to wake up a few more non-harvesting nodes to handle network coverage and connectivity during less-energy-harvesting intervals. Similarly, non-harvesting nodes are allowed to sleep by increasing the default transmission range of the solar-harvesting nodes during higher energy harvesting intervals prolonging network lifetime.https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=35hj2020Electrical, Electronic and Computer Engineerin

Joint position estimation, packet routing and sleep scheduling in wireless sensor networks

Wireless Sensor Network (WSN) is an important research field in Computer Science with applications that span multiple domains. Due to the limitation of sensor nodes, network lifetime is a critical issue that needs to be addressed. Therefore, in this thesis I propose the Energy-aware Connected k-Neighbourhood (ECKN), a joint position estimation, packet routing, and sleep scheduling solution that combines some overlap- ping features. I propose a localization algorithm that performs trilateration using the position of a mobile sink and of neighbour nodes to estimate the position of a sensor node with no GPS module. I introduce a routing protocol based on the well-known Greedy Geographic Forwarding (GGF). Similarly to GGF, my protocol takes into consideration the position of neighbours to decide the best forwarding node, however it also considers the residual energy in order to guarantee that the forwarding node will deliver the packet. The concept of bridges is also introduced, in which the sink compares its current position with previous positions and calculates whether there is a shortest path in order to create a bridge that will reduce the number of hops a packet has to travel through. Lastly, a sleep scheduler is proposed in order to extend the network lifetime, it is based on the Connected k-Neighbourhood (CKN) algorithm, which aids in the decision of what nodes goes to sleep while maintaining the network connected. My sleep scheduler maintains the network denser in the area close to the sink, since this region receives packets from the whole network to forward to the sink. An extensive set of performance evaluation experiments is conducted and results show that ECKN can extend network lifetime, while sustaining acceptable packet delivery ratio and reducing network overhead

Reducing false wake-up in contention-based wake-up control of wireless LANs

This paper studies the potential problem and performance when tightly integrating a low power wake-up radio (WuR) and a power-hungry wireless LAN (WLAN) module for energy efficient channel access. In this model, a WuR monitors the channel, performs carrier sense, and activates its co-located WLAN module when the channel becomes ready for transmission. Different from previous methods, the node that will be activated is not decided in advance, but decided by distributed contention. Because of the wake-up latency of WLAN modules, multiple nodes may be falsely activated, except the node that will actually transmit. This is called a false wake-up problem and it is solved from three aspects in this work: (i) resetting backoff counter of each node in a way as if it is frozen in a wake-up period, (ii) reducing false wake-up time by immediately putting a WLAN module into sleep once a false wake-up is inferred, and (iii) reducing false wake-up probability by adjusting contention window. Analysis shows that false wake-ups, instead of collisions, become the dominant energy overhead. Extensive simulations confirm that the proposed method (WuR-ESOC) effectively reduces energy overhead, by up to 60% compared with state-of-the-arts, achieving a better tradeoff between throughput and energy consumption

Distributed Database Management Techniques for Wireless Sensor Networks

Authors and/or their employers shall have the right to post the accepted version of IEEE-copyrighted articles on their own personal servers or the servers of their institutions or employers without permission from IEEE, provided that the posted version includes a prominently displayed IEEE copyright notice and, when published, a full citation to the original IEEE publication, including a link to the article abstract in IEEE Xplore. Authors shall not post the final, published versions of their papers.In sensor networks, the large amount of data generated by sensors greatly influences the lifetime of the network. In order to manage this amount of sensed data in an energy-efficient way, new methods of storage and data query are needed. In this way, the distributed database approach for sensor networks is proved as one of the most energy-efficient data storage and query techniques. This paper surveys the state of the art of the techniques used to manage data and queries in wireless sensor networks based on the distributed paradigm. A classification of these techniques is also proposed. The goal of this work is not only to present how data and query management techniques have advanced nowadays, but also show their benefits and drawbacks, and to identify open issues providing guidelines for further contributions in this type of distributed architectures.This work was partially supported by the Instituto de Telcomunicacoes, Next Generation Networks and Applications Group (NetGNA), Portugal, by the Ministerio de Ciencia e Innovacion, through the Plan Nacional de I+D+i 2008-2011 in the Subprograma de Proyectos de Investigacion Fundamental, project TEC2011-27516, by the Polytechnic University of Valencia, though the PAID-05-12 multidisciplinary projects, by Government of Russian Federation, Grant 074-U01, and by National Funding from the FCT-Fundacao para a Ciencia e a Tecnologia through the Pest-OE/EEI/LA0008/2013 Project.Diallo, O.; Rodrigues, JJPC.; Sene, M.; Lloret, J. (2013). Distributed Database Management Techniques for Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems. PP(99):1-17. https://doi.org/10.1109/TPDS.2013.207S117PP9

Raamistik mobiilsete asjade veebile

Internet on oma arengus läbi aastate jõudnud järgmisse evolutsioonietappi - asjade internetti (ingl Internet of Things, lüh IoT). IoT ei tähista ühtainsat tehnoloogiat, see võimaldab eri seadmeil - arvutid, mobiiltelefonid, autod, kodumasinad, loomad, virtuaalsensorid, jne - omavahel üle Interneti suhelda, vajamata seejuures pidevat inimesepoolset seadistamist ja juhtimist. Mobiilseadmetest nagu näiteks nutitelefon ja tahvelarvuti on saanud meie igapäevased kaaslased ning oma mitmekülgse võimekusega on nad motiveerinud teadustegevust mobiilse IoT vallas. Nutitelefonid kätkevad endas võimekaid protsessoreid ja 3G/4G tehnoloogiatel põhinevaid internetiühendusi. Kuid kui kasutada seadmeid järjepanu täisvõimekusel, tühjeneb mobiili aku kiirelt. Doktoritöö esitleb energiasäästlikku, kergekaalulist mobiilsete veebiteenuste raamistikku anduriandmete kogumiseks, kasutades kergemaid, energiasäästlikumaid suhtlustprotokolle, mis on IoT keskkonnale sobilikumad. Doktoritöö käsitleb põhjalikult energia kokkuhoidu mobiilteenuste majutamisel. Töö käigus loodud raamistikud on kontseptsiooni tõestamiseks katsetatud mitmetes juhtumiuuringutes päris seadmetega.The Internet has evolved, over the years, from just being the Internet to become the Internet of Things (IoT), the next step in its evolution. IoT is not a single technology and it enables about everything from computers, mobile phones, cars, appliances, animals, virtual sensors, etc. that connect and interact with each other over the Internet to function free from human interaction. Mobile devices like the Smartphone and tablet PC have now become essential to everyday life and with extended capabilities have motivated research related to the mobile Internet of Things. Although, the recently developed Smartphones enjoy the high performance and high speed 3G/4G mobile Internet data transmission services, such high speed performances quickly drain the battery power of the mobile device. This thesis presents an energy efficient lightweight mobile Web service provisioning framework for mobile sensing utilizing the protocols that were designed for the constrained IoT environment. Lightweight protocols provide an energy efficient way of communication. Finally, this thesis highlights the energy conservation of the mobile Web service provisioning, the developed framework, extensively. Several case studies with the use of the proposed framework were implemented on real devices and has been thoroughly tested as a proof-of-concept.https://www.ester.ee/record=b522498

Performance assessment of real-time data management on wireless sensor networks

Technological advances in recent years have allowed the maturity of Wireless Sensor Networks (WSNs), which aim at performing environmental monitoring and data collection. This sort of network is composed of hundreds, thousands or probably even millions of tiny smart computers known as wireless sensor nodes, which may be battery powered, equipped with sensors, a radio transceiver, a Central Processing Unit (CPU) and some memory. However due to the small size and the requirements of low-cost nodes, these sensor node resources such as processing power, storage and especially energy are very limited. Once the sensors perform their measurements from the environment, the problem of data storing and querying arises. In fact, the sensors have restricted storage capacity and the on-going interaction between sensors and environment results huge amounts of data. Techniques for data storage and query in WSN can be based on either external storage or local storage. The external storage, called warehousing approach, is a centralized system on which the data gathered by the sensors are periodically sent to a central database server where user queries are processed. The local storage, in the other hand called distributed approach, exploits the capabilities of sensors calculation and the sensors act as local databases. The data is stored in a central database server and in the devices themselves, enabling one to query both. The WSNs are used in a wide variety of applications, which may perform certain operations on collected sensor data. However, for certain applications, such as real-time applications, the sensor data must closely reflect the current state of the targeted environment. However, the environment changes constantly and the data is collected in discreet moments of time. As such, the collected data has a temporal validity, and as time advances, it becomes less accurate, until it does not reflect the state of the environment any longer. Thus, these applications must query and analyze the data in a bounded time in order to make decisions and to react efficiently, such as industrial automation, aviation, sensors network, and so on. In this context, the design of efficient real-time data management solutions is necessary to deal with both time constraints and energy consumption. This thesis studies the real-time data management techniques for WSNs. It particularly it focuses on the study of the challenges in handling real-time data storage and query for WSNs and on the efficient real-time data management solutions for WSNs. First, the main specifications of real-time data management are identified and the available real-time data management solutions for WSNs in the literature are presented. Secondly, in order to provide an energy-efficient real-time data management solution, the techniques used to manage data and queries in WSNs based on the distributed paradigm are deeply studied. In fact, many research works argue that the distributed approach is the most energy-efficient way of managing data and queries in WSNs, instead of performing the warehousing. In addition, this approach can provide quasi real-time query processing because the most current data will be retrieved from the network. Thirdly, based on these two studies and considering the complexity of developing, testing, and debugging this kind of complex system, a model for a simulation framework of the real-time databases management on WSN that uses a distributed approach and its implementation are proposed. This will help to explore various solutions of real-time database techniques on WSNs before deployment for economizing money and time. Moreover, one may improve the proposed model by adding the simulation of protocols or place part of this simulator on another available simulator. For validating the model, a case study considering real-time constraints as well as energy constraints is discussed. Fourth, a new architecture that combines statistical modeling techniques with the distributed approach and a query processing algorithm to optimize the real-time user query processing are proposed. This combination allows performing a query processing algorithm based on admission control that uses the error tolerance and the probabilistic confidence interval as admission parameters. The experiments based on real world data sets as well as synthetic data sets demonstrate that the proposed solution optimizes the real-time query processing to save more energy while meeting low latency.Fundação para a Ciência e Tecnologi