D. Newell, Philip Davies, Ron Austin, P. Moore, Mak Sharma
System requirements for an intelligent, mobile blended learning environment (m-Learning) have been elicited. Theories of ontology modelling are developed. A context-aware adaption engine using explicit and implicit knowledge of the student profile model are proposed. The context in which learning occurs is shown to be represented by a set of functions that are contextually dependent on learning modelled as a multi connected ontology. The evaluated prototype implementation is a partially context aware m-Learning presentation system. It is concluded that the m-learning environment is beneficial to programme outcomes, mainly for students who learn according to the heutagogical model. Further work is underway to capture m-Learning requirements better suited to students employing the pedagogic learning model.
{"title":"Models for an Intelligent Context-Aware Blended m-Learning System","authors":"D. Newell, Philip Davies, Ron Austin, P. Moore, Mak Sharma","doi":"10.1109/WAINA.2015.25","DOIUrl":"https://doi.org/10.1109/WAINA.2015.25","url":null,"abstract":"System requirements for an intelligent, mobile blended learning environment (m-Learning) have been elicited. Theories of ontology modelling are developed. A context-aware adaption engine using explicit and implicit knowledge of the student profile model are proposed. The context in which learning occurs is shown to be represented by a set of functions that are contextually dependent on learning modelled as a multi connected ontology. The evaluated prototype implementation is a partially context aware m-Learning presentation system. It is concluded that the m-learning environment is beneficial to programme outcomes, mainly for students who learn according to the heutagogical model. Further work is underway to capture m-Learning requirements better suited to students employing the pedagogic learning model.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"45 1","pages":"405-410"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82570992","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}
Recently wireless sensor networks have been used as the technology that is actively grafted onto industries and daily living. Sensors should have built-in routing functions and basic sensing functions for the self-configuration of topologies. The number of sensors necessary for using them in an actual observation ranges from tens to hundreds or thousands. When theses sensors are wrongly placed in an observation region, they can quickly run out of batteries or be disconnected. These incidents may result in huge losses in terms of sensing data from numerous sensors and their costs. Therefore a number of simulators have been developed as tools for effective design and verification before the actual arrangement of sensors. While a number of simulators have been developed, simulation results can be fairly limited and the execution speed can be markedly slow depending on the function of each simulator. To improve the performance of existing simulators, this paper aimed to develop a parallel processing simulator for separate sensor (P2S3) that enables users to selectively use the GPU mode. It enables parallel and independent operations by matching GPU with many cores in order to resolve the slowdown of the execution speed when numerous sensor nodes are used for simulations. Also, P2S3 include the analyzed of sensor nodes with log data and visualization. The P2S3 supports the GPU mode in an environment that allows the operation of compute unified device architecture (CUDA), and performs the parallel simulation processing of multiple sensors using the mode within a short period of time.
{"title":"Parallel Processing Simulator for Separate Sensor of WSN Simulator with GPU","authors":"Hyun-Woo Kim, Eun-Ha Song, J. Park, Y. Jeong","doi":"10.1109/AINA.2015.193","DOIUrl":"https://doi.org/10.1109/AINA.2015.193","url":null,"abstract":"Recently wireless sensor networks have been used as the technology that is actively grafted onto industries and daily living. Sensors should have built-in routing functions and basic sensing functions for the self-configuration of topologies. The number of sensors necessary for using them in an actual observation ranges from tens to hundreds or thousands. When theses sensors are wrongly placed in an observation region, they can quickly run out of batteries or be disconnected. These incidents may result in huge losses in terms of sensing data from numerous sensors and their costs. Therefore a number of simulators have been developed as tools for effective design and verification before the actual arrangement of sensors. While a number of simulators have been developed, simulation results can be fairly limited and the execution speed can be markedly slow depending on the function of each simulator. To improve the performance of existing simulators, this paper aimed to develop a parallel processing simulator for separate sensor (P2S3) that enables users to selectively use the GPU mode. It enables parallel and independent operations by matching GPU with many cores in order to resolve the slowdown of the execution speed when numerous sensor nodes are used for simulations. Also, P2S3 include the analyzed of sensor nodes with log data and visualization. The P2S3 supports the GPU mode in an environment that allows the operation of compute unified device architecture (CUDA), and performs the parallel simulation processing of multiple sensors using the mode within a short period of time.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"3 1","pages":"255-262"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73062620","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}
This paper proposes an auto configuration scheme for DNS names of home network devices. By this scheme, the DNS name of a home network device can be auto configured with the devices category and model in a home network. This DNS name lets home residents easily identify each device for monitoring and remote-controlling it in a home network.
{"title":"DNS Name Autoconfiguration for IoT Home Devices","authors":"Sejun Lee, J. Jeong, Jungsoo Park","doi":"10.1109/WAINA.2015.104","DOIUrl":"https://doi.org/10.1109/WAINA.2015.104","url":null,"abstract":"This paper proposes an auto configuration scheme for DNS names of home network devices. By this scheme, the DNS name of a home network device can be auto configured with the devices category and model in a home network. This DNS name lets home residents easily identify each device for monitoring and remote-controlling it in a home network.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"36 1","pages":"131-134"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75769144","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}
Mahdieh Ahmadi, Mohammed Gharib, F. Ghassemi, A. Movaghar
Public key management scheme in mobile ad hoc networks (MANETs) is an inevitable solution to achieve different security services such as integrity, confidentiality, authentication and non reputation. Probabilistic asymmetric key pre-distribution (PAKP) is a self-organized and fully distributed approach. It resolves most of MANET's challenging concerns such as storage constraint, limited physical security and dynamic topology. In such a model, secure path between two nodes is composed of one or more random successive direct secure links where intermediate nodes can read, drop or modify packets. This way, intelligent selection of intermediate nodes on a secure path is vital to ensure security and lower traffic volume. In this paper, subjective logic is used to improve PAKP method with the aim to select the most trusted and robust path. Consequently, our approach results in a better data traffic and also improve the security. Proposed algorithm chooses the least number of nodes among the most trustworthy nodes which are able to act as intermediate stations. We exploit two subjective logic based models: one exploits the subjective nature of trust between nodes and the other considers path conditions. We then evaluate our approach using network simulator ns-3. Simulation results confirm the effectiveness and superiority of the proposed protocol compared to the basic PAKP scheme.
{"title":"Probabilistic Key Pre-Distribution for Heterogeneous Mobile Ad Hoc Networks Using Subjective Logic","authors":"Mahdieh Ahmadi, Mohammed Gharib, F. Ghassemi, A. Movaghar","doi":"10.1109/AINA.2015.184","DOIUrl":"https://doi.org/10.1109/AINA.2015.184","url":null,"abstract":"Public key management scheme in mobile ad hoc networks (MANETs) is an inevitable solution to achieve different security services such as integrity, confidentiality, authentication and non reputation. Probabilistic asymmetric key pre-distribution (PAKP) is a self-organized and fully distributed approach. It resolves most of MANET's challenging concerns such as storage constraint, limited physical security and dynamic topology. In such a model, secure path between two nodes is composed of one or more random successive direct secure links where intermediate nodes can read, drop or modify packets. This way, intelligent selection of intermediate nodes on a secure path is vital to ensure security and lower traffic volume. In this paper, subjective logic is used to improve PAKP method with the aim to select the most trusted and robust path. Consequently, our approach results in a better data traffic and also improve the security. Proposed algorithm chooses the least number of nodes among the most trustworthy nodes which are able to act as intermediate stations. We exploit two subjective logic based models: one exploits the subjective nature of trust between nodes and the other considers path conditions. We then evaluate our approach using network simulator ns-3. Simulation results confirm the effectiveness and superiority of the proposed protocol compared to the basic PAKP scheme.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"27 1","pages":"185-192"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74551181","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}
Computer graphics application becomes more and more attractive recently as the popularization of the smart phone and computer tablet. It is interested us what we can do through network for making 3DCG models. We have designed and developed an interactive 3DCG Builder system and tried to apply it on internet environment for on-line multi-player. In this paper, we shall provide our design policy and development process.
{"title":"TeleBuilder: A 3DCG Builder System for Multiplayers via Network","authors":"Ningping Sun, Masataka Murakami, Youhei Yamashita, Tomonori Yagi","doi":"10.1109/AINA.2015.197","DOIUrl":"https://doi.org/10.1109/AINA.2015.197","url":null,"abstract":"Computer graphics application becomes more and more attractive recently as the popularization of the smart phone and computer tablet. It is interested us what we can do through network for making 3DCG models. We have designed and developed an interactive 3DCG Builder system and tried to apply it on internet environment for on-line multi-player. In this paper, we shall provide our design policy and development process.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"142 1","pages":"287-293"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80205022","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}
With the increase of a large numbers of Tibetan information, Tibetan text processing has become popular and important. Tibetan hot topics extraction has become one of the Tibetan information analysis tools. This paper describes a method of the hot topics extraction from Tibetan text. First, construction of the dataset is described. Second, Tibetan word segmentation is presented. Third, the feature selection and the text representation are conducted. The classical TFIDF is used to calculate the weights of features. At last, statistical-based method is utilized to extract the hot topics. The experiment shows it can extract the topics effectively and the results can reflect the characteristics of hot topic category. It is helpful and meaningful for text classification, information retrieval as well as construction of high-quality corpus.
{"title":"Technology Research of Tibetan Hot Topics Extraction","authors":"Guixian Xu, L. Qiu","doi":"10.1109/WAINA.2015.17","DOIUrl":"https://doi.org/10.1109/WAINA.2015.17","url":null,"abstract":"With the increase of a large numbers of Tibetan information, Tibetan text processing has become popular and important. Tibetan hot topics extraction has become one of the Tibetan information analysis tools. This paper describes a method of the hot topics extraction from Tibetan text. First, construction of the dataset is described. Second, Tibetan word segmentation is presented. Third, the feature selection and the text representation are conducted. The classical TFIDF is used to calculate the weights of features. At last, statistical-based method is utilized to extract the hot topics. The experiment shows it can extract the topics effectively and the results can reflect the characteristics of hot topic category. It is helpful and meaningful for text classification, information retrieval as well as construction of high-quality corpus.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"6 1","pages":"204-208"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76943564","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}
Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa
In distributed systems, a group of multiple processes are cooperating with one another by exchanging messages in networks. A process is modeled to be a finite state machine. In this paper, we discuss a peer-to-peer (P2P) model of a publish/subscribe (P2PPS) system composed of peer processes (peers). Each peer can both subscribe a subscription and publish event messages with a publication. In this paper, subscriptions and publications are specified in terms of keywords. If a subscription of a subscriber peer and a publication of an event message include some common keywords, the subscriber peer is a target peer of the event message. The event message is notified to the target subscriber peer. A pair of event messages are related, which have a common target subscriber peer. Only a pair of related event messages are required to be delivered to common target subscriber peers in the causal order. We newly propose vectors of 〈V<;sub>1<;/sub>, ..., V<;sub>m<;/sub>〉 of keywords k , ..., k<;sub>m<;/sub> to causally order event messages. Each event message e carries the keyword vector e.V. An event message e<;sub>1<;/sub> causally precedes an event message e<;sub>2<;/sub> with respect to a subscription S<;sub>i<;/sub> iff e<;sub>1<;/sub>·V<;sub>h<;/sub> <; e<;sub>2<;/sub>·V<;sub>h<;/sub> for every keyword k<;sub>h<;/sub> which is in the publications of the event messages e<;sub>1<;/sub> and e<;sub>2<;/sub> and the subscription S<;sub>i<;/sub>. Only a pair of related messages are causally delivered to common subscriber peers.
在分布式系统中，一组多个进程在网络中通过交换消息相互协作。流程被建模为有限状态机。本文讨论了由对等进程组成的发布/订阅(P2PPS)系统的点对点(P2P)模型。每个对等点既可以订阅订阅，也可以使用发布发布事件消息。在本文中，订阅和出版物是根据关键词来指定的。如果订阅者对等体的订阅和事件消息的发布包含一些通用关键字，则订阅者对等体是事件消息的目标对等体。将事件消息通知给目标订阅者对等体。一对事件消息是相关的，它们有一个共同的目标订阅者对等体。只需要按照因果顺序将一对相关的事件消息传递给共同的目标订阅者对等点。我们提出了< V1，…， Vm >的关键字k，…， km对事件消息进行随机排序。每个事件消息e都携带关键字向量e.V。对于事件消息e1和e2以及订阅Si发布中的每个关键字kh，事件消息e1因果关系地先于事件消息e2。只有一对相关的消息被偶然地传递给公共订阅者对等体。
{"title":"Causally Ordered Delivery of Event Messages with Keyword Vectors in P2P Publish/Subscribe Systems","authors":"Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2015.233","DOIUrl":"https://doi.org/10.1109/AINA.2015.233","url":null,"abstract":"In distributed systems, a group of multiple processes are cooperating with one another by exchanging messages in networks. A process is modeled to be a finite state machine. In this paper, we discuss a peer-to-peer (P2P) model of a publish/subscribe (P2PPS) system composed of peer processes (peers). Each peer can both subscribe a subscription and publish event messages with a publication. In this paper, subscriptions and publications are specified in terms of keywords. If a subscription of a subscriber peer and a publication of an event message include some common keywords, the subscriber peer is a target peer of the event message. The event message is notified to the target subscriber peer. A pair of event messages are related, which have a common target subscriber peer. Only a pair of related event messages are required to be delivered to common target subscriber peers in the causal order. We newly propose vectors of 〈V<;sub>1<;/sub>, ..., V<;sub>m<;/sub>〉 of keywords k , ..., k<;sub>m<;/sub> to causally order event messages. Each event message e carries the keyword vector e.V. An event message e<;sub>1<;/sub> causally precedes an event message e<;sub>2<;/sub> with respect to a subscription S<;sub>i<;/sub> iff e<;sub>1<;/sub>·V<;sub>h<;/sub> <; e<;sub>2<;/sub>·V<;sub>h<;/sub> for every keyword k<;sub>h<;/sub> which is in the publications of the event messages e<;sub>1<;/sub> and e<;sub>2<;/sub> and the subscription S<;sub>i<;/sub>. Only a pair of related messages are causally delivered to common subscriber peers.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"534-541"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80759864","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}
We address the problem of reliable broadcasting in spite of collisions and transmission losses. We do not aim to achieve reliable broadcast to all nodes in the network, rather, we seek to ensure reliable broadcast to a desired percentage of nodes. We first present a geometric based, probabilistic model to predict the optimal transmission range for maximizing 1-hop broadcast coverage in wireless networks as a function of range, sending rate and density. Though this adaptation technique can be incorporated into any broadcasting protocol, we extend Broadcast Protocol for Sensor Networks (BPS) [1] because of its simplicity, scalability and adaptability. The protocol can be applied under node heterogeneity in terms of transmission/reception ranges and packet delivery rate. Through extensive analytical and experimental results, we show multi fold advantages of adapting the protocol to network conditions.
{"title":"Stateless Adaptive Reliable Broadcast Protocol for Heterogeneous Wireless Networks","authors":"V. Paruchuri, A. Durresi","doi":"10.1109/AINA.2015.280","DOIUrl":"https://doi.org/10.1109/AINA.2015.280","url":null,"abstract":"We address the problem of reliable broadcasting in spite of collisions and transmission losses. We do not aim to achieve reliable broadcast to all nodes in the network, rather, we seek to ensure reliable broadcast to a desired percentage of nodes. We first present a geometric based, probabilistic model to predict the optimal transmission range for maximizing 1-hop broadcast coverage in wireless networks as a function of range, sending rate and density. Though this adaptation technique can be incorporated into any broadcasting protocol, we extend Broadcast Protocol for Sensor Networks (BPS) [1] because of its simplicity, scalability and adaptability. The protocol can be applied under node heterogeneity in terms of transmission/reception ranges and packet delivery rate. Through extensive analytical and experimental results, we show multi fold advantages of adapting the protocol to network conditions.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"47 1","pages":"860-867"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86357718","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}
In this paper we propose a double block length hash function called MR-MMO. Our scheme satisfies two calls of (n, 2n) block cipher and can compress 3n bits to 2n bits (n = 128 bits). The Collision Resistance (CR) and Preimage Resistance (PR) of MR-MMO are respectively 2126.70 and 2252.5. Surprisingly, the collision security bound of our scheme is the best in compare with other existing schemes. We use a single key scheduling for each compression function which is great in respect of cost and time. Additionally, it can be said that the proof technique of Weimar-DM, Tandem-DM, Hirose-DM are based on Ideal Cipher Model (ICM) while we use Weak Cipher Model (WCM) tool. Davies Meyer (DM) mode is used in the above all schemes, we also made a change using Matyas Meyer Oseas (MMO) mode. It is also obvious that the proof technique of our scheme is very simple, straightforward and easy to understand.
{"title":"A New (n, 2n) Double Block Length Hash Function Based on Single Key Scheduling","authors":"A. Miyaji, M. Rashed","doi":"10.1109/AINA.2015.237","DOIUrl":"https://doi.org/10.1109/AINA.2015.237","url":null,"abstract":"In this paper we propose a double block length hash function called MR-MMO. Our scheme satisfies two calls of (n, 2n) block cipher and can compress 3n bits to 2n bits (n = 128 bits). The Collision Resistance (CR) and Preimage Resistance (PR) of MR-MMO are respectively 2126.70 and 2252.5. Surprisingly, the collision security bound of our scheme is the best in compare with other existing schemes. We use a single key scheduling for each compression function which is great in respect of cost and time. Additionally, it can be said that the proof technique of Weimar-DM, Tandem-DM, Hirose-DM are based on Ideal Cipher Model (ICM) while we use Weak Cipher Model (WCM) tool. Davies Meyer (DM) mode is used in the above all schemes, we also made a change using Matyas Meyer Oseas (MMO) mode. It is also obvious that the proof technique of our scheme is very simple, straightforward and easy to understand.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"71 1","pages":"564-570"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86796274","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}
As reactive routing protocols take advantage of using recently active routes in the route cache, determining appropriate cached route Time-To-Live plays an important role in reducing the routing overhead by avoiding misrouting overhead caused by route errors. In this paper, an analytical model is presented for quantifying the bandwidth necessary to facilitate routing. Then, a numerical model for determining the optimal cached route Time-To-Live is derived to minimize the reactive routing overhead depending on network mobility and data traffic load. We show that cached route Time-To-Live should be set far shorter than that commonly seen in or recommended for simulations to save bandwidth. This paper provides a valuable insight into the fundamental limits of routing performance in MANETs in response to mobility.
{"title":"Optimizing Cached Route Time-to-Live in Mobile Ad-Hoc Networks","authors":"Q. Tran, A. Dadej","doi":"10.1109/AINA.2015.185","DOIUrl":"https://doi.org/10.1109/AINA.2015.185","url":null,"abstract":"As reactive routing protocols take advantage of using recently active routes in the route cache, determining appropriate cached route Time-To-Live plays an important role in reducing the routing overhead by avoiding misrouting overhead caused by route errors. In this paper, an analytical model is presented for quantifying the bandwidth necessary to facilitate routing. Then, a numerical model for determining the optimal cached route Time-To-Live is derived to minimize the reactive routing overhead depending on network mobility and data traffic load. We show that cached route Time-To-Live should be set far shorter than that commonly seen in or recommended for simulations to save bandwidth. This paper provides a valuable insight into the fundamental limits of routing performance in MANETs in response to mobility.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"193-200"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84215265","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
扫码关注我们
求助内容：
应助结果提醒方式：