Results 1 -
5 of
5
A new neighbour selection strategy for group-based wireless sensor networks
"... In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common netw ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
(Show Context)
In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select its neighbours.
A Planar Group-Based Architecture to Scale Ad-Hoc and Sensor Networks
, 2009
"... It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads while allows to scale the network considerably. Many routing protocols for ad-hoc networks and sensor networks have been designed, ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads while allows to scale the network considerably. Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them is based on groups. In this paper, after a review of group based architectures and of neighbor selection strategies, a planar group-based network architecture is proposed. In the proposal, the network is formed by several groups of ad-hoc devices or sensors. Connections between groups are established as a function of the proximity and the neighbor's available capacity (based on the ad-hoc device or sensor’s energy). The messages that are needed to the proper operation are shown. It is also simulated how much time is needed to propagate information between groups and it is calculated the diameter for different topologies
unknown title
"... Abstract Recent advances in Wireless Sensor Networks (WSN) have led to a great breakthrough in sensors design and features. These technological novelties have brought additional challenges to WSN. Sensornets are seeking for new approaches for efficient data routing and management. The last few year ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract Recent advances in Wireless Sensor Networks (WSN) have led to a great breakthrough in sensors design and features. These technological novelties have brought additional challenges to WSN. Sensornets are seeking for new approaches for efficient data routing and management. The last few years have witnessed the emergence of several approaches that build Distributed Hash Tables (DHTs) over WSN. DHTs are initially conceived for efficient data lookup in large-scale wired networks. The main objective of this combination is to manage location-independent data and nodes identification. DHT mapping over WSN brings however new challenges. This paper presents an analytical survey on applying DHT techniques in WSNs. It describes existing DHT-based routing and data management protocols and includes a detailed classification of them.
Multiple Distributed Indexing Scheme for Supporting Energy-efficient Range Query in Data-Centric Storage Sensor Networks
"... Abstract: We envision that a sensor network would be deployed for multiple applications with different preference of range query processing. In that situation, multi-dimensional range query capability is useful since it can flexibly support various applications. We propose, in this paper, a data ind ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: We envision that a sensor network would be deployed for multiple applications with different preference of range query processing. In that situation, multi-dimensional range query capability is useful since it can flexibly support various applications. We propose, in this paper, a data indexing scheme that improves energyefficiency of such range query for Data-Centric Storage sensor networks. Our indexing scheme maintains multiple locality preserving sub-indices. Each sub-index is favorable, in terms of locality preserving, for a specific attribute. Querying is conducted on all those sub-indices to find the most efficient copies of data. Our simulation shows that our indexing scheme can reduce up to 50 % of query cost.
