266 research outputs found
An artificial intelligence based quorum system for the improvement of the lifespan of sensor networks.
Artificial Intelligence-based Quorum systems are used to solve the energy crisis in real-time wireless sensor networks. They tend to improve the coverage, connectivity, latency, and lifespan of the networks where millions of sensor nodes need to be deployed in a smart grid system. The reality is that sensors may consume more power and reduce the lifetime of the network. This paper proposes a quorum-based grid system where the number of sensors in the quorum is increased without actually increasing quorums themselves, leading to improvements in throughput and latency by 14.23%. The proposed artificial intelligence scheme reduces the network latency due to an increase in time slots over conventional algorithms previously proposed. Secondly, energy consumption is reduced by weighted load balancing, improving the network’s actual lifespan. Our experimental results show that the coverage rate is increased on an average of 11% over the conventional Coverage Contribution Area (CCA), Partial Coverage with Learning Automata (PCLA), and Probabilistic Coverage Protocol (PCP) protocols respectively
A survey on subjecting electronic product code and non-ID objects to IP identification
Over the last decade, both research on the Internet of Things (IoT) and
real-world IoT applications have grown exponentially. The IoT provides us with
smarter cities, intelligent homes, and generally more comfortable lives.
However, the introduction of these devices has led to several new challenges
that must be addressed. One of the critical challenges facing interacting with
IoT devices is to address billions of devices (things) around the world,
including computers, tablets, smartphones, wearable devices, sensors, and
embedded computers, and so on. This article provides a survey on subjecting
Electronic Product Code and non-ID objects to IP identification for IoT
devices, including their advantages and disadvantages thereof. Different
metrics are here proposed and used for evaluating these methods. In particular,
the main methods are evaluated in terms of their: (i) computational overhead,
(ii) scalability, (iii) adaptability, (iv) implementation cost, and (v) whether
applicable to already ID-based objects and presented in tabular format.
Finally, the article proves that this field of research will still be ongoing,
but any new technique must favorably offer the mentioned five evaluative
parameters.Comment: 112 references, 8 figures, 6 tables, Journal of Engineering Reports,
Wiley, 2020 (Open Access
Power saving and energy optimization techniques for Wireless Sensor Networks
Wireless sensor networks have become
increasingly popular due to their wide range of applications.
Energy consumption is one of the biggest constraints of the
wireless sensor node and this limitation combined with a
typical deployment of large number of nodes have added
many challenges to the design and management of wireless
sensor networks. They are typically used for remote
environment monitoring in areas where providing electrical
power is difficult. Therefore, the devices need to be powered
by batteries and alternative energy sources. Because battery
energy is limited, the use of different techniques for energy
saving is one of the hottest topics in WSNs. In this work, we
present a survey of power saving and energy optimization
techniques for wireless sensor networks, which enhances the
ones in existence and introduces the reader to the most well
known available methods that can be used to save energy.
They are analyzed from several points of view: Device
hardware, transmission, MAC and routing protocols.Sendra Compte, S.; Lloret, J.; García Pineda, M.; Toledo Alarcón, JF. (2011). Power saving and energy optimization techniques for Wireless Sensor Networks. Journal of Communications. 6(6):439-459. doi:10.4304/jcm.6.6.439-459S4394596
Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks
A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing
Implementation and Evaluation of Mobile-Edge Computing Cooperative Caching
Recent expanding rise of mobile device users for cloud services leads to resource challenges in Mobile Network Operator's (MNO) network. This poses significant additional costs to MNOs and also results in poor user experience. Studies illustrate that large amount of traffic consumption in MNO's network is originated from the similar requests of users for the same popular contents over Internet. Therefore such networks suffer from delivering the same content multiple times through their connected gateways to the Internet backhaul. On the other hand, in content delivery networks (CDN), the delay caused by network latency is one of the biggest issues which impedes the efficient delivery and desirable user experience.
Cooperative caching is one of the ways to handle the extra posed traffic by requesting popular contents repeatedly in MNO's network. Furthermore Mobile-Edge Computing (MEC) offers a resource rich environment and data locality to cloud applications. This helps to reduce the network latency time in CDN services. Thus in this Thesis an aggregation between Cooperative Caching and MEC concept has been considered.
This Thesis demonstrates a design, implementation and evaluation for a Mobile-Edge computing Cooperative Caching system to deliver content to mobile users. A design is presented in a failure resilient and scalable practice using a light-weight synchronizing method. The system is implemented and deployed on Nokia Networks Radio Application Cloud Servers(Nokia Networks RACS) as intelligent MEC base-stations and finally the outcome of the system and the effect on bandwidth saving, CDN delay and user experience are evaluated
- …