BIBLIOGRAPHY & REFERENCES.bib

MDP_Python

Artificial Intelligence: A Modern Approach

      ()

ReinLearning

Reinforcement Learning: An Introduction
Sutton and Barto
      (2005)
http://www.cs.ualberta.ca/~sutton/book/ebook/the-book.html

* Contents o Preface o Series Forward o Summary of Notation * I. The Problem o 1. Introduction + 1.1 Reinforcement Learning + 1.2 Examples + 1.3 Elements of Reinforcement Learning + 1.4 An Extended Example: Tic-Tac-Toe + 1.5 Summary + 1.6 History of Reinforcement Learning + 1.7 Bibliographical Remarks o 2. Evaluative Feedback + 2.1 An -Armed Bandit Problem + 2.2 Action-Value Methods + 2.3 Softmax Action Selection + 2.4 Evaluation Versus Instruction + 2.5 Incremental Implementation + 2.6 Tracking a Nonstationary Problem + 2.7 Optimistic Initial Values + 2.8 Reinforcement Comparison + 2.9 Pursuit Methods + 2.10 Associative Search + 2.11 Conclusions + 2.12 Bibliographical and Historical Remarks o 3. The Reinforcement Learning Problem + 3.1 The Agent-Environment Interface + 3.2 Goals and Rewards + 3.3 Returns + 3.4 Unified Notation for Episodic and Continuing Tasks + 3.5 The Markov Property + 3.6 Markov Decision Processes + 3.7 Value Functions + 3.8 Optimal Value Functions + 3.9 Optimality and Approximation + 3.10 Summary + 3.11 Bibliographical and Historical Remarks * II. Elementary Solution Methods o 4. Dynamic Programming + 4.1 Policy Evaluation + 4.2 Policy Improvement + 4.3 Policy Iteration + 4.4 Value Iteration + 4.5 Asynchronous Dynamic Programming + 4.6 Generalized Policy Iteration + 4.7 Efficiency of Dynamic Programming + 4.8 Summary + 4.9 Bibliographical and Historical Remarks o 5. Monte Carlo Methods + 5.1 Monte Carlo Policy Evaluation + 5.2 Monte Carlo Estimation of Action Values + 5.3 Monte Carlo Control + 5.4 On-Policy Monte Carlo Control + 5.5 Evaluating One Policy While Following Another + 5.6 Off-Policy Monte Carlo Control + 5.7 Incremental Implementation + 5.8 Summary + 5.9 Bibliographical and Historical Remarks o 6. Temporal-Difference Learning + 6.1 TD Prediction + 6.2 Advantages of TD Prediction Methods + 6.3 Optimality of TD(0) + 6.4 Sarsa: On-Policy TD Control + 6.5 Q-Learning: Off-Policy TD Control + 6.6 Actor-Critic Methods + 6.7 R-Learning for Undiscounted Continuing Tasks + 6.8 Games, Afterstates, and Other Special Cases + 6.9 Summary + 6.10 Bibliographical and Historical Remarks * III. A Unified View o 7. Eligibility Traces + 7.1 -Step TD Prediction + 7.2 The Forward View of TD($\lambda $) + 7.3 The Backward View of TD($\lambda $) + 7.4 Equivalence of Forward and Backward Views + 7.5 Sarsa() + 7.6 Q() + 7.7 Eligibility Traces for Actor-Critic Methods + 7.8 Replacing Traces + 7.9 Implementation Issues + 7.10 Variable + 7.11 Conclusions + 7.12 Bibliographical and Historical Remarks o 8. Generalization and Function Approximation + 8.1 Value Prediction with Function Approximation + 8.2 Gradient-Descent Methods + 8.3 Linear Methods # 8.3.1 Coarse Coding # 8.3.2 Tile Coding # 8.3.3 Radial Basis Functions # 8.3.4 Kanerva Coding + 8.4 Control with Function Approximation + 8.5 Off-Policy Bootstrapping + 8.6 Should We Bootstrap? + 8.7 Summary + 8.8 Bibliographical and Historical Remarks o 9. Planning and Learning + 9.1 Models and Planning + 9.2 Integrating Planning, Acting, and Learning + 9.3 When the Model Is Wrong + 9.4 Prioritized Sweeping + 9.5 Full vs. Sample Backups + 9.6 Trajectory Sampling + 9.7 Heuristic Search + 9.8 Summary + 9.9 Bibliographical and Historical Remarks o 10. Dimensions of Reinforcement Learning + 10.1 The Unified View + 10.2 Other Frontier Dimensions o 11. Case Studies + 11.1 TD-Gammon + 11.2 Samuel's Checkers Player + 11.3 The Acrobot + 11.4 Elevator Dispatching + 11.5 Dynamic Channel Allocation + 11.6 Job-Shop Scheduling * Bibliography o Index

CLPDI

CLPDI Algorithm in UWB Synchronization
Soderi and Iinatti and Hämäläinen
      ()

This paper studies code synchroniza- tion in time hopping (TH) ultra wideband (UWB) systems. In TH UWB systems, narrow pulses based on Gaussian pulse are positioned in different locations in consecutive time frames. The location of each frame is defined by a spreading code. The receiver collects the energy of the pulses using the same spreading code. To be able to do that, it has to synchronize itself to the incoming signal. Due to the large bandwidth of the signal, several replicas of the signals ar- rive into the receiver. Thus, the energy of the signal is spread in time domain causing extra problems to the synchronization procedure. In this paper, earlierly proposed method for direct sequence spread spectrum system is applied for time hopping system. The method is simulated in a multipath environment. The performance measure used is the mean acquisition time. Con- stant false alarm rate criterion is used for the threshold setting rule for comparator. The ener- gies of the multipath components are combined in the acquisition process. Therefore, diversity combining is obtained in the acquisition process, which also leads to performance improvement.

1263379

Multiband Media Access Control in Impulse-Based UWB Ad Hoc Networks
Krishnamurthy and Faloutsos and Molle and Foerster and Broustis
IEEE Transactions on Mobile Computing  6  351--366  (2007)

We propose a MAC protocol for use in multihop wireless networks that deploy an underlying UWB (Ultra Wide Band)-based physical layer. We consider a multiband approach to better utilize the available spectrum, where each transmitter sends longer pulses in one of many narrower frequency bands. The motivation comes from the observation that, in the absence of a sophisticated equalizer, the size of a slot for transmitting a UWB pulse is typically dictated by the delay spread of the channel. Therefore, using a wider frequency band to shorten the transmission time for each pulse does not increase the data rate in proportion to the available bandwidth. Our approach allows data transmissions to be contiguous and practically interference free, and, thus, highly efficient. For practicality, we ensure the conformance of our approach to FCC-imposed emission limits. We evaluate our approach via extensive simulations, and our results demonstrate the significant advantages of our approach over single-band solutions: The throughput increases significantly and the number of collisions decreases considerably. Finally, we analyze the behavior of our MAC protocol in a single-hop setting in terms of its efficiency in utilizing the multiple bands.

1272159

A Novel Approach for the Link Layer in Impulse-based UWB Ad Hoc Networks
Shi and Xia and Niemegeers
Wirel. Pers. Commun.  42  143--159  (2007)
http://portal.acm.org/citation.cfm?id=1272155.1272159&coll=GUIDE&dl=GUIDE#

WirelessUSB

Wireless USB
Koon
      ()
http://www.everythingusb.com/wireless_usb.html

SouilmiUWB

Souilmi's Publications
Souilmi
      ()
http://www.laboratoire-usages.com/people/souilmi.fr.htm

1287124

Cram\'{e}r-Rao lower bounds for the synchronization of UWB signals
Zhang and Kennedy and Abhayapala
EURASIP J. Appl. Signal Process.  2005  426--438  (2005)
http://portal.acm.org/citation.cfm?id=1287086.1287124&coll=GUIDE&dl=GUIDE&CFID=26194802&CFTOKEN=93385763#

We present Cramér-Rao lower bounds (CRLBs) for the synchronization of UWB signals which should be tight lower bounds for the theoretical performance limits of UWB synchronizers. The CRLBs are investigated for both single-pulse systems and time-hopping systems in AWGN and multipath channels. Insights are given into the relationship between CRLBs for different Gaussian monocycles. An approximation method of the CRLBs is discussed when nuisance parameters exist. CRLBs in multipath channels are studied and formulated for three scenarios depending on the waymultipath interference is treated. We find that a larger number of multipaths implies higher CRLBs and inferior performance of the synchronizers, and multipath interference on CRLBs cannot be eliminated completely except in very special cases. As every estimate of time delay could not be perfect, the least influence of the synchronization error on the performance of receivers is quantified.

citeulike:2414116

Time synchronization in UWB ad hoc networks using TOA estimation
Pierrot
Ultra-Wideband, 2005. ICU 2005. 2005 IEEE International Conference on    458--463  (2005)
http://dx.doi.org/10.1109/ICU.2005.1570031

The paper deals with a synchronization scheme for ad hoc network. The proposal is a distributed synchronization algorithm based on the convergence of nodes clock parameters to a mean reference using a diffusion method. The protocol measures time of arrival (TOA) of localization techniques using pulsed UWB modulation to estimate the delays and drifts values.

