Relevant bibliographies by topics / Broadcast routing / Journal articles
To see the other types of publications on this topic, follow the link: Broadcast routing.

Journal articles on the topic 'Broadcast routing'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Broadcast routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Chou, Ching-Tsun, and Inder S. Gopal. "Linear broadcast routing." Journal of Algorithms 10, no. 4 (December 1989): 490–517. http://dx.doi.org/10.1016/0196-6774(89)90002-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

El-Obaid, Amnah. "Three-Dimension Hamiltonian Broadcast Wormhole-Routing." International journal of Computer Networks & Communications 7, no. 3 (May 31, 2015): 31–46. http://dx.doi.org/10.5121/ijcnc.2015.7303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ahmad, R., and F. Halsall. "Reduced broadcast algorithm for source routing." Electronics Letters 27, no. 24 (1991): 2288. http://dx.doi.org/10.1049/el:19911414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

HWANG, F. K., and C. H. LIN. "BROADCASTING IN A THREE-STAGE POINT-TO-POINT NONBLOCKING NETWORK." International Journal of Reliability, Quality and Safety Engineering 02, no. 03 (September 1995): 299–307. http://dx.doi.org/10.1142/s0218539395000228.

Full text
Abstract:
Three-stage networks have been widely studied as a point-to-point network and later, also as a broadcast network. In this paper we consider using such networks for point-to-point calls and broadcasting calls simultaneously. We note that the point-to-point nonblocking property and the broadcast rearrangeable property do not coexist due to different routing strategies. We propose a new routing strategy for broadcast calls which preserves the point-to-point nonblocking property, and keeps the broadcast calls almost rearrangeable when most calls are point-to-point.
APA, Harvard, Vancouver, ISO, and other styles
5

WANG, GAOCAI, JIANER CHEN, and CHUANG LIN. "A NEW FAULT-TOLERANT BROADCAST ROUTING ALGORITHM ON MESH NETWORKS." Journal of Interconnection Networks 11, no. 03n04 (September 2010): 175–87. http://dx.doi.org/10.1142/s0219265910002799.

Full text
Abstract:
Mesh networks are a kind of very important network topologies in massively multicomputer parallel systems. One-to-all or broadcast communication is one of the most important routing patterns and can be applied in many important applications. With the continuous increment in network size, routing in large size mesh networks with faults is unavoidable. In this paper, we propose a new fault-tolerant, local-information-based, and distributed broadcast routing algorithm based on the concept of k-submesh in all-port mesh networks. We suppose that each node has independent failure probability, under the assumption, we analyze the fault tolerance of our algorithm. We show that our routing algorithm is highly fault tolerant and has a high success probability to broadcast messages. For example, we formally prove that if the node failure probability is bounded by 0.12%, our broadcast routing algorithm works successfully with probability at least 99%. Simulation results show that our algorithm is efficient and effective in practice and theory, and the time steps of our algorithm is very close to the optimum.
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, Sangho, Jong Kim, and Yoonho Kim. "Preserving source- and sink-location privacy in sensor networks." Computer Science and Information Systems 13, no. 1 (2016): 115–30. http://dx.doi.org/10.2298/csis141027040l.

Full text
Abstract:
Protecting the location privacy of source and sink nodes in a sensor network is an important problem. Source-location privacy is to prevent event source tracking by adversaries and sink-location privacy is to protect sink nodes from adversaries who try to disrupt the sensor network. In this paper, we propose a constant-rate broadcast scheme for ensuring their location privacy. This scheme (1) equalizes traffic patterns of the sensor network to deal with eavesdropping and (2) minimizes the routing information of each sensor node to deal with node compromising. We further reduce the overhead of the proposed scheme by proposing a forwarder-driven broadcast (FdB) scheme that allows efficient multiple broadcasts with smaller buffer usage. Analysis and evaluation results show that FdB can support multiple broadcasts with small message delivery time and buffer usage.
APA, Harvard, Vancouver, ISO, and other styles
7

Palmieri, Francesco, and Aniello Castiglione. "Condensation-Based Routing in Mobile Ad-Hoc Networks." Mobile Information Systems 8, no. 3 (2012): 199–211. http://dx.doi.org/10.1155/2012/149697.

