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...
This paper studies the energy costs of running a distributed averaging/consensus algorithm in a wireless sensor network. It has recently been shown that running such an algorithm over a bidirectional spanning tree is preferable in terms of convergence time. We formulate the combinatorial optimization problem of selecting a minimal energy bidirectional spanning tree as a mixed integer linear programming...
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...
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...
Node clone attack, that is, the attempt by an adversary to add one or more nodes to the network by cloning captured nodes, imposes a severe threat to wireless sensor networks. Several distributed detection protocols have been proposed against this attack. However, all of them rely on too strong assumptions and cannot be efficiently applied to most of sensor networks. In this paper, we propose an innovative...
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...
We consider the scenario that N sensors collaborate to observe a single event. The sensors are distributed and can only exchange messages through a network to reach a consensus about the observed event. In this paper, we propose a very robust and simple method using broadcast gossip algorithm to solve the distributed hypothesis testing problem. The simulation result shows that our method has good...
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...
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...
For wireless sensor networks (WSN) involved in geographical surveillance type applications, obtaining information from a specified region of interest is important. The information itself is dependent upon the application type specific sensors deployed within the network region. For the purpose of this study we propose a new routing protocol called swarm intelligent odour based routing (SWOB) that...
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...
We study networks consisting of a very large number of tiny and inexpensive sensors and introduce SWAS (Small-Worlds of Anonymous Sensors), an algorithm combining self-organization based upon small-worlds principles and Medium Access Control based upon a stack protocol for VLSNs and we report on a preliminary study of the algorithm. The nodes of Very Large Sensor Networks (VLSN) have limited resources;...
Positioning scheme is one of the most important issues in wireless sensor networks, especially for the applications requiring the accurate position of the sensed information. In this field, DV-hop has been considered as one of the pioneering methods without any range measurement tools. However, DV-hop is not well-applicable to the irregular network topology. In order to enhance the performance of...
Hexagonal wireless sensor network refers to a network topology where a subset of nodes have six peer neighbors. These nodes form a backbone for multi-hop communications. In a previous work, we proposed the use of hexagonal topology in wireless sensor networks and discussed its properties in relation to real-time (bounded latency) multi-hop communications in large-scale deployments. In that work, we...
In this paper, we address the problem of topology control in wireless sensor networks (WSNs). Taking energy consumption and reliability into account, we consider topology control to be a problem of multi-objective degree-constrained minimum spanning tree (mcd-MST) and present an improved discrete particle swarm optimization (PSO) algorithm for generating such topology schemes. The simulation results...
We analyze large, random network topologies that arise in ad hoc or sensor networks. A fundamental requirement of communication in these systems is reachability, that is, to have a connected network topology. It is known, however, that the price for full connectivity is very high, as it requires unbounded local complexity, i.e., it forces the nodes to have infinitely growing degrees to achieve asymptotic...
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.