ICACT08

A New UWB Synchronization Scheme Using Multipath Components Jointly
Chong and Kim and Lee and Kim and Yoon
10th International Conference on Advanced Communication Technology (ICACT)  3  1719-1724  (2008)
http://www.ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4494047&arnumber=4494114&count=187&index=66

In ultra-wideband (UWB) systems, conventionally, the synchronization is to align time phases of a locally generated template and any of multipath components to within an allowable range. However, the synchronization with a low-power multipath component could incur significant performance degradation in receiver operation (e.g., detection) after the synchronization. On the other hand, the synchronization with a high-power multipath component can improve the performance in receiver operation after the synchronization. Generally, the first one among multipath components has the largest power. Thus, the synchronization with the first path component can make better performance than that with a low-power component in receiver operations after the synchronization. Based on which, we first propose an optimal decision rule based on a maximum likelihood (ML) approach, and then, develope a simpler suboptimal decision rule for selecting the first path component. Simulation results show that the optimal and suboptimal decision rules have better performance than the conventional decision rule in UWB multipath channels.

RF_Algorithms

R.B.4 Algorithms for synchronization in UWB communication links
Reggiani
      ()
https://dbkn.ismb.it/DBKN%20Content/B/B.4

Course07

Coarse synchronization of UWB signals in the dense multipath channel based on the golden section
Arias-de-Reyna and Acha-Catalina
Journal of the Franklin Institute  344  128-151  (2007)
http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V04-4M877KY-2&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=bedbd42de12f1077fd823ab699fe72b5

In this paper we address the problem of coarse synchronization of ultra wideband signals in the dense multipath channel, following the widely used hypothesis testing approach in which the uncertainty region for the timing offset is divided into a certain number of cells. We propose a novel strategy for the search of the correct cells, within the constant increment perspective. We show that under a simple model the proposed strategy achieves practically the minimum possible mean acquisition time, independently of the length of the channel impulse response, as opposed to previous constant increment approaches. A comparative analysis of the proposed strategy and another convenient one reveals that, strictly speaking, none of them can be considered optimum from the point of view of the mean acquisition time. The proposed method is advantageous from the point of view of computational complexity in the general case. Simulations with a realistic channel model confirm that the proposed strategy is very appropriate for the problem of coarse synchronization of UWB signals. Keywords: Synchronization; Ultra wideband; Golden section; Delay estimation; Multipath channels Article Outline 1. Introduction 2. Search strategies for acquisition in dense multipath 3. Application of the golden section to the problem 4. Comparative study 4.1. Computation of the mean acquisition time for the golden section method 4.2. Computation of the mean acquisition time for the successive halving search 4.3. Comparison 5. Simulation results 6. Conclusions Appendix A. Computation of the mean number of trials necessary for acquisition A.1. Golden section method A.2. Method based on successive bisections A.3. Look and Jump by K method References Thumbnail image Fig. 1. Localization of a block of three elements in a ring of 16 positions.

Mitsubishi

Time Synchronization for MB-OFDM UWB
Zhang
      ()
http://www.merl.com/projects/timesync/

A problem in wireless communications is processing symbols received via a time dispersive channel causing intersymbol interferences. Orthogonal Frequency Division Multiplexing (OFDM) is an effective modulation technique for such channels. To further reduce OFDM symbol interferences, the OFDM symbols are sent through multiple frequency bands. Proper decoding of the received OFDM symbols requires an accurate synchronization, i.e. a correct estimation of the arrival time at the receiver of the OFDM symbols. Detecting and synchronizing to the packets and estimating the related parameters becomes more difficult, however, when the symbols are transmitted over different frequency bands according to a frequency hopping pattern. Furthermore a new device attempting to join a network does not know a priori the sequence being used by the network. MERL proposed synchronization techniques to detect frequency hopped packets and to synchronize, providing an optimal time for processing blocks of symbols during the preamble, in addition to an estimate of a carrier frequency offset. Background & Objective: Concurrently to its activities as contributor to WiMedia and co-author of the first UWB standard approved by ECMA International, MERL worked on some implementation issues of the Multiband OFDM receiver. One main achievement of this work is the invention of two patents on synchronization. Technical Discussion: The first aspect of this work focused on synchronizing OFDM symbols provided in the preamble, considering these symbols do not have a cyclic prefix and including the effect of channels with different delay spread. The second aspect of this work looked at the challenge of a device joining a network without any prior knowledge of its frequency hopping pattern. To achieve a successful detection, the analysis of the signal received in the selected frequency sub-band relative to the periodicities associated with the respective predefined groups of partitioned frequency hopping patterns is performed.

1283589

Blind synchronization in asynchronous UWB networks based on the transmit-reference scheme
Djapic and Leus and van der Veen and Trindade
EURASIP J. Wirel. Commun. Netw.  2006  65--65  (2006)
http://portal.acm.org/ft_gateway.cfm?id=1283589&type=pdf&coll=GUIDE&dl=GUIDE&CFID=72709355&CFTOKEN=58183936

Ultra-wideband (UWB) wireless communication systems are based on the transmission of extremely narrow pulses, with a duration inferior to a nanosecond. The application of transmit reference (TR) to UWB systems allows to side-step channel estimation at the receiver, with a tradeoff of the effective transmission bandwidth, which is reduced by the usage of a reference pulse. Similar to CDMA systems, different users can share the same available bandwidth by means of different spreading codes. This allows the receiver to separate users, and to recover the timing information of the transmitted data packets. The nature of UWB transmissions--short, burst-like packets--requires a fast synchronization algorithm, that can accommodate several asynchronous users. Exploiting the fact that a shift in time corresponds to a phase rotation in the frequency domain, a blind and computationally effcient synchronization algorithm that takes advantage of the shift invariance structure in the frequency domain is proposed in this paper. Integer and fractional delay estimations are considered, along with a subsequent symbol estimation step. This results in a collision-avoiding multiuser algorithm, readily applicable to a fast acquisition procedure in a UWB ad hoc network.

DirtyTemplates

UWB Timing Synchronization Using Dirty Templates
Yang and Giannakis
      (2004)
http://stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA431931

Precise localization and reliable exchange of information among distributed sensors, soldiers and unmanned aerial/ground vehicles (UAVs/UGVs) are important for tactical communications. To this end, Ultra-Wideband (UWB) technology emerges as a promising candidate, providing high performance wireless links with low complexity and low probability of detection (LPD). Rapid timing synchronization constitutes a major challenge in realizing these promises. Synchronization faces accentuated difficulties in the UWB regime because its waveforms are impulse-like and have low amplitude, and the propagation channel is unknown at the receiver. These explain why synchronization has attracted so much interest in UWB research 3, 1, 4, 6, 5. But each of existing approaches requires a number of restrictive assumptions. Without invoking any of the assumptions required by existing algorithms, we develop timing algorithms that remain operational in general UWB settings with fast time hopping (TH), unknown multipath propagation and even when multiple users are present. Our synchronizers rely on symbol-rate samples and thus entail low complexity. Most existing synchronizers are based on the unique maximum of the received pulse s autocorrelation function, which requires a clean template of the received pulse to be available. The latter is not feasible when the multipath channel is unknown. Our novel criterion relies on the unique maximum that emerges by cross correlating dirty templates extracted from the received waveform. These dirty templates render channel information unnecessary since it is embedded in the received waveform.

Lausanne

UWB research at EPFL-IC Very Low-Power Ultra-Wide Band (UWB) Networking Architecture
EPFL
      ()
http://uwb.epfl.ch/

We are interested in the design of very low emitted power ultra-wide band (UWB) networking architecture. One of our primary concern is the effect of multi-user interference on the design of algorithms, protocols, and architectures for UWB systems. We explore aspects ranging from the optimal design of UWB ad hoc networks to joint PHY and MAC protocol implementation, as well as synchronization, ranging, and localization.

MultiOFDMSync

Packet Detection and Symbol Timing Synchronization Algorithm for Multi-Band OFDM UWB
Yoon and Chong
IEICE Transactions on Communications  E89-B(4)  1433-1435  (2006)
http://ietcom.oxfordjournals.org/cgi/content/abstract/E89-B/4/1433

In this letter, we propose a novel packet detection and symbol timing synchronization algorithm for MB-OFDM UWB system over multi-path channel. To find more reliable and exact symbol timing, we utilize the merits of the auto- and cross-correlation at the same time. The auto-correlator can gather the energy of the received signal which is distorted by multipath fading. And, the cross-correlator can estimate symbol timing to sample level precision. We define the detection and symbol timing metric as the moving sum of autocorrelation of the pre-computed cross-correlated signals over zero pad duration. Simulation results show that the proposed algorithm can detect the presence of a signal with less than --4 dB SNR and find DFT window with at most 0.1 dB SNR reduction upon the receipt of two symbols.

BeyondBells

The World Beyond the Bells
Clark
      ()
http://www.manymedia.com/futures/beyond-bells.html

UWBConnectionPatent

US Patent 7352998 - Method and system for establishing a wireless communications link
Palin and Salokannel and Reunamaki
      ()