Full text
Abstract:
The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.
APA, Harvard, Vancouver, ISO, and other styles
8

Singh, Jagtar, Sanjay Singla, and Surender Jangra. "Systematic Review of Broadcast Routing Protocols for VANETs." International Journal of Computer Sciences and Engineering 6, no. 7 (July 31, 2018): 846–49. http://dx.doi.org/10.26438/ijcse/v6i7.846849.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nakano, K., S. Olariu, and A. Y. Zomaya. "Energy-efficient routing in the broadcast communication model." IEEE Transactions on Parallel and Distributed Systems 13, no. 12 (December 2002): 1201–10. http://dx.doi.org/10.1109/tpds.2002.1158259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Low, Chor Ping, and Chau Yuen. "Energy efficient broadcast routing in mobilead hoc networks." International Journal of Communication Systems 17, no. 4 (April 21, 2004): 375–88. http://dx.doi.org/10.1002/dac.649.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Stajkic, Andrea, Roberto Verdone, and Chiara Buratti. "Broadcast-based routing protocol for smart lighting systems." International Journal of Sensor Networks 32, no. 2 (2020): 107. http://dx.doi.org/10.1504/ijsnet.2020.10026669.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Stajkic, Andrea, Chiara Buratti, and Roberto Verdone. "Broadcast-based routing protocol for smart lighting systems." International Journal of Sensor Networks 32, no. 2 (2020): 107. http://dx.doi.org/10.1504/ijsnet.2020.104925.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Naderi, Mohammad, Farzad Zargari, and Mohammad Ghanbari. "Adaptive beacon broadcast in opportunistic routing for VANETs." Ad Hoc Networks 86 (April 2019): 119–30. http://dx.doi.org/10.1016/j.adhoc.2018.11.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

KRIZANC, DANNY, SANGUTHEVAR RAJASEKARAN, and SUNIL M. SHENDE. "A COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS." Parallel Processing Letters 03, no. 02 (June 1993): 109–14. http://dx.doi.org/10.1142/s0129626493000149.

Full text
Abstract:
We investigate the relative computational powers of a mesh with static buses and a mesh with half-duplex wrap-arounds. The latter model is like a torus, except that any wrap-around link of the architecture can only transmit data in one of the two directions at any clock tick. We show that the permutation routing problem can be solved as efficiently on a linear array augmented with a half-duplex wrap-around link, as on a linear array with an augmented broadcast bus. We also present a routing algorithm for a two-dimensional (2D) mesh with half-duplex wrap-around links whose run time is close to that of the best known algorithm for routing on a 2D mesh with broadcast buses in each dimension. In addition, we show that on an n×n 2D mesh with broadcast buses, randomized sorting of n2 elements can be accomplished in time that is only o(n) more, with high probability, than the time needed for permutation routing.
APA, Harvard, Vancouver, ISO, and other styles
15

HU, Tian, and Bao-hua ZHAO. "Load-balanced broadcast routing in wireless Ad-hoc networks." Journal of China Universities of Posts and Telecommunications 14, no. 3 (September 2007): 1–42. http://dx.doi.org/10.1016/s1005-8885(07)60139-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Kotzanikolaou, Panayiotis, George Chatzisofroniou, and Mike Burmester. "Broadcast anonymous routing (BAR): scalable real-time anonymous communication." International Journal of Information Security 16, no. 3 (February 3, 2016): 313–26. http://dx.doi.org/10.1007/s10207-016-0318-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

HO, CHING-TIEN, and MING-YANG KAO. "EFFICIENT BROADCAST ON HYPERCUBES WITH WORMHOLE AND E-CUBE ROUTINGS." Parallel Processing Letters 05, no. 02 (June 1995): 213–22. http://dx.doi.org/10.1142/s0129626495000199.

Full text
Abstract:
We consider the problem of broadcasting on an n-dimensional hypercube with wormhole e-cube routing, intermediate reception capability, and one-port communication. We give an algorithm, optimal to within a multiplicative constant, that broadcasts in this model in Θ(n/ log 2(n+1)) routing steps. We also give routing algorithms that achieve tight time bounds for n-cubes where n ≤ 6.
APA, Harvard, Vancouver, ISO, and other styles
18

