Exploration and Data Aggregation in Distributed Sensor Networks:  A Geometric Approach,Used

Exploration and Data Aggregation in Distributed Sensor Networks: A Geometric Approach,Used

In Stock
SKU: DADAX3846554456
Brand: LAP Lambert Academic Publishing
Sale price$98.73 Regular price$141.04
Save $42.31
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Coverage is an important issue in WSN. The problem is to ensure full coverage of a region whose geometrical details are not available. A set of mobile sensors is to be deployed in the unexplored region to form a mobile sensor network. In the first part, our work is on the field of Exploration in sensor networks. We have proposed an incremental algorithm to explore the region. First a general algorithm is given for a completely unknown region. Next with a little modification it is applied to the case of partially known region. Later we have discussed about some more special cases and related algorithms. In the second part, we have worked on another important field of sensor networks Data Aggregation. Here we have discussed about the kselection algorithm. Given a general connected network of diameter D, consisting of n nodes, each node containing m number of numeric elements, we are to find the kth smallest element among the elements across the network. In our work, there is no imposed assumption or constraint on the magnitude of the elements or the size of the network or the range of elementvalues. We have proposed a deterministic algorithm with much improved complexity.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed