http://www.eecs.ucf.edu/~dcm/Teaching/COT4810-Spring2011/Literature/SensorNetworksSurvey.pdf

Wireless sensor networks: a survey

Data Mining - Concepts and Techniques.

Data Mining Practical Machine Learning Tools and Techniques

Wireless Communications

A 2001 IBM manifesto observed that a looming software complexity crisis -caused by applications and environments that number into the tens of millions of lines of code - threatened to halt progress in computing. The manifesto noted the almost impossible difficulty of managing current and planned computing systems, which require integrating several heterogeneous environments into corporate-wide computing systems that extend into the Internet. Autonomic computing, perhaps the most attractive approach to solving this problem, creates systems that can manage themselves when given high-level objectives from administrators. Systems manage themselves according to an administrator's goals. New components integrate as effortlessly as a new cell establishes itself in the human body. These ideas are not science fiction, but elements of the grand challenge to create self-managing computing systems.

The vision of autonomic computing

Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.

/pdf/the-broadcast-storm-problem-in-a-mobile-ad-hoc-network-2ovgqt6pyc.pdf

The broadcast storm problem in a mobile ad hoc network

https://ir.nctu.edu.tw:443/bitstream/11536/29078/1/000174218000005.pdf

One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k=1 is assumed. Applications of the result include: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.

/pdf/the-coverage-problem-in-a-wireless-sensor-network-4ssl5sybyb.pdf

The coverage problem in a wireless sensor network

The wireless mobile ad hoc network (MANET) architecture has received a lot of attention recently. This paper considers the access of multiple channels in a MANET with multi-hop communication behavior. We point out several interesting issues when using multiple channels. We then propose a new multi-channel MAC protocol, which is characterized by the following features: (i) it follows an "on-demand" style to assign channels to mobile hosts, (ii) the number of channels required is independent of the network topology and degree, (iii) it flexibly adapts to host mobility and only exchanges few control messages to achieve channel assignment and medium access, and (iv) no clock synchronization is required. Compared to existing protocols, some assign channels to hosts statically (thus a host will occupy a channel even when it has no intention to transmit) some require a number of channels which is a function of the maximum connectivity, and some necessitate a clock synchronization among all hosts in the MANET. Extensive simulations are conducted to evaluate the proposed protocol.

A new multi-channel MAC protocol with on-demand channel assignment for multi-hop mobile ad hoc networks

One of the fundamental issues in sensor networks is the coverage problem, which reflects howwell a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k =1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.

/pdf/the-coverage-problem-in-a-wireless-sensor-network-18os186zok.pdf

Yu-Chee Tseng

Papers

The broadcast storm problem in a mobile ad hoc network

The broadcast storm problem in a mobile ad hoc network

The coverage problem in a wireless sensor network

A new multi-channel MAC protocol with on-demand channel assignment for multi-hop mobile ad hoc networks

The coverage problem in a wireless sensor network