2009 First International Communication Systems and Networks and Workshops最新文献

筛选
英文 中文
Optimal Power Control - MAC for Wireless Sensor Networks 无线传感器网络的最优功率控制- MAC
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-04-24 DOI: 10.1109/COMSNETS.2009.4840604
M. Ramakrishnan, P. Ranjan
{"title":"Optimal Power Control - MAC for Wireless Sensor Networks","authors":"M. Ramakrishnan, P. Ranjan","doi":"10.1109/COMSNETS.2009.4840604","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4840604","url":null,"abstract":"In this paper, an energy efficient Optimal Power Control Medium Access Control protocol (OPC -MAC) is proposed. The transmission power of every node is dynamically changed for the optimal connectivity between nodes. The optimal transmission power for a link is estimated in this OPC -MAC algorithm by measuring the link quality at the Maximum transmission power. The implementation of the OPC -MAC is done with PIC based wireless sensor nodes and the energy efficiency is compared with the simple CSMA/CA protocol with RTS/CTS control packet. Empirical analysis of the OPC MAC is verified with PIC microcontroller based Wireless Sensor Network testbed. I. OPTIMAL POWER CONTROL MAC This OPC –MAC is an extension of CSMA/CA with RTS/CTS. OPC –MAC includes the adaptive transmission power control without using separate control channel as in PCDC [6]. In a simple CSMA/CA protocol node senses whether the medium is idle or not. If the medium is idle, then it can do the transmission of RTS. After getting this RTS control packet the intended receiver sends the CTS. These RTS/CTS control packet flow is to avoid Hidden and exposed terminal problem which is prevalent in wireless MAC. In OPC –MAC the adaptive transmission power control is included as below. I. Sender node senses the carrier. If it is idle, it sends the RTS at the Maximum power (+13dBm) II. While receiving the RTS, the intended receiver measures the RSSI by which it can measure the range (d) approximately. III. If the RSSI value is more than the RSSI threshold value then the optimal transmission power for the receiver is chosen by using the empirical channel model implemented in the nodes. IV. The power level is increased to an extent to compensate for the indoor attenuation factors V. Then the receiver sends CTS to the sender with the estimated optimal power and this packet contains the power level at which the receiver transmits. VI. Sender also changes its power level and do the data packet transfer at reduced power which depends upon the range between the transmitter and receiver This kind of power control not only alleviates huge power consumption but also the interference problem and facilitates the spatial reuse of the channel. II DETERMINATION OF RSSIthreshold To determine the RSSI threshold, above which the Packet Reception Ratio is close to 100%, an experiment is conducted with a pair of wireless sensor node with an 8 bit microcontroller and Analog Devices ADF7020 – 1 RF Transceiver. This transceiver has a capability to change the transmission power dynamically from -16dBm to +13dBm in 64 steps. RSSI READBACK register in this transceiver facilitates the digital RSSI measurement. The experiment is conducted by keeping the transmission power at maximum value (13dBm) and in the indoor environment where the sensor nodes are going to be deployed. The sender node sends fixed number of packets and the receiver is made to receive these packets at various distances from the sender and the RSSI value i","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601376","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
Empirical evaluation of hybrid opportunistic networks 混合机会主义网络的实证评价
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-03-31 DOI: 10.1109/COMSNETS.2009.4808891
Pan Hui, Anders Lindgren, J. Crowcroft
{"title":"Empirical evaluation of hybrid opportunistic networks","authors":"Pan Hui, Anders Lindgren, J. Crowcroft","doi":"10.1109/COMSNETS.2009.4808891","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808891","url":null,"abstract":"In this paper, we study the utility of opportunistic communication systems with the co-existence of network infrastructure using three real experimental deployments. We study how some important performance metrics change with varying degrees of infrastructure and mobile nodes willing to participate in the opportunistic forwarding. In doing so, we observe phase transitions in the utility of infrastructure and opportunistic forwarding respectively at different points in the design space. We discuss the implications that this has for the design of future network deployments and how this observation can be used to improve network performance, while keeping cost at a minimum. To the best of our knowledge, this is the largest scale of experimental evaluations of hybrid opportunistic networks. It provides empirical evaluations to the large body of theoretical work that has been done in the past and insights for future research.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439777","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}
引用次数: 38
Design of efficient ternary-tree based group key agreement protocol for dynamic groups 基于三树的高效动态组密钥协商协议设计
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808834
S. Tripathi, G. P. Biswas
{"title":"Design of efficient ternary-tree based group key agreement protocol for dynamic groups","authors":"S. Tripathi, G. P. Biswas","doi":"10.1109/COMSNETS.2009.4808834","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808834","url":null,"abstract":"Several groupware applications such as distributed databases, video conferences, distributed computation etc require secure transmission while communicating over open connected networks, and for which numerous group key agreement protocols for static/dynamic groups have been proposed for establishing a secret session key among the group members. This paper proposes ternary tree based new technique to establish a contributory secure group key for dynamic groups, where a ternary tree has at most three children per node. The proposed technique instead of using two-party Diffie-Hellman technique as used in most of the binary tree based group-key generation techniques, uses an existing three party key exchange technique called GDH.2 to establish a shared secret key between the participants. The method provides some advantages over the existing binary tree based technique as it reduces the number of iterations to log3N, where N is the number of participants, covers larger subgroup using broadcast messages than subgroup formed in binary tree based approaches etc. As a result, the total number of broadcast messages and the exponential operations are reduced and it becomes a communication and computation efficient group key agreement protocol. Since proposed technique is projected for dynamic groups, therefore after initialization operation, the method describes and calculates the complexity of major group key management operations like single join, mass join and mass leave. The results obtained are then compared with other efficient group key agreement protocols like CCEGK, EGK, TGDH, STR and it has been seen that proposed method in most of the cases performs well.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120936482","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}
引用次数: 14
An IPTV service model for the multi-world 面向多世界的IPTV业务模型
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808849
Shrikant Kanaparti
{"title":"An IPTV service model for the multi-world","authors":"Shrikant Kanaparti","doi":"10.1109/COMSNETS.2009.4808849","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808849","url":null,"abstract":"Technology trends indicate that in the Internet world, video content gets created, delivered, consumed rather differently compared to the traditional broadcast TV. This necessitates the next gen IPTV systems to incorporate capabilities for addressing the needs of these emerging markets, to satisfy both the service provider and the service consumer effectively. Trends bring out a “multi” factor that is emerging vividly to suit the needs of this new consumer - be it with respect to the multiple service providers depending on the content of choice at a given point of time, or the multiple devices being used for consumption of this content at any given location, or the interaction models with these devices depending on the capabilities, and so on. In this paper we propose a service model to address these various factors.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"1083 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116032900","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
Experiences with WM: A centralised scheduling approach for performance management of IEEE 802.11 wireless LANs WM的经验:用于IEEE 802.11无线局域网性能管理的集中调度方法
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808912
M. Hegde, Pavan Kumar, K. Vasudev, S. Anand, Anurag Kumar, J. Kuri
{"title":"Experiences with WM: A centralised scheduling approach for performance management of IEEE 802.11 wireless LANs","authors":"M. Hegde, Pavan Kumar, K. Vasudev, S. Anand, Anurag Kumar, J. Kuri","doi":"10.1109/COMSNETS.2009.4808912","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808912","url":null,"abstract":"In our earlier work ([1]) we proposed WLAN Manager (orWM) a centralised controller for QoS management of infrastructure WLANs based on the IEEE 802.11 DCF standards. The WM approach is based on queueing and scheduling packets in a device that sits between all traffic flowing between the APs and the wireline LAN, requires no changes to the AP or the STAs, and can be viewed as implementing a “Split-MAC” architecture. The objectives of WM were to manage various TCP performance related issues (such as the throughput “anomaly” when STAs associate with an AP with mixed PHY rates, and upload-download unfairness induced by finite AP buffers), and also to serve as the controller for VoIP admission control and handovers, and for other QoS management measures. In this paper we report our experiences in implementing the proposals in [1]: the insights gained, new control techniques developed, and the effectiveness of the WM approach in managing TCP performance in an infrastructure WLAN. We report results from a hybrid experiment where a physical WM manages actual TCP controlled packet flows between a server and clients, with the WLAN being simulated, and also from a small physical testbed with an actual AP.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114470679","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
Security analysis of the Louis protocol for location privacy 位置隐私Louis协议的安全性分析
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808858
Aakar Gupta, Milan Saini, A. Mathuria
{"title":"Security analysis of the Louis protocol for location privacy","authors":"Aakar Gupta, Milan Saini, A. Mathuria","doi":"10.1109/COMSNETS.2009.4808858","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808858","url":null,"abstract":"Many location-based services for alerting persons of nearby friends have been deployed in practice. A drawback of most approaches to providing such services is that friends always learn each other's location even when they are not actually nearby. The Louis protocol proposed by Zhong, Goldberg and Hengartner aims to ensure that a friend's location is revealed to another friend if and only if the friends are actually nearby. The protocol lets a third party learn whether the friends are nearby, without the third party learning their location. The third party communicates the answer to the person who invokes the service. A key feature of the protocol is that a person can detect misbehavior by the third party or the person's friend. This paper reveals a flaw in the way the protocol handles the detection of the misbehaving party, leading to an unauthorized disclosure of a person's location. Two alternatives for fixing the flaw in the protocol are proposed and a heuristic analysis is given.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680098","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}
引用次数: 4
A quantitative approach towards detection of an optimal attack path in a wireless network using modified PSO technique 基于改进粒子群算法的无线网络最优攻击路径定量检测方法
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808869
Nirnay Ghosh, Saurav Nanda, S. K. Ghosh
{"title":"A quantitative approach towards detection of an optimal attack path in a wireless network using modified PSO technique","authors":"Nirnay Ghosh, Saurav Nanda, S. K. Ghosh","doi":"10.1109/COMSNETS.2009.4808869","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808869","url":null,"abstract":"In recent years there has been an immense proliferation of wireless networks and they are becoming increasingly vulnerable to attacks. Thus there is a serious need to secure such networks from attacks. Usually an attacker can penetrate into a network by utilizing a chain of exploits. An exploit is a small piece of code that makes use of vulnerabilities present in a service or in a system. Each exploit in the chain has a set of preconditions and effects and lays the groundwork for the subsequent exploits. Application of such a chain of exploits generates a set of attack states or network states which form a path called the attack path and combining many such attack paths produces an attack graph. A lot of research has been done on issues such as scalable and time efficient ways of generation of attack graphs in wired network in contrast to that in wireless scenario. Moreover, the need is to identify the path that may be chosen by the attacker to comprise a target system in less time and effort. The proposed methodology in this paper aims as finding out the optimal or risk-prone attack path that the attacker may choose to penetrate a wireless network. The generation of attack paths in a wireless network is itself a difficult proposition due to networks inherent dynamic nature and ever changing topology. In this work, the Particle Swarm Optimization (PSO) technique has been employed for finding out the optimal attack path using an attack vector metric. The effort required on the part of the attacker to compromise a target system has been termed as an attack vector. The wireless nodes have been assigned severity measures obtained from customized risk parameters which serve as an input to the modified PSO technique. A case study has also been presented to demonstrate the efficacy of the proposed methodology.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114325635","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
A DDH-based group key agreement protocol for mobile environment 基于ddh的移动环境组密钥协议
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/comsnets.2009.4808907
Z. zzzz
{"title":"A DDH-based group key agreement protocol for mobile environment","authors":"Z. zzzz","doi":"10.1109/comsnets.2009.4808907","DOIUrl":"https://doi.org/10.1109/comsnets.2009.4808907","url":null,"abstract":"In recent times, the popularity of group oriented applications such as electronic conferences and collaboration works has increased manifold. Thus, secure group communication has become one important research issue for network security. For secure group communication, the first and important step is to design a group key establishment protocol. A group key is a common secret key which can be used to achieve confidentiality and authentication services for different group applications. The focus of the current work is on the design of secure group key agreement protocols suitable for such mobile environment where a node with high computational ability is connected to a number of (mobile) nodes with low computational efficiency. The contribution of this work is to provide a truly contributory group key agreement protocol with dynamic user join and leave facility. The security of the protocol is based on decisional Diffie-Hellman (DDH) assumption.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130152255","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
Handoff mechanism in MPLS enabled wireless network 支持MPLS的无线网络中的切换机制
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808833
C. Pani, I. S. Misra
{"title":"Handoff mechanism in MPLS enabled wireless network","authors":"C. Pani, I. S. Misra","doi":"10.1109/COMSNETS.2009.4808833","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808833","url":null,"abstract":"In this paper, we propose a layered MPLS based mobility solution to support mobility in seamless manner. This scheme uses an enhanced type of MPLS router called label edge mobility agent (LEMA), takes an active part in mobility management. To support fast and dynamic handoff an intelligent multicasting method is discussed that shows good performance in handoff latency and packet loss. The analytical results show a remarkable network performance in terms of reducing location update, handoff delay, packet loss and buffer size. We compare our result with other MIP based protocols like MIPv4 and H-MPLS.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130708648","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
Load balancing inbound traffic in multihomed stub autonomous systems 多宿主存根自治系统入站流量的负载平衡
2009 First International Communication Systems and Networks and Workshops Pub Date : 2009-01-05 DOI: 10.1109/COMSNETS.2009.4808895
A. Sairam, G. Barua
{"title":"Load balancing inbound traffic in multihomed stub autonomous systems","authors":"A. Sairam, G. Barua","doi":"10.1109/COMSNETS.2009.4808895","DOIUrl":"https://doi.org/10.1109/COMSNETS.2009.4808895","url":null,"abstract":"In the Internet, with many competing networks each trying to optimise its own bandwidth, a stub network has limited knowledge about user demands, available network resources and routing policies of other networks. This uncertainty makes the task of interdomain traffic engineering for a stub network very challenging. The basic aim of a stub network connected to multiple ISPs (multihomed) is to load balance its traffic among its various edge links. Our goal in this work is to distribute the incoming traffic of a multihomed stub network among its various edge links. The focus is on networks that primarily download traffic from the Internet. Regulating the incoming traffic is difficult since it will require to influence the behaviour of the remote destinations. We performed a systematic analysis of our problem and showed that even a restricted instance of the problem is NP-complete. We proposed simple, low-cost route control techniques to load balance traffic by reallocating the routes of outgoing traffic. The techniques were validated using synthetic as well as actual data collected under numerous traffic load conditions. Results show that we can achieve significant improvement in load balancing with minimum traffic re-assignments. Moreover, the proposed techniques neither require any third party assistance nor changes to existing protocols and network setup. This makes our schemes easily deployable in real networks.","PeriodicalId":105339,"journal":{"name":"2009 First International Communication Systems and Networks and Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117138271","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}
引用次数: 3
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书