{"title":"A novel development for parallel cyclic convolution: The super block pseudocirculant matrix","authors":"M. Teixeira, Y. Rodriguez, A. Gonzalez","doi":"10.1109/SARNOF.2007.4567391","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567391","url":null,"abstract":"As opposed to prime factor type algorithms, the only requirement made by parallel cyclic convolution techniques based on block pseudocirculant matrices is that the convolution length be composite. Highly composite lengths, in particular, give a larger variety of implementation choices. In this paper we offer an introduction to new mathematical constructs, the super block pseudocirculant matrix, and the block pseudocyclic shift operator, as a base to derive further structures for this important class of parallel, one dimensional, cyclic convolution algorithms based on block pseudocirculant matrices. Their modular composition makes them suitable for implementation in VLSI, FPGA or multiprocessor computers in either a pipelined or a parallel fashion. Block pseudocirculants appear in fields such as precoding systems, transmultiplexers, polyphase networks, block filtering, QMF banks, and others, therefore the new mathematical constructs introduced in this paper may have an impact that transcend its sole applications to parallel cyclic convolution and its related applications.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123287027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cluster-grid structure routing protocol for sensor mobility management","authors":"Jiann-Liang Chen, Ming-Chiao Chen, Po-Yueh Huang, Yao-Chung Chang","doi":"10.1109/SARNOF.2007.4567320","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567320","url":null,"abstract":"Sink mobility has become an increasingly important requirement of various sensor network applications. Handling such mobile sink conditions brings new challenges to large-scale sensor networking. This investigation proposed a hybrid-structure routing protocol (HSRP) that combines the benefits of grid-based and cluster-based structures. Grid-based structure is designed to solve the cluster head selection problem. A virtual cluster structure based on grid structure information is also built. The hybrid-structure can establish a local shortest routing path from mobile sink toward to source. Simulation results indicate that the proposed HSRP mechanism reduces about 28% energy consumption than other approach. Moreover, HSRP mechanism reduces average delay time, increases higher success ratio, and has a longer network lifetime.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123330877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A dynamic load dispersion algorithm for load-balancing in a heterogeneous grid system","authors":"D.S. Acker, S. Kulkarni","doi":"10.1109/SARNOF.2007.4567375","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567375","url":null,"abstract":"The ever changing demands on computational resources has information systems managers looking for solutions that are more flexible. Using a ldquobigger boxrdquo that has more and faster processors and permanent storage or more random access memory (RAM) is not a viable solution as the system usage patterns vary. In order for a system to handle the peak load adequately, it will go underutilized much of the time. A grid based distributed system can solve this problem by allowing multiple independent jobs to run over a network of heterogeneous computers. Applications can be based on several parallel jobs, several sequential jobs, or a single job. Keeping the workload represented by these jobs balanced over the network of computers requires network-aware scheduling algorithms that are dynamic, transparent, scalable, and quick. We present such an algorithm that handles load-balancing of jobs submitted at any point in the grid. Our algorithm accommodates jobs with differing CPU and I/O requirements and load-balances them over varying grid loads and varying network latencies.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115486949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Security vulnerabilities and solutions for packet sampling","authors":"S. Goldberg, J. Rexford","doi":"10.1109/SARNOF.2007.4567339","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567339","url":null,"abstract":"Packet sampling supports a range of Internet measurement applications including characterizing the spatial flow of traffic through a network for traffic engineering purposes, identifying the flows utilizing a link for billing purposes or for intrusion detection, and monitoring end-to-end data-path quality. However, packet-sampling mechanisms must be robust to adversarial hosts that craft packet streams that are disproportionately selected by a packet sampler. For example, a botnet flooding a network with packets in a denial-of-service attack, or a greedy customer trying to avoid being billed for network utilization, each have a strong incentive to craft packet streams that evade selection by the packet sampler. In this paper, we focus on securing the passive packet sampling mechanisms recommended by PSAMP (the IETF Packet Sampling working group [1]) against adversarial hosts. We show that (1) some of the packet sampling techniques suggested in current drafts of the PSAMP charter have security vulnerabilities, (2) secure uncoordinated sampling can be achieved using random sampling with a cryptographic random number generator, and (3) secure coordinated sampling requires a cryptographic pseudorandom function, keyed with a secret key that should be changed each time the sampler leaks information to the hosts.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116961619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effects of channel estimation on dynamic resource allocation in multiuser OFDM systems","authors":"H. Ramezani, B. Abolhassani","doi":"10.1109/SARNOF.2007.4567347","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567347","url":null,"abstract":"This paper investigates effects of pilot assisted channel estimation on dynamic resource allocation in a multiuser orthogonal frequency division multiplexing (OFDM) system. The channel estimation is done in each OFDM symbol through least-squared error (LSE) or minimum mean-squared error (MMSE) algorithm. The performance of each of these algorithms is evaluated through computer simulations. The maximal total capacity and the fair resource allocations are considered. It is shown that there is an optimal power distribution among pilots and data for maximizing the capacity. It is also shown that the equal power allocation among data subchannels is the optimum for maximizing the system capacity with channel estimation.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121958535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Measurement-based computation of equivalent bandwidth under performance constraints","authors":"M. Marchese, M. Mongelli","doi":"10.1109/SARNOF.2007.4567397","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567397","url":null,"abstract":"Equivalent bandwidth (EqB) is defined as the minimum service rate to be provided to a traffic buffer to guarantee a certain degree of quality of service (QoS) in terms of objective parameters (packet loss, delay, jitter). EqB techniques are usually obtained analytically for homogeneous traffic trunks, with respect to a single QoS constraint. Modern network solutions often imply the aggregation of service classes with different QoS constraints, thus generating heterogeneous trunks from the point of view of both traffic sources and QoS requirements. This situation leads to the need to develop new EqB techniques so to match heterogeneity. This paper proposes a novel measurement-based EqB technique that computes the minimum required bandwidth to be allocated to a buffer, which conveys heterogeneous traffic (both concerning the traffic sources and the QoS requirements), without using closed-form expressions. The effectiveness of the algorithm is checked through simulations.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128308843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rapid collision resolution in slotted Aloha without retransmission delays","authors":"G. Thomas","doi":"10.1109/SARNOF.2007.4567376","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567376","url":null,"abstract":"A simple collision resolution algorithm is presented wherein a set of contending packets transmit randomly into a frame of n slots. Those packets involved in collisions retransmit in another n-slot frame, and so on till all originally contending packets achieve successful transmission. It is shown via a state space model that the algorithm attains a maximal throughput of 0.304 for the optimal frame length n=6. Delay analysis indicates reduction of average delays by a factor of seven or more relative to comparable Aloha systems.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121693094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On performance bounds for joint parameter estimation and modulation classification","authors":"O. Dobre, F. Hameed","doi":"10.1109/SARNOF.2007.4567394","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567394","url":null,"abstract":"In this paper we investigate bounds on performance of joint parameter estimation and modulation classification. The Cramer-Rao Lower Bounds (CRLBs) of non-data aided joint estimates of signal amplitude and phase, and noise power are derived for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals. In addition, an upper bound on performance of Quasi Hybrid Likelihood Ratio Test (QHLRT)-based modulation classifiers is proposed, for the case when unbiased and normally-distributed non-data aided estimates of unknown parameters are available. Results for this upper bound are presented for BPSK and QPSK classification, with signal amplitude and phase, and noise power as unknown parameters.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116537658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative diversity in the presence of a misbehaving relay : Performance analysis","authors":"S. Dehnie, H.T. Sencar, N. Memon","doi":"10.1109/SARNOF.2007.4567377","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567377","url":null,"abstract":"Cooperative wireless communications offers a new dimension of diversity by emulating transmit antenna diversity to provide reliable communications. In cooperative diversity, single-antenna radios behave as relays between a source and destination, and the performance improvements are due to cooperation of the source and the relay. However, a misbehaving relay can degrade the envisaged performance improvements severely. In practice, there are no mechanisms to ensure adherence of the relay to cooperation strategy. Due to this dependency on relaypsilas behavior cooperative diversity presents a new security challenge at the physical layer. In this paper, we investigate performance of cooperative diversity in the presence of a semi-malicious relay which does not conform to rules of cooperation at all time. The relay behavior is characterized by a probabilistic cooperation model which exploits the uncertainty in the wireless channel. Based on this model, we obtain the performance degradation in cooperative diversity both by analysis and simulation.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131307527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ultra wide-stopband planar microstrip bandpass filter above defected ground structure","authors":"E. Chikando, M. Reece, C. White","doi":"10.1109/SARNOF.2007.4567367","DOIUrl":"https://doi.org/10.1109/SARNOF.2007.4567367","url":null,"abstract":"In this paper, the design of a compact planar bandpass filter above a defected ground plane is presented. The filter is designed as a combination of microstrip resonators and exploits the properties of a planar electromagnetic bandgap (EBG) structure patterned unto the ground plane of the printed circuit board material to provide a very wide stopband of up to 5 times the fundamental frequency. The structure is fabricated and excellent agreement between measurement and simulation results are obtained; attesting for the functionality of this design approach. The proposed filter herein features operation at the protected L-band radiometric region centered around 1413MHz.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134461775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}