Pub Date : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182320
Yue Liu, Jinglin Li, Qibo Sun
The existing handoff decision algorithms in MIP are mainly based on the reception of route advertisement or received signal strength (RSS). Those schemes will face some limitations in the Aeronautical Passenger Communication (APC) environment, including high handoff delay and may cause call drop. In this paper, a flight plan and surveillance based handoff decision algorithm is proposed to reduce the handoff delay caused by the high delay between the plane and its home network. The proposed algorithm use flight plan and surveillance information received by the Area Control Center (ACC) to calculate the real-time handoff probability to each base station (BS) the plane will go through and inform the BS to start pre-registration handoff if the probability is above a threshold. The simulation result shows that our handoff decision algorithm can reduce the handoff delay obviously in the APC environment.
{"title":"Flight plan and surveillance based handoff scheme in Aeronautical Passenger Communication","authors":"Yue Liu, Jinglin Li, Qibo Sun","doi":"10.1109/ICCSNT.2011.6182320","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182320","url":null,"abstract":"The existing handoff decision algorithms in MIP are mainly based on the reception of route advertisement or received signal strength (RSS). Those schemes will face some limitations in the Aeronautical Passenger Communication (APC) environment, including high handoff delay and may cause call drop. In this paper, a flight plan and surveillance based handoff decision algorithm is proposed to reduce the handoff delay caused by the high delay between the plane and its home network. The proposed algorithm use flight plan and surveillance information received by the Area Control Center (ACC) to calculate the real-time handoff probability to each base station (BS) the plane will go through and inform the BS to start pre-registration handoff if the probability is above a threshold. The simulation result shows that our handoff decision algorithm can reduce the handoff delay obviously in the APC environment.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126999348","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182023
Wei Fu, Yingmei Li, Kai Xing
In the Robot-Soccer, each behavior of the Robot is realized through a series of motions as people do, so a consummate motion is what people are always in pursuit of. In addition to going for goal, we also pursue fluent motions and some artistry, and the precondition to insure the fluent motions is to avoid the block. The article is mainly around as follow: how to use the molecular interaction to realize avoidance. In the Robot-Soccer, each behavior of the Robot is realized through a series of motions as people do, so a consummate motion is what people are always in pursuit of. In addition to going for goal, we also pursue fluent motions and some artistry, and the precondition to insure the fluent motions is to avoid the block. The article is mainly around as follow: how to use the molecular interaction to realize obstacle avoidance technology.
{"title":"Research on integrated obstacle avoidance of Robot Soccer game","authors":"Wei Fu, Yingmei Li, Kai Xing","doi":"10.1109/ICCSNT.2011.6182023","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182023","url":null,"abstract":"In the Robot-Soccer, each behavior of the Robot is realized through a series of motions as people do, so a consummate motion is what people are always in pursuit of. In addition to going for goal, we also pursue fluent motions and some artistry, and the precondition to insure the fluent motions is to avoid the block. The article is mainly around as follow: how to use the molecular interaction to realize avoidance. In the Robot-Soccer, each behavior of the Robot is realized through a series of motions as people do, so a consummate motion is what people are always in pursuit of. In addition to going for goal, we also pursue fluent motions and some artistry, and the precondition to insure the fluent motions is to avoid the block. The article is mainly around as follow: how to use the molecular interaction to realize obstacle avoidance technology.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130557181","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182079
Xiaodong Xu
Applications that using cosine-modulated filter banks (CMFB) with large number of channels may encounter the design of high order prototype filter (PF), which often makes the direct-form design method fail due to the impractical arithmetical complexity. An efficient indirect-form design approach of the PF is proposed based on frequency response masking (FRM) technique. First, the PF is substituted by various subfilters of the narrow band FRM. Then an iterative second-order cone-programming (SOCP) based scheme like [1] is used to solve the nonconvex optimization problem. An improved FRM based implementation structure is also presented for complex-exponential modulated filter banks (CEMFB). Numerical results indicate the efficiency of the proposed method.
{"title":"Design of cosine-modulated filter banks with large number of channels based on FRM technique","authors":"Xiaodong Xu","doi":"10.1109/ICCSNT.2011.6182079","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182079","url":null,"abstract":"Applications that using cosine-modulated filter banks (CMFB) with large number of channels may encounter the design of high order prototype filter (PF), which often makes the direct-form design method fail due to the impractical arithmetical complexity. An efficient indirect-form design approach of the PF is proposed based on frequency response masking (FRM) technique. First, the PF is substituted by various subfilters of the narrow band FRM. Then an iterative second-order cone-programming (SOCP) based scheme like [1] is used to solve the nonconvex optimization problem. An improved FRM based implementation structure is also presented for complex-exponential modulated filter banks (CEMFB). Numerical results indicate the efficiency of the proposed method.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130616122","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182429
Dianyuan Han
This paper concerns the problem of tree height measurement based on image processing by 3-points correction. In the traditional method, two marker points were used, one was set on the root of the tree and the other was set one meter high from the root. A tripod was used to fix the camera for taking photos of the tree and the photo was made perpendicular to the ground, which have many restrictions in practice. In this paper, three marker points were used and they were set in a line along the tree trunk with same distance. After the coordinates of the three marker points and the top point of the tree were extracted according to their color features, the image was corrected by three marker points. Then the tree height can be worked out using triangle similarity theory. The experimental results show that the relative measurement error of tree height is much smaller than the traditional method.
{"title":"Tree height measurement based on image processing with 3-points correction","authors":"Dianyuan Han","doi":"10.1109/ICCSNT.2011.6182429","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182429","url":null,"abstract":"This paper concerns the problem of tree height measurement based on image processing by 3-points correction. In the traditional method, two marker points were used, one was set on the root of the tree and the other was set one meter high from the root. A tripod was used to fix the camera for taking photos of the tree and the photo was made perpendicular to the ground, which have many restrictions in practice. In this paper, three marker points were used and they were set in a line along the tree trunk with same distance. After the coordinates of the three marker points and the top point of the tree were extracted according to their color features, the image was corrected by three marker points. Then the tree height can be worked out using triangle similarity theory. The experimental results show that the relative measurement error of tree height is much smaller than the traditional method.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132144063","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182387
S. Dastgheib, H. Oulia, M. Ghassami, Seyyed Javad Mirabedini
Wireless sensor networks (WSNs) are consist of hundreds or thousands small nodes called sensors that are connected to each other to do specific tasks. Routing is one of the main operations that nodes are doing in WSN network. Routing consist of selecting the next node by each node in the WSN. A variety of methods is proposed for routing. But in the field of using fuzzy logic approach for flat routing has rarely been studied. Since more than one parameter is considered in selecting the next node, using fuzzy logic will be useful. Our proposed method is a fully distributed method and all operations are done by the nodes. Use of fuzzy logic increases speed, accuracy and power of the routing. Also since the processes are completely local, this structure is very useful for environments that require real-time processing. Evaluations show that our method dramatically increases the network lifetime.
{"title":"A new method for flat routing in wireless sensor networks using fuzzy logic","authors":"S. Dastgheib, H. Oulia, M. Ghassami, Seyyed Javad Mirabedini","doi":"10.1109/ICCSNT.2011.6182387","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182387","url":null,"abstract":"Wireless sensor networks (WSNs) are consist of hundreds or thousands small nodes called sensors that are connected to each other to do specific tasks. Routing is one of the main operations that nodes are doing in WSN network. Routing consist of selecting the next node by each node in the WSN. A variety of methods is proposed for routing. But in the field of using fuzzy logic approach for flat routing has rarely been studied. Since more than one parameter is considered in selecting the next node, using fuzzy logic will be useful. Our proposed method is a fully distributed method and all operations are done by the nodes. Use of fuzzy logic increases speed, accuracy and power of the routing. Also since the processes are completely local, this structure is very useful for environments that require real-time processing. Evaluations show that our method dramatically increases the network lifetime.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130969623","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6181940
Wei Wang, Xianpeng Wang, Jinshan Yan
In this paper, an angle estimation algorithm for monostatic Multiple-Input Multiple-Output (MIMO) radar based on Multistage Wiener Filter (MSWF) is present. Firstly, a reduced dimensional transformation matrix can be utilized to transform the high dimensional received signal data into low dimensional one. Then the signal subspace can be obtained by forward recursion of the Multistage Wiener Filter. The root polynomial of direction of arrival (DOA) estimation can be constituted by signal subspace, and the DOA can be obtained by root-MUSIC. The proposed method avoids not only the estimate of the covariance matrix and its eigendecomposition, but also the angle searching. Thus, the proposed method has lower computational complexity. Simulation results show that the proposed algorithm has better estimation performance than other methods.
{"title":"Angle estimation for monostatic MIMO radar based on Multistage Wiener Filter","authors":"Wei Wang, Xianpeng Wang, Jinshan Yan","doi":"10.1109/ICCSNT.2011.6181940","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181940","url":null,"abstract":"In this paper, an angle estimation algorithm for monostatic Multiple-Input Multiple-Output (MIMO) radar based on Multistage Wiener Filter (MSWF) is present. Firstly, a reduced dimensional transformation matrix can be utilized to transform the high dimensional received signal data into low dimensional one. Then the signal subspace can be obtained by forward recursion of the Multistage Wiener Filter. The root polynomial of direction of arrival (DOA) estimation can be constituted by signal subspace, and the DOA can be obtained by root-MUSIC. The proposed method avoids not only the estimate of the covariance matrix and its eigendecomposition, but also the angle searching. Thus, the proposed method has lower computational complexity. Simulation results show that the proposed algorithm has better estimation performance than other methods.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127867247","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182441
Ce Wang, Gongliang Liu
Compared to land-based sensor networks, Underwater Acoustic Sensor Networks have several new challenges, such as dynamic topology, limited network lifetime. To achieve long network lifetime, existing researches use clustering method to assure energy-efficiency. However, nodes far away from sink are easily to exhaust energy due to directly communication with sink. Besides, in HEED protocol, the nodes must be location-aware in order to communicate with the sink node. However, GPS radio receivers cannot function properly in underwater situation. Moreover, in industry, homogenous nodes with identical hardware are more welcomed concerning manufacture efforts and costs. In this paper, we provide a new homogeneous, dynamic topology adaptive, multi-hop routing protocol LUM-HEED (Location Unaware Multi-hop based on HEED) which suits for the real underwater situation and is more convenient and economic in industry application. Simulation results show that this protocol can prolong network lifetime and balance network traffic.
与陆基传感器网络相比，水声传感器网络面临着动态拓扑、有限网络寿命等新的挑战。为了实现较长的网络寿命，现有研究采用聚类方法来保证能量效率。然而，远离sink的节点由于直接与sink通信，容易耗尽能量。此外，在HEED协议中，节点必须具有位置感知才能与汇聚节点通信。然而，GPS无线电接收机无法在水下正常工作。此外，在工业中，考虑到制造成本和成本，具有相同硬件的同质节点更受欢迎。本文提出了一种新的同构的、动态拓扑自适应的多跳路由协议LUM-HEED (Location - aware multi-hop based HEED)，该协议适合水下实际情况，在工业应用中更加方便和经济。仿真结果表明，该协议可以延长网络生存期，实现网络流量均衡。
{"title":"LUM-HEED: A Location Unaware, Multi-hop routing protocol for Underwater Acoustic Sensor Networks","authors":"Ce Wang, Gongliang Liu","doi":"10.1109/ICCSNT.2011.6182441","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182441","url":null,"abstract":"Compared to land-based sensor networks, Underwater Acoustic Sensor Networks have several new challenges, such as dynamic topology, limited network lifetime. To achieve long network lifetime, existing researches use clustering method to assure energy-efficiency. However, nodes far away from sink are easily to exhaust energy due to directly communication with sink. Besides, in HEED protocol, the nodes must be location-aware in order to communicate with the sink node. However, GPS radio receivers cannot function properly in underwater situation. Moreover, in industry, homogenous nodes with identical hardware are more welcomed concerning manufacture efforts and costs. In this paper, we provide a new homogeneous, dynamic topology adaptive, multi-hop routing protocol LUM-HEED (Location Unaware Multi-hop based on HEED) which suits for the real underwater situation and is more convenient and economic in industry application. Simulation results show that this protocol can prolong network lifetime and balance network traffic.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127878360","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182030
M. Vora
Today we are inundated with digital data. Yet we are very poor in managing and processing it. It is becoming increasingly difficult to store and analyze data efficiently and economically via conventional database management tools. Not only that, type of data, appearing in the databases, are also changing. Now a day, binary large objects are a standard integral part of any database. Researchers, all over the globe, are baffling with analysis of these ultra large databases. Apache HBase is one such attempt. HBase is a noSQL distributed database developed on top of Hadoop Distributed File System (HDFS). In this paper, we present an evaluation of hybrid architecture where HDFS contains the non-textual data like images and location of such data is stored in HBase. This hybrid architecture enables faster search and retrieval of the data which is a growing need in any organization who are flooded with data. The paper aims at evaluating the performance of random reads and random writes of data storage location information to HBase and retrieving and storing data in HDFS respectively. We also present a comparative study of HBase-HDFS architecture with MySQL-HDFS architecture.
{"title":"Hadoop-HBase for large-scale data","authors":"M. Vora","doi":"10.1109/ICCSNT.2011.6182030","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182030","url":null,"abstract":"Today we are inundated with digital data. Yet we are very poor in managing and processing it. It is becoming increasingly difficult to store and analyze data efficiently and economically via conventional database management tools. Not only that, type of data, appearing in the databases, are also changing. Now a day, binary large objects are a standard integral part of any database. Researchers, all over the globe, are baffling with analysis of these ultra large databases. Apache HBase is one such attempt. HBase is a noSQL distributed database developed on top of Hadoop Distributed File System (HDFS). In this paper, we present an evaluation of hybrid architecture where HDFS contains the non-textual data like images and location of such data is stored in HBase. This hybrid architecture enables faster search and retrieval of the data which is a growing need in any organization who are flooded with data. The paper aims at evaluating the performance of random reads and random writes of data storage location information to HBase and retrieving and storing data in HDFS respectively. We also present a comparative study of HBase-HDFS architecture with MySQL-HDFS architecture.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131671467","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182103
Jian Wang, Xiaoming Hu, Yinchun Yang, Xiumei Wu
BitTorrent-like networks are prevailing on Internet, facilitating quick distribution of media files to large numbers of users via aggregating upload bandwidth at the user side. Their successes lie in initial optimistic blocks and active reciprocation on all established connections. However, some misbehaving peers may exploit or sabotage such premises, exerting free-riding, faking block exploit, collusion, and even denial-of-service attacks. This paper proposes a threshold-based verifiable cipherblock trading protocol in an attempt to mitigate aforementioned kinds of misbehavior simultaneously. Preliminary results about the best response of these misbehavior against the proposed protocol are presented. Also influences of protocol parameters (i.e. threshold and number of bits shifted circularly) are discussed in detail.
{"title":"A misbehavior resilient cipherblock trading protocol in BitTorrent-like networks","authors":"Jian Wang, Xiaoming Hu, Yinchun Yang, Xiumei Wu","doi":"10.1109/ICCSNT.2011.6182103","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182103","url":null,"abstract":"BitTorrent-like networks are prevailing on Internet, facilitating quick distribution of media files to large numbers of users via aggregating upload bandwidth at the user side. Their successes lie in initial optimistic blocks and active reciprocation on all established connections. However, some misbehaving peers may exploit or sabotage such premises, exerting free-riding, faking block exploit, collusion, and even denial-of-service attacks. This paper proposes a threshold-based verifiable cipherblock trading protocol in an attempt to mitigate aforementioned kinds of misbehavior simultaneously. Preliminary results about the best response of these misbehavior against the proposed protocol are presented. Also influences of protocol parameters (i.e. threshold and number of bits shifted circularly) are discussed in detail.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001679","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182221
Dan Wu, Weixiong Rao, Dawei Liu, Bin Sheng, Yue Wang
Determining event ordering has always been a crucial issue in distributed computing. A well known model for describing event ordering is the happened-before relation. However, the traditional happened-before relation model is inadequate to faithfully characterize event ordering in recent emerging mobile ad hoc networks (MANETs), which usually have no fixed supporting infrastructure and may experience dynamic network topology changes. In this paper, we first propose a new relation, called the extended-happened-before relation, to model the ordering of events for a MANET. Then we present an algorithm to assign logical time to events such that the extended-happened-before relation between events can be decided by comparing their timestamps. We finally show how to construct consistent global snapshots in a MANET when the ordering of events can be determined.
{"title":"Determining event ordering in mobile ad hoc networks","authors":"Dan Wu, Weixiong Rao, Dawei Liu, Bin Sheng, Yue Wang","doi":"10.1109/ICCSNT.2011.6182221","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182221","url":null,"abstract":"Determining event ordering has always been a crucial issue in distributed computing. A well known model for describing event ordering is the happened-before relation. However, the traditional happened-before relation model is inadequate to faithfully characterize event ordering in recent emerging mobile ad hoc networks (MANETs), which usually have no fixed supporting infrastructure and may experience dynamic network topology changes. In this paper, we first propose a new relation, called the extended-happened-before relation, to model the ordering of events for a MANET. Then we present an algorithm to assign logical time to events such that the extended-happened-before relation between events can be decided by comparing their timestamps. We finally show how to construct consistent global snapshots in a MANET when the ordering of events can be determined.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129181790","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
扫码关注我们
求助内容：
应助结果提醒方式：