“…On the other hand data transmission can be significantly reduced if beacon nodes would share precalculated data or parts of it. Using a cluster based structure like 2-MASCLE [3] may be one suitable solution.…”
Section: Discussionmentioning
confidence: 99%
“…In many applications of WSNs, knowledge of nodes' locations is mandatory for a meaningful interpretation of the data sensed. Location-awareness is not only necessary to assign a location to measured values but also to perform geographic routing [1] [2] or location based clustering as described in [3]. Due to existing limitations in terms of size and energy consumption, local positioning within the network is preferred over utilizing common positioning systems like GPS.…”
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This allows to perform an originally complex calculation with high precision on constrained nodes. Besides this advantage, DLS lacks in two harmful constraints concerning practical appliance. On the one hand the algorithm does not scale, i.e. calculation and communication increases with the number of beacon nodes or with network size, respectively. On the other hand DLS even does not work for large networks. An important assumption of DLS is that each blind node can communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. In this work we present an adaptation of DLS, concerning major changes, which enables DLS to be used in large WSNs for the first time. At the same time computational and communicational cost of each node becomes independent from network size, while precision is kept on the same high level.
“…On the other hand data transmission can be significantly reduced if beacon nodes would share precalculated data or parts of it. Using a cluster based structure like 2-MASCLE [3] may be one suitable solution.…”
Section: Discussionmentioning
confidence: 99%
“…In many applications of WSNs, knowledge of nodes' locations is mandatory for a meaningful interpretation of the data sensed. Location-awareness is not only necessary to assign a location to measured values but also to perform geographic routing [1] [2] or location based clustering as described in [3]. Due to existing limitations in terms of size and energy consumption, local positioning within the network is preferred over utilizing common positioning systems like GPS.…”
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This allows to perform an originally complex calculation with high precision on constrained nodes. Besides this advantage, DLS lacks in two harmful constraints concerning practical appliance. On the one hand the algorithm does not scale, i.e. calculation and communication increases with the number of beacon nodes or with network size, respectively. On the other hand DLS even does not work for large networks. An important assumption of DLS is that each blind node can communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. In this work we present an adaptation of DLS, concerning major changes, which enables DLS to be used in large WSNs for the first time. At the same time computational and communicational cost of each node becomes independent from network size, while precision is kept on the same high level.
“…By exploiting cluster structures, which are widely used in WSNs, detection of erroneous nodes can become more efficient. A clustering approach which is particularly suitable is 2-MASCLE [12]. This approach ensures that each node in a cluster is able to observe the same phenomena, i.e.…”
Wireless Sensor Networks (WSNs) have attracted considerable research effort in the community during the past couple of years. One of the most challenging issues so far is the extension of network lifetime with regards to small battery capacity and self-sustained operation. Endeavors to save energy have been made on various frontiers, ranging from hardware improvements over medium access and routing protocols to network clustering and role changing strategies. Only weak attention has been paid to the detection of erroneous nodes which can be also used for lifetime extension of WSNs. In contrast to some authors, regarding detection of failures in communication as error detection, we focus on faulty sensor readings. In this work we present an efficient error detection algorithm which detects erroneous nodes within the network based on neighborhood relations. The results of our algorithm enables direct reactions of concerned nodes or network parts without expensive involvement of any kind of central computing instances.
“…Data aggregation approaches concatenate and combine messages from adjacent nodes to reduce data transmissions as well as length of data packets. 2-MASCLE [10], as an example of clustering approaches, uses location based square cells to build clusters within which only one node has to be active at a time. In addition, only every second cluster has to be active, which prolongs the lifetime by 80%.…”
Wireless Sensor Networks (WSN) have attracted considerable research effort in the community during the past couple of years. One of the most challenging issues so far is the extension of network lifetime with regards to small battery capacity and self-sustained operation. Endeavors to save energy have been made on various frontiers, ranging from hardware improvements over medium access and routing protocols to network clustering and role changing strategies. In addition some authors studied failures in communication regarded as error detection. Yet, only weak attention has been paid to the detection of malicious nodes and its potential for lifetime extension. In this work, we present a short overview of detection and classification of malicious nodes in WSN and describe its potential in terms of network lifetime and reliability.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.