Exploration and Data Aggregation in Distributed Sensor Networks: - A Geometric Approach - Softcover

Nandy, Indranil

 
9783846554456: Exploration and Data Aggregation in Distributed Sensor Networks: - A Geometric Approach
Softcover
ISBN 10: 3846554456 ISBN 13: 9783846554456
Verlag: LAP LAMBERT Academic Publishing, 2011

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Biografía del autor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
LAP LAMBERT Academic Publishing
Erscheinungsdatum
2011
Sprache
Englisch
ISBN 10 
3846554456
ISBN 13 
9783846554456
Einband
Tapa blanda
Anzahl der Seiten
156
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar