Comparison-based system-level fault diagnosis in ad hoc networks

Chessa, Stefano; Santi, Paolo

doi:10.1109/reldis.2001.970776

Cited by 120 publications

(95 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This process should be real-time as to guarantee the performance of the whole networks. In order to solve the fault diagnoses problem, many fault diagnoses algorithms [6] were bring out. After carefully surveying the existing algorithm today, we found that they cannot correctly diagnose faulty node with the presence of the changing of the network topology during the process of diagnosis, and these algorithms are analyzed with repetitious diagnosis for all the mobile hosts and cause the great system overhead due to the transmission of diagnosis messages by means of flooding throughout the whole networks.…”

Section: Security In Wireless Ad-hoc Networkmentioning

confidence: 99%

Wireless Ad-Hoc Networks

Zhou¹

2012

View full text Add to dashboard Cite

Deployed in 1990's, Mobile Ad-hoc networks have been widely researched for many years. Mobile Ad-hoc Networks are a collection of two or more devices equipped with wireless communications and networking capability. These devices can communication with other nodes that immediately within their radio range or one that is outside their radio range. For the later, the nodes should deploy an intermediate node to be the router to route the packet from the source toward the destination. The Wireless Ad-hoc Networks do not have gateway, every node can act as the gateway. Although since 1990s', lots of research has been done on this particular field, it has often been questioned as to whether the architecture of Mobile Ad-hoc Networks is a fundamental flawed architecture. The main reason for the argument is that Mobile Ad-hoc Networks are almost never used in practice, almost every wireless network nodes communicate to base-station and access points instead of co-operating to forward packets hop-by-hop.We take the position that Mobile Ad-hoc Networks (MANET) are a fundamentally flawed architecture. As argument, we try to clarify the definition, architecture and the characters of MANET, as well as the main challenges of constructing the MANET. Although many works have been done to solve the problem, we will show in this paper that it is very difficult to solve these limitations which made the Mobile Ad-hoc Networks a flawed architecture.After giving many evidences and analysis, we could see that the key technologies of Wireless Ad-hoc Networks were not implemented as well as we expect. That is to say, many problems are inherently unsolvable. Thus, we could explain why we take the position that Mobile Ad-hoc Networks are flawed architecture.

show abstract

Section: Security In Wireless Ad-hoc Networkmentioning

confidence: 99%

Wireless Ad-Hoc Networks

Zhou¹

2012

View full text Add to dashboard Cite

show abstract

“…Unlike previous neighbor monitoring schemes employing a single timer [30] or treating neighbors as the same [15], our scheme sets different timers for nonconsulting and consulting neighbors. The major reason for doing so is that data packets and EUP-like broadcast packets are subject to loss due to wireless transmission errors or collisions.…”

Section: Neighborhood Monitoring and Self-detectionmentioning

confidence: 99%

“…For example, Chessa and Santi [30] propose a single time-out scheme to monitor the systemlevel fault diagnosis. In [43], a residual energy scan is designed to approximately depict the remaining energy distribution within a WSN.…”

Section: Introductionmentioning

confidence: 99%

A Coverage Inference Protocol for Wireless Sensor Networks

Zhang

Fang

2010

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-After a wireless sensor network (WSN) is deployed, sensor nodes are usually left unattended for a long period of time.There is an inevitable devolution of the connected coverage of the WSN due to battery exhaustion of sensor nodes, intended physical destruction attacks on sensor nodes, unpredictable node movement by physical means like wind, and so on. It is, therefore, critical that the base station (BS) learns in real time how well the WSN performs the given sensing task (i.e., what is the current connected coverage) under a dynamically changing network topology. In this paper, we propose a coverage inference protocol (CIP), which can provide the BS an accurate and in-time measurement of the current connected coverage in an energy-efficient way. Especially, we show that the scheme called BOND, which our CIP requires to be implemented on each sensor node, enables each node to locally self-detect whether it is a boundary node with the minimal communication and computational overhead. The BOND can also be exploited to seamlessly integrate multiple functionalities with low overhead. Moreover, we devise extensions to CIP that can tolerate location errors and actively predict the change of the connected coverage based on residual energy of sensor nodes.

show abstract

“…For wireless and ad-hoc networks few works using the comparison approach have been done. The seminal work of Chessa and Santi [6] adapted the comparison approach to the wireless environment. They presented a distributed diagnosis algorithm that allows any fault-free mobile to diagnose the fault status of all mobiles in its neighborhood and in the network.…”

Section: Introductionmentioning

confidence: 99%