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.
The success of various sensor network applications highly depends on the use of energy-conserving routing methods to prolong network lifetime. We present a heterogeneous sensor network architecture consisting of a small number of high-end sensors serving as sink nodes and a large number of low-end sensors responsible for environmental sensing. We propose a path bottleneck-oriented and energy cost-based...
An energy efficient multi hop sensor network cannot avoid the energy hole problem, which is the rapid decrease in the energy of nodes around the sink. Also as a sensor network has a limited node resources and unexpected changes of external environment, its nodes should show energy efficiency, reliable data transmission, and topological adaptation to the change of external environment. This study proposes...
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges as slowly as flooding (O(n2) messages)...
Wireless Sensor Network (WSN) is a network of sensors that has a very large scale of nodes with a tight resources limitation. WSN is application specific, with a wide range of applications in military, survey, industrial, up to home usage. The major problems for WSN are resource limitations and dynamic network, which require unique algorithms for unique applications. Our study focused on the implementation...
Sensors in sensor networks are operated by their embedded batteries and they can not work any more if the batteries run out. The data collected by sensors should be transferred to a sink node through the efficient routes. Many energy efficient routing algorithms were proposed. However, the previous algorithms consume more energy since they did not consider the transmission range and direction. In...
In this paper, we present a novel algorithm of connected dominating set based clustering in sensor networks. Considering the characteristics and location information of nodes in sensor networks, a modified directed transfer model of sensor networks, and a novel clustering algorithm based on area is proposed in this paper. Theoretical analyses and simulation results show that, the above new methods...
Since there is no fixed infrastructure or centralized management in wireless sensor networks, a connected dominating set (CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless sensor networks. This problem has been studied extensively, in which all nodes have the same transmission...
Wireless sensor network is a new information acquisition and processing technology, which is widely used in monitoring systems. Taking into account that the physical topology of the mine is relatively fixed, as well as that the energy can be added to the mobile nodes, in this paper we propose an energy-efficient wireless sensor network routing algorithm to adapt to the mine environment. Demonstrated...
Energy efficiency has been known as the most important problem in wireless sensor networks. However, different applications need different energy efficiency protocols. A centralized wireless sensor network with mesh topology can enable the reliable monitoring of a variety of environments, such as plant monitoring, city traffic monitoring. In this paper, we propose the MEBRSS (Mesh Network Energy Balancing...
Collecting data from source sensor nodes to designated sinks is a common and challenging task in a wide spectrum of sensor network applications, ranging from animal monitoring to security surveillance. A number of approaches exploiting sink mobility have been proposed in recent years: some are proactive, in that sensor nodes push their readings to storage nodes from where they are collected by roaming...
Routing algorithm is a key component of wireless sensor networks. The researchers applied a lot of routing algorithm to satisfy the needs of various wireless sensor networks. In this paper we analyzed the topologies of multi-sink node wireless sensor networks and achieved a multi-direction routing algorithm based on meet ant colony optimization for multi-sink node wireless sensor networks. The simulation...
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called ldquoGreedy Forwarding with VIrtual Position (ViP)rdquo. We introduce virtual position as the middle position of all direct neighbors of a node....
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Holes in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called Greedy Forwarding with Virtual Position (GF-ViP). We introduce virtual position as the middle position of all neighbors of a node. Instead of comparing...
Deploying real WSN testbed provides a realistic testing environment, and allows users to get more accurate test results. However, deploying real testbed is highly constrained by the available budget when the test needs a large scale WSN environment. By leveraging the advantages of both simulators and real testbed, an approach that integrates simulation environment and testbed can effectively solve...
Wireless sensor networks (WSN) consists of tiny autonomous devices called sensors capable of sensing, processing and transmitting information. Energy consumption, routing and maximizing lifetime are the important challenges in the sensor network. In this paper, we propose multiple tree construction (MTC) algorithm to address the problem of finding path from each node to its nearest base stations to...
A sensing-covered network is a wireless sensor network where every single point in the geographic area is covered by the sensing range of at least one sensor node. For routing on such a 2-D sensing-covered network topology, we propose a new greedy forwarding-type progress-based routing protocol GC2, as well as a hybrid routing algorithm SCL:GC2 which is based on GC2 and a faster simplified version...
To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest...
An important issue of routing is how to effectively balance the energy consumption of the entire network, and avoid the energy-hole which would lead to the premature death of the network. Based on the characteristics of wireless sensor network, this paper firstly converts the routing problem into linear programming problem, and proves the equivalence between the routing problem and linear programming...
This paper presents a design of routing algorithm for mobile agent in the wireless sensor networks which is called MA-SWR. It introduces a weight metric and each node derives its weight value dynamically from its current position. In MA-SWR, by comparing the weights values, mobile agents can determine their own routs. MA-SWR can be applied when topological information changes such as in a network...
We present a localized algorithm (LTCA) for topology control in wireless sensor networks which has certain desirable properties. First, the algorithm is very simple, strictly local (requires 1-hop information of neighbors) and fast, requiring each node to communicate with its neighbors exactly twice. Second, LTCA does not assume the underlying graph to be a unit disk graph, and in fact works on general...
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.