http://www.patentstorm.us/patents/7352998/description.html

AntennasOnline

      ()
http://www.antennasonline.com/

VTC2007

Proceedings of the 65th IEEE Vehicular Technology Conference

      (2007)
http://www.sigmod.org/dblp/db/conf/vtc/vtc2007s.html

WinLisp

Lisp Programs by Winston
Winston
      ()
http://www.engin.umd.umich.edu/CIS/course.des/cis479/winstonlisp.html

ProgrammingReligion

Programming Aesthetics and Religion
powered by a contradiction in terms
      ()
http://log.reflectivesurface.com/2004/09/01/programming-aesthetics-and-religion/

SmallestOSPicotux

RJ-45 module : The Digi Connect ME : The Picotux running uClinux on an RJ-45 connector
Elektronik
      ()
http://www.linuxdevices.com/news/NS8386088053.html

CodeAsDesign

What is software design?
Reeves
      ()
http://www.developerdotstar.com/mag/articles/reeves_design_main.html

Agawa

Rock Art, Scent Mark
Jordan
      ()
http://realindy.com/rockart.htm

Opportunistic

The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments
Katti and Katabi and Hu and Rahul and Médard
Proceedings of 43rd Allerton Conference on Communication, Control, and Computing      (2005)
http://www.cl.cam.ac.uk/research/srg/netos/papers/2005-allerton-netcoding.pdf

This paper applies network coding to wireless mesh networks and presents the first implementation results. It introduces COPE, an opportunistic approach to network coding, where each node snoops on the medium, learns the status of its neighbors, detects coding opportunities, and codes as long as the recipients can decode. This flexible design allows COPE to efficiently support multiple unicast flows, even when traffic demands are unknown and bursty, and the senders and receivers are dynamic. We evaluate COPE using both emulation and testbed implementation. Our results show that COPE substantially improves the network throughput, and as the number of flows and the contention level increases, COPE's throughput becomes many times higher than current 802.11 mesh networks.

MathML

Arabic mathematical notation
Group
      ()
http://www.w3.org/TR/arabic-math/

VPL

Visual Languages
McIntyre
      ()
http://www.hypernews.org/~liberte/computing/visual.html

visualLanguage

Principles of Nature, towards a new visual language.
Roberts
      (2003)
http://www.principlesofnature.net/

AlanKay

Steps Toward The Reinvention of Programming
Kay and Ingalls and Ohshima and Piumarta and Raab
      (2006)
http://irbseminars.intel-research.net/AlanKayNSF.pdf

We make, not just to have, but to know Introduction: Over the years, our research has combined interests and inventions in computer science (object-oriented programming, reflective whole systems, networking), graphics (bit-map screens and ``bitblt''), UI (overlapping windows and icons, modeless editing and interactions), education (particularly for children), design (aiming for beauty as well as problem solving), and computer engineering (learning how to efficiently make whole HW & SW systems). The latter has allowed us to tackle new approaches on a large scale, deploy and test real solutions without huge teams or being bound to particular computational models, tools or platforms. Some of the alternative approaches we've invented have become mainstream (and some not), but a very important process in our work over the years is to be able to control our own HW & SW destinies by making high-enough-level languages with powerful enough tools to allow our small but critical mass research group to successfully implement anything we want to try. In short, we've been very interested in the ideas and ideals of personal computing since its inception, and have strived to come up with real advances for real users, by making real systems, deploying and testing them. These alternative systems have been small in comparison with standard practice, e.g. today's Squeak Smalltalk[Sq1] covers much of personal computing, includes its own applications, operating environment, UI and development tools, runable specifications, etc., in about 2.8MB of code (about 200,000 lines). But our intuitive sense of ``mathematical entropy'' insists that an even more comprehensive design approach to whole-system personal computing could be smaller by a factor of 10 or more (a factor of 2 from removing non-used code, and another factor of 5 or more via a different, more advanced architecture and design).

bananas

Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
Meijer and Fokkinga and Paterson
  523  124--144  (1991)
citeseer.ist.psu.edu/meijer91functional.html

fold

A tutorial on the universality and expressiveness of fold
Hutton
Journal of Functional Programming, Cambridge University Press  9  355--372  (1999)

Potential2006

Potential of UWB Technology for the Next Generation Wireless Communications
Chong and Watanabe and Inamura
IEEE Ninth International Symposium on Spread Spectrum Techniques and Applications      (2006)
http://www.docomolabs-usa.com/pdf/PS-2006-0139.pdf

ESCHER

Heaven and {H}ell ({C}ircle {L}imit {IV})
Escher
      (1960)
http://www.mcescher.com/Gallery/recogn-bmp/LW436.jpg

yoshida98gametheoretic

A Game-Theoretic Solution of Conflicts among Competitive Agents
Yoshida and Inuzuka and Naing and Seki and Itoh
  1441  193--??  (1998)
citeseer.ist.psu.edu/61645.html

Recently the control of multi-agent behavior using two-player non-zero sum games, such as prisoner's dilemma, has been studied. In this paper we propose a two player game that includes a dilemmatic structure and extend it to the study of two teams consisting of many players. Iterative versions of dilemma games have been investigated extensively and many strategies for the games have been proposed. For multi-agent applications we extend our dilemma game to a multi-player version. Several...

MOLECULAR_DEBUGGING

Casting spells with DNA
Rothemund
      (2007)
http://www.ted.com/index.php/talks/view/id/183

BEES

Honey Bee - Cell Phone Study is Questionable at Best
newsvine.com
      ()
http://forager.newsvine.com/_news/2007/04/18/670272-honey-bee-cell-phone-study-is-questionable-at-best

COI

Carrier over Interference... What is it and why does it matter?
Duckworth
      ()
http://www.pendulum-instruments.com/Assets/download/ci_article.pdf

Vishwakarma

Vishwakarma -- The Architect to the Gods
Venkateswaran
      (2002)
http://www.warftindia.org/research.php?id=VISHWAKARMA

According to RigVeda- the oldest documented treatise known to mankind, VishwaKarma is the divine architect to the Gods. As the son of Bramha, the creator, he personifies the creative power that welds heaven and earth together. He is the revealer of Sthapatya Veda, or the science of mechanics and architecture. The Mahabharata describes him as "The Lord of the arts, executor of a thousand handicrafts, the most eminent of artisans -- in today's world it includes engineers, scientists and computer architects - and whom, they continually worship." He is the presiding deity of all the craftsmen and architects. As a tribute to him, our computer architecture research group is named -- VishwaKarma.

NON_ZERO_SUM

Nonzero
Wright
      (2006)
http://video.google.com/videoplay?docid=7649291049306277988

Author Robert Wright argues that history has an arrow: That humans have continued to evolve -- if not biologically, than culturally and technologically -- toward greater complexity and intelligence. He also explains the concept behind his book, "Nonzero": That life is a nonzero sum game, where there can be more than one winner, and that civilization evolved thanks to such endeavors, which reward cooperation, rather than competition. His guarded optimism is tinged with a deep worry over the growing prevalence of grass-roots hatred. His hope: that the intelligent pursuit of self-interest will actually be the world's salvation. Robert Wright is author of The Moral Animal and NonZero. He also hosts an excellent interview series called meaningoflife.tv. (Recorded February 2006 in Monterey, CA. Duration: 19:54)

CIRCLE_LIMIT

The {F}amily of ``{C}ircle {L}imit {III}'' {E}scher {P}atterns
Dunham
      ()
http://www.d.umn.edu/~ddunham/dunamtlk.pdf

SCARCITY_MYTH

How wireless networks scale: the illusion of spectrum scarcity
Reed
      (2002)
http://jacksons.net/tac/Spectrum%20capacity%20myth%20FCC%20TAC.pdf

RADIATION

BBC Rules That Wi-Fi Radiation Findings Were Wrong
Stevenson
      ()
http://hardware.slashdot.org/article.pl?sid=07/12/04/1621240

BONOBO_BABY

Bonobo Chimps: Girls Rule! - In bonobo society, it's the females that rule the world.
Geographic
      ()
http://www.youtube.com/watch?v=RlqsaxL-wCw

CHIMP_HUNT

Chimps hunting a monkey
Attenborough
      ()
http://www.youtube.com/watch?v=WDFh5JdYh7I

CHIMPS

Chimps outperform humans at memory task
Hooper
      ()
http://www.newscientist.com/article/dn12993-chimps-outperform-humans-at-memory-task.html

_MTU_SECOND!

Programming Team Earns Slot in World Finals
CS.MTU.EDU
      ()
http://csalpha.ist.unomaha.edu/acmregn/

