Query localization techniques for on-demand routing protocols in ad hoc networks

Castaneda, R.; Das, Samir R.

doi:10.1145/313451.313534

Cited by 112 publications

(60 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The value of probability is set according to packet counter that is not equal to the number of node neighbors. In [24], the authors introduced a technique to reduce the RREQ overhead during route discovery operation, using the previous path. They argue that when the path between source and destination is changed, the new path between them will not be extremely different from the previous one.…”

Section: Related Workmentioning

confidence: 99%

Probabilistic Routing Using Queuing Theory for Manets

Khandelwal¹,

Prasanna²,

Hota

2011

IJWMN

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Probabilistic Routing Using Queuing Theory for Manets

Khandelwal¹,

Prasanna²,

Hota

2011

IJWMN

View full text Add to dashboard Cite

show abstract

“…Table 1 lists these components and their composition. Each sensor node in the WSN runs application software (e.g., a query processor) developed using TinyOS [3]. The sink node acts as the root of the WSN and communicates with the data proxy.…”

Section: Terminologymentioning

confidence: 99%

“…However, such environments also make it hard to study techniques for data-centric WSN applications in real sensor networks. Furthermore, major techniques in data-centric WSNs, such as in-network query processing [8] [11] and queryinformed routing [3], need a realistic development and evaluation environment with system feedback at a suitable level of detail. In this design paper, we propose to develop an accurate sensor network emulator in order to facilitate studies of techniques for data-centric WSN applications.…”

Section: Introductionmentioning

confidence: 99%

Accurate Emulation of Wireless Sensor Networks

Luo

Zheng

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Wireless sensor networks (WSNs) have a wide range of useful, datacentric applications, and major techniques involved in these applications include in-network query processing and query-informed routing. Both techniques require realistic environments and detailed system feedback for development and evaluation. Unfortunately, neither real sensor networks nor existing simulators/emulators are suitable for this requirement. In this design paper, we propose a distributed sensor network emulator, a Virtual Mote Network (VMNet), to meet this requirement. We describe the system architecture, the synchronization of the nodes and the virtual time emulation with a focus on mechanisms that are effective for accurate emulation.

show abstract

“…Although these algorithms have strong distribution and can achieve most approximate solution, but the reliability was not so strong as to be applied in practice. To solve the problem, the engineers has brought out mechanism to reduce broadcast overhead by use of position information [5,6] or available path information [7], the most advantage of which is that the spatial localization of node mobile was utilized. It is benefit for broadcasting inquiring near the original paths and executing deterministic routing communication, but it is not suitable for general basic broadcasting communication.…”

mentioning

confidence: 99%

Research on Avoid Repetition Information Flooding Broadcasting Protocol

Liu¹,

Zhang²

2010

IJCEE

View full text Add to dashboard Cite

Abstract-Distributed ad hoc broadcasting is not only the foundation for unicast, multicast as well as deterministic broadcast routing protocols to detect and maintain their routing, but itself can be used as approach to transmit messages for unicast, multicast and broadcast communication. In order to avoid the problems of poor broadcast reliability, large transmission delay and more network resource occupation that caused by broadcast storms, adjacent conflict, hidden collisions in the packet radio network application of traditional broadcasting protocol, the paper presented an Avoid Repetition Information Flooding Broadcasting Protocol (ARIFBP) and mainly researched on its material algorithm and related key problems for practical applications based on Collision Avoid Multiple Access (CAMA) protocol. The proposition of ARIFBP is of great significance for the improvement of routing protocols and researches on ad hoc packet radio network. Index Terms-packet radio network, broadcast, flooding, avoid repetition information I. INTRODUCTIONIn the networking process of multi-hop packet radio network, distributed ad hoc broadcasting is a necessary operation, which is not only the foundation for unicast, multicast as well as deterministic broadcast routing protocols to detect and maintain their routing, but it can be used as means to transmit unicast, multicast and broadcast messages. Flooding is a king of ad hoc technology that has been widely used in the practical network applications. But when applied in multi-hop packet radio network, it will introduce the problems of broadcast storms, adjacent conflict, hidden collisions and etc, which will result in bad broadcast reliability, larger transmission delay and more network resource occupation. Aim at the characteristics of multi-hop packet radio network, the paper brought out the ARIFBP. It utilizes CAMA firstly to solve the problems of adjacent conflict and hidden collisions, which is a kind of non-collision and high efficiency preferential RTS/CTS appointment multiple access mechanism that can not only solve problems of adjacent conflict and hidden collisions, but also effectively support QoS of multimedia traffic and insure prior traffic can be accessed in priority. At the same time, the ARIFBP makes use of local neighbor information and collected repetition broadcasting information to avoid broadcast storms, so that the repeated broadcasting information of flooding can be effectively avoid, and improve the broadcast transmission speed and network throughput, which has good reliability, too. The arrangement of the paper is as following: Section 2 analyzes the related research works of broadcasting protocol and points out their advantages and disadvantages; In section 3, the detail algorithm of the paper proposed ARIFBP; Section 4 researches key problems of forward delay, adjacent information acquisition, one-way link and data structure that relates to practical applications of ARIFBP; Section 5 concludes our work. II. RELATED RESEARCH WORKS OF FLOODING BROADCASTING P...

show abstract

Query localization techniques for on-demand routing protocols in ad hoc networks

Cited by 112 publications

References 18 publications

Probabilistic Routing Using Queuing Theory for Manets

Probabilistic Routing Using Queuing Theory for Manets

Accurate Emulation of Wireless Sensor Networks

Research on Avoid Repetition Information Flooding Broadcasting Protocol

Contact Info

Product

Resources

About