Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613664
H. Tebbe, A. Kassler
Mobile Ad-hoc networking has been considered as one of the most important and essential technologies that support future Pervasive Computing Scenarios and 4G networks. In a mobile Ad-hoc Network (MANET), support for multicast communication is essential in order to minimize overhead for group communication. For group conferencing services, controlling the end-to-end delay is important to provide high quality communication. In this paper, we present QAMNet, an approach to improve the Quality of Service (QoS) for multicast communication in MANETs. We extend existing approaches of mesh based multicasting by introducing traffic prioritization, distributed resource probing and admission control mechanisms, adaptive rate control of non-real-time traffic based on Medium Access Control (MAC) layer feedback so as to maintain low delay and required throughput for real-time multicast flows. Simulation results show that our approach is as scalable as mesh based deliver structures and does not require significantly more states than normal mesh based multicasting protocols. As we reuse signaling packets of mesh based multicast packets, we do not introduce additional signaling overhead.
{"title":"QAMNet: Providing Quality of Service to Ad-hoc Multicast Enabled Networks","authors":"H. Tebbe, A. Kassler","doi":"10.1109/ISWPC.2006.1613664","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613664","url":null,"abstract":"Mobile Ad-hoc networking has been considered as one of the most important and essential technologies that support future Pervasive Computing Scenarios and 4G networks. In a mobile Ad-hoc Network (MANET), support for multicast communication is essential in order to minimize overhead for group communication. For group conferencing services, controlling the end-to-end delay is important to provide high quality communication. In this paper, we present QAMNet, an approach to improve the Quality of Service (QoS) for multicast communication in MANETs. We extend existing approaches of mesh based multicasting by introducing traffic prioritization, distributed resource probing and admission control mechanisms, adaptive rate control of non-real-time traffic based on Medium Access Control (MAC) layer feedback so as to maintain low delay and required throughput for real-time multicast flows. Simulation results show that our approach is as scalable as mesh based deliver structures and does not require significantly more states than normal mesh based multicasting protocols. As we reuse signaling packets of mesh based multicast packets, we do not introduce additional signaling overhead.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130943355","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613588
R. Chang, Shing-Jiuan Leu
Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency.
{"title":"Long-lived path routing with received signal strength for ad hoc networks","authors":"R. Chang, Shing-Jiuan Leu","doi":"10.1109/ISWPC.2006.1613588","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613588","url":null,"abstract":"Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254304","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613581
Yong Up Lee, Yeoungjun Seo, G. Choi
In this study, the new signal model suitable for ultrawide band (UWB) environments with random angle spread is proposed to estimate the angle-of-arrivals (AOAs) of clusters in a UWB indoor or indoor-to-outdoor wireless communication. The estimation technique based MUSIC algorithm is investigated and the estimates of the AOA and distribution parameter on the received clusters are obtained. The proposed model and estimation technique are verified using computer simulations, and the performance of the estimation error is analyzed.
{"title":"Angle-of-Arrival Estimation for UWB Signals Clustered in Angle","authors":"Yong Up Lee, Yeoungjun Seo, G. Choi","doi":"10.1109/ISWPC.2006.1613581","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613581","url":null,"abstract":"In this study, the new signal model suitable for ultrawide band (UWB) environments with random angle spread is proposed to estimate the angle-of-arrivals (AOAs) of clusters in a UWB indoor or indoor-to-outdoor wireless communication. The estimation technique based MUSIC algorithm is investigated and the estimates of the AOA and distribution parameter on the received clusters are obtained. The proposed model and estimation technique are verified using computer simulations, and the performance of the estimation error is analyzed.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133514143","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613562
S. Poonvasin, N. Pathommanit
We consider an energy-aware packet transmission node that supports packets of two types: real-time packets and non real-time packets. Several energy-aware packet scheduling schemes are explored and discussed. Using the average delay of non real-time packets and the rejection rate of real-time packets as performance metrics, a scheduling scheme for this purpose is proposed. It is composed of two scheduling stages. In the early stage, each packet type is scheduled independently on the per type basis. They are then merged using PGPS into the second stage where the transmission speed for each packet is assigned. The packets are then transmitted using dynamic modulation scaling (DMS). The method has been evaluated using simulation and compared against one in which energy savings schemes are not incorporated. The result shows that not only does it provide a fair share of bandwidth (low rejected packets for real-time packets and low delay for non real-time packets) between these streams, but it also saves the overall transmission energy, particularly in the light load case, where as much as 90% savings can be obtained.
{"title":"Supporting heterogeneous traffic in wireless sensor networks","authors":"S. Poonvasin, N. Pathommanit","doi":"10.1109/ISWPC.2006.1613562","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613562","url":null,"abstract":"We consider an energy-aware packet transmission node that supports packets of two types: real-time packets and non real-time packets. Several energy-aware packet scheduling schemes are explored and discussed. Using the average delay of non real-time packets and the rejection rate of real-time packets as performance metrics, a scheduling scheme for this purpose is proposed. It is composed of two scheduling stages. In the early stage, each packet type is scheduled independently on the per type basis. They are then merged using PGPS into the second stage where the transmission speed for each packet is assigned. The packets are then transmitted using dynamic modulation scaling (DMS). The method has been evaluated using simulation and compared against one in which energy savings schemes are not incorporated. The result shows that not only does it provide a fair share of bandwidth (low rejected packets for real-time packets and low delay for non real-time packets) between these streams, but it also saves the overall transmission energy, particularly in the light load case, where as much as 90% savings can be obtained.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724983","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613641
ByoungSeob Park, CheolSu Lim
In mobile Internet, the host grouping maintenance or the multicast delivery tree for multicasting algorithm becomes a major issues. In this paper, we explore the issues of mobile multicast scheme using mobile-IPv6. Specifically, we address operation scenarios when a mobile host is a source as well as a recipient of a given multicast operation using MLD (multicast listener discovery) scheme, and the proposed MLD-based multicasting protocol, MIP-MLD uses a smooth handoff technique to reduce the service disruption for the multicast session during the handoff. We compared our scheme to existing approaches by cost analysis model, and gained an improved performance in terms of the multicast delivery path.
{"title":"An efficient source mobility-based multicast scheme for mobile hosts in mobile-IPv6 networks","authors":"ByoungSeob Park, CheolSu Lim","doi":"10.1109/ISWPC.2006.1613641","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613641","url":null,"abstract":"In mobile Internet, the host grouping maintenance or the multicast delivery tree for multicasting algorithm becomes a major issues. In this paper, we explore the issues of mobile multicast scheme using mobile-IPv6. Specifically, we address operation scenarios when a mobile host is a source as well as a recipient of a given multicast operation using MLD (multicast listener discovery) scheme, and the proposed MLD-based multicasting protocol, MIP-MLD uses a smooth handoff technique to reduce the service disruption for the multicast session during the handoff. We compared our scheme to existing approaches by cost analysis model, and gained an improved performance in terms of the multicast delivery path.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130178791","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613655
Joon Heo, C. Hong
Generally sensor network and wireless ad hoc network use a symmetric key agreement scheme, although this mechanism has some problems, such as key management, complex network deployment and configuration. This is because the devices of sensor network have limitations such as power, memory, processor speed and implementation cost. The public key algorithms are considered to be too expensive in term of memory and processing requirements. In Low-Rate Wireless Personal Area Network (WPAN), we propose a new key agreement mechanism using the Security Manager (SM) for public key management based on the EC-MQV algorithm. And also, we define two security levels by means of device's power and security policies in the network. We have measured the performance of this mechanism and at the same time meeting the low implementation cost and low power.
{"title":"Efficient and Authenticated Key Agreement Mechanism in Low-Rate WPAN Environment","authors":"Joon Heo, C. Hong","doi":"10.1109/ISWPC.2006.1613655","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613655","url":null,"abstract":"Generally sensor network and wireless ad hoc network use a symmetric key agreement scheme, although this mechanism has some problems, such as key management, complex network deployment and configuration. This is because the devices of sensor network have limitations such as power, memory, processor speed and implementation cost. The public key algorithms are considered to be too expensive in term of memory and processing requirements. In Low-Rate Wireless Personal Area Network (WPAN), we propose a new key agreement mechanism using the Security Manager (SM) for public key management based on the EC-MQV algorithm. And also, we define two security levels by means of device's power and security policies in the network. We have measured the performance of this mechanism and at the same time meeting the low implementation cost and low power.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130619848","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613648
S. K. Ghosh, R. Patro, M. Raina, C. Thejaswi, V. Ganapathy
In this paper we address the issues of forming secure multicast group within wireless sensor networks. We describe a protocol that establishes a secure multicast group, and distributes a group key by mutually authenticating a group of devices over an open insecure wireless channel. We choose a conference keying mechanism and extend it with symmetric authentication protocols and a key hierarchy on which group key could be distributed efficiently. We address two problems in this work. Firstly, the formation of secure groups in sensor network with a low communication complexity, secondly, provides an efficient solution to maintain such multicast group.
{"title":"Secure group communication in wireless sensor networks","authors":"S. K. Ghosh, R. Patro, M. Raina, C. Thejaswi, V. Ganapathy","doi":"10.1109/ISWPC.2006.1613648","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613648","url":null,"abstract":"In this paper we address the issues of forming secure multicast group within wireless sensor networks. We describe a protocol that establishes a secure multicast group, and distributes a group key by mutually authenticating a group of devices over an open insecure wireless channel. We choose a conference keying mechanism and extend it with symmetric authentication protocols and a key hierarchy on which group key could be distributed efficiently. We address two problems in this work. Firstly, the formation of secure groups in sensor network with a low communication complexity, secondly, provides an efficient solution to maintain such multicast group.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415457","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613613
T. Pfeifer
Positioning, as one of the prime components of Con text, has been a driving factor in the development of pervasive computing applications throughout the past two decades. Based on the Redundant Positioning architecture introduced previously, this paper discusses the issues of managing positioning and context data between applications and across different administra tive domains, with a focus on implementing security and privacy concepts, for autonomic devices and com munications.
{"title":"Autonomic Position Management","authors":"T. Pfeifer","doi":"10.1109/ISWPC.2006.1613613","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613613","url":null,"abstract":"Positioning, as one of the prime components of Con text, has been a driving factor in the development of pervasive computing applications throughout the past two decades. Based on the Redundant Positioning architecture introduced previously, this paper discusses the issues of managing positioning and context data between applications and across different administra tive domains, with a focus on implementing security and privacy concepts, for autonomic devices and com munications.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"44 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134231315","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613566
Yih-Fuh Wang, Mao-Jie Huang
A novel Orthogonal Expanded Walsh Code (OEWC) suited in DS-CDMA spreading is presented in this paper. Although some processing gain increased, the OEWC can increase channel anti-interference and transmission security since of its elongated horizontal length. Moreover, it can be applied with MPSK to modulate one of M signal units expressed with a chip of OEWC. This plus the higher security and anti-interference abilities make OEWC of interest to designers of next-generation CDMA systems.
{"title":"New Orthogonal Code with MPSK for Next-Generation CDMA Systems","authors":"Yih-Fuh Wang, Mao-Jie Huang","doi":"10.1109/ISWPC.2006.1613566","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613566","url":null,"abstract":"A novel Orthogonal Expanded Walsh Code (OEWC) suited in DS-CDMA spreading is presented in this paper. Although some processing gain increased, the OEWC can increase channel anti-interference and transmission security since of its elongated horizontal length. Moreover, it can be applied with MPSK to modulate one of M signal units expressed with a chip of OEWC. This plus the higher security and anti-interference abilities make OEWC of interest to designers of next-generation CDMA systems.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957867","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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613560
M. Watfa, S. Commuri
Wireless sensor networks (WSNs) made up of many small sensing devices equipped with memory, processors, and short-range wireless communication provides an unprecedented amount of detailed measurements over wide geographic areas. Communication between nodes requires the expenditure of energy, a scarce commodity in most WSNs. Thus, making effective use of data require scalable, self organizing, and energy-efficient data dissemination algorithms. In this paper, contrary to existing techniques, the coverage problem in a three dimensional space is analyzed. The "coverage hole" problem is also analyzed and a substitute plan is proposed where sensor nodes that are almost out of energy or already dead, are substituted by nodes that covers their sensing region and have more energy supply.
{"title":"A coverage algorithm in 3D wireless sensor networks","authors":"M. Watfa, S. Commuri","doi":"10.1109/ISWPC.2006.1613560","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613560","url":null,"abstract":"Wireless sensor networks (WSNs) made up of many small sensing devices equipped with memory, processors, and short-range wireless communication provides an unprecedented amount of detailed measurements over wide geographic areas. Communication between nodes requires the expenditure of energy, a scarce commodity in most WSNs. Thus, making effective use of data require scalable, self organizing, and energy-efficient data dissemination algorithms. In this paper, contrary to existing techniques, the coverage problem in a three dimensional space is analyzed. The \"coverage hole\" problem is also analyzed and a substitute plan is proposed where sensor nodes that are almost out of energy or already dead, are substituted by nodes that covers their sensing region and have more energy supply.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128564079","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：