Ryan Richards, Nicholas Smolinske, Mikola Lysenko and Dr. Dave Poplawski, Coach Programming Team Earns Slot in World Finals December 2007 -- A three-student team of Michigan Tech Computer Science majors finished second out of 195 teams from 63 colleges and universities in the North Central North American Region of the International Collegiate Programming Contest and qualified for the world finals in Banff, Alberta, Canada in early April. The students, Mikola Lysenko, Ryan Richards and Nicholas Smolinske, were narrowly edged out of first place by a team from the University of Wisconsin, Madison in the last few minutes of a very exciting contest. The team joins 92 other teams from around the world in the largest and most prestigious contest of its kind in the world. Worldwide over 7000 teams competed in various regionals, putting MTU's team in the top 1.3%, no small feat considering the competition came form schools the likes of MIT, Cal tech, and the University of Michigan. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ March 2007 -- CS Majors Win Programming Contest MTU Computer Science students placed first among five schools partipating in the 8th annual NMU programming contest held at Northern Michigan University on March 31st. MTU's top three-man teams took second (Scott Carroll, Kishor Joshi, Oystein Thorsen), fifth (Merrill Dynes, John Earnest, Richard Pringle) and seventh (Craig Koenigs, Dave Stanich, Chris Swisher) place among 24 teams to secure the victory for MTU. The contest involves writing programs to correctly solve up to six problems in five hours using a single computer. Winners were determined by a combination of the number of problems correctly solved and the time it took to solve them. This tests the students' ability to quickly formulate solution methods, code them, and then thoroughly test them before submitting them for judging, and requires knowledge of algorithms and data structures, attention to detail, and a team approach to problem solving. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

SCARCITY_ECON

The Importance Of Zero In Destroying The Scarcity Myth Of Economics
Masnick
      ()
http://techdirt.com/articles/20061025/014811.shtml

DeWaalWeb

Bonobos, Left and Right: Primate Politics Heats Up Again as Liberals and Conservatives Spindoctor Science
de Waal
      ()
http://www.skeptic.com/eskeptic/07-08-08.html

DeWaal06

Simple and complex reciprocity in primates
de Waal and Brosnan
Cooperation in Primates and Humans: Mechanisms and Evolution  III    (2006)
http://www.springerlink.com/content/w023k13g57682374/

Coop06

Cooperation, Competition and Cognition in Wireless Networks: Principles and Applications - Real Egoistic Behavior is to Cooperate!
Shin and Devroye and Mitran and Ochiai and Ghassemzadeh and Kung and Tarokh
      (2006)
http://www.springerlink.com/content/h5k166576504p456/

Racism

Shattering the Myth of Racism: Volume I
Nuenke
      ()
http://www.solargeneral.com/library/ShatteringMythOfRacism.pdf

Nuenke

Those loving bonobos - did we pick the wrong primate to evolve from?
Nuenke
      ()
http://home.comcast.net/~neoeugenics/dom.htm

Sailer99

Chimps and Chumps : What monkeys don't tell us about man
Sailer
National Review  September    (1999)
http://findarticles.com/p/articles/mi_m1282/is_1999_Sept_27/ai_55820853

ShakeWell

Shake well before use: two implementations for implicit context authentication
Mayrhofer and Gellersen
3rd International Workshop on Pervasive Mobile Interaction Devices    http://www.youtube.com/watch?v=ktJC0S4_X58  (2007)
http://eis.comp.lancs.ac.uk/fileadmin/eis/publication/2007-ShakeImp.pdf

Secure device pairing is especially difficult for spontaneous interaction in ubiquitous computing environments because of wireless communication, lack of powerful user interfaces, and scalability issues. We demonstrate a method to address this problem for small, mobile devices that does not require explicit user interfaces like displays or key pads. By shaking devices together in one hand for a few seconds, they are securely paired. Device authentication happens implicitly as part of the pairing process without the need for explicit user interaction ``just for security''. Our method has been implemented in two variants: first, for high-quality data collection using wired accelerometers; second, using built-in accelerometers in standard Nokia 5500 mobile phones.

Quan07

An Optimal Strategy for Cooperative Spectrum Sensing in Cognitive Radio Networks
Quan and Cui and Sayed
      (2007)
http://iracema.icsl.ucla.edu/publications/conferences/globecom_2007.pdf

Haykin07

Fundamental Issues in Cognitive Radio
Haykin
      (2007)
http://bul.ece.ubc.ca/Simon_Haykin_Cognitive%20Radio_2007.pdf

Cognitive Radio is fast emerging as an exciting and multidisciplinary subject, which has the potential for being a 'disruptive technology', thereby making a significant difference to wireless communications. In this presentation, Prof. Haykin will address the following fundamental issues: (1) The notion of cognition, (2) The cognitive signal processing cycle, as viewed by a radio transceiver, (3) The basic functional blocks of radio scene analysis, channel state estimation, feedback channel, and dynamic spectrum management and transmit power control, (4) The roles of game theory and information theory in the study of a multiuser cognitive radio environment, (5) The emergent behaviour of cognitive radio as a closed-loop feedback control system.

MobiCom07

Bonobos Vs Chimps: Cooperative and Non-Cooperative Behavior in Wireless Networks
Jean-Pierre Hubaux and moderator) and Ramesh Johari and P. R. Kumar and Joseph Mitola and Heather Zheng
      ()
http://www.sigmobile.org/mobicom/2007/panel1.html

Rationale Bonobos and chimpanzees are the apes that are genetically closest to human beings. Yet the former tend to be friendly with each other and prone to collaborate, whereas the latter are usually more nasty and selfish. A similar difference has been observed lately between the research efforts of physical layer specialists on one hand and those of wireless networkers on the other hand: the former focus on cooperation between wireless devices (beamforming,...), whereas the latter are obsessed by selfish (or non-cooperative) behavior. Yet, these behaviors are not necessarily exclusive: in some cases, the most egoistic attitude consists in cooperating. The purpose of this panel is to bring together (human) specialists of each of the two camps. In particular, they will address the following issues: Does the word 'cooperation' mean the same thing in each camp? How relevant are these issues in practice? Can a device be cooperative at the physical layer and non-cooperative at the other layers? How does cross-layer design come into the picture? What are the security implications (or requirements) of non-cooperative and cooperative behavior? Are the players only wireless devices, or can larger bodies (even wireless operators) exhibit (non)-cooperative behavior? Is game theory useful in designing distributed algorithms for cooperative wireless systems? Is the distinction made in game theory between cooperative and non-cooperative games of some use in this framework? How do limits on available information affect the knowledge and rationality assumptions inherent in game theoretic models applied to wireless networks? What are the implications of all the above questions on cognitive radios and software-defined radios? The audience will then be invited to participate in the debate. Note: Dr. Mitola's affiliation with the MITRE Corporation does not imply the endorsement of MITRE nor any of its sponsors of this activity.

CPB08

Robust distributed spectrum sensing in cognitive radio networks
Chen and Park and Bian
IEEE Infocom 2008 mini-conference      (2008)
http://www.arias.ece.vt.edu/publications/conferences/Robust_DSS_in_CR_Networks_infocom.pdf

CPHR08

Toward secure distributed spectrum sensing in cognitive radio networks
Chen and Park and Hou and Reed
IEEE Communications Magazine Special Issue on Cognitive Radio Communications      (2008)
http://www.arias.ece.vt.edu/publications/conferences/Toward%20Secure%20DSS%20in%20CR%20Networks.pdf

Chen06

Ensuring trustworthy spectrum sensing in cognitive radio networks
Chen and Park
IEEE Workshop on Networking Technologies for Software Defined Radio Networks (held in conjunction with IEEE SECON 2006)      (2006)
http://www.arias.ece.vt.edu/publications/conferences/Ensuring%20Trustworthy%20Spectrum%20Sensing%20in%20Cognitive%20Radio%20Networks_camera%20ready.pdf

Jing06

Spectrum co-existence of IEEE 802.11b and 802.16a networks using reactive and proactive etiquette policies
Jing and Raychaudhuri
  1  539--554  (2006)

This paper presents an investigation of spectrum co-existence between IEEE 802.11b and 802.16a networks in the same shared frequency band using cognitive radio techniques with different levels of complexity. Simple reactive interference avoidance algorithms as well as proactive spectrum coordination policies based on etiquette protocols are proposed and compared in terms of achievable spectrum efficiency in a shared Wi-Fi/Wi-Max scenario. In reactive interference avoidance methods, radio nodes coordinate spectrum usage without exchange of explicit control information-this is done by adaptively adjusting transmit PHY parameters such as frequency, power and time occupancy based on local observations of the radio band. Because local observations provide information only about transmitters, they may not be sufficient for resolving spectrum contention in scenarios with 'hidden receivers'. Proactive coordination techniques solve the hidden-receiver problem by utilizing a common spectrum coordination channel (CSCC) for exchange of transmitter and receiver parameters. Radio nodes can cooperatively select key PHY-layer variables such as frequency and power by broadcasting messages in the CSCC channel and then following specified spectrum etiquette policies. An ns2 simulation model is developed to evaluate both reactive and proactive etiquette policies in scenarios with co-existing IEEE 802.11b and 802.16a networks. The density of radio nodes in the coverage region, and their degree of spatial clustering are key parameters in the system evaluation. Detailed simulation studies were carried out for a variety of scenarios including both single and multiple 802.11b hotspots per 802.16a cell with and without spatial clustering. Our results show that simple reactive algorithms can improve system throughput when sufficient 'free space' (in frequency, power or time) is available for PHY adaptation. In more congested scenarios with spatially clustered nodes and hidden receivers, the proposed CSCC etiquette can significantly improve overall system performance over reactive schemes.

