{"title":"Packet Buffer Management for a High-Speed Network Interface Card","authors":"Shalini Batra, Yul Chu, Yan Bai","doi":"10.1109/ICCCN.2007.4317818","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317818","url":null,"abstract":"Packet buffers in a smart network interface card are managed in a way to reduce any packet losses from high-speed burst incoming data. Currently, two types of packet buffer management techniques are used. They are static buffer management and dynamic buffer management techniques. Dynamic buffer management techniques are more efficient than the static ones because they change the threshold value according to network traffic conditions. However, current dynamic techniques cannot adjust threshold instantaneously. Thus, packet losses with dynamic techniques are still high. We, therefore, propose a history-based buffer management scheme to address the issue. Our experiment results show that the history-based scheme reduces packet loss by 11% to 15.9% as compared to other conventional dynamic algorithms. Keywords -packet buffer; network interface card; layer 3 and 4 protocols; VHDL; static and dynamic buffer management.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000858","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}
A. Boukerche, Horácio Oliveira, E. Nakamura, A. Loureiro
{"title":"A Voronoi Approach for Scalable and Robust DV-Hop Localization System for Sensor Networks","authors":"A. Boukerche, Horácio Oliveira, E. Nakamura, A. Loureiro","doi":"10.1109/ICCCN.2007.4317868","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317868","url":null,"abstract":"Localization systems have been identified as a key issue to the development and operation of the Wireless Sensor Networks (WSN). A DV-Hop localization system works by transforming the distance to all beacon nodes from hops to units of length measurement (e.g., meters, feet) using the average size of a hop as a correction factor. Despite its advantages, a DV-Hop algorithm has some disadvantages, such as its large communication cost that limits its scalability, and its mapping from hops to distance units that introduces errors that are propagated to the computation of a node location. This last issue has been solved by some recent works, but the scalability problem still is an open problem that limits this technique to small or medium sized networks. In this work, we propose a novel approach that uses Voronoi diagrams in order to scale a DV-Hop localization algorithm while mantaining or even reducing its localization error. Two types of localization can result from the proposed algorithm: the physical location of the node (e.g., latitude, longitude), or a region limited by the node's Voronoi cell. The algorithm evaluation is performed by comparison with similar algorithms. We show how the proposed algorithm can scale in different aspects such as communication and processing costs when increasing the number of nodes and beacons.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128695881","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":"Facts of LIFE","authors":"A. Barbero, Øyvind Ytrehus","doi":"10.1109/ICCCN.2007.4317921","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317921","url":null,"abstract":"The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a \"real\" network, through the use of a simulation model. We present results on the algorithm's ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697184","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":"Broadcast Collision Avoidance in Wireless Packet Networks","authors":"Jun Peng","doi":"10.1109/ICCCN.2007.4317925","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317925","url":null,"abstract":"Collision avoidance for broadcast packets in wireless networks is still a relatively open problem. The source of the problem is that there are multiple receivers for a single packet and it is difficult to coordinate them for medium reservation. This paper proposes a new, in-band pulse approach to addressing the problem and shows by extensive simulations how the approach significantly reduces the collisions in wireless networks with broadcast traffic and thus improves the network throughput.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817995","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}
Yuehua Wu, Jibo Wei, Byung-Seo Kim, Y. Xi, Dongtang Ma
{"title":"Opportunistic Scheduling for Delay Sensitive Flows in Wireless Networks","authors":"Yuehua Wu, Jibo Wei, Byung-Seo Kim, Y. Xi, Dongtang Ma","doi":"10.1109/ICCCN.2007.4317789","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317789","url":null,"abstract":"We present an \"opportunistic\" scheduling policy with the objective of improving delay performance for time-sensitive users in wireless networks. Since packet delay depends on both resource allocation and time-varying capacity of wireless channels, we introduce a search radius (SR) into the framework of packet fair queueing (PFQ) and employ maximum relative SNR (Max-rSNR) as scheduling rule with the purpose of providing short-term temporal fairness guarantee and improving user throughput. We make theoretical analysis of the delay performance of each user and find that each user's delay is directly related to SR, moreover the value of SR should be restricted within a limited range in order to provide better delay performance to each user. Based on this, we propose a feasible iterative algorithm to achieve an appropriate SR. We conduct an extensive set of simulations, which characterizes the performance of our scheduling scheme.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132321947","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":"Bayesian Learning of Neural Networks for Mobile User Position Prediction","authors":"Sherif Akoush, A. Sameh","doi":"10.1109/ICCCN.2007.4317989","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317989","url":null,"abstract":"In this paper, a novel technique for location prediction of mobile users has been proposed, and a paging technique based on it is developed. Mobile users are creatures of habits. They tend to repeat their behaviors. Hence, neural networks with its learning and generalization ability may act as a suitable tool to predict the location of a mobile user provided it is trained appropriately by the personal mobility profile. For prediction, a novel hybrid Bayesian neural network model for predicting locations on Cellular Networks (can also be extended to other wireless networks such as Wi-Fi and WiMAX) is suggested. We investigate its different parallel implementation techniques on mobile devices, and compare its performance to many standard neural network techniques such as: Back-propagation, Elman, Resilient, Levenberg-Marqudat, and One-Step Secant models. This approach is free from all unrealistic assumptions about the movement of the users. It is applicable to any arbitrary cell architecture. It attempts to reduce the total location management cost and paging delay. In general, it enhances mobility management in wireless networks (in location management and hand-off management). In our experiments, we compare results of the proposed Bayesian Neural Network with 5 standard neural network techniques in predicting next location. Bayesian learning for Neural Networks predicts location better than standard neural network techniques since it uses well founded probability model to represent uncertainty about the relationship being learned. The result of Bayesian training is a posterior distribution over network weights.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011271","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":"Functionally Layered Video Coding for River Surveillance","authors":"M. Iwahashi, S. Udomsiri","doi":"10.1109/ICCCN.2007.4317970","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317970","url":null,"abstract":"This paper proposes a new type of layered video coding for an application of river monitoring. A sensor node of the system produces the bit stream functionally separated into three layers. The first layer contains component signals effective for a function of water level detection. The second layer contains signals for thumb-nail video browsing. Each of them is transmitted at very low bit rate for regular monitoring. The third layer contains additional data necessary for decoding original video signal. It is transmitted when the necessity arises. The original video signal is decomposed into component band signals by the Haar transform in a sensor node. Experimental results show which band signals should be included into the first layer for water level detection based on the maximum likelihood estimation. It becomes possible to reduce power consumption in a sensor node by distributing computational load via internet and by sharing the temporal and spatial processing between \"compression\" and \"recognition\".","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134122183","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 the Suitability of Framed Slotted Aloha based RFID Anti-collision Protocols for Use in RFID-Enhanced WSNs","authors":"Dheeraj K. Klair, Kwan-Wu Chin, R. Raad","doi":"10.1109/ICCCN.2007.4317881","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317881","url":null,"abstract":"This paper studies the energy consumption of frame slotted Aloha (FSA) based anti-collision protocols. Specifically, we investigate twelve FSA variants using a detailed qualitative and quantitative methodology to evaluate their energy efficiency with varying tag population. Our results show that the variant that adjusts its frame size in accordance with tag population and incorporates the muting and early-end feature has the lowest energy consumption, hence most suited for RFID-enhanced WSNs.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131736477","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}
Yang Yu, Zhuo Li, Larry Shi, Yi-Chiun Chen, Hua Xu
{"title":"Network-Aware State Update For Large Scale Mobile Games","authors":"Yang Yu, Zhuo Li, Larry Shi, Yi-Chiun Chen, Hua Xu","doi":"10.1109/ICCCN.2007.4317878","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317878","url":null,"abstract":"In large scale mobile gaming environments, efficient mechanisms for state update is crucial to allow graceful real-time interaction of a large number of players, under limited wireless network bandwidth. By using the state updating threshold as a key parameter that bridges the resulting state inconsistency (or distortion) and the network traffic, we are able to model the fundamental traffic-distortion tradeoffs. Given the tradeoffs for all users, an optimal bandwidth allocation can be derived using well-known convex programming techniques. By exploring the temporal locality of gaming behavior, we also propose a prediction method to realize on-line bandwidth adaptation. Using real data trace from a multi-player driving game, the proposed network aware bandwidth allocation method, NABA, is able to achieve significant reduction in state distortion compared to two baselines: Uniform and Proportional policies. NABA is also adaptable to variations in system parameters, including bandwidth constraint and network delay.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131002613","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":"Applying Design Patterns to Wireless Sensor Network Programming","authors":"K. Tei, Y. Fukazawa, S. Honiden","doi":"10.1109/ICCCN.2007.4317965","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317965","url":null,"abstract":"Middleware for wireless sensor network (WSN) abstracts a network as an entity and hides programming difficulties from programmers. Many middlewares have been proposed, but they use different programming languages to manipulate functions in WSNs. This inhibits usability when manipulating multiple WSNs managed by different middlewares, because the primitives of each language have different descriptive capabilities. In this paper, we propose and apply design patterns in WSN programming to complement the capabilities of language primitives, and discuss the effectiveness of these design patterns. First, we discuss major middleware languages and compare the capabilities of their primitives. Second, we extract design patterns from the representative middlewares to cover the missing capabilities identified in the comparison. Finally, we discuss the effectiveness of design patterns for WSN programming. The discussion indicates that design patterns improve the usability of manipulating multiple WSNs.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949922","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}