Kuang-Ching Wang, Jobin Jacob, Lei Tang, Yong Huang
{"title":"Transmission Error Avoidance for IEEE 802.15.4 Wireless Sensors on Rotating Structures","authors":"Kuang-Ching Wang, Jobin Jacob, Lei Tang, Yong Huang","doi":"10.1109/ICCCN.2008.ECP.162","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.162","url":null,"abstract":"Wireless sensors are increasingly adopted in manufacturing and vehicular systems for monitoring critical components under continuous operation. Many such components move rapidly and frequently in metallic containments with challenging radio propagation characteristics. For wireless sensors mounted on rotating structures, previous studies identified an eminent increase in packet transmission errors at higher rotation speeds. Such errors were found to occur at specific locations around the rotating spindle's periphery and such locations depended sensitively on sensor location and surrounding geometry. This paper studies a transmission error avoidance approach based on on-line error pattern inference and packet transmission time control for IEEE 802.15.4 compatible sensor radios to enhance the achievable data throughput. The method does not rely on sensor positioning support; instead, it infers the temporal error distribution using its local clock and avoids transmission in identified \"error regions\". Simulation studies showed a 50% reduction of errors and throughput increase up to 75%. Evaluated with different packet sizes and error distributions, the throughput gain was found to be most significant for higher rate and larger size transmissions.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132807471","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":"Publish/Subscribe Service in CAN-based P2P Networks: Dimension Mismatch and The Random Projection Approach","authors":"D. Tran, Thinh P. Q. Nguyen","doi":"10.1109/ICCCN.2008.ECP.24","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.24","url":null,"abstract":"CAN is a well-known DHT technique for content- based P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed into this zone. The dimension of this space is usually lower than the data dimension, thus we have the problem of dimension mismatch. This problem is widely addressed in the context of data retrieval that follows the traditional request/response model. However, little has been done for the publish/subscribe model, which is the focus of our paper. We show that dimension mismatch in CAN-based publish/subscribe applications poses new challenges. We furthermore investigate how a random projection approach can help reduce the negative effects of dimension mismatch. Our theoretical findings are complemented by a simulation-based evaluation.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133081765","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":"STRID: Scalable Trigger-Based Route Incidence Diagnosis","authors":"Feng Wang, Lixin Gao, O. Spatscheck, Jia Wang","doi":"10.1109/ICCCN.2008.ECP.29","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.29","url":null,"abstract":"As the Internet steadily increases in importance, it is still based on a quite fragile routing design. From network operators perspective it is therefore crucial to detect end-to- end path performance due to routing outages early to either mitigate them directly or contact other entities to mitigate them. In this work we demonstrate the feasibility of a real-time tool for detecting degraded forwarding performance due to routing problems. Our tool passively monitors the traffic within the network and actively probes paths for which the TCP traffic characteristics indicate a possible routing problem. More importantly, our tool focuses on detecting routing events that actually affect network traffic, which from the network operators' perspective is most relevant. The experimental results based on large-scale measurement in the Internet indicate that our tool effectively detects a significant number of routing outages and forwarding loops.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323866","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 Approach for Setting Parameters of the Coordinated Distributed Scheduler of the IEEE 802.16","authors":"V. Loscrí","doi":"10.1109/ICCCN.2008.ECP.129","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.129","url":null,"abstract":"The IEEE 802.16 standard is currently one of the most interesting broadband wireless access. One key issue of mesh networks is the MAC (medium access control) layer. In this paper we analyze the coordinated distributed scheduling scheme (CDS) of the standard IEEE 802.16. Since some fundamental parameters in this scheme has been left un-standardized, we focus on the dynamic setting of these parameters in order better performance in terms of throughput and average end-to-end data packets delay to be obtained. The standard describes a data scheduler in a general way, based on a three-way-handshake mechanism, but details about data scheduler scheme have been left un- standardized. In order to obtain a better evaluation in terms of performance of the control schedule, we implemented a simplified data scheduler and we show how this simplified data schedule allows smaller data delay transmissions to be realized.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124190379","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":"Proactive Rearrangement in Delay Constrained Multicast with Dynamic Membership Support","authors":"K. Yong, G. Poo, T. Cheng","doi":"10.1109/ICCCN.2008.ECP.115","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.115","url":null,"abstract":"We propose an efficient heuristic algorithm to rearrange multicast trees proactively in delay constrained dynamic membership multicast networks. The objective is to construct low cost multicast tree with controlled number of disrupted members within a very short rearrangement time when a member joins and leaves the tree. In addition, a heuristic algorithm to obtain near-optimal solution to the problem is introduced as the benchmark. A new performance index to gauge the efficiency of the proposed heuristics more accurately is also introduced. Better performance is obtained when compared with existing methods using simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920287","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":"Soft Combining ARQ Techniques for Wireless Systems Employing SC-FDE Schemes","authors":"R. Dinis, P. Carvalho, J. Martins","doi":"10.1109/ICCCN.2008.ECP.49","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.49","url":null,"abstract":"This paper considers the use of SC-FDE techniques (single-carrier with frequency-domain equalization) with low-complexity soft combining ARQ schemes (automatic repeat request). With our technique, packets associated to different transmission attempts are combined in a soft way, allowing improved performances. Moreover, the transmitter and receiver complexities are low and we can have excellent performances, especially when we have deep fading effects in slow-varying channels. By combining the advantages of SC-FDE schemes with soft combining ARQ, the proposed technique is particularly interesting for the uplink of wireless systems.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806703","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":"Efficient Fault Tolerant Topology Control for Three-Dimensional Wireless Networks","authors":"Yang Wang, Lijuan Cao, T. Dahlberg","doi":"10.1109/ICCCN.2008.ECP.75","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.75","url":null,"abstract":"Fault tolerant topology control in wireless networks has been studied recently. In order to achieve both sparseness (i.e., the number of links is linear with the number of nodes) and fault tolerance (i.e., can survive certain level of node/link failures), different geometric topologies were proposed and used as the underlying network topologies for wireless networks. However, most of the existing topology control algorithms can only be applied to 2-dimensional (2D) networks where all nodes are distributed in a 2D plane. In practice, wireless networks may be deployed in 3-dimensional (3D) space, such as underwater wireless sensor networks in ocean or ad hoc networks in space. This paper seeks to investigate efficient fault tolerant topology control protocols for 3D wireless networks. Our new protocols not only guarantee the kappa-connectivity of the network, but also ensure the bounded node degree and constant power stretch factor. All of our proposed protocols are localized algorithms, which only use one-hop neighbor information and constant messages with small time complexity. Our simulation confirms our theoretical proofs for all proposed 3D topologies.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128616520","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 Trust Model Robust to Slander Attacks in Ad Hoc Networks","authors":"P. B. Velloso, R. Laufer, O. Duarte, G. Pujolle","doi":"10.1109/ICCCN.2008.ECP.130","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.130","url":null,"abstract":"Slander attacks represent a significant danger to distributed reputation systems. Malicious nodes may collude to lie about the reputation of a particular neighbor and cause serious damage to the overall trust evaluation system. This paper presents and analyzes a trust model robust to slander attacks in ad hoc networks. We provide nodes with a mechanism to build a trust relationship with its neighbors. The proposed model considers the recommendation of trustworthy neighbors and the previous experiences of the node itself. The interactions are limited to direct neighbors in order to scale on mobile networks. The results show the impact of slander attacks to our trust model. We analyze how the main parameters affect the trust evaluation process under a lying collusion attack. We show that our trust model tolerate almost 40% of liars.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127084963","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}
Junlin Li, G. Al-Regib, Dihong Tian, Pi Sheng Chang, Wen H. Chen
{"title":"3-D Position and Amplitude VLC Coding in H.264/AVC","authors":"Junlin Li, G. Al-Regib, Dihong Tian, Pi Sheng Chang, Wen H. Chen","doi":"10.1109/ICCCN.2008.ECP.153","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.153","url":null,"abstract":"Hybrid variable length coding (HVLC) was recently proposed as a novel entropy coding scheme for block-based image and video compression, which divides each transform block into low frequency (LF) region and high frequency (HF) region and codes them differently. To take advantage of the clustered nature of the nonzero coefficients in the LF region, a two-dimensional position and one-dimensional amplitude coding scheme (2DP1DA) was also proposed, which codes the 2D position information, i.e., run of consecutive zero-valued coefficients and run of consecutive nonzero coefficients, jointly by a 2D code table. To further improve the coding efficiency, joint position and amplitude coding is desirable. In this paper, we propose a three-dimensional position and amplitude coding scheme (3DPA) to jointly code the position and amplitude information for each nonzero cluster by a 3D code table. The experimental results show that HVLC with 3DPA for coding LF region achieves about 3.2%~3.7% bit rate reduction for a wide range of quantization parameters (QP) compared with CAVLC in H.264. Moreover, the 3DPA scheme is a compact way to realize the joint position and amplitude coding and it is very suitable for context-adaptive HVLC design.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127151781","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 Flexible Approach to WSN Deployment","authors":"Luís D. Pedrosa, P. Melo, R. Rocha, R. Neves","doi":"10.1109/ICCCN.2008.ECP.161","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.161","url":null,"abstract":"A flexible wireless sensor network platform for easier implementation of diverse applications has been developed and deployed at the Institute Superior Tecnico - Technical University of Lisbon (IST-TUL). This test-bed integrates multiple projects into a single common network, thus creating an expandable platform that facilitates the development of future applications. To achieve this flexibility, a dedicated software framework was developed that not only provides a centralized configuration panel that is accessible over the Internet, allowing the administrator to configure common network parameters, but also supports application programmability, enabling fine-grained control of in-network sensing, processing, and actuation. On top of this platform, three initial applications have been developed and are currently coexisting within the same network, thus demonstrating the new platform's capabilities. The paper discusses the main issues related with the test-bed architecture and the development of an environmental interaction application, with an illustrative purpose, along with the deployment challenges. Results of the experimental evaluation of the test-bed are also shown, focusing on the performance of the environmental interaction application's in-network processing system. A particularly relevant result is denoted by the minimum time the network needs to complete its processing tasks (approximately 200 ms in our test topology).","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127168806","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}