Raychaudhuri06

CogNet - An Architectural Foundation for Experimental Cognitive Radio Networks within the Future Internet
Raychaudhuri and Mandayam and Evans and Ewy and Seshan and Steenkiste
IEEE MobiArch 2006    11--16  (2006)
http://www.cs.cmu.edu/afs/cs/project/cmcl/archive/2007/Cognet07pdf.pdf

This paper describes a framework for research on architectural tradeoffs and protocol designs for cognitive radio networks at both the local network and the global internetwork levels. Several key architectural issues for cognitive radio networks are discussed, including control and management protocols, support for collaborative PHY, dynamic spectrum coordination, flexible MAC layer protocols, ad hoc group formation and cross-layer adaptation. The overall goal of this work is the design and validation of the control/management and data interfaces between cognitive radio nodes in a local network, and also between cognitive radio networks and the global Internet. Protocol design and implementation based on this framework will result in the CogNet architecture, a prototype open-source cognitive radio protocol stack. Experimental evaluations on emerging cognitive radio platforms are planned for future work, first in a wireless local-area radio network scenario using wireless testbeds such as ORBIT, and later as part of several end-to-end experiments using a wide-area network testbed such as PlanetLab (and GENI in the future).

Ananthanarayanan06

{SPACE}: Secure Protocol for Address-Book based Connection Establishment
Ananthanarayanan and Venkatesan and Naldurg and Blagsvedt and Hemakumar
      (2006)
http://research.microsoft.com/research/mns/papers/SPACE-HotNets2006.pdf

This paper presents SPACE an application-level protocol for secure automatic ad-hoc connection-establishment between two devices based on their address book entries. The protocol is based on the simple premise that if two people have each others contact details in their address books, they probably know and trust each other in some limited way and this can form a basis for a trust relationship between their devices, without additional user intervention. This paper shows how the protocol is resistant to specific security attacks and can accommodate for privacy concerns. Existing connection-establishment protocols for Bluetooth and IEEE 802.11 have known security flaws, and can be compromised using well-known techniques and off-the-shelf hardware. In addition, these protocols require explicit user intervention, like entering a passkey.

Luo05

Planning Future Heterogeneous Wireless Networks
Luo and Huang
Progress In Electromagnetics Research Symposium 2005, Hangzhou, China, August 22-26      (2005)
http://whitepapers.techrepublic.com.com/whitepaper.aspx?&docid=141970

Buddhikot05

Spectrum Management in Coordinated Dynamic Spectrum Access Based Cellular Networks
Buddhikot and Ryan
IEEE DySPAN - Synamic Spectrum Access Networks      (2005)
http://whitepapers.techrepublic.com.com/whitepaper.aspx?&docid=272753

This paper focuses on spectrum management in next generation cellular networks that employ Coordinated Dynamic Spectrum Access (DSA). In this model, a spectrum broker controls and provides time-bounded access to a band of spectrum to wireless service providers and/or end users and implements the spectrum pricing and allocation schemes and policies. The paper introduces several concepts that are central to the design of spectrum management algorithms. Based on these concepts, the authors investigate practically realizable candidate algorithms for spectrum allocation for homogenous CDMA networks.

eemcs2875

Adaptive {O}{F}{D}{M} System Design For Cognitive Radio
Zhang and Kokkeler and Smit
    91--95  (2006)
http://whitepapers.techrepublic.com.com/whitepaper.aspx?&docid=290709

Recently, Cognitive Radio has been proposed as a promising technology to improve spectrum utilization. A highly flexible OFDM system is considered to be a good candidate for the Cognitive Radio baseband processing where individual carriers can be switched off for frequencies occupied by a licensed user. In order to support such an adaptive OFDM system, we propose a Multiprocessor System-on-Chip (MPSoC) architecture which can be dynamically reconfigured. However, the complexity and flexibility of the baseband processing makes the MPSoC design a difficult task. This paper presents a design technology for mapping flexible OFDM baseband for Cognitive Radio on a multiprocessor System-on-Chip (MPSoC).

Chiang05

Use of Cognitive Radio Techniques for OFDM Ultrawideband Coexistence With WiMax
Chiang and Lansford
      (2005)
http://whitepapers.techrepublic.com.com/whitepaper.aspx?&docid=291138

This paper explores the issues in coexistence between Broadband Fixed Wireless Access, also know as WiMax or 802.16e, and Ultrawideband (UWB), specifically the multiband OFDM form of UWB as promoted by the WiMedia trade group. A multiband OFDM receiver can operate as a channelized radiometer to detect emissions from WiMax systems, either in the uplink or downlink channel. By using well known detection techniques, signals can be detected to high levels of confidence. Once detected, the UWB system can adapt its spectral shape to minimize the energy received by the WiMax system.

EURECOM+2245

{C}hannel division multiple access : new multiple access approach for {UWB} networks
de Lacerda Neto and Menouni Hayar and Debbah
      (2007)
http://www.eurecom.fr/util/publidownload.fr.htm?id=2245

EURECOM+2194

{D}istributed power allocation for cognitive radio
Haddad and Debbah and Menouni Hayar
      (2007)
http://www.eurecom.fr/util/publidownload.fr.htm?id=2194

In this paper, we investigate the idea of using cognitive radio to reuse locally unused spectrum for communications. We consider a multiband/wideband system with two users in which the primary (licensed) user and the secondary (cognitive) user wish to communicate to the base station, subject to mutual interference. We introduce the notion of the virtual noise-threshold which represents a proxy for the primary user to allow cognitive communications. We determine, under the assumption that each user knows only his own channel, the acceptable interference level within a given quality of service. Moreover, we obtain a characterization of the distributed power allocation for each user, as well as the resulting virtual noise threshold. We prove that a cognitive user can vary its transmit power in order to maximize the sum capacity while maintaining a guarantee of service to the primary user.

EURECOM+2112

{UWB} channel models
Saadane and Menouni Hayar
      (2006)
http://www.eurecom.fr/util/publidownload.fr.htm?id=2112

EURECOM+1964

Channel division multiple access based on high UWB channel temporal resolution
de Lacerda Neto and Menouni Hayar and Debbah
      (2006)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1964

Ultra-WideBand (UWB) has been recently presented as a promising radio technology due to the large bandwidth available. This feature enables point to point high data rates at short range as well as high temporal resolution with long Channel Impulse Responses (CIR). Due to the their large bandwidth, UWB systems enables high temporal resolution with long CIR. In this paper, we evaluate an original multiple access scheme called Channel Division Multiple Access (ChDMA), where we use the CIR as a user signature. The signature code is given by the channel and the users are separated by their position: this signature is uniquely determined by the user's position, which changes from one position to another. This signature locationdependent property provides decentralized flexible multiple access as the codes are naturally generated by the radio channel. The framework is analyzed and validated by capacity assessments using UWB measurements performed at Eurecom and compared with classical CDMA schemes with random spreading codes. The analysis is focused on the impact of the user's asynchronism and the period of symbol on system performance. Two structures are considered at the receiver: single-user matched filter and MMSE receiver with Gaussian and BPSK signaling schemes.

EURECOM+1872

Channel allocation algorithms for multi-carrier systems
Toufik and Knopp
      (2006)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1872

This study focuses on orthogonal channel allocation strategies yielding multiuser diversity with a deterministic channel use in a N-user system with N parallel sub-channels. The techniques are applicable, for instance, in Orthogonal Frequency Division Multiple- Access (OFDMA) systems with dynamic sub-carrier allocation. We show that multiuser diversity, and thus an increase of aggregate data rates with the size of the user population, can still be successfully achieved even under a hard fairness constraint. Furthermore, we provide algorithms which perform channel allocation yielding variable-rate with constant power and fixed-rate with variable power. We show the effect of system bandwidth (and thus sub-channel correlation) on multiuser diversity. The techniques considered here do not require phase information in the channel allocation process, which, from a practical point-of-view is particularly important for time-division duplex systems exploiting channel reciprocity. Dynamic channel resource allocation (DCA) exploiting wideband multiuser diversity can provide data transmission with very high spectral efficiency by scheduling at each dimension (time, frequency, space) the user with the best channel conditions. The main issue arising from this allocation is fairness. Base station or users have to wait until their channel is most favorable to transmit. It is commonly considered that fairness comes at the cost of a significant system capacity penalty. In this paper we show that multiuser diversity, and thus an increase of aggregate data rates with the size of the user population, can still be successfully achieved even with deterministic channel use and that even under a hard fairness constraint we can achieve performance which comes close to those of the optimal unfair policy for K-user systems with K parallel sub-channels. We propose and compare different algorithms which perform channel allocation yielding variable- rate/constant-power (Max--Min allocation and maximum total rate allocation) and fixed-rate/variable-power (fixed rate allocation). We show the effect of system bandwidth (and thus sub-channel correlation) on wideband multiuser diversity. This paper also investigates the performance of combined orthogonal channel and antenna allocation algorithms in multiple-antenna multi-channel systems. We extend the proposed Max-Min allocation algorithm to the multiple-antenna systems and compare its performance in two different transmission scenarios (spatial multiplexing and space time coding). An extension of the Max--Min allocation algorithm to the general case of an arbitrary number of users is also given. The proposed techniques are applicable, for instance, in orthogonal frequency division multiple-access (OFDMA) systems with dynamic sub-carrier allocation.