Kaur, Amanpreet, Gurpreet Singh, and Rohan Gupta. "Limiting the Excess Broadcast in Multipath Routing Using Ant Colony Optimization." International Journal of Engineering & Technology 7, no. 3.1 (August 4, 2018): 70. http://dx.doi.org/10.14419/ijet.v7i3.1.16801.

Full text
Abstract:
Single path routing in mobile adhoc network (MANET) suffers from frequent disconnections due to movement of nodes. So, multipath routing evolves as a solution to the single path routing. Many researchers are working on devising multipath routing protocols with new features and strategies. Ant colony optimization is also used by many investigators for developing new solutions for multipath routing in MANET. In this paper we have worked on controlling the broadcast being done by the intermediate nodes. We improved on our work done in Amanpreet Kaur et al. titled “ACO Agent Based Routing in AOMDV Environment” by making use of channel contention and backoff technique. We compared the newly designed algorithm with three broad categories unipath, multipath and ant based algorithm. The new algorithm performs better as compared with other algorithms on the basis of various QoS metrics like throughput, jitter, end to end delay, and number of packets send, lost in packets and delivery ratio.
APA, Harvard, Vancouver, ISO, and other styles
19

Omar, Normaliza, Naimah Yaakob, Rohani S. M. Farook, Zulkifli Husin, Aini Syuhada Md Zain, Mohamed Elshaikh, and Aznor Hanah Abdul Halim. "A Network Coding-Aware Directional Broadcast Routing Scheme for VANET." MATEC Web of Conferences 150 (2018): 06012. http://dx.doi.org/10.1051/matecconf/201815006012.

Full text
Abstract:
Recent technological advancements in wireless communications are fundamentally changing the manner by which devices communicates with one another. Modern wireless devices build networks on their own and aid each other in passing information to any device in the network. The aim of this research is to design and develop a robust routing protocol using network coding technique for Vehicular ad hoc networks (VANET). The purpose of the protocol is to disseminate vehicular traffic to the vehicles approaching the problem area, rather than those leaving the problem area. The designed protocol during the research will be more robust, reliable, and efficient with topology change. In this research, network coding and geographical routing models will be used to develop network coding based VANET routing protocol for alerting vehicles approaching the accident area and emergency message dissemination. The network coding model assumed will serve to increase throughput, in this sense reducing packet loss which will provide a robust broadcast routing protocol.
APA, Harvard, Vancouver, ISO, and other styles
20

LI, ZHENG, and DEYING LI. "MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS." Discrete Mathematics, Algorithms and Applications 01, no. 02 (June 2009): 205–18. http://dx.doi.org/10.1142/s1793830909000166.

Full text
Abstract:
In this paper we discuss minimum energy broadcast routing with directional antennas in ad hoc and sensor networks. We assume that the network consists of sensor nodes whose antennas are switched beam directional antennas. The problem of our concern is: a given set V with n nodes and each node vi has l(i) transmission directions (i.e. the antenna sectors) and a broadcast request sourced at s, how to find a broadcast tree rooted at s and spanning all nodes in V such that the total energy is minimized. This problem involves with the choice of transmitting nodes and their transmission directions, which is NP-hard. We firstly propose a directed Steiner tree-based approximation algorithm for this problem and discuss its distributed implementation. Then we also propose a |V|-approximation algorithm and one heuristic with lower time complexities. Extensive simulations have demonstrated the efficiency of our algorithms.
APA, Harvard, Vancouver, ISO, and other styles
21

