hJam: Attachment Transmission in WLANs

Wu, Kaishun; Li, Haochao; Wang, Lu; Yi, Yunhui; Liu, Yunhuai; Chen, Dihu; Luo, Xiliang; Zhang, Qian; Ni, Lionel M.

doi:10.1109/tmc.2012.194

Cited by 50 publications

(8 citation statements)

References 21 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assume that there exists a multicast session in the network. The set of source nodes is {v 5 , v 11 , v 15 }, and the set of destination nodes is {v 1 10 , v 12 , v 13 }. Figure 3B reports an desired forest for the uncertain multicast session .…”

Section: Approximation Methods By Adjusting Congested Linksmentioning

confidence: 99%

“…Three uncertain multicast sessions, 1 , 2 , and 3 , are injected into the network. In the session 1 , a node set {v 5 } records the source nodes, and a node set {v 10 , v 3 , v 2 , v 9 , v 7 } records the destination nodes. In the session 2 , a node set {v 6 , v 9 } represents the source nodes, and a node set {v 2 , v 4 , v 1 , v 10 , v 7 } represents the destination nodes.…”

Section: Observationsmentioning

confidence: 99%

“…As pointed in one study, 8 it is not necessary that the source of a multicast session has to be in a specific location as long as certain constraints are satisfied. A major reason is that the widely used content replica designs for improving the robustness and efficiency in various networks, such as the content distribution network, Internet Protocol television networks, 9 enterprise networks, 10,11 and data center networks. 12,13 When a multicast session has multiple potential sources, each destination may have opportunity to select any replica node as its source in theory.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The packing problem of uncertain multicasts

Ren

Guo

Xie

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP-hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority-based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them. KEYWORDS packing problem, routing algorithm, uncertain multicast 1 Concurrency Computat: Pract Exper. 2017;29:e3985.wileyonlinelibrary.com/journal/cpe

show abstract

Section: Approximation Methods By Adjusting Congested Linksmentioning

confidence: 99%

Section: Observationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The packing problem of uncertain multicasts

Ren

Guo

Xie

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Wireless sensor and actuator networks (WSAN), including a great number of sensing and actuation devices, have achieved increasing attention due to their distinct advantages, e.g., small size, low cost, no cabling, etc. [1][2][3][4]. With the help of actuators, WSAN can construct feedback loops which integrate cyber space and physical world together.…”

Section: Introductionmentioning

confidence: 99%

Testing and Defending Methods Against DOS Attack in State Estimation

Zhang

Zhou

et al. 2016

Asian Journal of Control

View full text Add to dashboard Cite

In this paper, we consider a state estimation problem. In this problem, a sensor measures the state of a linear discrete‐time system and sends measurements to an estimator via a packet‐dropping communication link. We are concerned with the effect of Denial‐of‐Service (DoS) attacks on stability of the estimation system, and particularly focus on how to examine whether the communication channel is under DoS attack or not as well as how to defend accordingly, if defense is possible. We formulate the detection problem as a hypothesis testing problem provided that the statistics of the communication channel is known a priori. Two defense countermeasures are proposed: one of which uses a secured packet coding approach to partly compensate the previous packet loss; and in the other the sensor's transmission power is raised to resist the jamming effect brought by the DoS attack. Simulations are provided to demonstrate the main results.

show abstract

“…Moreover, most of the data traffic originates from indoor users as introduced in . Because there exists large wall penetration loss between the outdoor base stations and indoor users, the indoor users can hardly achieve high data rates and quality of service (QoS) from conventional wireless communication networks . As a result, femtocell with low‐power, low‐mobility, and high‐performance was proposed to assist the conventional macrocell networks in serving the indoor users, which can greatly improve the coverage and data rates of the cellular networks .…”

Section: Introductionmentioning

confidence: 99%

Analytical evaluation of downlink interference mitigation in multi‐macrocell/femtocell networks with frequency & cell partitioning

Chen

Jiang

et al. 2016

Wireless Communications

View full text Add to dashboard Cite

In this paper, we propose an interference mitigation method to suppress the downlink interference in multi‐macrocell/femtocell networks, and analytically evaluate the interference mitigation and average rate performances. Specifically, the proposed interference mitigation method consists of three steps: frequency partitioning, cell partitioning, and sub‐band allocation. In the frequency partitioning step, the whole downlink frequency band is divided into nine non‐overlapping sub‐bands. In the cell partitioning step, each macrocell is divided into four macrocell regions and three femtocell regions for macrocells' and femtocells' communications, respectively. In the sub‐band allocation step, each macrocell or femtocell region is allocated a sub‐band to guarantee that any two neighboring macrocell/femtocell regions use different sub‐bands. Conducted simulation results show that the proposed method is effective in mitigating the downlink interference and improving the average downlink per‐channel rate in multi‐macrocell/femtocell networks. In summary, the major contribution of the proposed interference mitigation method is that the downlink interference can be mitigated without cooperation between macrocells and femtocells, while the full frequency utilization of the macrocell is achieved. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

hJam: Attachment Transmission in WLANs

Abstract: If it is the author's pre-published version, changes introduced as a result of publishing processes such as copy-editing and formatting may not be reflected in this document. For a definitive version of this work, please refer to the published version.

Cited by 50 publications

References 21 publications

The packing problem of uncertain multicasts

The packing problem of uncertain multicasts

Testing and Defending Methods Against DOS Attack in State Estimation

Analytical evaluation of downlink interference mitigation in multi‐macrocell/femtocell networks with frequency & cell partitioning

Contact Info

Product

Resources

About