Log in

Relevant bibliographies by topics / Broadcast routing

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers
Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Broadcast routing"

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

More sources

Dissertations / Theses on the topic "Broadcast routing"

1

王慧霞 and Wai-ha Wong. "Efficient algorithms for broadcast routing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214733.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wong, Wai-ha. "Efficient algorithms for broadcast routing /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18565402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Jinze. "Broadcast routing and scheduling of ad hoc networks." Thesis, University of Hawaii at Manoa, 2003. http://hdl.handle.net/10125/6993.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Arumugam, Rajkumar. "SCRIBE self-organized contention and routing in intelligent broadcast environments /." Cincinnati, Ohio : University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin1024331160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

ARUMUGAM, RAJKUMAR. "SCRIBE: SELF-ORGANIZED CONTENTION AND ROUTING IN INTELLIGENT BROADCAST ENVIRONMENTS." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1024331160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Kok Thong. "Performance analysis of Mobile Ad Hoc Networking routing protocols /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FLee%5Kok.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bani, Khalaf Mustafa. "Dynamic probabilistic routing discovery and broadcast schemes for high mobility ad-hoc networks." Thesis, Edinburgh Napier University, 2013. http://researchrepository.napier.ac.uk/Output/6151.

Full text

Abstract:

Mobile Ad-hoc Networks (MANETs) have lately come to be widely used in everyday applications. Their usability and capability have attracted the interest of both commercial organizations and research communities. Recently, the Vehicular Ad-hoc Network (VANET) is a promising application of MANETs. It has been designed to offer a high level of safety for the drivers in order to minimize a number of roads accidents. Broadcast communication in MANETs and VANETs, is essential for a wide range of important services such as propagating safety messages and Route REQuest (RREQ) packets. Routing is one of the most challenging issues in MANETs and VANETs, which requires high efficient broadcast schemes. The primitive and widely deployed method of implementing the broadcast is simple ‘flooding'. In this approach, each node ‘floods' the network, with the message that it has received, in order to guarantee that other nodes in the network have been successfully reached. Although flooding is simple and reliable, it consumes a great deal of network resources, since it swamps the network with many redundant packets, leading to collisions contention and huge competition, while accessing the same shared wireless medium. This phenomenon is well-known in MANETs, and is called the Broadcast Storm Problem. The first contribution of this thesis is to design and develop an efficient distributed route discovery scheme that is implemented based on the probabilistic concept, in order to suppress the broadcast storm problem. The proposed scheme is called a Probabilistic Disturbed Route Discovery scheme (PDRD), and it prioritizes the routing operation at each node with respect to different network parameters such as the number of duplicated packets, and local and global network density. The performance of the proposed scheme PDRD has been examined in MANETs, in terms of a number of important metrics such as RREQ rebroadcast number and RREQ collision number. Experimental results confirm the superiority of the proposed scheme over its counterparts, including the Hybrid Probabilistic-Based Counter (HPC) scheme and the Simple Flooding (SF) scheme. The second contribution of this thesis is to tackle the frequent link breakages problem in MANETs. High mobility nodes often have frequent link breakages; this potentially leads to re-discovery of the same routes. Although different probabilistic solutions have been suggested to optimize the routing in MANETs, to the best of our knowledge they have not focused on the problem of frequent link breakages and link stability. II Unlike other existing probabilistic solutions, this thesis proposes a new Velocity Aware-Probabilistic (VAP) route discovery scheme, which can exclude unstable nodes from constructing routes between source and destination. The main idea behind the proposed schemes is to use velocity vector information to determine the stable nodes and unstable nodes. A proper rebroadcast probability and timer are set dynamically according to the node stability. Simulation results confirm that the new proposed scheme has much better performance in terms of end-to-end delay, RREQ rebroadcast number and link stability. The routing in VANETs is very critical and challenging in terms of the number of broken links and packet overheads. This is mainly due to the fast vehicles' speed and different vehicles' movement directions. A large number of routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) have been proposed to deal with the routing in MANETs. However, these protocols are not efficient and cannot be applied directly to VANETs context due to its different characteristics. Finally toward this end, this thesis proposes new probabilistic and timer probabilistic routing schemes in order to improve the routing in VANETs. The main aim of the proposed schemes is to set up the most stable routes to avoid any possible link breakage. These schemes also enhance the overall network performance by suppressing the broadcast storm problem, which occurs during the route discovery process. The proposed schemes also make AODV protocol suitable and applicable for VANETs. Simulation results show the benefit of the new routing schemes in terms of a number of metrics such as RREQ rebroadcast number, link stability and end-to-end delay.