Xiang, Dong, and Xiaowei Liu. "Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels." IEEE Transactions on Parallel and Distributed Systems 27, no. 9 (September 1, 2016): 2520–32. http://dx.doi.org/10.1109/tpds.2015.2503746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Sivakumar, Raghupathy, Prasun Sinha, and Vaduvur Bharghavan. "Braving the broadcast storm: infrastructural support for ad hoc routing." Computer Networks 41, no. 6 (April 2003): 687–706. http://dx.doi.org/10.1016/s1389-1286(02)00423-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Deying Li, Xiaohua Jia, and Hai Liu. "Energy efficient broadcast routing in static ad hoc wireless networks." IEEE Transactions on Mobile Computing 3, no. 2 (April 2004): 144–51. http://dx.doi.org/10.1109/tmc.2004.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Cheng, Maggie Xiaoyan, Jianhua Sun, Manki Min, Yingshu Li, and Weili Wu. "Energy-efficient broadcast and multicast routing in multihopad hoc wirelessnetworks." Wireless Communications and Mobile Computing 6, no. 2 (2006): 213–23. http://dx.doi.org/10.1002/wcm.381.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Kim, Cheolgi, Young-Bae Ko, and Nitin H. Vaidya. "Link-state routing without broadcast storming for multichannel mesh networks." Computer Networks 54, no. 2 (February 2010): 330–40. http://dx.doi.org/10.1016/j.comnet.2009.09.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Ruan, Lu, and Weili Wu. "Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks." Journal of Combinatorial Optimization 9, no. 2 (March 2005): 223–35. http://dx.doi.org/10.1007/s10878-005-6859-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Zhang, Yi Fei, Zhao Yang Meng, and Guo Zhang. "Research of New Media Wireless Ad Hoc Network Broadcast Algorithm." Advanced Materials Research 962-965 (June 2014): 2886–89. http://dx.doi.org/10.4028/www.scientific.net/amr.962-965.2886.

Full text
Abstract:
The whole network broadcast is very important in the wireless ad hoc Network. It is more necessary in the routing establish processing. Simple flooding broadcast method is the most common broadcast algorithm. Although this method can cover most of the nodes ,the disadvantage is that it could lead to the broadcasting storm which would reduce the efficiency of the broadcast. According to the old methods which can not solve the broadcast storm effectively, I present the message divided and check together broadcast algorithm which is suitable for the large data packets. It can solve the large data packets sending crashing problem and maintain the integer of the message .Through the research of the low density nodes network message transmission ,I present the Adoption broadcast algorithm which based on the second jump node set. It could select the less first jump nodes to rebroadcast .This algorithm could not only increase the saving forward rate but also maintain the covering rate of broadcast .
APA, Harvard, Vancouver, ISO, and other styles
28

DATTA, AJOY K., JERRY L. DERBY, JAMES E. LAWRENCE, and SÉBASTIEN TIXEUIL. "STABILIZING HIERARCHICAL ROUTING." Journal of Interconnection Networks 01, no. 04 (December 2000): 283–302. http://dx.doi.org/10.1142/s0219265900000172.

Full text
Abstract:
Hierarchical routing provides a less expensive algorithm compared to the traditional all-pairs routing algorithms. We present an algorithm in this paper which benefits from the lower memory requirement, faster routing table lookup, and less costly broadcast exemplified by hierarchical routing, and yet maintains routing capability of all pairs of connected nodes even in the presence of faults, such as link/node failures and repairs, and corruption of program variables. Additionally, this algorithm solves the problem of cluster partitioning where nodes that are supposed to be in the same subset of the network, become isolated due to link or node failures. Being self-stabilizing, starting from an arbitrary state (with possibly corrupted routing tables), the protocol is guaranteed to reach a configuration with routing tables containing valid entries in a finite time. The protocol automatically updates the shortest paths in the face of dynamically changing link weights. The proposed protocol also dynamically allocates/deallocates storage for the routing information as the network size changes. The algorithm works on an arbitrary topology and under a distributed daemon model.
APA, Harvard, Vancouver, ISO, and other styles
29

Ziavras, Sotirios G. "Investigation of Various Mesh Architectures With Broadcast Buses for High-Performance Computing." VLSI Design 9, no. 1 (January 1, 1999): 29–54. http://dx.doi.org/10.1155/1999/29035.

