Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Exploration and Data Aggregation in Distributed Sensor Networks

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 4,396

Availability: In stock

 
  • Product Description
 

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 k-selection 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 element-values. We have proposed a deterministic algorithm with much improved complexity.

Product Specifications
SKU :COC93487
AuthorIndranil Nandy
LanguageEnglish
BindingPaperback
Number of Pages156
Publishing Year2011-12-15T00:00:00.000
ISBN978-3846554456
Edition1 st
Book TypeReal analysis, real variables
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-08-14 00:00:00
0 Review(s)