1,601 Hits in 6.4 sec

Approach of Improved Topology Development Protocol In Ad Hoc Network Minimizing The Number of Hops And Maintaining Connectivity of Mobile Terminals Which Move From One To The Others

Lipur Sugiyanta
2017 JAREE (Journal on Advanced Research in Electrical Engineering)  
Wireless mesh network which engages broadcasting and contains multiple hops become increasingly vulnerable to problems such as routing problem and rapid increasing of overhead packets.  ...  This paper provides a broadcast framework that engages various network metrics and at the same time maintaining connectivity of nodes (mobile terminals).  ...  PRELIMINARIES Wireless mesh network is generally set up with a centralized access point for provide high level of connectivity in certain area.  ... 
doi:10.12962/j25796216.v1.i1.11 fatcat:fid5gg72ujgsfc5gjwa6haedky

A Markov-Based Reservation Algorithm for Wavelength Assignment in All-Optical Networks

Wenhao Lin, Richard S. Wolff, Brendan Mumey
2007 Journal of Lightwave Technology  
He is the holder of one patent. His research interests are applied algorithm problems, including optical networking and computational biology.  ...  (a) Comparison on the NSF network. (b) Comparison on the mesh network. TABLE I RESULTS I OF SENSITIVITY EXPERIMENTS USING THE POISSON TRAFFIC MODEL.  ...  Hence, connections with a large hop number have a greater chance of being accepted. The performance of RWA algorithms is generally measured in terms of connection-request blocking probability.  ... 
doi:10.1109/jlt.2007.897725 fatcat:jrkgc2u4nra5lmbktjcnxovayq

The priority broadcast scheme for dynamic broadcast in hypercubes and related networks

Chi-Hsiang Yeh, E.A. Varvarigos, Hua Lee
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ωn+ 1 1,ρ when packets are generated according to a Poisson process, where ρ is  ...  Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process.  ...  are generated according to a Poisson process with rate λ [14] .  ... 
doi:10.1109/fmpc.1999.750612 fatcat:yus7utagonc6zklf2zwvx5jhje


Shirshanka Das, Alok Nandan, Giovanni Pau
2004 Proceedings of the first ACM workshop on Vehicular ad hoc networks - VANET '04  
The broadcast nature of the wireless medium drives us to explore different design paradigms from the ones used in typical wired settings.  ...  A new paradigm in content delivery on the Internet using peer-peer swarming protocols is emerging [1, 2].  ...  THE SPAWN PROTOCOL SPAWN has the same generic structure of any swarming protocol. Peers downloading a file form a mesh and exchange pieces of the file amongst themselves.  ... 
doi:10.1145/1023875.1023893 dblp:conf/mobicom/DasNP04 fatcat:dy2e4b4lsnctjksyagcssftpmq

Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks

Xiaobing Wu, Jiangchuan Liu, Guihai Chen
2006 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems  
A wireless mesh network consists of mesh routers and mesh clients, connected in an ad hoc manner via wireless links.  ...  A subset of the mesh routers, referred to as gateway nodes, are capable of external Internet connections.  ...  We assume that each mesh router is equipped with multiple radios and there are multiple channel available in the network.  ... 
doi:10.1109/mobhoc.2006.278648 dblp:conf/mass/WuLC06 fatcat:gwnaon6dwbcffhpl6itbiwfkei

MRP: Wireless mesh networks routing protocol

Jangeun Jun, Mihail L. Sichitiu
2008 Computer Communications  
Wireless Mesh Networks (WMNs) are one of the few commonly implemented types of mobile ad-hoc networks (MANETs); several companies offer WMNs for broadband Internet access and for extending the coverage  ...  While general MANET routing protocols can be used in WMNs, it is expected that a protocol that takes the particularities of WMNs into account will outperform the general protocol.  ...  use Poisson traffic with data packets serving as probes. Every user node has two flows: one toward the gateway and the other one from the gateway. Packet size is 1500 bytes.  ... 
doi:10.1016/j.comcom.2008.01.038 fatcat:khercclofjfolcapebmfxdd2ly

Finite element simulation of semiconductor devices on multiprocessor computers

T.F. Pena, E.L. Zapata, D.J. Evans
1994 Parallel Computing  
The parallelization of this approach and its projection onto a multiprocessor system with a hypercube topology are carried out.  ...  We study the distribution of an irregular mesh of triangular elements over a hypercube and the later parallelization of the resolution method.  ...  Compute the generation-recombination factor R(q, ~+ 1, n k, pk). L5. Solve Eq. (28) for n ~+1. L6. Compute the generation-recombination factor R($ k+ I, n k+ ~, pk). L7. Solve Eq. (29) for pk+L L8.  ... 
doi:10.1016/0167-8191(94)90072-8 fatcat:36zr6wducjdzbpdnwcuprnitzi

A Dynamically Reconfigurable RF NoC for Many-Core

Alexandre Brière, Julien Denoulet, Andrea Pinna, Bertrand Granado, Francois Pêcheux, Eren Unlu, Yves Louët, Christophe Moy
2015 Proceedings of the 25th edition on Great Lakes Symposium on VLSI - GLSVLSI '15  
A major feature of this architecture is its broadcast capacity. The RF NoC becomes faster with 32 nodes, achieving a ×3 speedup with 1024.  ...  Static analysis shows that, for point to point communications, its latency is comparable with a 256-node electrical mesh and becomes lower for wider networks.  ...  As aggregation of multiple independent Bernouilli processes is a Poisson process, we model the number of packets generated in a cluster on each symbol as a Poisson distribution.  ... 
doi:10.1145/2742060.2742082 dblp:conf/glvlsi/BriereDPGPULM15 fatcat:mdwycsmuuzajzbdqoerwu4esaq

