2009 Sixth International Conference on Wireless On-Demand Network Systems and Services最新文献

筛选
英文 中文
Evaluation of path dependent scheduling in Ad Hoc networks: A suitable fairness mechanism? Ad Hoc网络中路径依赖调度的评估:一种合适的公平机制?
T. K. Moseng, O. Kure
{"title":"Evaluation of path dependent scheduling in Ad Hoc networks: A suitable fairness mechanism?","authors":"T. K. Moseng, O. Kure","doi":"10.1109/WONS.2009.4801839","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801839","url":null,"abstract":"In this paper we investigate whether scheduling packets based on path information can improve the fairness in an ad hoc network. The users may have a need for a predictable service over time and common to the whole ad hoc network. However, the performance depends on the path between sender and receiver, and it will therefore vary over time. Two schemes are analyzed; the first scheme differentiates local traffic from transfer traffic, while the second scheme differentiates packets on their last hop to the destination from other packets. Fairness will come at a price, and there will always have to be a trade-off between the degree of equal service and the utilization or effectiveness of the ad-hoc network. In simulations we illustrate the trade-off between fairness and total goodput. The simulations are done for a simple topology to illustrate the trade-offs, and for a full QoS architecture with mobility and random topologies.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133182598","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}
引用次数: 0
Using co-presence communities to enhance social recommendation 使用共存社区来增强社交推荐
L. Tokarchuk, K. Shoop, A. ma
{"title":"Using co-presence communities to enhance social recommendation","authors":"L. Tokarchuk, K. Shoop, A. ma","doi":"10.1109/WONS.2009.4801863","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801863","url":null,"abstract":"This paper proposes a social recommendation algorithm for use in a research social network environment. The social recommendation algorithm proposed combines the concepts of a relationship ontology and item-based collaborative filtering (CF). While the network setup in social networking sites can accurately reflect the social landscape of its users, it is much harder to detect the importance or strength of any one link. We therefore propose an extension to our recommendation algorithm which makes use of the idea of co-presence communities to increase the relevance of the recommendations. A co-presence community can be detected from with data collected from Bluetooth-enabled mobiles. Detection of a co-presence community can help determine the nature and importance of the social links between participating members","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123854200","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}
引用次数: 2
A simulation based performance comparison study of stability-based routing, power-aware routing and load-balancing on-demand routing protocols for mobile ad hoc networks 基于仿真的移动自组织网络稳定路由、功率感知路由和负载均衡按需路由协议性能比较研究
N. Meghanathan, Leslie C. Milton
{"title":"A simulation based performance comparison study of stability-based routing, power-aware routing and load-balancing on-demand routing protocols for mobile ad hoc networks","authors":"N. Meghanathan, Leslie C. Milton","doi":"10.1109/WONS.2009.4801841","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801841","url":null,"abstract":"The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of on-demand routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), Min-Max Battery Cost Routing (MMBCR) and the traffic interference based Load Balancing Routing (LBR) protocol as representatives of the stability-based routing, power-aware routing and load-balancing routing protocols respectively. FORP incurs the least number of route transitions; while LBR incurs the smallest hop count and lowest end-to-end delay per data packet. Energy consumed per data packet is the least for LBR, closely followed by MMBCR. FORP incurs the maximum energy consumed per data packet, both in the absence and presence of power control. Nevertheless, in the presence of power control, the end-to-end delay per data packet and energy consumed per data packet incurred by FORP are significantly reduced compared to the scenario without power control. MMBCR is the most fair in terms of node usage and incurs the largest time for first node failure. FORP tends to repeatedly use nodes lying on the stable path and hence is the most unfair of the three routing protocols. FORP also incurs the smallest value for the time of first node failure.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"76 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128777920","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}
引用次数: 7
Improving preamble sampling performance in wireless sensor networks with state information 利用状态信息改进无线传感器网络的前导采样性能
E. R. Sanchez, Claude Chaudet, M. Rebaudengo
{"title":"Improving preamble sampling performance in wireless sensor networks with state information","authors":"E. R. Sanchez, Claude Chaudet, M. Rebaudengo","doi":"10.1109/WONS.2009.4801849","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801849","url":null,"abstract":"Wireless sensor networks (WSN) are characterized by stringent power constraints. Researchers focus on improving their power efficiency in order to allow building up networks that survive for long periods of time on limited battery resources without any human intervention. Improvements have been proposed for every hardware and software component, including every networking layer of the sensor nodes. Concerning the MAC layer, different strategies have been proposed, among which preamble sampling is promising. This technique limits the energy spent by nodes that are not recipients of a frame, and transfer a part of this cost to the transmitter. However, the basic technique leaves room for enhancements. We show that such optimization is possible by adapting the duty cycles of the nodes taking into consideration their depth in the routing tree. We experimentally demonstrate that a significant reduction in energy consumption may be obtained when using different preamble lengths throughout the network. Our results show that, with such inter-layer cooperation, the energy efficiency of nodes closer to the sink can be improved by up to 50%.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"7 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995803","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}
引用次数: 5
Non-interactive localization of cognitive radios based on dynamic signal strength mapping 基于动态信号强度映射的认知无线电非交互定位
Song Liu, Yingying Chen, W. Trappe, L. Greenstein
{"title":"Non-interactive localization of cognitive radios based on dynamic signal strength mapping","authors":"Song Liu, Yingying Chen, W. Trappe, L. Greenstein","doi":"10.1109/WONS.2009.4801847","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801847","url":null,"abstract":"The openness of the lower-layer protocol stacks in cognitive radios increases the flexibility of dynamic spectrum access and promotes spectrally-efficient communications. To ensure the effectiveness of spectrum sharing, it is desirable to locate primary users, secondary users, and unauthorized users in a non-interactive fashion based on limited measurement data at receivers. In this work, we present two range-free localization algorithms based on dynamic mapping of received signal strength (RSS) to perform non-interactive localization that does not require the cooperation from the cognitive device to be located. A fine-grained signal strength map across the surveillance area is constructed dynamically through interpolation. By making use of this signal map, the proposed schemes can achieve higher accuracy of location estimation than existing non-interactive and RSS based methods in most channel variation conditions. Both our simulation results as well as testbed evaluations have demonstrated the feasibility of the proposed algorithms.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386348","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}
引用次数: 28
SESAM: A semi-synchronous, energy savvy, application-aware MAC SESAM:半同步、节能、应用感知的MAC
R. Cigno, Matteo Nardelli, M. Welzl
{"title":"SESAM: A semi-synchronous, energy savvy, application-aware MAC","authors":"R. Cigno, Matteo Nardelli, M. Welzl","doi":"10.1109/WONS.2009.4801848","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801848","url":null,"abstract":"In spite of the huge recent research effort in the field, energy efficiency remains one of the key issues in wireless communications. The area most affected by energy inefficiency is Wireless Sensor Networks (WSN). In this paper we propose SESAM - a distributed MAC protocol, which, making use of application level information to predict future transmission instants between nodes, achieves an exceptional level of energy conservation.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348963","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}
引用次数: 5
Joint interest- and locality-aware content dissemination in social networks 社交网络中共同兴趣和地域感知的内容传播
E. Jaho, I. Stavrakakis
{"title":"Joint interest- and locality-aware content dissemination in social networks","authors":"E. Jaho, I. Stavrakakis","doi":"10.1109/WONS.2009.4801864","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801864","url":null,"abstract":"Social groups are typically formed by nodes that share common interests (interest-induced social groups), with no implication on the geographic location of these nodes. In addition to such groups, mobile nodes form groups also as they move around and come to a locality where they can establish communication with other nodes (locality-induced social groups). This paper investigates the intermingling of these distinct types of social groups and proposes an approach that can enhance content dissemination in the presence of such groups. Specifically, we introduce a framework for modelling this environment (both, the nodes' dynamic association to such groups and the dynamic usability of the content) and explore the conditions under which a proposed cooperative strategy can enhance the content dissemination process compared to a selfish one. This work basically explores how mobility and cooperative content storage strategies can help bridge interest-induced social groups, or how the joint association of nodes with interest- and locality-induced social groups can be exploited to enhance content dissemination.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"C-21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126780345","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}
引用次数: 46
Study of randomly replicated random walks for information dissemination over various network topologies 不同网络拓扑结构下信息传播的随机复制随机行走研究
Dimitris Kogias, K. Oikonomou, I. Stavrakakis
{"title":"Study of randomly replicated random walks for information dissemination over various network topologies","authors":"Dimitris Kogias, K. Oikonomou, I. Stavrakakis","doi":"10.1109/WONS.2009.4801834","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801834","url":null,"abstract":"Flooding is well known to be the “fastest” way to propagate information throughout a network (achieve 100% coverage), at the expense of typically unacceptably large message-forwarding overhead; when the overhead is controlled or limited, then the achieved coverage is reduced. A Single Random Walker (SRW) is another popular mechanism for information dissemination that is very “slow” compared to flooding but utilizes less overhead and can potentially achieve better coverage than flooding. The latter may be attributed to the better “stretching” properties (ability to visit further away network regions) of the SRW and is particularly observed if coverage is defined as the set of network nodes which are at most L hops away from a network node which received the information (notion of L-coverage, L ≥ 0). Randomly Replicated Random Walkers (RRRWs) are considered in this paper as a broad class of information dissemination mechanisms whose members are defined by a given value of the (first) replication probability; clearly a SWR corresponds to the RRRWs with zero (first) replication probability, while for values of the (first) replication probability close to one a large number of information disseminating agents (RWs) are generated resembling the operation of flooding. By considering various performance metrics (such as the achieved coverage for a given message-forwarding budget and the time required to spend the available message-forwarding budget), and by considering various network topologies (such as Random Geometric, Erdös- Rényi and Clustered environments), we show that the class of RRRWs can “fill” the performance space, between the performance induced by flooding and the SRW, thus offering a richer set of information dissemination strategies that can better match desirable performance constraints or objectives.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134276921","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}
引用次数: 8
An application layer architecture for seamless roaming 实现无缝漫游的应用层架构
Adrian Popescu, D. Ilie, D. Erman, M. Fiedler, Alexandru Popescu, Karel de Vogeleer
{"title":"An application layer architecture for seamless roaming","authors":"Adrian Popescu, D. Ilie, D. Erman, M. Fiedler, Alexandru Popescu, Karel de Vogeleer","doi":"10.1109/WONS.2009.4801840","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801840","url":null,"abstract":"The paper advances a new architecture for seamless roaming, which is implemented at the application layer. This architecture is subject for the research projects PERIMETER and MOBICOME, recently granted by the EU STREP FP7 and EUREKA, respectively. The research challenges are on mobility management, security, QoE management, overlay routing, node positioning, mobility modeling and prediction, middleware and handover. The foundation of seamless handover is provided by several components, the most important ones being the handover, mobility management, connectivity management and Internet mobility. The paper provides an analysis of these components as well.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132563667","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}
引用次数: 6
Findings from an empirical study of fine-grained human social contacts 一项细粒度人类社会接触的实证研究发现
Yi Wang, B. Krishnamachari, T. Valente
{"title":"Findings from an empirical study of fine-grained human social contacts","authors":"Yi Wang, B. Krishnamachari, T. Valente","doi":"10.1109/WONS.2009.4801861","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801861","url":null,"abstract":"An interaction based human contact study experiment has been conducted on 25 undergraduate students at USC, each carrying a wireless device (Tmote) for a week duration. Each mote transmits contact packets every 0.1 second to advertise its presence and a node receiving the packets will record the contact information. Data is processed off-line and a contact graph has been generated based on the strength of pairwise contact in order to visualize the grouping effect. All groups are identified and it has been found out that although most groups have small sizes and infrequent meetings, there exist large groups that have encountered several times in one week duration. The inter-contact and contact time distributions are found to be similar to findings from previous studies done in different settings. The inter-group contact time and group contact time distributions are also found to be power law and exponential in different time scales. Moreover, the contact arrival process is found to be self similar for data from both our experiment and the Haggle project [4].","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117062525","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}
引用次数: 16
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信