Combining multi-path forwarding and packet aggregation for improved network performance in wireless mesh networks

Stasi, Giovanni Di; Karlsson, Jonas; Avallone, Stefano; Canonico, Roberto; Kassler, Andreas; Brunström, Anna

doi:10.1016/j.comnet.2014.01.006

Cited by 13 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, messages going out from a particular node has multiple sinks options to be sent, but only 1 sink is selected as destination, which means that the same message is not received by multiple sinks. Knowing this, the new version of Equation 11 should consider all s m ∈ S, as it is presented in Equation 16.…”

Section: Multiple-sink Formulationmentioning

confidence: 99%

“…Equation 16 ensures that the number of payloads delivered to any sink must be equal or greater than the NL. As NL = min L i , the constraints in Equation 16 ensure that the sinks cannot receive less than the min L i since min L i is the least number of produced payloads. For instance, the constraints in Equation 16 force the sinks to receive at least one payload from each group k in a communication round c. In some cases, depending on the layout and the size of group k, the sinks will receive more than one payload from group k in a communication round c.…”

Section: Multiple-sink Formulationmentioning

confidence: 99%

“…This constraint also influences the level of the payload aggregation performed on the internal group traffic. It is worth to observe that Equation 16 limits the maximum aggregation level allowed on the internal group traffic. On the opposite side, the case of minimum aggregation level occurs when the set of sinks receives all payloads produced by the members of the group, which means payload aggregation does not take place.…”

Section: Multiple-sink Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Energy‐efficient multigroup communication

Riker

Fonseca

Curado

et al. 2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Wireless devices are widely used to monitor and control multiple groups within the context of machine‐to‐machine applications. The Constrained Application Protocol provides communication capabilities for applications that demand periodic monitoring of multiple groups. Because of the energy constraints of the devices used, a key challenge is to extend the network lifetime. Data aggregation solutions have been proposed to reduce the amount of network traffic and increase energy efficiency. However, for periodic monitoring of multiple groups, current data aggregation solutions do not exploit the potential of combining multiple payloads in a single message. In addition, solutions in literature are unable to take advantage of the communication interactions that occur when there is traffic originating from different groups. To fill this gap, this paper focuses on a nontraditional data aggregation approach, named two‐tier aggregation, that applies the idea of inserting many payloads in 1 message to efficiently gather data from multiple groups, introducing novelty on how the messages are assembled. An integer linear programming model is proposed to maximize the network lifetime in multiple group scenarios. The proposed formulation guarantees the energy efficiency of two‐tier aggregation and defines an upper bound for the heuristics. The evaluation shows the lifetime upper bound obtained by the proposed integer linear programming model on different network sizes and compares it to state‐of‐the‐art heuristic solutions.

show abstract

Section: Multiple-sink Formulationmentioning

confidence: 99%

Section: Multiple-sink Formulationmentioning

confidence: 99%

Section: Multiple-sink Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Energy‐efficient multigroup communication

Riker

Fonseca

Curado

et al. 2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…In [7] the authors investigate another method to increase packet aggregation opportunities. Their focus is on multi-path networks where a routing decision is made based on a set of weights that are assigned to each direct neighbour.…”

Section: Related Workmentioning

confidence: 99%

“…The majority of these solutions focus on packet aggregation [1,2,3,4,5,6,7], which works by combining multiple small VoIP packets into a single WiFi frame before transmission, hence lowering the number of frame transmissions required, which further reduces the probability of collision.…”

Section: Introductionmentioning

confidence: 99%