Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626976
K. Wong, A. Dutta
Mobile IP for IPv6 (MIPv6) includes a procedure for route optimization, which allows packets from the correspondent host to go directly to the mobile host. However, the way route optimization is implemented makes it vulnerable to problems with simultaneous mobility, which can occur when two mobile hosts are communicating with each other. In this paper, we suggest ways to change MIPv6 to reduce its vulnerability to the simultaneous mobility problem.
MIPv6 (Mobile IP for IPv6)包含一个路由优化过程，它允许来自相应主机的数据包直接到达移动主机。然而，路由优化的实现方式使其容易受到同时移动的问题的影响，这可能发生在两个移动主机相互通信时。在本文中，我们提出了改变MIPv6的方法，以减少其对同时移动问题的脆弱性。
{"title":"Simultaneous mobility in MIPv6","authors":"K. Wong, A. Dutta","doi":"10.1109/EIT.2005.1626976","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626976","url":null,"abstract":"Mobile IP for IPv6 (MIPv6) includes a procedure for route optimization, which allows packets from the correspondent host to go directly to the mobile host. However, the way route optimization is implemented makes it vulnerable to problems with simultaneous mobility, which can occur when two mobile hosts are communicating with each other. In this paper, we suggest ways to change MIPv6 to reduce its vulnerability to the simultaneous mobility problem.","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124343220","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627012
S. Davu, R. Zaghal, J. Khan
Mobile IP offers disconnection free handoff by assuming availability of infrastructure. It requires intermediate software agents to be deployed in the Internet ahead of time. This infrastructure based mobility scheme though offers connectivity to itinerant hosts but incurs significant handoff and tunneling delays along with deployment costs. In this paper we investigate an alternate mobility scheme which does not require any such infrastructure and uses only end-point technique and interestingly provides much faster loss-free handoff. This end-to-end scheme named Interactive Protocol for Mobile Networks (IPMN) intelligently performs handoff based on information provided by MAC layer. The network address change is handled by renewing the existing connections by manipulating the TCP/IP stack at the end-points. It further uses a novel inter-protocol communication architecture to simplify end-point re engineering. However, it does not require any functional change in the TCP/IP protocol software. Besides, the difference in deployment scenarios, the IPMN offers blazingly fast event based handoff and much faster and simplified transport (no tunneling delay) than MIP. We provide a detail model based performance comparison between the two
{"title":"End-to-end high performance mobility without infrastructure","authors":"S. Davu, R. Zaghal, J. Khan","doi":"10.1109/EIT.2005.1627012","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627012","url":null,"abstract":"Mobile IP offers disconnection free handoff by assuming availability of infrastructure. It requires intermediate software agents to be deployed in the Internet ahead of time. This infrastructure based mobility scheme though offers connectivity to itinerant hosts but incurs significant handoff and tunneling delays along with deployment costs. In this paper we investigate an alternate mobility scheme which does not require any such infrastructure and uses only end-point technique and interestingly provides much faster loss-free handoff. This end-to-end scheme named Interactive Protocol for Mobile Networks (IPMN) intelligently performs handoff based on information provided by MAC layer. The network address change is handled by renewing the existing connections by manipulating the TCP/IP stack at the end-points. It further uses a novel inter-protocol communication architecture to simplify end-point re engineering. However, it does not require any functional change in the TCP/IP protocol software. Besides, the difference in deployment scenarios, the IPMN offers blazingly fast event based handoff and much faster and simplified transport (no tunneling delay) than MIP. We provide a detail model based performance comparison between the two","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122737256","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627028
E. Thompson, E. Harmison, R. Carper, R. Martín, J. Isaacs
This article describes the design and development of a prototype system that allows real time operation of a teleoperated robot over a wireless link using off-the-shelf commercially available wireless network cards. The hardware architecture and the wireless network are described. Performance of the wireless link is evaluated for 802.11b, 802.11g, and MeshNetwork cards. The 802.11g card was found to be unsuitable for the application
{"title":"Teleoperated robot featuring commercially available wireless network cards","authors":"E. Thompson, E. Harmison, R. Carper, R. Martín, J. Isaacs","doi":"10.1109/EIT.2005.1627028","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627028","url":null,"abstract":"This article describes the design and development of a prototype system that allows real time operation of a teleoperated robot over a wireless link using off-the-shelf commercially available wireless network cards. The hardware architecture and the wireless network are described. Performance of the wireless link is evaluated for 802.11b, 802.11g, and MeshNetwork cards. The 802.11g card was found to be unsuitable for the application","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128368820","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627040
R. Sunder, C. Eswaran, N. Sriraam
In this paper, a 3-D discrete Hartley transform coder is proposed to compress 2-D magnetic resonance brain images. The image is segmented into four different sets of subblocks based on the local energy magnitude of the image. Then the subblocks with the same energy are grouped to form a 3-D cuboid. Finally 3-D discrete Hartley transform is applied to the 3-D cuboids and the resulting coefficients are scanned and encoded using Huffman coding. It is found that this technique gives better result compared to the standard JPEG compression method
{"title":"A 3-D discrete Hartley transform coder for compression of magnetic resonance images","authors":"R. Sunder, C. Eswaran, N. Sriraam","doi":"10.1109/EIT.2005.1627040","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627040","url":null,"abstract":"In this paper, a 3-D discrete Hartley transform coder is proposed to compress 2-D magnetic resonance brain images. The image is segmented into four different sets of subblocks based on the local energy magnitude of the image. Then the subblocks with the same energy are grouped to form a 3-D cuboid. Finally 3-D discrete Hartley transform is applied to the 3-D cuboids and the resulting coefficients are scanned and encoded using Huffman coding. It is found that this technique gives better result compared to the standard JPEG compression method","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132993442","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627044
M. Kumar, P. Ramuhalli
Wavelet-based data fusion techniques have been used extensively in several application areas, including quantification of flaw parameters in nondestructive evaluation applications. The use of hybrid systems including the use of wavelets and neural networks for fusion and corrosion characterization is relatively recent. While the hybrid approach usually results in fairly accurate results, the selection of the fusion parameters is manually accomplished and is typically a time-consuming process. This paper proposes a multiresolution data fusion algorithm to improve the performance of corrosion quantification in aircraft lap joints. A maximum likelihood estimation scheme is proposed to fuse data in the wavelet domain. The proposed algorithm reduces the dimensionality of the input and improves the robustness of the network. Initial results indicate that the proposed approach gives similar results to those obtained using manual parameter selection, and indicate the feasibility of the algorithm
{"title":"Maximum likelihood wavelet fusion for aerospace NDE applications","authors":"M. Kumar, P. Ramuhalli","doi":"10.1109/EIT.2005.1627044","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627044","url":null,"abstract":"Wavelet-based data fusion techniques have been used extensively in several application areas, including quantification of flaw parameters in nondestructive evaluation applications. The use of hybrid systems including the use of wavelets and neural networks for fusion and corrosion characterization is relatively recent. While the hybrid approach usually results in fairly accurate results, the selection of the fusion parameters is manually accomplished and is typically a time-consuming process. This paper proposes a multiresolution data fusion algorithm to improve the performance of corrosion quantification in aircraft lap joints. A maximum likelihood estimation scheme is proposed to fuse data in the wavelet domain. The proposed algorithm reduces the dimensionality of the input and improves the robustness of the network. Initial results indicate that the proposed approach gives similar results to those obtained using manual parameter selection, and indicate the feasibility of the algorithm","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131108467","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627043
K. Prasanna
Emerging trend to provide efficient error concealment using data hiding techniques has gained importance in modern communications due to the security offered in addition to its error handling capabilities. This paper proposes a revolutionary approach to error concealment of predictive coded frames (P-and B-Frames) by hiding in to the intra frame within safe capabilities, a derived mathematical function establishing a bitwise(bit index) relationship of the binarized motion compensated predictive frame with the intra frame in the GOP considered. The bitwise relationship is deliberately established in an unconventional manner between the considered frames for the purpose of providing additional error handling capability. The mathematical functions representing the bit index relationship are made to be redundantly present in both the predictive frame as an additional header and in the intra frame as embedded information. This added redundancy is extremely helpful for error free reconstruction of frames at the decoder despite appreciable packet losses, if any present in the communication network.
{"title":"Prasan Bit Position Match Error Concealment Model with Inverse Relationship Between Motion Frames for Efficient MPEG Video Transmission Over Lossy Communication Networks","authors":"K. Prasanna","doi":"10.1109/EIT.2005.1627043","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627043","url":null,"abstract":"Emerging trend to provide efficient error concealment using data hiding techniques has gained importance in modern communications due to the security offered in addition to its error handling capabilities. This paper proposes a revolutionary approach to error concealment of predictive coded frames (P-and B-Frames) by hiding in to the intra frame within safe capabilities, a derived mathematical function establishing a bitwise(bit index) relationship of the binarized motion compensated predictive frame with the intra frame in the GOP considered. The bitwise relationship is deliberately established in an unconventional manner between the considered frames for the purpose of providing additional error handling capability. The mathematical functions representing the bit index relationship are made to be redundantly present in both the predictive frame as an additional header and in the intra frame as embedded information. This added redundancy is extremely helpful for error free reconstruction of frames at the decoder despite appreciable packet losses, if any present in the communication network.","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116379298","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626987
S. Bhatia
The organization of an image database is one of the important issues in efficient storage and retrieval of images. Most of the existing image databases are based on flat structures, with the possibility of an index into the database that can help in narrowing down the images to be searched. In this paper, the author presents a technique to create a hierarchical data structure based on the clustering approach such that a user can select or discard a number of images for subsequent operations. The presented technique is based on application of wavelet analysis to scale the images in hierarchy, and can take advantage of the structure of compressed images in the JPEG 2000 standard
{"title":"Hierarchical clustering for image databases","authors":"S. Bhatia","doi":"10.1109/EIT.2005.1626987","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626987","url":null,"abstract":"The organization of an image database is one of the important issues in efficient storage and retrieval of images. Most of the existing image databases are based on flat structures, with the possibility of an index into the database that can help in narrowing down the images to be searched. In this paper, the author presents a technique to create a hierarchical data structure based on the clustering approach such that a user can select or discard a number of images for subsequent operations. The presented technique is based on application of wavelet analysis to scale the images in hierarchy, and can take advantage of the structure of compressed images in the JPEG 2000 standard","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114793071","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627034
K. Dezhgosha, S. Angara
It is a well-known fact that since the emergence of Internet, Web and e-commerce applications have become increasingly popular. With the growing demand of Web-based applications, a number of issues have also increased proportionately regarding scalability, interoperability and application integration. "Web services", which is a new XML based framework introduced by W3C (World Wide Web consortium) has addressed several of these issues. Web services defines a standard for achieving smooth communication among discrete application systems by using a framework based on the exchange of messages and documents in XML over standard Internet protocols. Because Web services comprises of other additional components (SOAP, WSDL and UDDI) apart from XML, it is widely used in large-scale enterprise applications and often its potential is overlooked in small business applications. Nevertheless, Web services when employed in small-scale applications not only renders interoperability but also improves scalability to a great extent. For example, a simple interface of XML and SOAP that uses a minimal number of APIs in a Web application could become a powerful feature to connect the application to other subsystems, saving on development cost, effort and time, compared to using complex middleware technologies such as CORBA or DCOM. Implementations using middleware technologies mostly require the use of request brokers, whereas in Web services, the usage of service brokers is optional thereby eliminating the necessity to bind any remote interfaces. In addition, Web services implementations are not vendor specific, hence there is no occurrence of vendor-imposed restrictions, whereas distributed system middleware technologies are vendor specific many a time. The only issue involved is which programming software to use for implementation and whether it would provide the maximum number of APIs to enable future upgrades. Also when there is bulk of data to be transmitted back and forth within the application, it is relatively easy and efficient to do so by using XML compared to using numerous request parameters or session attributes. Web services can also be applied in combination with other object oriented frameworks such as MVC (model view controller), to bring out effective results in application performance
{"title":"Web services for designing small-scale Web applications","authors":"K. Dezhgosha, S. Angara","doi":"10.1109/EIT.2005.1627034","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627034","url":null,"abstract":"It is a well-known fact that since the emergence of Internet, Web and e-commerce applications have become increasingly popular. With the growing demand of Web-based applications, a number of issues have also increased proportionately regarding scalability, interoperability and application integration. \"Web services\", which is a new XML based framework introduced by W3C (World Wide Web consortium) has addressed several of these issues. Web services defines a standard for achieving smooth communication among discrete application systems by using a framework based on the exchange of messages and documents in XML over standard Internet protocols. Because Web services comprises of other additional components (SOAP, WSDL and UDDI) apart from XML, it is widely used in large-scale enterprise applications and often its potential is overlooked in small business applications. Nevertheless, Web services when employed in small-scale applications not only renders interoperability but also improves scalability to a great extent. For example, a simple interface of XML and SOAP that uses a minimal number of APIs in a Web application could become a powerful feature to connect the application to other subsystems, saving on development cost, effort and time, compared to using complex middleware technologies such as CORBA or DCOM. Implementations using middleware technologies mostly require the use of request brokers, whereas in Web services, the usage of service brokers is optional thereby eliminating the necessity to bind any remote interfaces. In addition, Web services implementations are not vendor specific, hence there is no occurrence of vendor-imposed restrictions, whereas distributed system middleware technologies are vendor specific many a time. The only issue involved is which programming software to use for implementation and whether it would provide the maximum number of APIs to enable future upgrades. Also when there is bulk of data to be transmitted back and forth within the application, it is relatively easy and efficient to do so by using XML compared to using numerous request parameters or session attributes. Web services can also be applied in combination with other object oriented frameworks such as MVC (model view controller), to bring out effective results in application performance","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116559342","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627025
P. Bhattarakosol, Wijak Srisujjalertwaja
A network-aware application is an application that can adapt itself to the changing network environments. According to the quality of service (QoS) concept, QoS management is executed to deliver service license agreement (SLA) between client and server. By merging of these two concepts, this paper proposes a generic QoS management model as a framework of a wireless Internet system for network-aware applications. An end-to-end QoS management functions on server-level and client-level are provided to maximize overall user's satisfaction and individual user's satisfaction, respectively. A QoS management factor, end-to-end transmission delay, is experimented and analyzed in this case study at application-level to see its implication to the QoS management functions
网络感知应用程序是一种能够适应不断变化的网络环境的应用程序。根据QoS (quality of service)的概念，通过QoS管理在客户端和服务器之间提供服务许可协议(SLA)。通过对这两个概念的融合，本文提出了一种通用的QoS管理模型，作为网络感知应用的无线互联网系统框架。在服务器级和客户级提供端到端的QoS管理功能，分别最大限度地提高整体用户满意度和个人用户满意度。本文在应用层对端到端传输延迟这一QoS管理因素进行了实验和分析，以了解其对QoS管理功能的影响
{"title":"A generic quality of service management model for network-aware applications","authors":"P. Bhattarakosol, Wijak Srisujjalertwaja","doi":"10.1109/EIT.2005.1627025","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627025","url":null,"abstract":"A network-aware application is an application that can adapt itself to the changing network environments. According to the quality of service (QoS) concept, QoS management is executed to deliver service license agreement (SLA) between client and server. By merging of these two concepts, this paper proposes a generic QoS management model as a framework of a wireless Internet system for network-aware applications. An end-to-end QoS management functions on server-level and client-level are provided to maximize overall user's satisfaction and individual user's satisfaction, respectively. A QoS management factor, end-to-end transmission delay, is experimented and analyzed in this case study at application-level to see its implication to the QoS management functions","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127765109","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627013
A. Durresi, M. Durresi, L. Barolli
The use of inter-vehicle communications protocols to increase the safety of highways requires improved quality and reliability of service. In particular, it is important that in case of emergencies, when the inter-vehicle traffic increases exponentially, the message delay should be kept low. We present a reliable hierarchical routing protocol that uses load balancing to keep low message delay even in presence of high level of traffic. Our protocol is based on geographical routing. The protocol is designed for highway travelers but can be used in any mobile ad-hoc network. The highway is divided in virtual cells, which moves as the vehicles moves. The cell members might choose one or more cell-leaders that will behave for a certain time interval as base stations. Every node has its geographical position given by Global Positioning System (GPS). Cell-leaders form a virtual backbone used to forward messages among nodes on different cells. The traffic is distributed among cell-leaders in order to optimize the communication delay. We study the effect of load balancing in minimizing delay. Our simulation results show that our proposed protocol improves the network utilization compared to existing inter-vehicles protocols
{"title":"LIVE: load balanced inter-vehicle routing protocol","authors":"A. Durresi, M. Durresi, L. Barolli","doi":"10.1109/EIT.2005.1627013","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627013","url":null,"abstract":"The use of inter-vehicle communications protocols to increase the safety of highways requires improved quality and reliability of service. In particular, it is important that in case of emergencies, when the inter-vehicle traffic increases exponentially, the message delay should be kept low. We present a reliable hierarchical routing protocol that uses load balancing to keep low message delay even in presence of high level of traffic. Our protocol is based on geographical routing. The protocol is designed for highway travelers but can be used in any mobile ad-hoc network. The highway is divided in virtual cells, which moves as the vehicles moves. The cell members might choose one or more cell-leaders that will behave for a certain time interval as base stations. Every node has its geographical position given by Global Positioning System (GPS). Cell-leaders form a virtual backbone used to forward messages among nodes on different cells. The traffic is distributed among cell-leaders in order to optimize the communication delay. We study the effect of load balancing in minimizing delay. Our simulation results show that our proposed protocol improves the network utilization compared to existing inter-vehicles protocols","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123138019","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
扫码关注我们
求助内容：
应助结果提醒方式：