Data collection algorithm for wireless sensor networks using collaborative mobile elements

The simplest approach to reduce network latency for data gathering in wireless sensor networks (WSN) is to use multiple mobile elements rather than a single mobile sink. However, the most challneging issues faced this approach are firstly the high network cost as a result of using large number of mobile elements. Secondly, it suffers from the difficulty of network partitioning to achieve an efficient load balancing among these mobile elements. In this study, a collaborative data collection algorithm (CDCA) is developed. Simulation results presented in this paper demonstrated that with this algorithm the latency is significantly reduced at small number of mobile elements. Furthermore, the performance of CDCA algorithm is compared with the Area Splitting Algorithm (ASA). Consequently, the CDCA showed superior performance in terms of network latency, load balancing, and the required number of mobile elements

A Cluster–based Approach for Minimizing Energy Consumption by Reducing Travel Time of Mobile Element in WSN

Envoy Node Identification (ENI) and Halting Location Identifier (HLI) algorithms have been developed to reduce the travel time of Mobile Element (ME) by determining Optimal Path(OP) in Wireless Sensor Networks. Data generated by cluster members will be aggregated at the Cluster Head (CH) identified by ENI for onward transmission to the ME and it likewise decides an ideal path for ME by interfacing all CH/Envoy Nodes (EN). In order to reduce the tour length (TL) further HLI determines finest number of Halting Locations that cover all ENs by taking transmission range of CH/ENs into consideration. Impact of ENI and HLI on energy consumption and travel time of ME have been examined through simulations

Delay-aware data collection in wireless sensor networks with mobile nodes

© 2017 Technical Committee on Control Theory, CAA. The data delivery delay is a significant measure in wireless sensor networks when the users focus on data freshness. In the previous work, two approaches named: Unusual Message Delivery Path Construction (UMDPC) and Improved-UMDPC (I-UMDPC), target on delivering unusual message to mobile nodes within the allowed latency. The data collection system consists of a set of sensor nodes (S nodes) to detect the environment, a set of mobile nodes (M nodes) attached to buses to collect sensory data, and a set of B nodes deployed at bus stops to assist data delivery. The goal of this work is to investigate the influence of B node coverage on the delay sensitive data delivery performance of the two existing approaches. In this paper, the B node coverage is indicated by the average hop distance between cluster heads and B nodes. We focus on seeking the minimum achieved allowed latency under different B node coverage and demonstrate the results through simulations

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Improving Maximum Data Collection Based On Pre-Specified Path Using a Mobile Sink for WSN

Data aggregation is one of the challenging issues which are faced in the wireless sensor network by using Energy Harvesting Sensors. Data collection in a fixed pre-defined path with time varying characteristic forms a major problem in Energy Harvesting Sensor Networks. In the proposed work the Adjustment based allocation method is used to allocate fixed time slots to each sensor nodes in which the network throughput can be increased with less energy consumption. The mobile sink transmits the polling message to all the nodes within the transmission range and makes decision based on the profits gained by the sensor nodes in each timeslot. The NP-Hard problem is defined with the form of reducing the complexity of the sensor nodes where larger number of data can be collected from the environment. The data collection throughput is maximized with the use of optimized path for the mobile sink in the network. This record was migrated from the OpenDepot repository service in June, 2017 before shutting down

TechNews digests: Jan - Mar 2010

TechNews is a technology, news and analysis service aimed at anyone in the education sector keen to stay informed about technology developments, trends and issues. TechNews focuses on emerging technologies and other technology news. TechNews service : digests september 2004 till May 2010 Analysis pieces and News combined publish every 2 to 3 month

Investigación de los efectos de las redes de comunicación 5G sobre la gestión urbana inteligente y el desarrollo económico sostenible

This article, with a global view, explains the necessity of using smart urban technologies in the development of the infrastructure of ICTnetworks and in order to resolve the urban management challenges. Also, by reviewing some smart model in current modern cities, alongwith new generations of high-speed communications, some of the improvements made in this field are being examined. The economicview in this research has a global approach to saving energy and increasing productivity while protecting natural resources and theenvironment through emerging communications technologies. At the end of this research, by challenging some traditional andcostly method in urban management, it is proposed to provide technological solutions to save time and money, as well as urbanbeautification and urbanization. With the hope that the findings of this study, though insignificant, will be the light on urban planningand urban considerations to integrate smart city technologies. It should be noted that the potential of the policymakers in the nearfuture will be effected on creating an appropriate environment for sustainable development of the economy in national dimensions

Bioans: bio-inspired ambient intelligence protocol for wireless sensor networks

This paper describes the BioANS (Bio-inspired Autonomic Networked Services) protocol that uses a novel utility-based service selection mechanism to drive autonomicity in sensor networks. Due to the increase in complexity of sensor network applications, self-configuration abilities, in terms of service discovery and automatic negotiation, have become core requirements. Further, as such systems are highly dynamic due to mobility and/or unreliability; runtime self-optimisation and self-healing is required. However the mechanism to implement this must be lightweight due to the sensor nodes being low in resources, and scalable as some applications can require thousands of nodes. BioANS incorporates some characteristics of natural emergent systems and these contribute to its overall stability whilst it remains simple and efficient. We show that not only does the BioANS protocol implement autonomicity in allowing a dynamic network of sensors to continue to function under demanding circumstances, but that the overheads incurred are reasonable. Moreover, state-flapping between requester and provider, message loss and randomness are not only tolerated but utilised to advantage in the new protocol