Information Dissemination in Power-Constrained Wireless Networks

R. Zheng
2006 Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications  
We find that using multihop relay, the rate of broadcasting continuous stream is Θ((log(n) − α 2 ) in extended networks; while direct single-hop broadcast is efficient for dense networks.  ...  ., broadcast capacity and information diffusion rate and derive fundamental limits in both random extended and dense networks.  ...  A node refrains from re-broadcasting upon overhearing multiple broadcasts from its neighbors. In [15] , nodes rebroadcast message with a probability p as a function of the hop count from the source.  ... 
doi:10.1109/infocom.2006.168 dblp:conf/infocom/Zheng06 fatcat:rowlczhlgbby5lqsuwm4j6fhfm

Algorithms for Provisioning Survivable Multicast Sessions against Link Failures in Mesh Networks [chapter]

Narendra K. Singhal, Biswanath Mukherjee
2003 Lecture Notes in Computer Science  
We also study the application of these algorithms to dynamic traffic comprising of unicast, multicast, and broadcast connections.  ...  First, we study these algorithms for protecting a multicast tree in a mesh network and then extend them for dynamic provisioning of survivable multicast connections where connections come and go.  ...  broadcast connections) on the network (Fig. 6) with W = 64 wavelengths.  ... 
doi:10.1007/978-3-540-24604-6_35 fatcat:42opsxuovvevrkgkrsotpy6xv4

Performance Evaluation of Some Distributed Averaging Algorithms for Sensor Networks

Marco Baldi, Elma Zanaj, Franco Chiaraluce
2011 International Journal of Distributed Sensor Networks  
In this paper, we consider two point-topoint and one point-to-multipoint distributed averaging algorithms that can be seen as variants of the same averaging solution.  ...  We also provide a performance assessment, based on numerical simulations, aimed at verifying the results of the analytical treatment and at comparing the considered schemes.  ...  Also L can be interpreted as a Laplacian matrix, whose eigenvalues coincide with those of Q, but each appears with multiplicity N.  ... 
doi:10.1155/2011/428290 fatcat:pm6rtshmtbayna6w2bm3fw7q5e

Performance issues with routing in multi-channel multi-interface IEEE 802.11s networks

Renato C. Juacaba Neto, Rossana M. C. Andrade, Reinaldo B. Braga, Fabrice Theoleyre, Carina T. Oliveira
2014 2014 IFIP Wireless Days (WD)  
Wireless Mesh Networks have the potential to serve as an all-wireless backbone. They represent a key building block of the new Internet of Things to collect all the traffic.  ...  Thus, the standard IEEE 802.11s proposes to re-use the IEEE 802.11 medium access in a mesh multi-hop topology while using a routing protocol to create routes at the layer 2.  ...  The simulation characteristics are summarized in Table I run, a node is randomly designated as the Mesh Portal to receive the Poisson traffic generated by the transmitters.  ... 
doi:10.1109/wd.2014.7020810 dblp:conf/wd/NetoABTO14 fatcat:5skpfvf4yjd5zct5qppofaod7y

Evaluating the communications capabilities of the generalized hypercube interconnection network

Sotirios G. Ziavras, Sanjay Krishnamurthy
1999 Concurrency Practice and Experience  
We first present implementations of randomized many-to-all broadcasting and multicasting on generalized hypercubes, using as the basis the one-to-all broadcast algorithm presented in [3].  ...  Our results show that the size of the intermediate message buffers has a significant effect on the total communication time, and this effect becomes very dramatic for large systems with large numbers of  ...  Broadcasting is the distribution of a message or a group of messages from one (or multiple) source processor(s) to all other processors.  ... 
doi:10.1002/(sici)1096-9128(199905)11:6<281::aid-cpe428>;2-g fatcat:idgnzl63dzbazbe6ag6zlnvf5m

The software design of Gridap: a Finite Element package based on the Julia JIT compiler [article]

Francesc Verdugo, Santiago Badia
2021 arXiv   pre-print
As a result, there is no need to use different languages for the computational back-end and the user front-end anymore, thus eliminating the so-called two-language problem.  ...  Gridap also provides a low-level API that is modular and extensible via the multiple-dispatch paradigm of Julia and provides easy access to the main building blocks of the library.  ...  Solving a Poisson equation with the Gridap API. . Generating the computational mesh used in Listing 14 with the Gmsh Julia API.  ... 
arXiv:2109.12818v1 fatcat:6qng25bxs5blrb374kcdlqkh6m

Parallel Adaptive Mesh Refinement Combined with Additive Multigrid for the Efficient Solution of the Poisson Equation

Hua Ji, Fue-Sang Lien, Eugene Yee
2012 ISRN Applied Mathematics  
The Hilbert space-filling curve (SFC) approach has been adopted for dynamic grid partitioning (resulting in a partitioning that is near optimal with respect to load balancing on a parallel computational  ...  ., additive multigrid method, adaptive mesh refinement (AMR), and parallelization) have been combined in order to provide a highly efficient parallel solver for the Poisson equation.  ...  This work was made possible by the facilities of the Shared Hierarchical Academic Research Computing Network SHARCNET .  ... 
doi:10.5402/2012/246491 fatcat:typz6mu5z5h2vktmwf3fl25ham
« Previous Showing results 1 — 15 out of 1,601 results