Items related to Exploration and Data Aggregation in Distributed Sensor...
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Indranil Nandy, currently working as a software professional in telecommunication domain, has obtained his Master’s degree in Computer Science and Engineering from IIT Kharagpur in 2008, after graduating from Jadavpur University. His specific fields of interest include algorithms for distributed processing and pattern recognition techniques.
"About this title" may belong to another edition of this title.
Buy New
View this item
US$ 71.34
US$ 27.00 shipping from Germany to U.S.A.
Destination, rates & speedsSearch results for Exploration and Data Aggregation in Distributed Sensor...
Seller Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
LAP LAMBERT Academic Publishing Dez 2011, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 156 pp. Englisch. Seller Inventory # 9783846554456
Quantity: 2 available
Stock Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
Editorial Academica Espanola, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 156. Seller Inventory # 2698162037
Quantity: 4 available
Stock Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
Editorial Academica Espanola, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 156 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 95316650
Quantity: 4 available
Seller Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 5498698
Quantity: Over 20 available
Stock Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
Editorial Academica Espanola, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 156. Seller Inventory # 1898162047
Quantity: 4 available
Seller Image
Exploration and Data Aggregation in Distributed Sensor Networks
Published by
LAP LAMBERT Academic Publishing Dez 2011, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 156 pp. Englisch. Seller Inventory # 9783846554456
Quantity: 1 available
Seller Image
Exploration and Data Aggregation in Distributed Sensor Networks : A Geometric Approach
Published by
LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846554456
ISBN 13: 9783846554456
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783846554456
Quantity: 1 available