767 research outputs found
A Tutorial on Clique Problems in Communications and Signal Processing
Since its first use by Euler on the problem of the seven bridges of
K\"onigsberg, graph theory has shown excellent abilities in solving and
unveiling the properties of multiple discrete optimization problems. The study
of the structure of some integer programs reveals equivalence with graph theory
problems making a large body of the literature readily available for solving
and characterizing the complexity of these problems. This tutorial presents a
framework for utilizing a particular graph theory problem, known as the clique
problem, for solving communications and signal processing problems. In
particular, the paper aims to illustrate the structural properties of integer
programs that can be formulated as clique problems through multiple examples in
communications and signal processing. To that end, the first part of the
tutorial provides various optimal and heuristic solutions for the maximum
clique, maximum weight clique, and -clique problems. The tutorial, further,
illustrates the use of the clique formulation through numerous contemporary
examples in communications and signal processing, mainly in maximum access for
non-orthogonal multiple access networks, throughput maximization using index
and instantly decodable network coding, collision-free radio frequency
identification networks, and resource allocation in cloud-radio access
networks. Finally, the tutorial sheds light on the recent advances of such
applications, and provides technical insights on ways of dealing with mixed
discrete-continuous optimization problems
RFID Localisation For Internet Of Things Smart Homes: A Survey
The Internet of Things (IoT) enables numerous business opportunities in
fields as diverse as e-health, smart cities, smart homes, among many others.
The IoT incorporates multiple long-range, short-range, and personal area
wireless networks and technologies into the designs of IoT applications.
Localisation in indoor positioning systems plays an important role in the IoT.
Location Based IoT applications range from tracking objects and people in
real-time, assets management, agriculture, assisted monitoring technologies for
healthcare, and smart homes, to name a few. Radio Frequency based systems for
indoor positioning such as Radio Frequency Identification (RFID) is a key
enabler technology for the IoT due to its costeffective, high readability
rates, automatic identification and, importantly, its energy efficiency
characteristic. This paper reviews the state-of-the-art RFID technologies in
IoT Smart Homes applications. It presents several comparable studies of RFID
based projects in smart homes and discusses the applications, techniques,
algorithms, and challenges of adopting RFID technologies in IoT smart home
systems.Comment: 18 pages, 2 figures, 3 table
A Holistic Methodology for Improved RFID Network Lifetime by Advanced Cluster Head Selection using Dragonfly Algorithm
Radio Frequency Identification (RFID) networks usually require many tags along with readers and computation facilities. Those networks have limitations with respect to computing power and energy consumption. Thus, for saving energy and to make the best use of the resources, networks should operate and be able to recover in an efficient way. This will also reduce the energy expenditure of RFID readers. In this work, the RFID network life span will be enlarged through an energy-efficient cluster-based protocol used together with the Dragonfly algorithm. There are two stages in the processing of the clustering system: the cluster formation from the whole structure and the election of a cluster leader. After completing those procedures, the cluster leader controls the other nodes that are not leaders. The system works with a large energy node that provides an amount of energy while transmitting aggregated data near a base station
Design, Analysis and Computation in Wireless and Optical Networks
abstract: In the realm of network science, many topics can be abstracted as graph problems, such as routing, connectivity enhancement, resource/frequency allocation and so on. Though most of them are NP-hard to solve, heuristics as well as approximation algorithms are proposed to achieve reasonably good results. Accordingly, this dissertation studies graph related problems encountered in real applications. Two problems studied in this dissertation are derived from wireless network, two more problems studied are under scenarios of FIWI and optical network, one more problem is in Radio- Frequency Identification (RFID) domain and the last problem is inspired by satellite deployment.
The objective of most of relay nodes placement problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensors and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. In this dissertation, we study a family of problems whose goal is to design a network with âmaximal connectednessâ or âminimal disconnectednessâ, subject to a fixed budget constraint. Apart from âconnectivityâ, we also study relay node problem in which degree constraint is considered. The balance of reducing the degree of the network while maximizing communication forms the basis of our d-degree minimum arrangement(d-MA) problem. In this dissertation, we look at several approaches to solving the generalized d-MA problem where we embed a graph onto a subgraph of a given degree.
In recent years, considerable research has been conducted on optical and FIWI networks. Utilizing a recently proposed concept âcandidate treesâ in optical network, this dissertation studies counting problem on complete graphs. Closed form expressions are given for certain cases and a polynomial counting algorithm for general cases is also presented. Routing plays a major role in FiWi networks. Accordingly to a novel path length metric which emphasizes on âheaviest edgeâ, this dissertation proposes a polynomial algorithm on single path computation. NP-completeness proof as well as approximation algorithm are presented for multi-path routing.
Radio-frequency identification (RFID) technology is extensively used at present for identification and tracking of a multitude of objects. In many configurations, simultaneous activation of two readers may cause a âreader collisionâ when tags are present in the intersection of the sensing ranges of both readers. This dissertation ad- dresses slotted time access for Readers and tries to provide a collision-free scheduling scheme while minimizing total reading time.
Finally, this dissertation studies a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. It is assumed that the impact of a significant event spills into neighboring regions and there will be corresponding indicators. Careful deployment of sensors, utilizing âIdentifying Codesâ, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place.Dissertation/ThesisDoctoral Dissertation Computer Science 201
An energy-efficient routing protocol for Hybrid-RFID Sensor Network
Radio Frequency Identification (RFID) systems facilitate detection and identification of objects that are not easily detectable or distinguishable. However, they do not provide information about the condition of the objects they detect. Wireless sensor networks (WSNs), on the other hand provide information about the condition of the objects as well as the environment. The integration of these two technologies results in a new type of smart network where RFID-based components are combined with sensors. This research proposes an integration technique that combines conventional wireless sensor nodes, sensor-tags, hybrid RFID-sensor nodes and a base station into a smart network named Hybrid RFID-Sensor Network (HRSN)
PRLS-INVES: A General Experimental Investigation Strategy for High Accuracy and Precision in Passive RFID Location Systems
Due to cost-effectiveness and easy-deployment, radio-frequency identification (RFID) location systems are widely utilized into many industrial fields, particularly in the emerging environment of the Internet of Things (IoT). High accuracy and precision are key demands for these location systems. Numerous studies have attempted to improve localization accuracy and precision using either dedicated RFID infrastructures or advanced localization algorithms. But these effects mostly consider utilization of novel RFID localization solutions rather than optimization of this utilization. Practical use of these solutions in industrial applications leads to increased cost and deployment difficulty of RFID system. This paper attempts to investigate how accuracy and precision in passive RFID location systems (PRLS) are impacted by infrastructures and localization algorithms. A general experimental-based investigation strategy, PRLS-INVES, is designed for analyzing and evaluating the factors that impact the performance of a passive RFID location system. Through a case study on passive high frequency (HF) RFID location systems with this strategy, it is discovered that: 1) the RFID infrastructure is the primary factor determining the localization capability of an RFID location system and 2) localization algorithm can improve accuracy and precision, but is limited by the primary factor. A discussion on how to efficiently improve localization accuracy and precision in passive HF RFID location systems is given
Reliable Communication in Wireless Networks
Wireless communication systems are increasingly being used in industries and infrastructures since they offer significant advantages such as cost effectiveness and scalability with respect to wired communication system. However, the broadcast feature and the unreliable links in the wireless communication system may cause more communication collisions and redundant transmissions. Consequently, guaranteeing reliable and efficient transmission in wireless communication systems has become a big challenging issue. In particular, analysis and evaluation of reliable transmission protocols in wireless sensor networks (WSNs) and radio frequency identification system (RFID) are strongly required.
This thesis proposes to model, analyze and evaluate self-configuration algorithms in wireless communication systems. The objective is to propose innovative solutions for communication protocols in WSNs and RFID systems, aiming at optimizing the performance of the algorithms in terms of throughput, reliability and power consumption. The first activity focuses on communication protocols in WSNs, which have been investigated, evaluated and optimized, in order to ensure fast and reliable data transmission between sensor nodes. The second research topic addresses the interference problem in RFID systems. The target is to evaluate and develop precise models for accurately describing the interference among readers. Based on these models, new solutions for reducing collision in RFID systems have been investigated
- âŠ