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.
Dynamic Spectrum access (DSA) is a promising solution to solve the spectrum scarcity problem by allowing unlicensed user (a.k.a Secondary User (SU)) to access the licensed spectrum in a way that does not harm the spectrum owner (a.k.a Primary User (PU)). The SU's performance can be further enhanced by utilizing cooperative transmission via an intermediate relay instead of using direct transmission...
Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location information. The iterated localization process proceeds as follows. Starting with a subset of nodes that have their location information, possibly using global positioning system (GPS) devices, any other node gets localized...
Cooperative spectrum sensing (CSS) performance could be severely degraded due to presence of misbehaved Cognitive Radio (CR) falsifying sensing data. To identify misbehaviors and mitigate their harmful effects on CSS performance, this letter proposes a secure CSS scheme by introducing a prior probability-aided mechanism with utilization of the statistics of primary band occupancy. While performance...
This paper presents a simple but an effective approach to restore the coverage within a wireless sensor network (WSN) when sensors fail without adding new sensors. We have considered a sensor node failure due to electrical faults or malfunctions during the initial deployment. Each sensor has a limited energy supply, and the failure of a sensor results in extra overhead during restoration of the uncovered...
With the development of Wireless sensor networks, secure communication among sensors by establishing pair-wise keys becomes a critical issue for many sensor network applications. Due to sensors' special uses, limited capabilities and declining connection probability, the random key pre-distribution schemes are no longer suitable for networks with large size. Multi-path key establishment scheme becomes...
Most monitoring or tracking applications require the localization information in wireless sensor network. The DV-Hop provides a basic scheme to retrieve the localization without GPS information. DV-Hop scheme only uses the localizations of the reference nodes and the hop-count, so the fundamental estimation may cause the larger error than range-based schemes. The proposed scheme uses the neighbor...
To reduce energy consumption is an important topic in WSN (wireless sensor networks). One of the popular protocols for energy-efficient WSN is called LEACH (low-energy adaptive clustering hierarchy) which is a clustering algorithm designed for homogeneous WSN. Since LEACH selects the cluster heads based on probability, the real and expectance number of cluster heads may be different. However, LEACH...
In this work, to obtain stronger connectivity, we propose and analyze a scheme extended by random key pre-distribution (RKP), which can work only in highly dense networks and require path construction. We investigate the threshold property of multi-hop key connectivity in random geometric networks. We have made use of the Jansonpsilas inequality to deal with the dependency overhead. Accordingly, our...
Cooperation spectrum sensing in cognitive radio networks has an analogy to a distributed decision in wireless sensor networks, where each sensor make local decision and those decision result are reported to a fusion center to give the final decision according to some fusion rules. In this paper the performance of cooperative spectrum sensing examines using new optimization strategy to find optimal...
Providing a secure routing algorithm that defend against node compromise is a challenging task in sensor networks. In this paper, we propose a proactive secure routing algorithm (PSR) to conquer the undetected compromised nodes-the compromised nodes that the system has not detected them yet. Compared with other secure routing algorithms or ideas, routing paths in PSR not only bypass the detected compromised...
Localizing sensor nodes is critical in the context of wireless sensor networks applications. It has been shown that, for certain applications, low overhead discrete localization achieves comparable results to costly fine localization. This paper presents a discrete and probabilistic localization method that requires no transmission overhead from the sensor nodes. The method is based on Kalman estimation...
We focus on an opportunistic communication system consisting of multiple independent channels with time-varying states. With limited sensing, a user can only sense and access a subset of channels and accrue rewards determined by the state of the sensed channels. We formulate the problem of optimal sequential channel probing as a restless multi-armed bandit process, for which a powerful index policy-Whittle's...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
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.