{"title":"Energy efficiency of different data transmission methods in IEEE 802.15.4: study and improvement","authors":"Liang Cheng, A. Bourgeois","doi":"10.1109/ISWPC.2007.342636","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342636","url":null,"abstract":"IEEE 802.15.4 is a new standard intended to serve a set of simple but important applications with very low power consumption and relaxed data rate requirements. Among these applications are residential networks, medical sensor networks, and industrial monitoring networks. In this paper, we propose new mechanisms to reduce the energy consumption of IEEE 802.15.4 devices further. Analysis results show that our schemes can improve energy efficiency of the devices, and save up to 47% energy in tracking beacons. Thus it can extend the lifetime of the entire personal area network","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"297 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114059355","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":"Dual Channel Transmission for Coexistence of Bluetooth Piconets with Multi-Slot Packets","authors":"Jingli Li, Xiangqian Liu, Xiaoli Ma","doi":"10.1109/ISWPC.2007.342635","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342635","url":null,"abstract":"Coexistence has become an important problem with the increasing deployment of wireless networks in the unlicensed frequency band. Most collision avoidance schemes developed for the coexistence of Bluetooth and WLAN are not applicable to multiple coexisting Bluetooth piconets due to constant frequency hopping. We propose a dual channel transmission (DCT) scheme to reduce the packet error rate (PER) due to channel collisions when multiple Bluetooth piconets coexist. With DCT, the same packet is transmitted on two distinct frequency hopped channels simultaneously, and the power used in each channel is half of what would be used in single channel transmission (SCT). We analyze the performance for multiple Bluetooth piconets with multi-slot packets in noisy environment. Performance analysis shows that compared to SCT, DCT can significantly reduce the PER when a small number of piconets coexist, and thus the network throughput can be increased by using DCT.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669650","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}
J. S. Silva, Tiago Camilo, A. Rodrigues, M. Silva, F. Gaudêncio, F. Boavida
{"title":"Multicast in Wireless Sensor Networks The next step","authors":"J. S. Silva, Tiago Camilo, A. Rodrigues, M. Silva, F. Gaudêncio, F. Boavida","doi":"10.1109/ISWPC.2007.342598","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342598","url":null,"abstract":"Multicast potentially optimises bandwidth consumption and node resources, when several users simultaneously participate in a communication session. Nevertheless, contrary to the expectations, IP multicast has not experienced widespread deployment, with the exception of IPTV. On the other hand, emerging wireless sensor network (WSN) applications could greatly benefit from multicast and constitute another field where multicast can be an effective and efficient technique. The question is: do multicast advantages hold in WSN scenarios? This paper discusses and evaluates the use of multicast in wireless sensor networks. A WSN platform with IP support and multicast is being developed. Concurrently, simulation studies were performed in order to assess the usefulness of multicast in WSNs. The results clearly point to the benefits of the use of this technique in processing and energy-restricted environments such as this one","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131670461","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":"An Unified Kalman Tracking Technique for Wireless Location Systems","authors":"Po-Hsuan Tseng, Chao Chen, Kai-Ten Feng","doi":"10.1109/ISWPC.2007.342628","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342628","url":null,"abstract":"Location estimation and tracking for the mobile stations have attracted a significant amount of attention in recent years. In order to offer sufficient precision for wireless location tracking, different techniques have been studied and combined, e.g. the least square methods for location estimation associated with the Kalman filters for location tracking. In this paper, a unified Kalman tracking (UKT) technique is proposed to provide an integrated algorithm for precise location estimation and tracking. Based on the time-of-arrival (TOA) measurements, a new variable is incorporated as an additional state within the Kalman filtering formulation in order to consider the nonlinear behavior for wireless location estimate. Numerical results illustrate that the proposed UKT algorithm can achieve enhanced accuracy for mobile location tracking, comparing with other existing schemes","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347561","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":"Improved Hamming Code for Error Detection and Correction","authors":"U. Kumar, B. Umashankar","doi":"10.1109/ISWPC.2007.342654","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342654","url":null,"abstract":"Hamming code is well known for its single-bit error detection & correction capability. To provide such a capability, it introduces 4 redundancy bits in a 7-bit data item. These redundancy bits are to be interspersed at bit positions 2n (n = 0, 1, 2, 3) with the original data bits. After error detection & correction, if any, the data bits have to be reassembled by removing the redundancy bits. In the proposed improvement the redundancy bits are appended at the end of data bits. This eliminates the overhead of interspersing the redundancy bits at the sender end and their removal at the receiver end after checking for single-bit error and consequent correction, if any. Further the effort needed in identifying the values of the redundancy bits is lower in the proposed novel method. Hamming code is normally used for transmission of 7-bit data item. Scaling it for larger data lengths results in a lot of overhead due to interspersing the redundancy bits and their removal later. In contrast, the proposed method is highly scalable without such overhead. Because of this feature it is suitable for transmission of large size data bit-streams with much lower redundancy bits per data bit ratio","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128485752","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":"Utility-Based Energy-Efficient Power Control for Multi-Carrier DS/CDMA","authors":"Lin Fang, R. de Figueiredo","doi":"10.1109/ISWPC.2007.342617","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342617","url":null,"abstract":"In this paper, based on the Nash game theory, we first propose a non-cooperative power control game for MC-DS/CDMA systems. Then, we present an ameliorated power control solution by introducing a pricing strategy to improve the overall quality of service (QoS) of the entire system. Compared to previous pricing strategies, our pricing scheme aims at increasing the entire system utility rather than individual utility to ensure that each player adopts a social behavior. Moreover, it does not require tuning or training procedures to avoid large computational complexity. Therefore, our approach forces each user to share efficiently rather than seek aggressively the system resources. Computer simulation results show that the proposed approach achieves a significant improvement in the total system utility, and it is useful in combating multiple access interference (MAI) and additive white Gaussian noise (AWGN) power to maintain satisfactory performance","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131748040","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 Routing Algorithm for Mobile Multiple Sinks in Large-Scale Wireless Sensor Networks","authors":"M. Soyturk, T. Altilar","doi":"10.1109/ISWPC.2007.342575","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342575","url":null,"abstract":"In wireless sensor networks, energy-aware and network-lifetime prolonging techniques are proposed, as the energy becomes the most valuable resource. Most of these techniques use complex calculations failing to be easy to implement. Another approach is to use mobile-sink node to enhance the performance metrics. However, these techniques are not scalable to large scale networks. Scalability of a routing protocol for wireless sensor networks is mainly affected by the topological changes and by the number of sensor nodes in the network. In large scale networks, multiple-sinks (gateways) should be used to provide scalability. In this paper, we propose that mobile multiple sink usage enhances the energy-related performance metrics in large scale networks. We use the stateless weight routing with multiple sinks (MS-SWR) for routing. Mobile sink nodes are used to enhance the performance metrics. The performance evaluation of the proposed technique shows that mobile sink usage in MS-SWR is scalable for large scale wireless sensor networks with multiple sinks","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126841737","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}
Taehong Kim, Daeyoung Kim, Noseong Park, Seong-eun Yoo, T. López
{"title":"Shortcut Tree Routing in ZigBee Networks","authors":"Taehong Kim, Daeyoung Kim, Noseong Park, Seong-eun Yoo, T. López","doi":"10.1109/ISWPC.2007.342571","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342571","url":null,"abstract":"ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. Due to characteristics such as low data rate, low price, and low power consumption, ZigBee is expected to be used in wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important goals is to reduce the installation and running cost, ZigBee stack is embedded in small and cheap micro-controller units. Since tree routing does not require any routing tables to send the packet to the destination, it can be used in ZigBee end devices that have limited resources. However, tree routing has the problem that the packets follow the tree topology to the destination even if the destination is located nearby. We propose the shortcut tree routing protocol to reduce the routing cost of ZigBee tree routing by using the neighbor table that is originally defined in the ZigBee standard. While following the ZigBee tree routing algorithm, we suggest forwarding the packet to the neighbor node if it can reduce the routing cost to the destination. Simulation results show that the shortcut tree routing algorithm saves more than 30 percent of the hop count compared with ZigBee tree routing.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121518794","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":"Enabling real-time fleet route planning and execution in a pervasive transportation environment","authors":"S. Ghosh, N. Jani, S. Das","doi":"10.1109/ISWPC.2007.342671","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342671","url":null,"abstract":"With the proliferation of wireless broadband technologies and the development of advanced smart phones, the transportation and logistics industry is well poised to leverage the advantages of ubiquitous connectivity to provide more reliable, efficient and responsive services. In particular, in the changing landscapes of supply chain management, the transportation management system (TMS) segment is required to support real-time flow of information between the route optimization/planning software and field execution: enabling dynamic re-routing of deliveries and granular tracking of packages. In this paper, we explore a mobile software architecture for bridging the gap between planning and execution in a pervasive transportation landscape empowered by next generation wireless communication and smart phone technologies. We identify key challenges in developing the mobile infrastructure and report on lessons learnt in implementing a prototype simulator for a generic Java Mobile Edition (J2ME) enabled mobile device.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114676171","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":"Trigger Management Mechanisms","authors":"Jukka Makela, K. Pentikousis","doi":"10.1109/ISWPC.2007.342633","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342633","url":null,"abstract":"Current protocol stacks can handle only a handful of events that may trigger actions for mobility management, such as signal strength indicators and cell load. We argue for new mechanisms that can deal with a greater variety of triggering events, which may originate from any component of the node's protocol stack as well as mobility management entities within the network. We present the main concepts that govern our trigger management mechanisms (TMM), which aim at operating in a richer mobility management framework, and enable the deployment of new applications and services. After summarizing the architectural requirements with respect to trigger collection, processing, storage, and dissemination, we introduce a real implementation of TMM on commodity mobile devices. We briefly review our testbed environment and present experimental results using TMM to drive a lossless streaming video session handover between a laptop and a PDA. We position the current TMM design and implementation within the ambient networks architecture, centering in particular on the use of policies to steer TMM operation, and the role that TMM can play in an information service infrastructure. Finally, we outline current and future work items","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"12 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120813260","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}