Full text
Abstract:
Extensive comparative analysis is carried out of various mesh-connected architectures that contain sparse broadcast buses for low-cost, high-performance parallel computing. The two basic architectures differ in the implementation of bus intersections. The first architecture simply allows row/column bus crossovers, whereas the second architecture implements such intersections with switches that introduce further flexibility. Both architectures have lower cost than the mesh with multiple broadcast, which has buses spanning each row and each column, but the former architectures maintain to high extent the powerful properties of the latter mesh. The architecture that employs switches for the creation of separable buses is even shown to often perform better than the higher-cost mesh with multiple broadcast. Architectures with separable buses that employ store-and-forward routing often perform better than architectures with contiguous buses that employ the high-cost wormhole routing technique. These architectures are evaluated in reference to cost, and efficiency in implementing several important operations and application algorithms. The results prove that these architectures are very promising alternatives to the mesh with multiple broadcast while their implementation is cost-effective and feasible.
APA, Harvard, Vancouver, ISO, and other styles
30

Zhao, Chong, Jianghong Han, Xu Ding, Lei Shi, and Fan Yang. "An Analytical Model for Interference Alignment in Broadcast Assisted VANETs." Sensors 19, no. 22 (November 15, 2019): 4988. http://dx.doi.org/10.3390/s19224988.

Full text
Abstract:
Application of safety-related information interaction among vehicles has always been a research frontier in Vehicular Ad-hoc NETworks (VANETs). These messages require high real-time performance. There is a lot of research dependant on creating optimization model for communication task scheduling or routing protocols to reduce communication delay. In this paper, we analyze characteristics of safety-related information and introduce Interference Alignment (IA) technology in VANETs. To further improve routing efficiency, a data-driven assisted transmission routing and broadcast model framework for Vehicle to Vehicle(V2V) and Vehicle to Infrastructure (V2I) communication are constructed which are the basis for IA. Depending on the proposed model, we propose an optimization problem of minimizing total number of time slots required for safety information sharing in VANETs. Then a clustering algorithm is designed to narrow feasible solution space. Simulation results show that the approach can effectively reduce the number of time slots required and improve link use by 20% percent compared with no IA applied.
APA, Harvard, Vancouver, ISO, and other styles
31

WATTS, JERRELL, and ROBERT VAN DE GEIJN. "A PIPELINED BROADCAST FOR MULTIDIMENSIONAL MESHES." Parallel Processing Letters 05, no. 02 (June 1995): 281–92. http://dx.doi.org/10.1142/s0129626495000266.

Full text
Abstract:
We address the problem of performing a pipelined broadcast on a mesh architecture. Meshes require a different approach than other topologies, and their very nature puts a tighter bound on the performance that one can hope to achieve. By using the appropriate techniques, however, one can obtain excellent performance for sufficiently long messages. The resulting algorithm will work on meshes of any dimension with any number of nodes. Our model assumes that the mesh is a torus and/or that it has bidirectional links and uses wormhole routing. Performance data from the Cray T3D are included.
APA, Harvard, Vancouver, ISO, and other styles
32

Yu, Hao, Li Liu, Chao Sun, Ruizhe Li, Xinzhu Yu, Cheng Zhang, Zhiyuan Zhang, and Bin Wang. "DiRong1.0: a distributed implementation for improving routing network generation in model coupling." Geoscientific Model Development 13, no. 12 (December 10, 2020): 6253–63. http://dx.doi.org/10.5194/gmd-13-6253-2020.

Full text
Abstract:
Abstract. A fundamental functionality of model coupling in an Earth system model is to efficiently handle data transfer between component models. An approach of M×N communication following a routing network has been used widely used for data transfer, and routing network generation becomes a major step required to initialize data transfer functionality. Some existing coupling software such as the Model Coupling Toolkit (MCT) and the existing versions of the Community Coupler (C-Coupler) employ a global implementation of routing network generation that relies on gather–broadcast communications, which can be very inefficient under a case of a large number of processes. This is an important reason why the initialization cost of a coupler increases with the number of processor cores. In this paper, we propose a “distributed implementation for routing network generation, version 1.0” (DiRong1.0), which does not introduce any gather–broadcast communication. Empirical evaluations show that DiRong1.0 is much more efficient than the global implementation. DiRong1.0 has already been implemented in C-Coupler2, and we believe that some other couplers can also benefit from it.
APA, Harvard, Vancouver, ISO, and other styles
33

