The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Localization of tagged objects with sufficient precision is a main issue in many industrial applications. In this paper, a new approach is proposed for the localization of UHF passive tags simply using the environment learning approach. This method uses, for a given passive tag located in a 2-D space, an aggregate function of the Received Signal Strength Indicator (RSSI) for all the possible RFID...
RFID has been developed for many applications such as object identification, object traceability, geometric localization, etc. In order to locate an object labeled by a tag, several characteristics of the tag responses have been studied. This yielded theoretical models whose accuracy is not sufficient in practice for targeted applications. In this paper, we investigate how to localize a tag based...
An interesting approach for the location service problem in wireless mesh networks is the one that relies on location agendas to model node displacements on an absolute time basis. To the best of our knowledge, the literature still lacks the design and evaluation of such an approach. In this paper, we introduce and analyze an agenda-based location service that reduces the overhead due to location...
In this paper we introduce a novel distributed and robust link-quality measurement framework, called QualRoute. It exploits the existing traffic in the network in order to estimate accurately the quality of the links. Different from existing methods, our proposed scheme takes advantage of the broadcast nature of the wireless medium, and sets up an asynchronous cooperation between neighbors without...
There are considerable researches focused on routing in wireless multi-hop networks dealing with random and unpredictable channel variations. As it is well-known that using the shortest path in terms of number of hops often leads to poor performance, most of the recent research efforts propose various link quality aware metrics. Yet, there is not many works addressing the stability issue of link quality...
In this paper, we investigate the individuality of mobility patterns in wireless networks composed of IEEE 802.11 access points. We propose a mobility-aware clustering algorithm that uses roaming events as the metric to evaluate the proximity to access-points (APs) without using any geographical information. The contributions of this clustering algorithm are threefold. First, it provides a sanitized...
Wireless networks suffer from random variations in channel and network condition. This leads to poor performance in multi-hop wireless networks specially with a conventional non-flexible routing. To cope with instability of wireless links, a cross-layer routing that supports adaptivity and optimization across lower layers of protocol stack is needed. Cross layer routing intends to play an essential...
Self organized networks (SONs) are a general description of autonomous networks, of which ad hoc and sensor networks are special cases. Lack of infrastructure, limited resources and dynamic nature of nodes are some of the main characteristics of such networks. We had previously proposed a novel clustering architecture for SONs that utilizes a fixed description of cluster routing tables. The architecture...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.