The ACQUIRE mechanism for efficient querying in sensor networks

Sadagopan, Narayanan; Krishnamachari, Bhaskar

doi:10.1109/snpa.2003.1203365

Cited by 168 publications

(85 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• ACQUIRE: In [41], Sadagopan et al proposed a technique for querying sensor networks called ACtive QUery forwarding In sensoR nEtworks (ACQUIRE). Similar to COUGAR, ACQUIRE views the network as a distributed database where complex queries can be further divided into several sub queries.…”

Section: Flat Routingmentioning

confidence: 99%

Routing techniques in wireless sensor networks: a survey

Al‐Karaki

Kamal

2004

IEEE Wireless Commun.

3,609

1,628

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of different routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flat, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design tradeoffs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The paper concludes with possible future research areas.

show abstract

Section: Flat Routingmentioning

confidence: 99%

Routing techniques in wireless sensor networks: a survey

Al‐Karaki

Kamal

2004

IEEE Wireless Commun.

3,609

1,628

View full text Add to dashboard Cite

show abstract

“…In Active Query Forwarding in Sensor Networks (ACQUIRE) proposed by Sadagopan, Krishnamachari and Helmy [9], the wireless sensor network is viewed as a distributed database. Under ACQUIRE, the node in the network forwards an active query packet.…”

Section: Efficient Routing Algorithmsmentioning

confidence: 99%

Trade-off between Accuracy and Longevity in Wireless Sensor Networks

Laloo¹,

Sunhaloo²,

Subramanian³

2015

IJCTE

View full text Add to dashboard Cite

Abstract-Two major controversial metrics that determine the stability period of a wireless sensor network (WSN) are accuracy and longevity. In this paper, we analyse the trade-off between accuracy and longevity in WSNs. We investigate different types of WSNs routing techniques together with their applications and state of the art in WSN routing protocols and determine their underlying success with regards to accuracy and longevity. We provide alternatives for algorithms not described in both parameters.Index Terms-Network lifetime, routing protocol, wireless sensor network.

show abstract

“…There has been considerable work on broadcasting and querying in sensor networks [22], [18], [2], [19], [13], [15], [4], [1], [12], [11], [16]. It was demonstrated in [13] that flooding based broadcasting/querying schemes such as [11], [12] cause many redundant transmissions leading to the broadcast storm problem.…”

Section: B Related Workmentioning

confidence: 99%

“…In [19], the two-hop neighbor information is utilized for building connected dominating sets that efficiently broadcast information. Also, querying in sensor networks has been studied in papers such as [16], [5], authors in [1] propose random walks initiated by the source node and the destination node. They have shown that querying delay, transmission overheads can be reduced by spreading routing information through the network.…”

Section: B Related Workmentioning

confidence: 99%

Broadcasting in Sensor Networks: The Role of Local Information

Subramanian

Shakkottai

Arapostathis

2008

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ() to reach any node that is a unit distance away, where M (n) is the transmission range of any sensor node. However, in sensor networks with large radio ranges, flooding based broadcasting schemes cause many redundant transmissions leading to a broadcast storm problem. Many approaches have been proposed to mitigate the broadcast storm problem, where broadcast schemes employ some knowledge of the previous transmissions to reduce the extraneous transmissions. In this paper, we study the role of geographic information and state information (i.e. memory of previous messages or transmissions) in reducing the redundant transmissions in the network.We consider three broadcasting schemes with varying levels of local information: (i) where nodes have no geographic or state information, (ii) nodes have coarse geographic information about the origin of the broadcast, and (iii) where nodes have no geographic information, but remember previously received messages. We also consider the related problem of broadcasting to a set of "spatially uniform" points in the network (lattice points) in the regime where all nodes have only a local sense of direction. For each of these networks, we compute the number of transmissions required to achieve broadcast delays that are order-wise equivalent to simple flooding algorithms, i.e. Θ(). We first show that networks with no geographic or state information require exponentially large number of transmissions whereas networks with very little geographic or state information can utilize the knowledge to significantly reduce the transmission overheads. Next, we show that networks with local information, can reduce the congestion by spreading the messages more uniformly through the network. Finally, we show that networks with only state information can also employ the information to provide a radial drift to the transmitted packets. In the context of lattice broadcasting, we again show that local information results in significant reduction of transmission overheads. We quantitatively compare the transmission overheads of broadcasting strategies and validate our results using simulations.

show abstract

The ACQUIRE mechanism for efficient querying in sensor networks

Cited by 168 publications

References 10 publications

Routing techniques in wireless sensor networks: a survey

Routing techniques in wireless sensor networks: a survey

Trade-off between Accuracy and Longevity in Wireless Sensor Networks

Broadcasting in Sensor Networks: The Role of Local Information

Contact Info

Product

Resources

About