Dhote, Dr C. A., Prof M. A. Pund, Prof R. S. Mangrulkar, and Makarand R. Shahade. "Hybrid Routing Protocol with Broadcast Reply for Mobile Ad hoc Network." International Journal of Computer Applications 1, no. 10 (February 25, 2010): 131–36. http://dx.doi.org/10.5120/212-360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Kumar, Neeraj, and Mayank Dave. "A Beacon Information Independent VANET Routing Algorithm with Low Broadcast Overhead." International Journal of Computer Network and Information Security 7, no. 6 (May 8, 2015): 17–30. http://dx.doi.org/10.5815/ijcnis.2015.06.03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Yuan, Bai, An jie, and Zhang Huibing. "Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing." Journal of China Universities of Posts and Telecommunications 24, no. 2 (April 2017): 66–71. http://dx.doi.org/10.1016/s1005-8885(17)60200-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Muttaqien, Indera Zainul, Asad Arismadhani, Royyana Muslim Ijtihadie, and Radityo Anggoro. "SURVEI PENANGANAN BROADCAST STORM PROBLEM PADA PROTOKOL ROUTING AODV DI MANET." JUTI: Jurnal Ilmiah Teknologi Informasi 13, no. 2 (July 1, 2015): 172. http://dx.doi.org/10.12962/j24068535.v13i2.a486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Sharon, O. "Dissemination of routing information in broadcast networks: OSPF versus IS-IS." IEEE Network 15, no. 1 (2001): 56–65. http://dx.doi.org/10.1109/65.898822.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Ahmed, Ejaz, Junaid Qadir, and Adeel Baig. "High-throughput transmission-quality-aware broadcast routing in cognitive radio networks." Wireless Networks 21, no. 4 (November 12, 2014): 1193–210. http://dx.doi.org/10.1007/s11276-014-0843-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Yuan, Li-yong, Fei-long Lin, and Jun-ke Lv. "An improved asynchronous energy-saving mechanism for IEEE 802.15.5-based networks." International Journal of Distributed Sensor Networks 14, no. 9 (September 2018): 155014771880218. http://dx.doi.org/10.1177/1550147718802184.

Full text
Abstract:
IEEE 802.15.5 standard introduces the mesh routing which improves reliability and robustness of routing in wireless sensor network since there are multiple routes from source node to destination node. To achieve energy efficiency for a long network lifetime, the asynchronous energy saving is proposed in IEEE 802.15.5, which includes the receiver-initiated unicast mechanism and the sender-initiated broadcast mechanism. In this article, an improved asynchronous energy saving named semi-synchronous energy saving is proposed to deal with the energy inefficiency from idle listening existing in asynchronous energy saving. In semi-synchronous energy saving, every node maintains the wake/sleep schedule information of nodes in its two-hop neighborhood and uses this information to calculate the wake-up time of an interested neighbor that the data will be sent to, which reduces idle listening time in both unicast and broadcast mechanisms. A low delay routing mechanism is also proposed based on the wake/sleep schedule information of neighbors. Furthermore, the optimal guard time to guarantee receiving the wake-up notification from neighbor in the presence of clock drift is investigated for saving energy. The performance analysis and simulation evaluation show that semi-synchronous energy saving saves more than 80% of energy with less than 30% memory cost compared to asynchronous energy saving, and it also improves the time of completing broadcast and the end-to-end delay.
APA, Harvard, Vancouver, ISO, and other styles
40

Li, Li Fen. "Simple Ant Routing Algorithm for WSNs Used in Power Line Monitoring." Applied Mechanics and Materials 401-403 (September 2013): 1981–85. http://dx.doi.org/10.4028/www.scientific.net/amm.401-403.1981.

