Proceedings of the 2nd International Workshop on Middleware for Sensor Networks 2007
DOI: 10.1145/1376860.1376864
|View full text |Cite
|
Sign up to set email alerts
|

A piggybacking approach to reduce overhead in sensor network gossiping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…"Piggybacking is a bi-directional data transmission technique in the network layer. It makes the most of the sent data frames from receiver to emitter and adds the confirmation that the data frame sent by the sender was received successfully acknowledge" (Ucan e. al., 2007).…”
Section: A) Location Aided Routing Protocol (Larzmentioning
confidence: 99%
“…"Piggybacking is a bi-directional data transmission technique in the network layer. It makes the most of the sent data frames from receiver to emitter and adds the confirmation that the data frame sent by the sender was received successfully acknowledge" (Ucan e. al., 2007).…”
Section: A) Location Aided Routing Protocol (Larzmentioning
confidence: 99%
“…However, two attributes with different monitoring periods will be piggybacked in very few messages. In [12], authors propose a piggybacking approach to reduce gossiping overhead in sensor networks. They developed a scheduling strategy based on semblance graphs to build a piggybacking scheduler of different streams of messages.…”
Section: B Piggybacking Scheduling Strategiesmentioning
confidence: 99%
“…Selecting a piggybacking scheduler is equivalent to partitioning this graph into connected subgroups such that the sum of weights is maximized while the number of vertices in any subgroup is less than r max . From [12], we adapted a Greedy algorithm based on Kruskal's algorithm to build a Maximum-Weight Spanning Tree. In our model, the number of partitions which contain the grouped piggybacked attributes, is dynamic and limited by r max which is specific to the available outgoing packet in a node.…”
Section: B Piggybacking Scheduling Strategiesmentioning
confidence: 99%
“…When overlays coexist, their communication facets can often be coordinated locally to cause them to communicate with the same destination in a way that does not degrade the original service. When this happens, the network traffic can be reduced through piggybacking [22,23] by merging together the data and control messages of multiple overlays to the same destination.…”
Section: A Classification Of Synergies Between Coexisting Overlaysmentioning
confidence: 99%
“…We have already discussed many of these works [5,1,2]. In addition, Ucan et al [22] proposed a piggybacking mechanism to reduce overheads between multiple gossip broadcasts in a wireless sensor network.…”
Section: Related Workmentioning
confidence: 99%