EURECOM+1792

{C}ooperative spatial multiplexing with hybrid channel knowledge
Gesbert and Hjorungnes and Skevling
      (2006)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1792

EURECOM+1897

{R}esource allocation in wideband wireless systems
Realp and Knopp and Pérez-Neira
      (2005)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1897

EURECOM+1883

{C}ode constructions for non-coherent on-off ultra-wideband systems
Souilmi and Knopp
      (2005)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1883

We consider coding schemes for non-coherent on-off signaling over ultra-wideband channels. Different code constructions are proposed and optimized using an exit chart based methodology. The performance of proposed codes is then measured using both an exit chart based analysis and Monte Carlo simulations. The optimized codes are shown to perform close to information-theoretic limits.

EURECOM+1711

{T}echniques de transmission et de modélisation de canal pour les systèmes de communications multi-antennes
Guillaud
      (2005)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1711

EURECOM+1697

Analysis of signaling and coding schemes for non-coherent ultra-wideband systems
Souilmi
      (2005)
http://www.eurecom.fr/util/popuppubli.fr.htm?page=detail&id=1697

Ultra-wideband (UWB) radio is a new emerging technology which promises to bring a real revolution in the field of local area wireless communications. UWB is based on a shift in spectrum management paradigm which consists on allowing users to transmit over a shared bandwidth of several GHz rather than allocating private bandwidth to each user. No significant interference is caused to other UWB users nor to other systems coexisting on the same frequency bandwidth thanks to the fact that the transmitted power is constrained to have a very low spectral density. Given the huge bandwidth used by UWB systems, the latter operates in the low spectral efficiency regime. In our work we investigate the impact of UWB characteristics on the design of adequate signalling and coding schemes. Motivated by the fact that channel knowledge is not required to achieve channel capacity for vanishing spectral efficiency, we consider non-coherent type of detection. We first evaluate the performance of practical non-coherent schemes using on-off signalling. We then investigate the impact of channel estimation, made possible by channel stationary, on system performance and show at which extinct practical coherent UWB systems can outperform non-coherent ones. Later we introduce a multi-carrier UWB signalling scheme which generalizes the concept of on-off signalling to the time-frequency 2-dimentional signalling space. We analyze the performance of this signalling scheme by deriving lower and upper bounds on its achievable data rates over the set of all frequency taps correlation profiles. We then consider UWB on-off signalling in the context of peer-to-peer multiple access networks. We propose a quantized threshold-based non-coherent receiver whose performance is shown to approach the performance of a genie aided receiver. Finally we propose some practical channel code constructions that are specially designed for non-coherent UWB m-ary PPM systems. The code design uses an exit chart analysis. Code performance is then measured through simulations.

Brooks01

Design and Simulation of Orthogonal Frequency Division Multiplexing (OFDM) Signaling
Brooks and Hoelzer
      (2001)
http://whitepapers.zdnet.com/whitepaper.aspx?&docid=100667

A MATLAB program has been written to investigate Orthogonal Frequency Division Multiplexing (OFDM) communication systems. This program is valuable for future researchers simulating systems that are too theoretically complex to analyze. Single-carrier QAM and multi- carrier OFDM are compared to demonstrate the strength of OFDM in multipath channels. Two graphical user interface demonstrations show some of the basic concepts of OFDM.

Jing04

Reactive Cognitive Radio Algorithms for Co-Existence Between IEEE 802.11b and 802.16a Networks
Jing and Mau and Raychaudhuri and Matyas
      (2004)
http://www.winlab.rutgers.edu/~xjing/prj/GlobeCom05xjing.pdf

Overview: This paper investigates the use of reactive cognitive radio algorithms to enable co-existence between IEEE 802.11b and 802.16a networks in the same unlicensed band. In particular, a system model is developed in which the two wireless systems share radio resources in frequency, space and time, and reactive coordination methods are used to reduce the mutual interference and improve link throughput. Reactive cognitive radio schemes utilize the available degrees of freedom in frequency, power and time, and react to observations in these dimensions to avoid interference. Dynamic Frequency Selection (DFS) enables radios to choose the band with the least interference.

MTU

Michigan Tech Research
MTU
      ()
http://www.ece.mtu.edu/ee/faculty/cchigan/research.html

Singh

Navigating Spectrum With Cognitive Radio
Singh
      ()
http://ezinearticles.com/?expert=Braham_Singh

EURECOM+1892

{C}hannel models for ultra-wideband communications: an overview
Menouni Hayar and Vitetta
      (2005)
http://www.eurasip.org/content/Eusipco/IST05/papers/432.pdf

This paper presents an overview of ultra-wideband (UWB) channel modeling. After outlining the enormous potentialities of UWB systems and the benefits in terms of capacity and flexibility coming from their large bandwidth, we illustrate the state of the art on UWB channel models based on both empirical and statistical approaches. Finally, we underline the need of further research work and measurement campaigns in this area; this should aim at capturing the specificity of UWB propagation, leading to the derivation of more accurate channels models to be employed in both system design and performance optimization.

EURECOM+1516

On the estimation of the degrees of freedom of in-door UWB channel
Saadane and Menouni Hayar and Knopp and Aboutajdine
      (2005)

In this paper, we apply Akaike information criterion (AIC) and minimum description length (MDL) to estimate the number of degrees of freedom (DoF) of an ultra-wide band channel (UWB) in an indoor environment. We evaluate our solution under both scenarios, line-of-sight (LOS) and non-line-of-sight (NLOS). Based on AIC and the MDL criterion, we find that this number is large; this has important consequences on the receiver design. We show also, that in opposition to the accepted idea in the literature, the number of DoF does not increase linearly with the channel bandwidth.

EURECOM+1527

Variable-rate coding for slowly fading gaussian multiple-access channels
Caire and Tuninetti and Verdu
      (2004)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1527

We consider a nonergodic multiple-access Gaussian block-fading channel where a fixed number of independent and identically distributed (i.i.d.) fading coefficients affect each codeword. Variable-rate coding with input power constraint enforced on a per-codeword basis is examined. A centralized power and rate allocation policy is determined as a function of the previous and present fading coefficients. The power control policy that optimizes the expected rates is obtained through dynamic programming and the average capacity region and the average capacity region per unit energy are characterized. Moreover, we study the slope of spectral efficiency curve versus$ E_b/N_0 $(dB), and we quantify the penalty incurred by time-division multiple access (TDMA) over superposition coding in the low-power regime.

EURECOM+1484

Reconfigurable radio access technology: between myth and reality
Menouni Hayar and Knopp
      (2004)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1484

An overview of software radio and reconfigurable radio is given, with a special emphasis on results from EU-funded projects. The state-of-the art in reconfigurable radio is presented, detailing architectures providing reconfigurability for networks and services. The allsoftware approach for reconfigurable network elements and terminals is described. Finally, the Eurecom software radio platform is presented as well as the design flow for implementing reconfigurable air-interfaces. The evolution toward reconfigurable terminal architectures targeted at SoC/SoPC(System-on-a-Chip/System-on-a-Programmable -Chip) architectures is outlined.

EURECOM+1476

Achievable rates for UWB peer-to-peer networks
Souilmi and Knopp
      (2004)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1476

EURECOM+1475

The effects of UWB interference on GSM systems
Landi and Fischer
      (2004)
http://www.eurecom.fr/util/publidownload.fr.htm?id=1475

EURECOM+1166

A low complexity approach to space-time coding for multipath channels
Kobayashi and Caire
      (2003)
http://www.eurecom.fr/util/popuppubli.fr.htm?page=detail&id=1166

We consider a low-complexity single-carrier space-time coding scheme for frequency-selective channels based on the concatenation of an outer Trellis-Coded Modulation (TCM) with an inner Time-Reversal Orthogonal Space-Time Block Code (TR-STBC). The TR-STBC reduces the Multi-Input Multi-Output (MIMO) frequency-selective channel to a standard Single-Input Single-Output (SISO) channel affected by Inter-Symbol Interference (ISI). Hence, we apply reduced-state sequence detection based on combined equalization and Viterbi decoding in order to decode the outer TCM code. We motivate this structure via an information theoretic argument, and we show that for sufficiently large interleaving depth it achieves the maximum diversity offered by the channel. Our scheme achieves better spectral efficiency than space-time spreading and much lower complexity with similar/superior performance than other proposed schemes with the same spectral efficiency.

EURECOM+1447

On achievable rates and coding for UWB systems
Souilmi and Knopp
      (2003)
http://www.isi.ee.ethz.ch/winterschool/docs/souilmi.pdf

EURECOM+1444

Challenges in UWB signaling for adhoc networking
Knopp
      (2003)
http://www.eurecom.fr/util/popuppubli.fr.htm?page=detail&id=1444

Wallace05

