Fish bone structure based data aggregation and routing in wireless sensor network: multi-agent based approach

Lifetime Maximization of Sensor Networks Through Optimal Data Collection Scheduling of Mobile Sink

“…To mitigate these problems, in rendezvous-node based data collection strategy, a mobile sink collects data from a few rendezvous nodes [22] [23] over a designated tree-like backbone [24] [28], cluster-heads [35] [36] [37] or routing-backbone [29] [38], instead of traveling all source nodes in the network. In the literature, rendezvous-node based strategies have been developed for two varieties of networks: obstacle-free and obstructed-networks.…”

“…In rendezvous-node based data collection strategy [21] [22] [23], a mobile sink only visits and collects data from a few rendezvous nodes over a designated tree-like backbone [24], cluster-heads [25] [26] or routing-backbones (e.g., Honeycomb [27], Fish-bone [28], Starfish routing backbone [29], etc. ), instead of visiting all sensor nodes in the network.…”

Distributed and morphological operation-based data collection algorithm

“…Routing for data aggregation, compression, and fusion is very effective to decrease in-network data transmission. [2][3][4][5][6][7][8][9][10][11][12][13][14][15] In the shortest path tree (SPT), 2 each source sends its information to the sink along the shortest path between the two and overlapping paths are combined to form an aggregation tree. Energy efficient cluster-based data aggregation (ECBDA) 3 divides the monitoring region into multiple layers, forms K clusters for each layer according to the node residual energy and communication cost, fuses data in clusters, and routes data by efficient route discovery.…”

“…In Figure 7(a), when the node Node 105 (marked in yellow) sends its EDM, t is set to 1 at the moment, and all of the nodes within the green region receive the message, although only the red nodes forward the EDM further. Thus, we can have Forwarder(9, 7, 1) = f(7, 5), (11,5), (7,9), (11,9)g. After the EDM is forwarded by the red nodes in Figure 7(a), t is set to 2.…”

“…= f(3, 1),(7,1),(11,1),(15,1),(3,5),(15,5),(3,9),(15,9),(3,13),(7,13),(11,13),(15,13)g.To restrict the EDM forwarding to the structuring neighborhood, each node holds a variable Num H. Num H records the maximum number of EDM forwardings within the structuring neighborhood, and it is determined by the size of the structuring element and the node communication radius. If the size of the structuring element is s 3 s and the communication radius is r, then an EDM will be forwarded (s À 1)a=( ffiffi ffi 2 p r) AE Ç times to ensure that all of the structuring neighbors receive it.…”