M. Akbaş, Matthias R. Brust, C. Ribeiro, D. Turgut
{"title":"Deployment and mobility for animal social life monitoring based on preferential attachment","authors":"M. Akbaş, Matthias R. Brust, C. Ribeiro, D. Turgut","doi":"10.1109/LCN.2011.6115510","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115510","url":null,"abstract":"The effort and time spent in wild life monitoring increases with the area and the number of objects to observe. Deployment of wireless sensor nodes enables a scalable sampling method and fine granularity of data collection. When we include resource rich actor nodes the data collection and evaluation are further optimized. However realistic mobility data is missing for various animal species to develop prototypes of wireless network based monitoring systems. In this paper, the problem of the absence of realistic data is considered from a social network perspective. Node deployment and mobility algorithms are provided to model a complete system of an animal swarm to be used for animal social life monitoring. A novel spatial cut-off preferential attachment model and center of mass concept are used and extended for the models according to the characteristics of the animal swarms. In the application scenario of a gorilla swarm, each gorilla is equipped with a sensor node for the monitoring of the social system. The local interaction patterns among the mobile nodes are also monitored throughout the network life time to observe the social interactions among animals and to determine the role of each animal in the society. The performance of the monitoring protocol and the applicability of the deployment and mobility models are presented through extensive simulations.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117229777","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}
Immanuel Schweizer, Nils Fleischhacker, M. Mühlhäuser, T. Strufe
{"title":"SDF — Solar-aware distributed flow in wireless sensor networks","authors":"Immanuel Schweizer, Nils Fleischhacker, M. Mühlhäuser, T. Strufe","doi":"10.1109/LCN.2011.6115320","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115320","url":null,"abstract":"Energy is the most limiting factor in wireless sensor networks. Harvesting solar energy is a feasible solution to overcome the energy-constraint in some applications. It enables a theoretically infinite network lifetime, sustaining a mode of operation termed energy neutral consumption rate. The challenge arises, how can the harvested energy be utilized to maximize the performance of the sensor network. Considering a field monitoring application the performance is measured as the sustained sampling rate of the sensors. Maximizing the sampling rate needs to take the spatio-temporal distribution of load and energy into account, to prevent the overloading of nodes. In [12] they introduced a optimal, theoretical solution based on perfect global knowledge. In this paper we propose the solar-aware distributed flow (SDF) approach. SDF enables each node to predict the harvested energy, calculate a sustainable flow and control its local neighborhood. Extensive simulations confirmed that SDF achieves over 80% of the theoretical optimum, while introducing negligible overhead.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124491149","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}
M. Keller, M. Woehrle, R. Lim, J. Beutel, L. Thiele
{"title":"Comparative performance analysis of the PermaDozer protocol in diverse deployments","authors":"M. Keller, M. Woehrle, R. Lim, J. Beutel, L. Thiele","doi":"10.1109/LCN.2011.6115578","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115578","url":null,"abstract":"In this paper, we present a performance analysis of the communication stack of the PermaDozer application. Our offline analysis is based on long-term performance data from three diverse real-world wireless sensor network deployments. Two of the deployments considered are located in the Swiss mountains at 3.500 meters a.s.l., the third deployment is located along a river in the Swiss midlands. Apart from climatic differences, the three deployments also vary in network size, network density, node placement, and type and quantity of RF interference. From September 2008 to May 2011 more than 99.6 million WSN packets have been collected serving as the dataset. All three deployments are based on the same software and hardware. This allows us to comparatively study the performance of the PermaDozer protocol under different deployment settings and environmental conditions. For the period between June 2010 and May 2011, our networks achieved a data yield of ≥ 99.5%. But, we can also clearly notice that achieving this performance requires varying effort in terms of radio duty cycle resulting in different power consumption and network lifetime.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578409","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":"APAWSAN: Actor positioning for aerial wireless sensor and actor networks","authors":"M. Akbaş, D. Turgut","doi":"10.1109/LCN.2011.6115518","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115518","url":null,"abstract":"The node mobility is a natural element of many wireless sensor and actor network (WSAN) applications. Recent advances in the development of small unmanned aerial vehicles (UAVs) with built in sensors made it possible to deploy aerial sensor and actor networks. An aerial network composed of small UAVs enables high quality observation for events while reducing the number of personnel and the risk for the operators. In order to have an effective data collection, the positioning of actors plays a critical role in aerial WSANs. In this paper we propose an actor positioning strategy for aerial WSANs considering the scenario of toxic plume observation after a volcanic eruption, which is one of the emerging applications of aerial UAV networks. Measuring the composition of volcanic plumes allows the computation of volcanogenic fluxes and provides insights into volatile degassing mechanisms. The actors in the proposed approach use a lightweight and distributed algorithm to form a self organizing network around the central UAV, which has the role of the sink in the WSAN. Our algorithm makes use of the Valence Shell Electron Pair (VSEPR) theory of chemistry, which is based on the correlation between molecular geometry and the number of atoms in a molecule. The performance of the proposed practical positioning algorithm is presented through extensive simulations.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123267778","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 study of topology formation in 802.11s multiradio wireless mesh networks","authors":"Jean-Charles Grégoire, C. Roy, Z. Dziong","doi":"10.1109/LCN.2011.6115568","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115568","url":null,"abstract":"Wireless mesh networks (WMN) are efficient and low cost solutions for the deployment of broadband access in various environments. To support real-time applications such as multimedia and emergency services, WMNs must provide quality of service (QoS) guarantees and QoS continuity protection. While the capacity of single radio WMNs may severely limit the QoS for such traffic, multiradio WMNs can overcome this restriction and provide additional links to support better QoS mechanisms. This paper describes two self-configuration mechanisms to establish mesh topologies in IEEE 802.11s multiradio WMNs: a distributed mechanism based on the portal announcement protocol specified in the IEEE 802.11s standard to determine the initial channel assignment of the mesh points forming a backhaul network and a centralized mechanism to optimize the topology initially created once the network is stable. We also study the performance of topology formation in IEEE 802.11s multiradio WMNs and identify the various factors affecting delays in the creation and modification of topologies.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123071081","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":"Practical machine learning based multimedia traffic classification for distributed QoS management","authors":"S. Zander, G. Armitage","doi":"10.1109/LCN.2011.6115322","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115322","url":null,"abstract":"A multi-service Internet requires routers to recognise and prioritise IP flows carrying interactive or multimedia traffic. It is increasingly problematic for legal or administrative reasons to recognise such flows using unique port numbers or deep packet inspection. New work in recent years shows that Machine Learning (ML) techniques can use externally observable statistical characteristics to usefully differentiate such IP traffic. However, most previous work has not addressed the practicality of ML-based traffic classification in terms of CPU and memory usage. Here we describe our design, implementation and performance evaluation of a distributed, ML-based traffic classification and control system for FreeBSD's IP Firewall (IPFW). On an Intel Core i7 2.8 GHz PC our system can classify up to 400 000 packets per second using only one core and our system scales well to up to 100 000 simultaneous flows. Also our implementation allows one classifier PC to control subsequent traffic shaping or blocking at multiple (potentially lower performance) routers or gateways distributed around the network.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126894462","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 performance study of network operator-friendly P2P traffic control technique","authors":"HyunYong Lee, A. Nakao","doi":"10.1109/LCN.2011.6115310","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115310","url":null,"abstract":"In the network operator-friendly P2P traffic control technique such as P4P, peers are supposed to select their communication partners by following a guidance issued by the network operator. Thus, the guidance has significant impact on the traffic control. However, detailed performance study of available guidances is missing. Most existing work does not show how they affect intra-domain traffic control in detail while mostly focusing on inter-domain traffic control. In this paper, we try to understand how the guidances affect the intra and inter-domain traffic control for better guidance improving the traffic control. Through simulations, we reveal followings. The performance-based guidance reflecting the networking status shows attractive results in distributing the traffic over intra-domain links and in reducing the cross-domain traffic and the charging volume of inter-domain link compared to the distance-based guidance enforcing simple localization. However, the performance-based guidance shows one limitation that can cause unstable traffic control. To overcome the identified limitation, we propose peer-assisted measurement and traffic estimation approach. Then, we verify our approach through simulations.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125327287","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 teletraffic-based power saving scheme for cellular networks with microcells","authors":"Z. Abbas, F. Li","doi":"10.1109/LCN.2011.6115535","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115535","url":null,"abstract":"As the number of network components increases to meet the explosion of mobile devices, power conservation has become an important strategy for network operators. In this paper, we propose a novel teletraffic-based approach to save power consumption of a three-cell microcellular network. When the traffic load in the middle cell is lower than certain threshold, the cell can be switched-off and its users will be covered by increasing the transmission power of one sector antenna in each of the two neighboring cells. Numerical results demonstrate that at a moderate cost of increased antenna transmission power of the two sectors, significant amount of network power can be saved for the whole network.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116973023","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":"Formal validation of the security properties of AMT's three-way handshake","authors":"Ali Salem, J. W. Atwood","doi":"10.1109/LCN.2011.6115195","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115195","url":null,"abstract":"AMT (Automatic IP Multicast without explicit Tunnels) is a specification that has been developed by the Internet Engineering Task Force to address the lack of multicast communication among isolated multicast-enabled sites or hosts, attached to a network with no local multicast support. AMT is designed to provide a mechanism for a migration path to a fully multicast-enabled backbone in the future. As part of a larger project using AMT to extend the reach of multicast sessions, we have performed formal validation of the three-way handshake process between an AMT gateway and its coupled AMT relay by modeling it using the AVISPA tools (Automated Validation of Internet Security Protocols and Applications). We have identified two security problems where an intruder can impersonate an AMT Relay or an AMT Gateway. Furthermore, an intruder can make use of this impersonation to disconnect valid sessions of other legitimate participants.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130710418","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":"Analysis of packet loss for batch traffic arrivals in IEEE 802.15.4-based networks","authors":"M. S. Haghighi, K. Mohamedpour, V. Varadharajan","doi":"10.1109/LCN.2011.6115166","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115166","url":null,"abstract":"Instances of batch traffic can be seen in many applications. A set of sensors around the source of a sudden event which try to report it to the cluster head, and energy conserving MAC protocols in hierarchical networks with sleep-awake schedules which lead to burst traffics toward a single destination are good examples. The transient non-stationary nature of network reaction to batch arrivals has led to the development of complex models in order to estimate the network quantities of interest. In this paper, we propose a non-stationary Markov model to capture the transient characteristics of IEEE 802.15.4-based networks response to batch traffic arrivals of one-shot type. Mainly, the slotted CSMA/CA MAC protocol of the IEEE 802.15.4 standard is analyzed and the packet loss metric value is extracted from the proposed model. Extensive simulations were conducted to evaluate the accuracy of the proposed model and to compare its performance with that of the previous models.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"32 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120819571","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}