APA, Harvard, Vancouver, ISO, and other styles

8

Ke, Kai-Wei. "State reduction and state-dependent call admission and routing in multirate communications networks." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lai, Shouwen. "Duty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/27333.

Full text

Abstract:

In order to save energy consumption in idle states, low duty-cycled operation is widely used in Wireless Sensor Networks (WSNs), where each node periodically switches between sleeping mode and awake mode. Although efficient toward saving energy, duty-cycling causes many challenges, such as difficulty in neighbor discovery due to asynchronous wakeup/sleep scheduling, time-varying transmission latencies due to varying neighbor discovery latencies, and difficulty on multihop broadcasting due to non-simultaneous wakeup in neighborhood. This dissertation focuses on this problem space. Specifically, we focus on three co-related problems in duty-cycled WSNs: wakeup scheduling, routing and broadcasting. We propose an asynchronous quorum-based wakeup scheduling scheme, which optimizes heterogenous energy saving ratio and achieves bounded neighbor discovery latency, without requiring time synchronization. Our solution is based on quorum system design. We propose two designs: cyclic quorum system pair (cqs-pair) and grid quorum system pair (gqs-pair). We also present fast offline construction algorithms for such designs. Our analytical and experimental results show that cqs-pair and gqs-pair achieve better trade-off between the average discovery delay and energy consumption ratio. We also study asymmetric quorum-based wakeup scheduling for two-tiered network topologies for further improving energy efficiency. Heterogenous duty-cycling causes transmission latencies to be time-varying. Hence, the routing problem becomes more complex when the time domain must be considered for data delivery in duty-cycled WSNs. We formulate the routing problem as time-dependent Bellman-Ford problem, and use vector representation for time-varying link costs and end-to-end (E2E) distances. We present efficient algorithms for route construction and maintenance, which have bounded time and message complexities in the worst case by ameliorating with beta-synchronizer. Multihop broadcast is complex in duty-cycled WSNs due to non simultaneous wakeup in neighborhoods. We present Hybrid-cast, an asynchronous multihop broadcast protocol, which can be applied to low duty-cycling or quorum-based duty-cycling schedules, where nodes send out a beacon message at the beginning of wakeup slots. Hybrid-cast achieves better tradeoff between broadcast latency and broadcast count compared to previous broadcast solutions. It adopts opportunistic data delivery in order to reduce the broadcast latency. Meanwhile, it reduces redundant transmission via delivery deferring and online forwarder selection. We analytically establish the upper bound of broadcast count and the broadcast latency under Hybrid-cast. To verify the feasibility, effectiveness, and performance of our solutions for asynchronous wakeup scheduling, we developed a prototype implementation using Telosb and TinyOS 2.0 WSN platforms. We integrated our algorithms with the existing protocol stack in TinyOS, and compared them with the CSMA mechanism. Our implementation measurements illustrate the feasibility, performance trade-off, and effectiveness of the proposed solutions for low duty-cycled WSNs.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

10

Whisman, Daniel Montgomery. "Benefits of opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast network." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105956.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 69-72).
This thesis studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate with the end node. When node i transmits, it is received at node j with a probability Pi,j . Several communication protocols are proposed and their performance studied using the mean and variance of the completion time as metrics. The protocols studied use end-to-end retransmission, end-to-end coding, and link-by-link retransmission with network coding both with and without opportunistic routing. Simulation and analytical results are presented. End-to-end coding significantly outperforms end-to-end retransmission on both metrics, and the link-by-link protocols outperform both. Opportunistic routing shows a mixed benefit over link-by-link protocols without it. When using opportunistic routing, the variance of the completion time is higher, and the mean is either similar or lower, depending on the channel conditions. When the loss probabilities are higher, opportunistic routing shows little benefit, whereas with a lower probability of packet loss, opportunistic routing shows a significant reduction in mean completion time.al Engineering and Computer Science.
by Daniel Montgomery Whisman.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Broadcast routing"

1

