Relay Node Selection Technique in Homogeneous Cluster Based WSN

Relay Node Selection Technique in Homogeneous Cluster Based WSN

EnglishPaperback / softbackPrint on demand
Samsuzzaman, Md.
LAP Lambert Academic Publishing
EAN: 9783846537671
Print on demand
Delivery on Friday, 24. of July 2026
€50.05
Common price €55.62
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

Wireless Sensor Networks (WSNs) are collections of low cost, low power and compact size computational nodes that sense an environment or monitor an area for some parameters of interest and forward such information to a central processing center or base station for appropriate processing. Now a day s energy consumption is one of the fundamental research issues to extend the sensor network life time. Clustering techniques reduce this consumption by aggregating the information of a cluster. When the clustering protocols are single hop, cluster head sends data to base station. But in multihop communication, cluster head communicate through other cluster head or any special nodes called relay node in heterogeneous sensor network. But in homogeneous network, selection of next node depends on flooding or gossiping technique that introduces serious energy consumption. Here we propose simple cluster to cluster communication architecture for randomly deployed homogeneous SN and develop an algorithm to select a set of relay nodes between clusters. The simulation result shows that our proposed technique prolonging the life time of a cluster head.
EAN 9783846537671
ISBN 3846537675
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Pages 108
Language English
Authors Abdullah, Md. Ibrahim; Masud, Md. Abdul; Samsuzzaman, Md.
Edition Aufl.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.