Performance analysis of a spectrally compliant ultra-wideband pulse design
Wallace and Parr and Cho and Ding
Wireless Communications, IEEE Transactions on  4  2172 - 2181  (2005)
http://spincom.ece.umn.edu/papers03/jcn03lyg.pdf

Summary: We present a performance analysis of an ultra-wideband (UWB) system. The UWB system utilizes a new pulse design that made the performance analysis possible, since the new pulse not only has a short duration to reduce collision, but is also spectrally compliant to the recent U.S. Federal Communications Commission regulation on UWB systems. We present the performance analysis of UWB systems based on different pulse shapes and number of users. New simulation results on multiuser performance of the impulse radio are also presented.

Nakache03

Spectral Shape of UWB Signals-Influence of Modulation Format, Multiple Access Scheme and Pulse Shape
Nakache and Molisch
IEEE - Vehicular Technology Conference - Jeju, Korea      (2003)
http://www.merl.com/papers/docs/TR2003-40.pdf

Yang07

Spectrum Shaping for UWB Signals
Yang
      (2007)
http://www.ece.rochester.edu/courses/ECE245/projects/Yang_USB.ppt

DeWaal0506

{How Selfish an Animal? The Case of Primate Cooperation}
De Waal
Free Enterprise: Values in Action Conference Series, 2005-2006      ()

UCAN04

{U}ltra {W}ideband {C}oncepts for {A}d-{H}oc {N}etworks

      (2004)
http://www.acorde.biz/ch/rd_peur_UCANch.asp

McCorkle03

Electrically small planar UWB antenna apparatus and related system
McCorkle
USPTO      (07/08/2003)
http://www.freepatentsonline.com/6590545.html

Mitola05

Adaptive, Aware, or Cognitive Radio
Mitola
DARPA E2R Workshop      (2005)
http://e2r.motlabs.com/workshops/e2r-workshops/Session2_KeyNoteSpeech.ppt.pdf/download

Bian07

Segment-Based Channel Assignment in Cognitive Radio Ad Hoc Networks
Bian and Park
ICST Second International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom)      (2007)
http://www.arias.ece.vt.edu/publications/conferences/Kaigui_Crowncom_CamReady.pdf

Jondral05

Software-Defined Radio---Basics and Evolution to Cognitive Radio
Jondral
EURASIP Journal on Wireless Communications and Networking 2005  3  275--283  (2005)
http://web.syr.edu/~ejhumphr/Cognitive%20Radio%20Research/CR%20Tutorial.pdf

We provide a brief overview over the development of software-defined or reconfigurable radio systems. The need for software- defined radios is underlined and the most important notions used for such reconfigurable transceivers are thoroughly defined. The role of standards in radio development is emphasized and the usage of transmission mode parameters in the construction of software-defined radios is described. The software communications architecture is introduced as an example for a framework that allows an object-oriented development of software-defined radios. Cognitive radios are introduced as the next step in radio systems' evolution. The need for cognitive radios is exemplified by a comparison of present and advanced spectrum management strategies.

Dimitrakopoulos04

Cognitive Radio, Spectrum and Radio Resource Management
Dimitrakopoulos and Demestichas and Grandblaise and Mößner and Hoffmeyer and Luo
      (2004)
http://www.ww-rf.org/fileadmin/sites/default/files/about_the_forum/WG/WG6/White%20Paper/WG6_WP4.pdf

The innovative communications services and applications imposed by ever increasing customer demands render necessary the development of efficient radio resource exploitation mechanisms and intelligent network planning methods. The whole process of planning and managing a reconfigurable network must be reconsidered, in order to live up to the expectations created by the migration towards a new era of communications. This White Paper deals with such issues, emphasizing the role of new engineering technologies in reconfigurable networks. For this purpose, it presents the respective Radio Resource Management, i.e. Spectrum Management and Joint Radio Resource Management, and Network Planning technical approaches, aiming at their application in next generation wireless access infrastructures.

Evans06

Technical Document on Cognitive Radio Networks - GENI: Global Environment for Network Innovations
Evans and Minden and Knightly
      (2006)
http://geni.net/GDD/GDD-06-20.pdf

A driving feature of future network architectures will be the mobile user. Users increasingly will access information resources while on the move, whether when in a vehicle, attending a business meeting, or working in remote locations. Wireless technology is necessary to support the mobile user and adaptive and efficient use of radio spectrum is an important aspect of developing future network architectures. Cognitive Radios (CRs) integrate radio technology and networking technology to provide efficient use of radio spectrum, a natural resource, and advanced user services. The cognitive radio wireless network is intended as an advanced technology integration environment with focus on building adaptive, spectrum-efficient systems with emerging programmable radios. The emerging cognitive radio scenario is of current interest to both policy makers and technologists because of the potential for order-of-magnitude gains in spectral efficiency and network performance. NSF and industry funded R&D projects aimed at developing cognitive radio platforms are currently in progress and are expected to lead to equipment that can be used for GENI in the 2007-08 timeframe. Protocol research to be supported with the planned experimental system includes discovery and self-organization, cross- layer protocols for PHY adaptation, cooperation and competition mechanisms, spectrum etiquette procedures, and cognitive radio hardware/software performance optimization. Cognitive Radio Features The idea of a cognitive radio extends the concepts of a hardware radio and a software defined radio (SDR) from a simple, single function device to a radio that senses and reacts to its operating environment. A Cognitive Radio incorporates multiple sources of information, determines its current operating settings, and collaborates with other cognitive radios in a wireless network. The promise of cognitive radios is improved use of spectrum resources, reduced engineering and planning time, and adaptation to current operating conditions. Some features of cognitive radios include: Sensing the current radio frequency spectrum environment: This includes measuring which frequencies are being used, when are they used, estimating the location of transmitters and receivers, and determining signal modulation. Results from sensing the environment would be used to determine radio settings. Policy and configuration databases: Policies specifying how the radio can be operated and physical limitations of radio operation can be included in the radio or accessed over the network. Policies might specify which frequencies can be used in which locations. Configuration databases would describe the operating characteristics of the physical radio. These databases would normally be used to constrain the operation of the radio to stay within regulatory or physical limits. Self-configuration: Radios may be assembled from several modules. For example, a radio frequency front-end, a digital signal processor, and a control processor. Each module should be self-describing and the radio should automatically configure itself for operation from the available modules. Some might call this ``plug-and-play.'' - 2 - Mission-oriented configuration: Software defined radios can meet a wide set of operational requirements. Configuring a SDR to meet a given set of mission requirements is called mission- oriented configuration. Typical mission requirements might include operation within buildings, substantial capacity, operation over long distances, and operation while moving at high speed. Mission-oriented configuration involves selecting a set of radio software modules from a library of modules and connecting them into an operational radio. Adaptive algorithms: During radio operation, the cognitive radio is sensing its environment, adhering to policy and configuration constraints, and negotiating with peers to best utilize the radio spectrum and meet user demands. Distributed collaboration: Cognitive radios will exchange current information on their local environment, user demand, and radio performance between themselves on a regular bases. Radios will use their local information and peer information to determine their operating settings. Security: Radios will join and leave wireless networks. Cognitive Radio Research Questions The capabilities outlined above for cognitive radios, and the questions they generate, are just forming in the wireless research community. In a truly integrated network, once one node is mobile, the entire network needs to deal with mobility. Routing is one of the first functions that must address mobility. Resource management under the constraints of mobile users is another open issue. A sample of research questions include: 1. How does a richly connected mobile wireless network affect the architecture, design, and implementation of a global internet? How do local resource allocation algorithms, say the allocation of RF spectrum resources, interact with fixed infrastructure resource allocation? 2. How does one reliably sense the radio spectrum environment? How does one detect weak signals with constrained processing capacity? How does one use measurements to set the operating parameters of the radio? How does one reliably exchange measurement information with peers? 3. How does one express regulatory and operational policies? How are policies securely updated? What method does one use to interpret policies? How are policies affected by different market models, e.g. property based, unlicensed, or brokered? 4. What language should be used to describe radio module capabilities? What radio interface should be presented to the application? How does one derive a common application interface from a specific module description? 5. How does one quantify mission requirements? How does one describe the capabilities of radio software modules? What techniques effectively translate from mission requirements to a radio configuration? 6. Given all the information available to a radio, how are operating settings derived? 7. How do multiple radios collaborate? What information is exchanged and what protocols are used? How are setting changes coordinated across the wireless networks? 8. How are each of these adaptive techniques secured against intruders? - 3 - These early research questions call for a active and rigorous research program. Investigators should be encouraged to develop and analyze the necessary measurement and adaptive algorithms. The most promising algorithms should be tested and evaluated in numerous testbeds and field-based experiments and integrated with the larger fixed infrastructure. The interactions between CR networks through the fixed infrastructure and with the fixed infrastructure need to be investigated. Cognitive radios will operate in a dynamic radio environment. They will sense the environment, user demand, and radio performance and react to those measurements. Cognitive radios will exchange information with peers to use the radio spectrum efficiently, meet user demands, and achieve robust operation. Impact of Cognitive Radio Research on GENI Many of the research questions essential to building cognitive radio networks are, in some sense, extreme problems of wired networks. For example, both wired and wireless networks need to deal with links going up and down. However, in the wireless network, the frequency of link status changes is much higher than in today's wired network. So, wireless network architectures must pay closer attention to link status changes and react faster to these changes. This work would carry over into wired network. Some characteristics of cognitive radio networks that are applicable to the larger, end-to-end network are: 1. Operating environment sensing -- Cognitive radios measure and react to the environment they are operating in. This environment is multi-dimensional; including cooperative and non-cooperative emitters turning on and off, CRs adapting to their local changes, and traffic loads; and rapidly varying. CRs must rapidly adapt to this changing environment and communicate their changing operation settings to other wireless devices in the network. The mechanisms and techniques to sense, adapt, and communicate operation state are necessary in CR networks and applicable to networks in general. 2. Robust communications services with unreliable links -- The radio links, by their very nature, have intermittent outages. A link outage may result from the temporary location of the receiver, transmitter, and other objects in the environment. CRs, by their very design, must deal with these very short term link outages, and do so through a variety of techniques. It is through this large set of techniques and mechanisms that wireless networks implement a robust and reliable communications service with unreliable links. The techniques and design patterns used in wireless architectures are applicable to the larger network architecture. 3. Operational state languages -- CRs, as they adapt, must communicate their observations and operation state to other CRs in the network. A few ``languages'' will be needed to describe observations and operation state. This information is likely to be much richer than common link status information. For example, one radio might send a list of all emitters it has recently sensed to other CRs in the network. The entry for each emitter might include a frequency range, time, and spatial location, and signal format (e.g. spread spectrum or narrow-band FM). The language used to describe observations and operation state will be much richer than conventional node or link state information. The language(s) and protocols necessary for CR networks should influence general network architectures. 4. Distributed Resource Management -- The radio spectrum is a distributed resource. Use of the spectrum in one location affects the availability of that spectrum in other network locations. Allocation of the radio spectrum resource must be carried out in a cooperative manner and balanced between (quick) local decisions and (optimal) global allocation. The algorithms developed to allocate the distributed radio spectrum and mobile network resources based on traffic loads and operating environment are applicable to the GENI infrastructure -- and will require demanding new services within the GENI network. These examples show how techniques and mechanisms necessary to CR networks will have an influence on the architecture, design, and implementations of networks in general.

