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.
Anonymous communication is a challenging task in resource constrained wireless sensor networks (WSN). However, anonymity is important for many sensor networks, in which we want to conceal the location and identify of important nodes (such as source nodes and base stations) from attackers. Existing WSN anonymous protocols either cannot achieve complete anonymity, or have large computation and/or storage...
In many applications of Wireless Sensor Networks (WSN), the source of an event needs to be protected. In resource constrained WSN, providing source anonymity is a challenging task. A traditional approach for hiding source in WSN is to let all nodes generate dummy data packets even if they have no event to report. However, this kind of approach introduces large overhead. In order to reduce the large...
Wireless mesh network (WMN) is a rapid deployed, self organized and multi-hop wireless network. The wireless and distributed natures of WMNs make them subject to various kinds of attacks, which raise a great challenge in securing these networks. Most existing security mechanisms are based on cryptographic keys where a high degree key management services are in demand. In this paper, we present an...
Routing is an essential operation in wireless sensor networks. Most existing routing protocols are designed for homogeneous sensor networks. Recent studies show that a homogeneous sensor network has a poor fundamental performance limit. To achieve better performance, we adopt a Heterogeneous Sensor Network (HSN) model. In this paper, we present an efficient NEar-optiMal rOuting (NEMO) protocol for...
Establishing pair-wise keys in wireless sensor networks is a challenging task due to the hostile environment and limited resources in sensor nodes. Many key management schemes have been proposed for sensor networks. However, most existing schemes are designed for homogeneous sensor networks where all of the nodes have the same or similar capabilities. Research has shown that better performance can...
To achieve better performance, we adopt a heterogeneous sensor network (HSN) model. In many applications, the locations of some sensor nodes are controllable. In this paper, first we propose a novel density-varying deployment scheme for high-end sensors (H-sensors) in an HSN. The scheme solves the bottleneck problem in typical many-to-one sensor networks. We then study the optimal placement of H-sensors...
The p-cycle design problem has been extensively studied because it can provide both ring-like fast self-protection speed and spare capacity efficiency of path protection scheme. However, p-cycle provisioning for dynamic traffic has not been fully addressed. Most related works have not considered link capacity in the construction of p-cycles, which may cause problems in practice because the protection...
Wireless sensor networks are usually over-engineered, i.e., more than required sensors are deployed and remain active in order to cover each point in the monitored field with a high probability at any time instance. Intuitively, when the size and the shape of objects are considered, any net with holes no smaller than the size of the object would work fine. In this paper, we build a mathematical model...
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.