2008 Fourth International Conference on Wireless Communication and Sensor Networks最新文献

筛选
英文 中文
MILD based sliding contention window mechanism for QoS in Wireless LANs 基于MILD的无线局域网QoS的滑动竞争窗口机制
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772691
M. Bharatiya, S. Prasad
{"title":"MILD based sliding contention window mechanism for QoS in Wireless LANs","authors":"M. Bharatiya, S. Prasad","doi":"10.1109/WCSN.2008.4772691","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772691","url":null,"abstract":"Multimedia applications and real time communications like audio, voice, and video over IEEE 802.11 WLANs requires quality of service (QoS). IEEE 802.11 does not have an in-built QoS supported MAC protocol. Existing work provides service differentiation based on contention window separation (CWS) or variation of the waiting time using Inter Frame Space (IFS). In CWS, the higher priority traffic receives a CW that results in a smaller Backoff Interval (BI) whereas lower priority receives a CW that results in longer BI. Nafaa et al. used Sliding Contention Window (SCW) with Linear-Increase Linear-Decrease (LILD) mechanism as the backoff algorithm. LILD does not provide strict service differentiation in case of high network congestion and suffers from fairness problem. In order to ensure firm service differentiation while maintaining maximum bandwidth utilization and provide fairness, this paper proposes a new MAC protocol for WLANs that uses SCW scheme for each network flow with Multiplicative-Increase Linear-Decrease (MILD) mechanism as the backoff algorithm. The simulation results show that SCW with MILD scheme provide strict service differentiation, increased throughput, decreased delay and better fairness in high network population and high congestion.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122739339","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}
引用次数: 9
A system for locating users of WLAN using statistical mapping in indoor and outdoor environment-LOIDS 一个利用统计映射在室内和室外环境中定位无线局域网用户的系统
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772692
K. Naik, M.N. Giri Prasad
{"title":"A system for locating users of WLAN using statistical mapping in indoor and outdoor environment-LOIDS","authors":"K. Naik, M.N. Giri Prasad","doi":"10.1109/WCSN.2008.4772692","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772692","url":null,"abstract":"Recent developments in wireless Local Area Networks made usage of wireless technology efficiently. The availability of portable, light weight, hand held computing devices and high speed wireless local area network enabled users to remain connected while moving in indoor or outdoor environment. Wireless local area network has a wide range of utilization while moving from one location to another location. When a user is moving from one location to another, how the other user knows about the required station inside the WLAN. For that we designed and implemented a system to locate a mobile user inside the wireless local area network with the help of RSSI. We designed four different architectures and used statistical mapping. These architectures are based on statistical or we can say manual configuration of radio maps of indoor and outdoor location with the help of available Sniffer based and cluster based techniques. We were also found a better location of a mobile user in WLAN with the help of Pamvotis WLAN simulator. We tested this work in indoor and outdoor environment with different locations.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123626640","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}
引用次数: 1
Perfect Difference Set - network for Wireless Sensor Networks 无线传感器网络的完美差分集网络
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772682
S. Akojwar, R. Patrikar
{"title":"Perfect Difference Set - network for Wireless Sensor Networks","authors":"S. Akojwar, R. Patrikar","doi":"10.1109/WCSN.2008.4772682","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772682","url":null,"abstract":"In wireless sensor networks (WSN), nodes are randomly deployed. Most of all protocols in WSN are designed for its random deployment. Projective geometry can be used for the fixed-geometrical deployment of wireless sensor nodes. This strategy can be used for deploying nodes in smart houses, hotels, offices, underground mines etc. For environmental monitoring on large geographical area random deployment is used. In random deployment many redundant sensors are used which increases the cost. In fixed geometrical deployment calculated number of nodes with their exact location can be deployed. This reduces the cost and optimization of network can be achieved. The paper proposes the use of perfect difference set (PDS) - networks in the paradigm of WSN. In PDS - network nodes are interconnected to give minimum number of hops during communication. Any node can send data to cluster head node within a hop count of one or two. The lifetime of WSN with 50 nodes is computed for cooperative routing and is compared with PDS-WSN.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122025738","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}
引用次数: 1
Data clustering in sensor networks using ART 基于ART的传感器网络数据聚类
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772681
M. Kumar, S. Verma, P. Singh
{"title":"Data clustering in sensor networks using ART","authors":"M. Kumar, S. Verma, P. Singh","doi":"10.1109/WCSN.2008.4772681","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772681","url":null,"abstract":"Wireless sensor networks may be deployed in an environment the intrinsic pattern of data is unknown and may not be amenable to statistical aggregation techniques. Moreover, the dynamic nature of the environment may generate large amount data which may be highly similar with few data values that may be noisy or may indicate interesting observation. The present work proposes resonance based clustering of data. The technique works in two phases, offline and online phase. Fuzzy ART is employed as initial clustering process which is performed in the pre deployment offline phase to detect natural sets in data. Fuzzy ART does not require knowledge of the nature of data but in the scheme, the a priori knowledge of the type, range and other parameters are utilized to generate synthetic data to be used for clustering .The small number of data clusters eliminates the need to transfer large amounts of data. To cater to the dynamic nature of the environment, Fuzzy ARTMAP neural network (FAMNN) is employed at the cluster heads in the online phase to determine the group to which sensed data arriving after the formation of groups by ART. FAMNN is able to segregate outliers or form new groups whenever required. This obviates the need of ab initio regroupings or does not force data in one of the existing groups. To test the efficacy of the techniques, Fuzzy ART and FAMNN based clustering was performed and tested on synthetic sensor data with different parameters. Simulation results show that Fuzzy ART and FAMNN are able to identify the natural clusters and map new data to existing clusters or form new clusters to drastically reduce the amount of data required to be sent to the sink.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130924682","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
Base station initiated dynamic routing protocol for Heterogeneous Wireless Sensor Network using clustering 基于集群的异构无线传感器网络中基站发起的动态路由协议
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772672
S. Varma, N. Nigam, U. Tiwary
{"title":"Base station initiated dynamic routing protocol for Heterogeneous Wireless Sensor Network using clustering","authors":"S. Varma, N. Nigam, U. Tiwary","doi":"10.1109/WCSN.2008.4772672","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772672","url":null,"abstract":"Wireless sensor networks have received excessive attention in now a days. Research in all field in wireless sensor network (WSN) till now has assumed that sensors in network is homogeneous, means that all the nodes are same, especially for routing protocols that has used clustering like LEACH, LEACHC, and PEGASIS etc. But in the clustering algorithm where some nodes have to work as cluster heads, if they are same as the other nodes, this would lead the lifetime constraint in WSN. Because of this most we shall be considering here the heterogeneous WSN, where the nodes which will work as cluster head will contain more energy, computational and communication power than normal nodes. In this paper we introduce a routing protocol that is based on clustering and uses heterogeneity in nodes to increase the network lifetime.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116653654","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}
引用次数: 32
On converting OSTC scheme from non-full rate to full-rate with better error performance 从非全码转换到全码,具有更好的误码性能
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772716
Ankur Jain, A. Laufer, Y. Bar-Ness
{"title":"On converting OSTC scheme from non-full rate to full-rate with better error performance","authors":"Ankur Jain, A. Laufer, Y. Bar-Ness","doi":"10.1109/WCSN.2008.4772716","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772716","url":null,"abstract":"In the paper, ldquoImproved Transmission Scheme for Orthogonal Space Time Codesrdquo, a new scheme is proposed that uses an iterative Expectation Maximization (EM) algorithm for decoding and provides full rate and full diversity. For full rate, some of the codeword symbols are not transmitted but rather estimated at the receiver using the expectation maximization (EM) algorithm. In this paper, we prove analytically that the EM algorithm converges exponentially and unconditionally to the least squares (LS) estimate and the rate of convergence depends on the channel parameters and not on the initial vector. We also propose a new very low complexity decoding for the aforementioned transmission scheme with identical error performance.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133056234","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}
引用次数: 1
Sweep line algorithm for k-coverage in wireless sensor networks 无线传感器网络k-覆盖的扫描线算法
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772683
R. N. Tripathi, S.V. Rao
{"title":"Sweep line algorithm for k-coverage in wireless sensor networks","authors":"R. N. Tripathi, S.V. Rao","doi":"10.1109/WCSN.2008.4772683","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772683","url":null,"abstract":"Sensing is one of the fundamental functions of wireless sensor networks. Sensor networks are designed to conduct monitoring of physical or environmental conditions, such as temperature, sound, vibration, pressure, motion, or pollutants, at different locations. Some sensor applications require each point in the region to be covered by multiple sensors (k-coverage) to ensure full Quality of service (QoS) requirements. One way of providing k-coverage in the monitored region, with the purpose of maximizing operational life time of the network without sacrificing QoS, can be achieved by putting redundant nodes into sleep mode in order to reduce the energy consumption across the network. In this paper, we have considered the area coverage problem and proposed a node scheduling algorithm to increase the network life time by putting redundant nodes to sleep mode. In our approach, each node applies the sweep line algorithm to decide the redundancy of it using only single hop information. The time complexity of sweep line is in O (n log n), where n is maximum number of single hop sensing neighbors of a node.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480460","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}
引用次数: 1
Security enhancements in GSM cellular standard GSM蜂窝标准的安全性增强
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772693
Musheer Ahmad, Izharuddin
{"title":"Security enhancements in GSM cellular standard","authors":"Musheer Ahmad, Izharuddin","doi":"10.1109/WCSN.2008.4772693","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772693","url":null,"abstract":"GSM is widely used cellular standard in the world. GSM uses A5/x algorithms to secure the information sent over the air interface. A5/1 is a strong encryption algorithm among all A5/x algorithms. However, recent studies show that it has security flaws in its architecture, owing to which it is susceptible to several cryptographic attacks. This paper presents an enhanced scheme of A5/1 algorithm to improve the level of security provided by the GSM. Proposed scheme is analyzed against some cryptographic attacks and it is shown that the scheme provides more security by offering more resistance to correlation attack, algebraic attack and linear approximation attack. Moreover, the linear complexity of the enhanced cipher is quite large and makes the cipher to withstand the Berleykamp-Massey attack. It is also shown that the proposed scheme is little faster with respect to the output rate. Both the designs are coded in VHDL andP synthesized on FPGA device.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125877827","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
Performance analysis of MIMO space diversity technique for wireless communications 无线通信中MIMO空间分集技术性能分析
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772701
V. Sachan, A. Gupta, A. Kumar
{"title":"Performance analysis of MIMO space diversity technique for wireless communications","authors":"V. Sachan, A. Gupta, A. Kumar","doi":"10.1109/WCSN.2008.4772701","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772701","url":null,"abstract":"Space diversity technique is an attractive solution for improving quality in wireless links. The objectives of this paper are to investigate the impact of bit error rate on the number of users and the SNR for space time block coded MIMO Rayleigh fading channels. Diversity is a technique used to combat multipath-fading. Space Diversity is a technique in which multiple numbers of antennas are used at transmitter and receiver side. As far as detection techniques are concerned, we have used two detection techniques (a) joint minimum mean square error (JMMSE) (b) maximal receive ratio combining (MRRC). Furthermore, the usage of higher order diversity schemes not only provides the superior performance over lower order schemes, but also offers an opportunity for the service provider to accommodate more number of users. Simulation results are included.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129705354","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 balanced 1-hop clustering scheme for Mobile Ad Hoc Network 一种移动Ad Hoc网络均衡1跳聚类方案
2008 Fourth International Conference on Wireless Communication and Sensor Networks Pub Date : 2008-12-01 DOI: 10.1109/WCSN.2008.4772680
S. Udgata, T. Mallikarjun
{"title":"A balanced 1-hop clustering scheme for Mobile Ad Hoc Network","authors":"S. Udgata, T. Mallikarjun","doi":"10.1109/WCSN.2008.4772680","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772680","url":null,"abstract":"Mobile Ad hoc Networks (MANETs), without any fixed infrastructures, allow mobile terminals to setup a temporary network for instant communication. Hence, MANETs promise to have many applications including disaster management, emergency relief, mobile conferencing, battle field communication, and so on. Clustering is an important approach in ad hoc networks for achieving scalability, ease of routing, basic performance guarantee such as throughput and delay, in the presence of large number of mobile nodes and high mobility. Connectivity among cluster heads is required for most applications such as message broadcasting, data communication, routing synchronization in distributed computing environment among many others. A number of 1-hop clustering protocols have been proposed, essentially based on the notion of Connected Dominating Set (CDS) for better connectivity. Conventional 1-hop clustering algorithms assume an existing MANET having some nodes and implement their algorithms on that network. Unlike those algorithms, we propose a new 1-hop clustering algorithm which forms the clusters at boot time of each node without any assumption of a MANET existing or already working. Our algorithm focuses on load balanced clusters and minimizing message exchanges in cluster formation. We tested our proposed scheme using ns 2.29 simulator.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121012716","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
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学术官方微信