Andrew Tjang, Michael Pagliorola, Hiral Patel, Xiaoyan Li, R. Martin
{"title":"Active tapes: bus-based sensor networks","authors":"Andrew Tjang, Michael Pagliorola, Hiral Patel, Xiaoyan Li, R. Martin","doi":"10.1109/LCN.2004.12","DOIUrl":"https://doi.org/10.1109/LCN.2004.12","url":null,"abstract":"In this work, we explore active tapes, a novel sensor network architecture. An active tape is a sequence of sensor nodes and related units (such as batteries) organized around a bus. A bus of programmable sensor nodes is, in effect, a programmable linear array, thus the term active tape. A bus provides a simple mechanism to share resources. In a sensor network context, the primary sharing concerns center around energy, sensing and networking. This paper serves as an introduction and initial exploration into the design space of active tapes.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121535614","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":"MAGNA: modeling and generating network attacks","authors":"W. Allen, G. Marin","doi":"10.1109/LCN.2004.75","DOIUrl":"https://doi.org/10.1109/LCN.2004.75","url":null,"abstract":"We present a system that generates synthetic attack traffic from state-based models of the behavior of real network attacks. The execution of these attacks can be carefully controlled to produce realistic training data that could prove useful in the evaluation and development of intrusion detection systems This tool can also be used to test host systems and networks for known vulnerabilities by launching controlled attacks and observing their impact on the target.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122725713","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 potential connectivity advantage of multiple relay technologies in wireless sensor networks","authors":"J. R. Stright, D. Rosenburgh","doi":"10.1109/LCN.2004.89","DOIUrl":"https://doi.org/10.1109/LCN.2004.89","url":null,"abstract":"Conceptually, a network of sensors with two or more embedded wireless physical layer protocols might gain connectivity advantage by utilizing an available but unused (i.e., redundant) transport technology in the event of link failures within the primary network. We propose a model of link redundancy for wireless networks. Using this model, we show that once a sufficiently high node density has enabled complete connectivity with respect to a single linking technology in an uncluttered environment, cross-network connectivity with randomly located obstructions present might be more efficiently achieved by utilizing multiple internode links than by increasing node density.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"50 S5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113964090","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":"Alleviating self-interference in MANETs","authors":"Alex Varshavsky, Eyal de Lara","doi":"10.1109/LCN.2004.14","DOIUrl":"https://doi.org/10.1109/LCN.2004.14","url":null,"abstract":"The interference range in multi-hop ad hoc networks (MANETs) is typically twice as large as the transmission range. This phenomenon causes packets of a multi-hop flow to interfere with each other as they are relayed over the multi-hop route. This interference, an instance of the notorious hidden terminal problem, is caused by simultaneous transmissions by down-stream nodes unaware of ongoing transmissions by up-stream nodes. DMAC (deferrable MAC) is a novel MAC protocol that alleviates the hidden terminal problem by deferring further transmissions until the previously transmitted packets travel far enough to avoid interference with the newly transmitted packets. For simple chain topologies, DMAC improves the throughput of CBR and TCP flows by up to 100% and 60%, respectively. For random mobile topologies with up to 40 simultaneous flows, DMAC improves the throughput of TCP flows by up to 30%.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132103853","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":"Wireless sensor networks and radio localization: a metrological analysis of the MICA2 received signal strength indicator","authors":"C. Alippi, Giovanni Vanini","doi":"10.1109/LCN.2004.142","DOIUrl":"https://doi.org/10.1109/LCN.2004.142","url":null,"abstract":"We investigate the accuracy of the received signal strength indicator of Crossbow MICA2 nodes in terms of precision, repeatability of the measurements, influence of the device factory parameter production and influence of the battery level. These results can be subsequently used to identify the limits, in terms of spatial accuracy, introduced by the envisaged sensor errors when used to solve the localization problem.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127213227","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":"Re-routing instability in IEEE 802.11 multi-hop ad-hoc networks","authors":"P. Ng, S. Liew","doi":"10.1109/LCN.2004.102","DOIUrl":"https://doi.org/10.1109/LCN.2004.102","url":null,"abstract":"TCP throughput instability is a well-known phenomenon in IEEE 802.11 multi-hop ad-hoc networks. However, we find that this problem is not restricted to TCP traffic only, but also occurs in UDP traffic. The associated throughput oscillations are not acceptable for real-time applications such as video conferencing and voice-over-IP. The paper re-defines this throughput fluctuation as a \"re-routing instability problem\" since it is caused by the triggering of the re-routing function. In particular, we show that the throughput instability is mainly induced by re-routing, not the binary exponential back-off of the IEEE 802.11 MAC protocol. Turning off the re-routing function, for example, eliminates the problem. We believe that this is the first paper to study this phenomenon in the context of re-routing instability. We propose to modify the ad-hoc routing protocols with a \"don't-break-before-you-can-make\" strategy. The scheme does not require modifications of the IEEE 802.11 standard, making it readily deployable using existing commercial wireless LAN (WLAN) products. Simulations show that the proposed scheme can significantly reduce the throughput variation in a traffic flow by 50-70% and improve the average throughput by up to 11%.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123817848","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":"Fairness and capacity trade-off in IEEE 802.11 WLANs","authors":"D. Pong, T. Moors","doi":"10.1109/LCN.2004.58","DOIUrl":"https://doi.org/10.1109/LCN.2004.58","url":null,"abstract":"The paper investigates fairness in a wireless LAN environment in which stations experience unequal signal qualities due to location and interference factors. This causes differences in transmission rate among mobile stations due to the use of link adaptation schemes. We analyse fairness in the presence of these impairments for the distributed contention based access mechanisms of the IEEE 802.11 and 802.11e standards. The notion of fairness is explored in terms of utility derived from the network (i.e. throughput) and allocated resources (i.e. amount of time permitted to transmit). We show how fairness can be achieved by judicious choice of parameters and study the impact of these choices on capacity. Finally, we demonstrate how these findings could affect other related designs including admission control and charging schemes.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116922476","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":"Report from the field: results from an agricultural wireless sensor network","authors":"R. Beckwith, D. Teibel, P. Bowen","doi":"10.1109/LCN.2004.105","DOIUrl":"https://doi.org/10.1109/LCN.2004.105","url":null,"abstract":"This paper reports the results of a 6-month deployment of a 65-node multi-hop network in a vineyard setting. This deployment specifically looked to discover ways in which a farm setting could find a return on investment for deploying such a network. Our ongoing collaborations of over two years ultimately have included everyone from the vineyard owners to the technology developers. We have been able to find several areas where wireless sensor networks deliver valuable information and provide a return on investment.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114828576","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}
Yan Yu, D. Estrin, Mohammad H. Rahimi, R. Govindan
{"title":"Using more realistic data models to evaluate sensor network data processing algorithms","authors":"Yan Yu, D. Estrin, Mohammad H. Rahimi, R. Govindan","doi":"10.1109/LCN.2004.133","DOIUrl":"https://doi.org/10.1109/LCN.2004.133","url":null,"abstract":"Due to lack of experimental data and sophisticated models derived from such data, most data processing algorithms from the sensor network literature are evaluated with data generated from simple parametric models. Unfortunately, the type of data input used in the evaluation often significantly affects the algorithm performance. Our case studies of a few widely-studied sensor network data processing algorithms demonstrated the need to evaluate algorithms with data across a range of parameters. In conclusion, we propose our synthetic data generation framework.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121725878","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":"Contiki - a lightweight and flexible operating system for tiny networked sensors","authors":"A. Dunkels, B. Grönvall, T. Voigt","doi":"10.1109/LCN.2004.38","DOIUrl":"https://doi.org/10.1109/LCN.2004.38","url":null,"abstract":"Wireless sensor networks are composed of large numbers of tiny networked devices that communicate untethered. For large scale networks, it is important to be able to download code into the network dynamically. We present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs and services. Contiki is built around an event-driven kernel but provides optional preemptive multithreading that can be applied to individual processes. We show that dynamic loading and unloading is feasible in a resource constrained environment, while keeping the base system lightweight and compact.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"750 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115133282","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}