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.
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...
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...
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...
Unlike traditional wireless routing protocols which use a single fixed path, opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of forwarders to opportunistically perform packet forwarding. A key issue in the design of opportunistic routing protocols is the forwarder list selection problem. In this paper we establish a general theory...
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...
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...
The IEEE 802.15.4 standard offers a low-cost, low-power and short-range wireless communications, which are known by the acronym LR-WPAN (Low Rate Wireless Personal Area Network). The loss of coverage of a device involves a long process when it has to join again the wireless network, having associated a high delay and energy waste. These drawbacks imply this Orphan device stays a long time unable to...
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...
Networks-on-Chip (NoCs) are becoming widespread in contemporary multi-core and many-core designs. Amongst their appeals are regularity of layout and flexibility of topology. However, the energy consumed by routing nodes is now vastly more than that of an ALU operation in one of the processing cores they service. We present an evaluation of bypassing, a technique where selected traffic can avoid the...
In this paper we propose a new approach to designing a large scale wireless sensor network (WSN) with a cluster-tree topology. Sensors in each cluster communicate directly with their associated cluster head (CH) through contention-based transmissions, and communications between CHs use contention free transmissions. The objective is to balance the energy consumptions of all the CHs, while providing...
The wireless sensor network is characterized by its density in number of deployed sensors. In reality, sensors in the same region collect and forward, in general, the same information. In order to conserve nodes energy, it is necessary to keep active a set of nodes while others can sleep. In this paper, we present a new topology control protocol (GECP) for wireless sensor network that extends the...
A wireless sensor network is often deployed for environment monitoring and event inspection. Among these applications, the sink of the network usually requires the data generated on each sensor node periodically, and such a network is called a data-gathering sensor network. In each round of the data gathering process, a sensor node sends its reading via a single-hop or multi-hop path to the sink....
Wireless sensor networks have been widely used for ambient data collection in diverse environments. While in many such networks the sensor nodes are randomly deployed in massive quantity, there is a broad range of applications advocating manual deployment. A typical example is structure health monitoring, where the sensors have to be placed at critical locations to fulfill civil engineering requirements...
Finding an optimal key assignment (subject to given constraints) for a key predistribution scheme in wireless sensor networks is a difficult task. Hence, most of the practical schemes are based on probabilistic key assignment, which leads to sub-optimal schemes requiring key storage linear in the total number of nodes. A graph theoretic framework is introduced to study the fundamental tradeoffs between...
Power consumption of ICT is becoming more and more a sensible problem, which is of interest for both the research community, for ISPs and for the general public. In this paper we consider a real IP backbone network and a real traffic profile. We evaluate the energy cost of running it, and, speculating on the possibility of selectively turning off spare devices whose capacity is not required to transport...
Network lifetime is one of the most important parameters in ad-hoc wireless networks, and it is not only constrained by the battery capacity of the nodes in the networks but also by the energy efficient operation of the nodes. This paper evaluates energy consumption and network lifetime in a rectangular network model based on the Geographical Adaptive Fidelity (GAF) topology management protocol. We...
In wireless ad hoc sensor networks (WASNs), a crucial issue is to reduce power consumption while satisfying some key network properties. In this paper, we propose a fault-tolerant topology control that optimizes the lifetime of the network at a given degree k of connectivity by minimizing power consumption. Our topology control is fully distributed and uses a model-based transmission power adaptation...
The multi-scenario topology of the hybrid sensor networks is studied and a novel MIMO channel resource assignment cross layer cooperative scheduling scheme (CRA-CCSS) is proposed in this paper. The comparison and the predominance of the proposed scheme are demonstrated. With the help of the simulations, the relative energy consumption and the end-to-end blocking probability are all improved. So the...
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.