Chou, Ching-Tsun, and Inder S. Gopal. "Linear broadcast routing." In Lecture Notes in Computer Science, 122. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-50517-2_75.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zhang, Yongguang. "Direct Broadcast Satellites and Asymmetric Routing." In Internetworking and Computing Over Satellite Networks, 95–113. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0431-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kan, Jia, Lingyi Zou, Bella Liu, and Xin Huang. "Boost Blockchain Broadcast Propagation with Tree Routing." In Smart Blockchain, 77–85. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05764-0_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bitan, S., and S. Zaks. "Optimal linear broadcast routing with capacity limitations." In Algorithms and Computation, 287–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57568-5_259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhao, Ruiqin, Aijun Wen, Zengji Liu, and Peng Yue. "Maximum Life-Time Localized Broadcast Routing in MANET." In Lecture Notes in Computer Science, 193–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74784-0_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wibling, Oskar, Joachim Parrow, and Arnold Pears. "Ad Hoc Routing Protocol Verification Through Broadcast Abstraction." In Formal Techniques for Networked and Distributed Systems - FORTE 2005, 128–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11562436_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Qiu, Chenggong, Laisheng Xiang, and Xiyu Liu. "Broadcast Routing Algorithms in Hypercube Based on SN P Systems." In Pervasive Computing and the Networked World, 487–96. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09265-2_50.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cacciola, Matteo, Antonio Frangioni, Laura Galli, and Giovanni Stea. "A Lagrangian Approach to Chance Constrained Routing with Local Broadcast." In AIRO Springer Series, 277–91. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63072-0_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Klasing, Ralf, Alfredo Navarra, Aris Papadopoulos, and Stéphane Pérennes. "Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem." In Lecture Notes in Computer Science, 866–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24693-0_71.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Deying, Zheng Li, and Lin Liu. "Energy Efficient Broadcast Routing in Ad Hoc Sensor Networks with Directional Antennas." In Wireless Algorithms, Systems, and Applications, 29–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88582-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Broadcast routing"

1

Intae Kang and R. Poovendran. "A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency." In 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484). IEEE, 2003. http://dx.doi.org/10.1109/vetecf.2003.1286159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mao, Minjing, Bin Wu, and Kwan L. Yeung. "ILP-based design of survivable broadcast trees." In 2009 International Conference on High Performance Switching and Routing (HPSR). IEEE, 2009. http://dx.doi.org/10.1109/hpsr.2009.5307443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ganzinger, Matthias, William J. Hymas, and Thomas Schutt. "Securing Broadcast Based Ad Hoc Routing Protocols." In 2007 IEEE International Conference on Pervasive Computing and Communications Workshops. IEEE, 2007. http://dx.doi.org/10.1109/percomw.2007.104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Train, Joshua, Joseph Bannister, and C. S. Raghavendra. "Routing fountains: Leveraging wide-area broadcast to improve mobile inter-domain routing." In MILCOM 2011 - 2011 IEEE Military Communications Conference. IEEE, 2011. http://dx.doi.org/10.1109/milcom.2011.6127782.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kunzel, Gustavo, Gustavo Pedroso Cainelli, and Carlos Eduardo Pereira. "A Weighted Broadcast Routing Algorithm for WirelessHART Networks." In 2017 VII Brazilian Symposium on Computing Systems Engineering (SBESC). IEEE, 2017. http://dx.doi.org/10.1109/sbesc.2017.32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mousset, Julien, Hai-ying Zhou, and Kun-mean Hou. "One-Hop Broadcast Routing Protocol for Wireless Sensor." In 2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control (IMCCC). IEEE, 2011. http://dx.doi.org/10.1109/imccc.2011.204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bergstrom, Sofia, Jan Nilsson, Ulf Sterner, and Ulrika Uppman. "Routing Designs for Tactical Heterogeneous Cooperative Broadcast Networks." In 2021 International Conference on Military Communication and Information Systems (ICMCIS). IEEE, 2021. http://dx.doi.org/10.1109/icmcis52405.2021.9486390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Soua, Ahmed, Walid Ben-Ameur, and Hossam Afifi. "Broadcast-based directional routing in vehicular ad-hoc networks." In 2012 5th Joint IFIP Wireless and Mobile Networking Conference (WMNC). IEEE, 2012. http://dx.doi.org/10.1109/wmnc.2012.6416146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Jacquet, Philippe, Bernard Mans, and Georgios Rodolakis. "Broadcast delay of epidemic routing in intermittently connected networks." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205611.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Faisal Khan, Yusun Chang, Sung-Jin Park, and John Copeland. "Handshaking vs. instant broadcast in VANET safety message routing." In 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC 2011). IEEE, 2011. http://dx.doi.org/10.1109/pimrc.2011.6140061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Broadcast routing"

1

Kang, Intae, and Radha Poovendran. Design Issues on Broadcast Routing Algorithms using Realistic Cost-Effective Smart Antenna Models. Fort Belvoir, VA: Defense Technical Information Center, January 2004. http://dx.doi.org/10.21236/ada459825.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!