Full text
Abstract:
The special class of wireless sensor networks for monitoring power transmission lines may extend for hundreds of miles in distances. The sensor nodes in this class of networks are deployed along narrowly elongated geographical areas and form a chain-type topology. Thus routing protocols in such environments must be kept as simple as possible. In this paper, we present the Simple Ant Routing Optimizing Algorithm (SAROA) to offer a low overhead solution in optimizing the routing process. Four improved strategies were used in our approach. During the route discovery we have used a new local search mechanism, in which each node broadcasts a control message (FANT) to its neighbors, but only one of them broadcast this message again. During the route maintenance phase, we only use data packets to refresh the paths of active sessions. Finally, the route repair phase is also enhanced, by using a deep search procedure as a way of restricting the number of nodes used to recover a route. A broadest search is only executed when the deeper one fails to succeed. The simulation results show that the enhance algorithm can effectively jump out of the local optimum and satisfy the tolerable delay in network-wide data collection.
APA, Harvard, Vancouver, ISO, and other styles
41

Kaushal, Vansh, Venuprea V., and Surjeet S. "Backbone Source and Positional Broadcast Routing for Emergency System in Urban VANETs." International Journal of Computer Applications 179, no. 50 (June 15, 2018): 8–16. http://dx.doi.org/10.5120/ijca2018917292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Lipiński, Zbigniew. "Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission." Wireless Personal Communications 101, no. 1 (May 14, 2018): 251–68. http://dx.doi.org/10.1007/s11277-018-5686-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Xu, Xin, Huan-Yan Qian, Yun-Li Gu, and Jie Du. "Ak-Anycast Routing Protocol Based on Broadcast Scheme for Wireless Sensor Network." Sensor Letters 9, no. 4 (August 1, 2011): 1566–70. http://dx.doi.org/10.1166/sl.2011.1674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Li, Deying, Zewen Liu, Yi Hong, Wenping Chen, and Huan Ma. "Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks." Theoretical Computer Science 497 (July 2013): 173–80. http://dx.doi.org/10.1016/j.tcs.2011.11.030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Dholey, Milan Kumar, Ditipriya Sinha, Sankar Mukherjee, Ayan Kumar Das, and Sudip Kumar Sahana. "A Novel Broadcast Network Design for Routing in Mobile Ad-Hoc Network." IEEE Access 8 (2020): 188269–83. http://dx.doi.org/10.1109/access.2020.3030802.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Warth, Peter F. "Implementation of a Large Digital Routing System at the CBC Broadcast Centre." SMPTE Journal 103, no. 2 (February 1994): 105–9. http://dx.doi.org/10.5594/j03711.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Ahmad, Naeem, Shuchi Sethi, and Muqeem Ahmed. "Cache-Aware Query-Broadcast to Improve QoS of Routing Protocols in MANETs." Wireless Personal Communications 113, no. 1 (March 25, 2020): 481–98. http://dx.doi.org/10.1007/s11277-020-07225-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Verma, Akshay, Sunil Kumar, Prateek Raj Gautam, Tarique Rashid, and Arvind Kumar. "Broadcast and Reliable Coverage based Efficient Recursive Routing in Large-Scale WSNs." Telecommunication Systems 75, no. 1 (June 11, 2020): 63–78. http://dx.doi.org/10.1007/s11235-020-00679-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Kumar, Neeraj, and Mayank Dave. "BIIR: A Beacon Information Independent VANET Routing Algorithm with Low Broadcast Overhead." Wireless Personal Communications 87, no. 3 (May 6, 2015): 869–95. http://dx.doi.org/10.1007/s11277-015-2620-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Zhang, Jun Hu, and Feng Jing Shao. "Ladder Routing: a Reactive Source Routing Protocol for Multi-Hop Data Transmission in Mobile Wireless Sensor Networks." Applied Mechanics and Materials 65 (June 2011): 455–60. http://dx.doi.org/10.4028/www.scientific.net/amm.65.455.

Full text
Abstract:
Applications built upon mobile wireless sensor networks demand multi-hop data transmission between the sink node and any other far-away nodes. It's always not a good idea to broadcast the whole network for finding the best path to a specified far-away node because the broadcasting for route discovery consume too much amount of message exchanging between adjacent nodes in the network. In this paper, we propose a reactive source routing protocol, ladder routing, for finding the best path between the sink node and a specified node through a unicast kind of message exchanging. Ladder routing is implemented on each node in a parallel and distributed manner, which can help unicast route discovery message or data between the sink node and any other specified node along the best up-to-date path without introducing too much message consumption and time delay for route discovery and maintenance on demand.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Broadcast routing' for other source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography