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.
Performance of wireless sensor networks (WSNs) can be affected when the network is deployed under different topologies. In this paper we present a performance study of congestion control algorithms in WSNs when nodes are deployed under different topologies. To perform our research we have employed algorithms SenTCP, directed diffusion, and HTAP. The choice of these algorithms is based on the fact...
Underwater wireless sensor networks (UWSNs) are prone to message loss due to their poor link condition with high bit error rate (BER). Retransmission-based mechanisms such as ARQ can be used for the reliability, however, they are not suitable for UWSNs due to the inherent long propagation delay of UWSNs. Therefore, a forward error correction (FEC) mechanism might be an alternative in order to guarantee...
Given a space where some events occur and expect to be detected, and a group of devices with limited sensing and communication capabilities moving in this space, this paper aims at developing a distributed self-deployment algorithm for each agent so that the steered sensing device network can cover and sample the space in interest. At the same time, to support the collection and further processes...
In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the average function under a harsh model of the conditions under which sensor nodes operate. This protocol is shown to be time-optimal in presence of unfrequent failures. The approach followed saves time and energy by relying the computation...
Deployment of sensors and routing inside an irregular region is one of the most fundamental challenges of Wireless Sensor Networks. The performance of an effective and efficient sensor network is highly related to the proper configuration and design of the network and effective communication between the sensors deployed. In real scenario, the area that needs to cover, may suffer from natural geographical...
We present a solid study on the performance of a homological sensor network in partial sensing coverage, which means the network has at least one sensing coverage hole and we demonstrate that when sacrificing a little coverage the system lifetime can be prolonged significantly. In particular, we showed that when there is one sensing coverage hole (with a coverage rate of 97%) the system lifetime can...
In wireless sensor networks, most of the existing key management schemes, establish shared keys for all pairs of neighbor sensors without considering the communication between these nodes. This results in causing huge overhead. For large scale WSNs, these schemes still need each sensor to be loaded with a bulky amount of keys. In many-to-one traffic pattern of sensor networks, large numbers of sensor...
Knowledge of topology in wireless sensor networks is significant for network management and maintenance. In this paper, a conditional probability of data loss theorem is proposed for wireless sensor networks based on the data aggregation paradigm.al probability of data loss theorem. It reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based...
Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint...
Wormhole attack is a severe threat to wireless ad hoc and sensor networks. Most existing countermeasures either require specialized hardware devices or make strong assumptions on the network in order to capture the specific (partial) symptom induced by wormholes. Those requirements and assumptions limit the applicability of previous approaches. In this work, we present our attempt to understand the...
In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermittent connectivity that results from duty-cycling further complicates the problem. Nevertheless, we present both a centralized and distributed algorithm that are provably optimal when the number of destinations is small. This model...
In many applications of Wireless Sensor Networks (WSN), it is crucial to know the location of sensor nodes. Although several methods have been proposed, most of them have poor performance in irregularly shaped networks. MDS-MAP is one of the localization methods based on multidimensional scaling (MDS) technique. It uses the connectivity information to derive the location of the nodes in the network...
Wireless sensor networks (WSN) are affected by underlying environments in which sensors are deployed randomly. Inevitably, there are many irregular holes in a WSN because of the existence of obstacles or the death of some sensors. To detect these holes is of great importance to both WSN applications and networking functionalities. Holes are described by a set of sensor nodes on their boundaries. In...
In data-centric wireless sensor networks, the malicious nodes may selectively drop some crucial data packets, which seriously destroy the network's data collection and decrease the availability of sensor services. In this paper, we present a lightweight defense scheme against selective forwarding attacks. According to characteristics of easy positioning the nodes around transmission paths in a structured...
Communication via self-organization is a practical and most common model for wireless sensor network. Its security, efficiency and cost and corresponding key management are one of the key research topics on WSN security. This paper proposes a group key management scheme for WSN based on an original self-organized structure, grid-loop. The group which we called grid-loop is constructed on distributed...
Wireless sensor networks (WSNs) can be used by the military for a number of purposes such as monitoring or tracking the enemies and force protection. Unlike commercial WSNs, a tactical military sensor network has different priority requirements for military usage. Especially in the remote large-scale network, topology, self-configuration, network connectivity, maintenance, and energy consumption are...
Deployment of sensors inside an irregular region is one of the most fundamental challenges of wireless sensor networks. The performance of an effective and efficient sensor network is highly related to the proper configuration and design of the network and effective communication between the sensors deployed. For an irregular space of random shape and size, it is practically very difficult to detect...
In recent years there was much attention about connected dominating set as a backbone for wireless networks. The aim is changing much nodes' state to inactive as possible and keep smallest number of nodes active and leave communication duty of inactive group to active group. In previous algorithms for attaining this goal, nodes with greater degree were kept active and trees were grown over nodes with...
Reducing energy consumption has been a recent focus of wireless sensor network research. Topology control explores the potential that a dense network has for energy savings. We propose that the sensor field be overlaid with a honeycomb virtual mesh based on a tessellation. Then with the help of greedy forwarding algorithm and perimeter forwarding algorithm, we can bypass a void or obstacles easily...
Proposed a new topology-control algorithms which is based on k-connectivity. In wireless sensor networks, the existing topology-control algorithms now can not meet the needs of WSN in fault tolerance, connectivity, redundancy and so on. In LKETA, the node deletes redundant edges according to the information of local neighbor nodes, and it adjusts transmission power with the power adjustment algorithm...
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.