OSCR

ARCHITECTURE FOR AN OPEN-SOURCE COGNITIVE RADIO
Stuntebeck and O'Shea and Hecker and Clancy
SDR Forum Technical Conference      (2006)
http://users.ece.gatech.edu/~eps/publications/sdr06-oscr.pdf

OSCR, a framework for the implementation of a cognitive radio, is designed to facilitate the integration of a cognitive engine with one or more existing Software Communications Architecture (SCA) based radios. It consists of two components: a multiplexer, which acts as the cognitive engine's point of control for each individual radio within the system, and an SCA resource within each radio, which translates between the radio's native control API and the OSCR API. OSCR is designed to integrate multiple radios, which may all have differing capabilities, under a single cognitive engine. To demonstrate the usefulness of OSCR, used it to construct a cognitive radio composed of a basic SCA-compliant software radio and a cognitive engine designed to maximize channel capacity by monitoring channel statistics and varying radio parameters. Implementation details and results of experiments with this system are provided

Sengupta07

Enhancements to cognitive radio based IEEE 802.22 air-interface
Sengupta and Brahma and Chatterjee and Shankar
      ()
http://www.cs.ucf.edu/~mainak/papers/iccCR.pdf

Chen05

Fast connection establishment method for bluetooth device
Chen
      (2005)
http://www.patentstorm.us/patents/6978119-fulltext.html

EURECOM+2349

Kinetic mobility management applied to vehicular ad hoc network protocols
Haerri and Bonnet and Filali
Accepted for Elsevier Computer Communications (COMCOM) ``Special Issue on Mobility Protocols for ITS VANET``, to be published in 2008      (2008)

Vehicular Ad Hoc Networks (VANETs) are a particular category of mobile ad hoc networks (MANETs) characterized by a high mobility and a reduced connectivity. In order to develop protocols for vehicular networks, the community may either create VANET specific approaches, or adapt already existing protocols to VANET. While the former may provide efficient specialized solutions, the latter offers an increased interoperability and universality, which is a key issue for industrial partners involved in the deployment of VANET and Intelligent Transportation Technologies (ITS). An important aspect in the porting of ad hoc networks solutions to VANET and ITS is an efficient management of vehicular mobility. Mobility Management is a principle aimed at updating network routes or structures in order to keep them coherent with mobile topologies. Mobility management may be proactive or reactive, depending if the updates are triggered with or without topology changes, or if and only if a change in the topology effectively requires to update the structure. Failure to develop efficient mobility management heuristics leads to a waste of network resources and suboptimal routes or structures. The optimal solution is obviously the reactive mobility management, as updates are optimally triggered only when necessary. However, due to its complexity, the reactive mobility management has not attracted as much attention as its proactive counterpart. In this paper, we introduce a location-aware framework, called Kinetic Graphs, that may be followed by ad hoc protocols in order to implement a reactive mobility management. The Kinetic Graph framework is able to capture the dynamics of mobile structures, and is composed of four steps: (i) a representation of the trajectories, (ii) a common message format for the posting of those trajectories, (iii) a time varying weight for building the kinetic structures, (iv) an aperiodic neighborhood maintenance. We eventually provide a example of a successful application of this framework to broadcasting and routing in VANET.

EURECOM+2104

Mobility models for vehicular ad hoc networks: a survey and taxonomy
Haerri and Filali and Bonnet
Accepted for IEEE Communications Surveys and Tutorials (epublication)      (2008)
http://www.eurecom.fr/util/popuppubli.fr.htm?page=detail&id=2104

Vehicular Ad-hoc Networks (VANETs) have been recently attracting an increasing attention from both research and industry communities. One of the challenges posed by the study of VANETs is the definition of a generic mobility model providing an accurate, realistic vehicular mobility description at both macroscopic and microscopic levels. Today, most mobility models for vehicular studies only consider a limited macro-mobility, involving restricted vehicles movements, while little or no attention is paid to micro-mobility and its interaction with the macro-mobility counterpart. On the other hand, the research community cannot have access to realistic traffic generator which have not been designed to collaborate with network simulators. In this paper, we first introduce a classification of existing methods for the generation of vehicular mobility models, then we describe the various approaches used by the community for realistic VANET simulations. Finally, we provide an overview and comparison of a large range of mobility models proposed for vehicular ad hoc networks.

Browne95

{Visual Programming and Debugging for Parallel Computing}
Browne and Hyder and Dongarra and Moore and Newton
      (`1995)

Rader98

{Principles to Scaffold Mixed Textual and Iconic End-User Programming Languages}
Rader and Cherry and Brand and Repenning and et al.
      (1998)
http://www.cs.colorado.edu/~ralex/papers/PDF/VL98-scaffold.pdf

Repenning07

{X-expressions in XMLisp: S-expressions and Extensible Markup Language Unite}
Repenning and Ioannidou
      (2007)
http://www.cs.colorado.edu/~ralex/papers/PDF/X-expressions.pdf

Repenning00

{AgentSheets : an Interactive Simulation Environment with End-User Programmable Agents}
Repenning
      (2000)
http://www.cs.colorado.edu/~ralex/papers/PDF/Interaction2000.pdf

Choi07

{CS5461 -- Mobile Networks -- Project 2}
Choi
    1  (2007)
http://www.csl.mtu.edu/cs5461/www/Project/project.html

Johnston04

Advances in dataflow programming languages
Johnston and Hanna and Millar
ACM Computer Survey  36  1--34  (2004)
http://portal.acm.org/citation.cfm?id=1013208.1013209

Kodowsky07

{Is LabVIEW a general purpose programming language?}
Kodowsky
      (2007)
http://zone.ni.com/devzone/cda/tut/p/id/5313

QuartzComposer

{Introduction to Quartz Composer Programming Guide}
Apple
      ()
http://developer.apple.com/documentation/GraphicsImaging/Conceptual/QuartzComposer/index.html

Dann05

{Learning to Program with Alice}
Dann and Cooper and Pausch
      (2005)

Hamalainen07

Review to the existing ultra wideband (UWB) radio technologies
Hämäläinen
      (2007)
http://akseli.tekes.fi/opencms/opencms/OhjelmaPortaali/ohjelmat/CONE/fi/Dokumenttiarkisto/Viestinta_ja_aktivointi/Muu_viestinta_ja_aktivointi/Aiheryhmat/AR1/CWC_Tekes_GIGA_AR1_210507.pdf

WAND

DARPA looks to adaptive battlefield wireless nets
John Cox
      (2007)
http://www.networkworld.com/cgi-bin/mailto/x.cgi?pagetosend=/export/home/httpd/htdocs/news/2007/110107-wand.html&pagename=/news/2007/110107-wand.html&pageurl=http://www.networkworld.com/news/2007/110107-wand.html&site=wirelessmobile

Elektrobit07

{U}{W}{B} antenna, {E}lektrobit {G}roup, {L}td.

      (2007)
http://www.elektrobit.com/