Sciweavers

66 search results - page 4 / 14
» Characterization of a simple communication network using Leg...
Sort
View
WICON
2008
13 years 8 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
CSE
2009
IEEE
14 years 2 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
SIGCOMM
1997
ACM
13 years 11 months ago
A Flow-Based Approach to Datagram Security
Datagram services provide a simple, exible, robust, and communication abstraction; their usefulness has been well demonstrated by the success of IP, UDP, and RPC. Yet, the overwh...
Suvo Mittra, Thomas Y. C. Woo
INFOCOM
2010
IEEE
13 years 5 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
INFOCOM
2008
IEEE
14 years 1 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...