{"title":"Accelerating Service Discovery in Ad-Hoc Zero Configuration Networking","authors":"S. Hong, S. Srinivasan, H. Schulzrinne","doi":"10.1109/GLOCOM.2007.185","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.185","url":null,"abstract":"Zero Configuration Networking (Zeroconf) assigns IP addresses and host names, and discovers service without a central server. Zeroconf can be used in wireless mobile ad-hoc networks which are based on IEEE 802.11 and IP. However, Zeroconf has problems in mobile ad-hoc networks as it cannot detect changes in the network topology. In highly mobile networks, Zeroconf causes network overhead while discovering new services. In this paper, we propose an algorithm to accelerate service discovery for mobile ad-hoc networks. Our algorithm involves the monitoring of network interface changes that occur when a device with IEEE 802.11 enabled joins a new network area. This algorithm allows users to discover network topology changes and new services in real-time while minimizing network overhead.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127867542","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 Determining a Best Pulse Shape for Multiple Access Ultra-Wideband Wireless Systems","authors":"N. Beaulieu, Bo Hu","doi":"10.1109/GLOCOM.2007.785","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.785","url":null,"abstract":"Pulse design is examined for multiple access ultra- wideband communication systems with consideration of the transmitter pulse-shaping and the receiver filter at the same time, subject to a transmitter power constraint. It is shown that an appropriate sine pulse not only conforms to required spectral emission constraints, but also optimizes the signal-to-noise-plus- interference ratio of the ultra-wideband system when corrupted by multiple access interference. Compared with previously proposed pulse shapes, the sine pulse proposed here achieves better error rate performance in multiple access environments without adding any implementation complexity. The design of ideal ultra- wideband pulses is clarified in terms of properties of the spectral emission mask.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131426322","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":"Adaptive Pricing without Explicit Knowledge of Users Traffic Demands and Utility Functions","authors":"F. Davoli, M. Marchese, M. Mongelli","doi":"10.1109/GLOCOM.2007.488","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.488","url":null,"abstract":"The problem of pricing for a telecommunication network is investigated with respect to the users' sensitivity to the pricing structure. A functional optimization problem is formulated, in order to compute price reallocations as functions of data collected in real time during the network evolution. No a-priori knowledge about the users' utility functions and the traffic demands is required, since adaptive reactions to the network conditions are sought in real time. To this aim, a neural approximation technique is studied to exploit an optimal pricing control law, able to counteract traffic changes with a small online computational effort.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127394693","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":"Moment Based Interference Analysis of CM1, CM2, CM3 and CM4 UWB Systems","authors":"Yunfei Chen, N. Beaulieu","doi":"10.1109/GLOCOM.2007.733","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.733","url":null,"abstract":"Statistical moments of the inter-path interference, the inter-chip interference and the intersymbol interference in a direct-sequence binary phase shift keying ultra-wide bandwidth (UWB) system are analyzed for the IEEE UWB channel models. Exact expressions for the first- and second-order moments are derived. Using these expressions, the effects of the channel model parameters and the duration of the monocycle pulse are examined. For comparison, the first- and second-order moments of the signal component are also obtained. An approximation to the probability density function of the signal component is presented, and its accuracy is verified by calculating the bit error rate of a maximal ratio combining Rake receiver.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115187630","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":"Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks","authors":"P. Ng, D. Edwards, S. Liew","doi":"10.1109/GLOCOM.2007.166","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.166","url":null,"abstract":"In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (I-graph). Most of the interference graphs in the literature simply model the DATA and ACK traffic of a link by a single vertex. They fail to capture the link-directionalities. In fact, some instances of directional traffic can actually transmit simultaneously but are prohibited by the interference graphs. Thus, in our link-directional interference graph, a link is represented by two vertices, one for DATA traffic and the other for ACK traffic. We then apply a colouring algorithm in the I-graphs. The colouring results provide insights in order to boost network capacities in TDMA or FDMA ad-hoc networks. We show that the network capacities can be improved by 100% in a triangular topology and 33% in a lattice topology. Simulations also show that a distributed dual channel protocol assigning channels according to link-directionalities can boost the capacities by 70% in large-scale random networks. We believe this is a first paper in the literature to take into account link-directionalities in interference graphs.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115234728","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":"Turbo Equalization for Single Antenna Cochannel Interference Cancellation in Single Carrier Transmission Systems","authors":"P. Nickel, W. Gerstacker, W. Koch","doi":"10.1109/GLOCOM.2007.639","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.639","url":null,"abstract":"In recent years, single antenna interference cancellation (SAIC) has evolved as an attractive method to increase the capacity of single carrier mobile radio networks like GSM/EDGE (enhanced data rates for GSM evolution). Different algorithms have been developed to improve the performance of the GSM system in severely interference limited scenarios exploiting the structure of the real-valued signal constellation adopted in GSM. For general complex-valued modulation, most known procedures are not applicable, as for a single antenna receiver the system gets overloaded and signals are not separable by e.g. linear operations. In this paper, cochannel interference mitigation with a reduced-complexity equalizer for intersymbol interference (ISI) channels in combination with an appropriate prefilter is considered. In order to enable SAIC for complex-valued modulation schemes, joint (multi-user) turbo equalization is applied. Performance is shown for different variants of the proposed basic scheme, where the GSM/EDGE system serves as an application example. One of the proposed variants is fully compatible to the packet radio transmission schemes of the GSM/EDGE standard and outperforms previously proposed SAIC algorithms for 8PSK.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115463327","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":"Telecom Critical Infrastructure Simulations: Discrete-Event Simulation vs. Dynamic Simulation How Do They Compare?","authors":"G. O'Reilly, A. Jrad, A. Kelic, R. LeClaire","doi":"10.1109/GLOCOM.2007.493","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.493","url":null,"abstract":"Critical national infrastructures for power, emergency services, finance, and other basic industries rely heavily on information and telecommunications networks (voice, data, and video) to provide services and conduct business. The telecommunication network is recognized by the federal government as one of the critical national infrastructures that must be maintained and protected against debilitating attacks. This paper describes a comparison between two simulation models of the voice telecommunications infrastructure for a metropolitan area for both wireline and wireless networks with millions of subscribers. One simulation is a very detailed discrete- event call-by-call simulation model, and the second is a higher level time-based system dynamics model. The purpose of these models is to investigate the availability of the telecom infrastructure under disruptions. The results show that the higher level system dynamics models can successfully match the summary results of the more detailed model and can be run several orders of magnitude faster.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115704634","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 Novel Distributed Scheduling Algorithm for Wireless Mesh Networks","authors":"Yun Hou, K. Leung","doi":"10.1109/GLOCOM.2007.958","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.958","url":null,"abstract":"Wireless multi-hop, mesh networks are being considered as a candidate to backhaul data traffic from access networks to the wired Internet. These mesh networks are referred to as wireless backhaul networks. Existing medium access control (MAC) protocols and scheduling algorithms are devised for wireless access. So although they have been adopted for the wireless backhaul networks, they do not yield good performance. In this paper, we propose a novel distributed scheduling algorithm, composed of a framework and a new utility function definition, for wireless backhaul networks. We show by analysis and simulation that in a long run the algorithm converges to the desired throughput allocation, which can be specified by the routing protocol in use to guarantee quality of service. Moreover, in terms of interference, we show that our framework maintains strong temporal correlation of interference, which is required to ensure proper channel predictions for scheduling gain and for distributed power control. Finally, simulation results reveal that the new algorithm takes advantage of the multi-user diversity in achieving high overall network throughput, when compared with the tree-structure algorithm.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124194761","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":"Intelligent Flow-Based Sampling for Effective Network Anomaly Detection","authors":"G. Androulidakis, S. Papavassiliou","doi":"10.1109/GLOCOM.2007.374","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.374","url":null,"abstract":"Sampling has become an essential component of scalable Internet traffic monitoring and anomaly detection. In this paper, the emphasis is placed on the evaluation of the impact of using intelligent flow sampling techniques on the anomaly detection process. Based on the observation that small flows are usually the source of many network attacks (DDoS, portscans, worm propagation) we first introduce a new flow sampling methodology that focuses on the selection of small flows and achieves to improve anomaly detection effectiveness, while at the same time reduces the number of selected flows. The performance evaluation of the impact of intelligent flow-based sampling on the anomaly detection process is achieved through the adoption and application of a sequential non-parametric Change-Point Detection anomaly detection method on realistic data that have been collected from a real operational university campus network.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434270","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":"Low Complexity Constructions of Multi-Block Space-Time Codes Achieving Diversity-Multiplexing Tradeoff","authors":"Hsiao-feng Lu","doi":"10.1109/GLOCOM.2007.332","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.332","url":null,"abstract":"A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440344","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}