Minimum-energy broadcast in all-wireless networks

Čagalj, Mario; Hubaux, Jean-Pierre; Enz, Christian

doi:10.1145/570645.570667

Cited by 322 publications

(239 citation statements)

References 22 publications

Supporting

Mentioning

235

Contrasting

Unclassified

Order By: Relevance

“…Though researchers have addressed the problem of energy-efficient and reliable broadcasting in wireless and sensor networks [1,3,7,16,17], security issues have not been addressed adequately.…”

Section: Related Workmentioning

confidence: 99%

Secure and reliable broadcasting in wireless sensor networks using multi‐parent trees

Srinivasan

2008

Security Comm Networks

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) have been the focal point of research over the last several years. Broadcast communication is a key requirement for WSNs since many tasks in the network depend on broadcasting, including critical tasks like querying. Consequently, securing broadcast communication over sensor networks has become an important research challenge.Typically, broadcast communication involves two steps: broadcasting and acknowledging. In the broadcasting phase, the message is broadcast in the network. In the acknowledging phase, nodes that successfully received the broadcast message send an acknowledgement to the broadcast origination node, which in this paper is always the sink. The terms "sink" and "base station" are used interchangeably throughout this paper. Intuitively, broadcast communication has two important metrics: reliability and security. Though the reliability metric has drawn sufficient attention in the research community, the security metric has not. In this paper, we address 1 both metrics with an emphasis on the former and address the Denial-of-Broadcast Message attacks (DoBM) in sensor networks. We propose a novel Multi-Parent tree-based model called the k-Parent Flooding Tree Model (k-FTM). We also present distributed algorithms for the construction of k-FTM and prove via simulation and analysis that the proposed k-FTM is robust against DoBM. Our Multi-Parent tree model enables the base station to detect DoBM very efficiently, even in the presence of a prudent adversary who focuses on remaining undetected by causing damage below the detection threshold. k-FTM is, to our best knowledge, the first fault-tolerant tree model that is both reliable and secure. Through simulations we confirm that our model achieves detection rates close to that of a static tree and a broadcast reliability close to that of blind flooding.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure and reliable broadcasting in wireless sensor networks using multi‐parent trees

Srinivasan

2008

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…The problem of minimum energy broadcast has been well researched in the literature and proved to be NPhard [15,16]. However, the complexity of broadcast lifetime remains open.…”

Section: Broadcast Lifetimementioning

confidence: 99%

Maximizing system lifetime in wireless sensor networks

Alfieri¹,

Bianco²,

Brandimarte³

et al. 2007

European Journal of Operational Research

View full text Add to dashboard Cite

Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the past, this problem has been mostly studied from the indirect perspective of energy conservation. Although this leads to solutions that help extend network lifetime, energy conservation is not the same problem as network lifetime maximization. Some researchers have formally studied network lifetime maximization problems, based on the assumption that energy is only consumed by packet transmission. However, it is well known that in many cases energy is significantly consumed during overhearing and idle periods. In this paper, we try to present formal analysis of a variety of network lifetime maximization problems in different energy consumption models. In particular, we identify different energy consumption models, define a variety of fundamental network lifetime maximization problems in individual energy consumption models, and formally analyze their complexity. Polynomial time algorithms are presented for tractable problems, and NPhardness proofs are presented for intractable problems.

show abstract

“…Although it is known that finding the optimal solution for total minimum power broadcast is NP-complete [3], [16], several heuristics resulting in routing trees with satisfactory performance have been proposed in the recent literature [3], [15], [28].…”

Section: Network Initializationmentioning

confidence: 99%

Power proximity based key management for secure multicast in ad hoc networks

Lazos

Poovendran

2006

Wireless Netw

View full text Add to dashboard Cite

As group-oriented services become the focal point of ad hoc network applications, securing the group communications becomes a default requirement. In this paper, we address the problem of group access in secure multicast communications for wireless ad hoc networks. We argue that energy expenditure is a scarce resource for the energy-limited ad hoc network devices and introduce a crosslayer approach for designing energy-efficient, balanced key distribution trees to perform key management. To conserve energy, we incorporate the network topology (node location), the "power proximity" between network nodes and the path loss characteristics of the medium in the key distribution tree design. We develop new algorithms for homogeneous as well as heterogeneous environments and derive their computational complexity. We present simulation studies showing the improvements achieved for three different but common environments of interest, thus illustrating the need for cross-layer design approaches for security in wireless networks. Index Termsad hoc networks, key management, multicast, security, energy efficiency

show abstract

Minimum-energy broadcast in all-wireless networks

Cited by 322 publications

References 22 publications

Secure and reliable broadcasting in wireless sensor networks using multi‐parent trees

Secure and reliable broadcasting in wireless sensor networks using multi‐parent trees

Maximizing system lifetime in wireless sensor networks

Power proximity based key management for secure multicast in ad hoc networks

Contact Info

Product

Resources

About