2006 International Symposium on Ad Hoc and Ubiquitous Computing最新文献_第2页

Distributed Algorithm for Power Aware Connected Dominating Set for EfCcient Routing in Mobile Ad Hoc Networks 面向移动自组网高效路由的功率感知连接控制集分布式算法

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290650

S. Bhattacharjee, J. Tripathi, O. Mistry, J. Dattagupta

{"title":"Distributed Algorithm for Power Aware Connected Dominating Set for EfCcient Routing in Mobile Ad Hoc Networks","authors":"S. Bhattacharjee, J. Tripathi, O. Mistry, J. Dattagupta","doi":"10.1109/ISAHUC.2006.4290650","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290650","url":null,"abstract":"Efficient routing in ad hoc mobile environment with an economic use of battery power is an important problem and conventional routing protocols are unsuitable there due to static choice of routing paths without consideration of remaining battery power of the nodes. In this paper, we propose a simple and efficient distributed algorithm for calculating power aware connected dominating set for Ad hoc wireless networks. To enhance the lifetime of each node, which will in turn enhance the lifetime of the network, energy consumption here is balanced among different nodes of the network. Nodes are alternated in being selected to become a member of connected dominating set, which would enhance the lifetime of the network. In our approach each node select another node as its dominating neighbor depending on the status vector of its neighbor set. The status of a node is calculated based on its node degree and remaining battery power. The algorithm has 0(Δ2) time complexity and O(m) message complexity, where Δ is the maximum node degree and m is the number of edges in the topology graph. The dominating sets we obtain are in general comparable in size to that obtained in [1]. We ensured mobility support in our algorithm and our simulation result shows that, under the condition of mobility better lifespan is obtained using our approach as compared to other power aware approach.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398875","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}

引用次数: 3

Power Aware Clustering Technique in Wireless Ad Hoc Networks 无线Ad Hoc网络中的功率感知聚类技术

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290651

S. K. Dhurandher, G. V. Singh

引用次数: 18

Analysis of IP Traceback Systems IP回溯系统分析

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290659

V. Murali, Bhaskarant M a, S. N. Natarajan, Sivanandam, Ac In

引用次数: 6

A Routing Protocol for Delay-Sensitive Applications in Mobile Ad Hoc Networks 移动Ad Hoc网络中时延敏感应用的路由协议

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290641

Rakesh Kumar, M. Misra, A. Sarje

{"title":"A Routing Protocol for Delay-Sensitive Applications in Mobile Ad Hoc Networks","authors":"Rakesh Kumar, M. Misra, A. Sarje","doi":"10.1109/ISAHUC.2006.4290641","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290641","url":null,"abstract":"The Ad hoc On Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in ad hoc networks. To provide quality of service, extensions can be added to the messages used during route discovery. These extensions specifythe service requirements which must be met by nodes rebroadcasting a route request (RREQ) or returning a route reply (RREP) for a destination. In order to provide quality delivery to delay sensitive applications such as voice and video, it is extremely important that mobile ad hoc networks provide quality of service (QoS) support in terms of bandwidth and delay. In spite of using IEEE 802.11 as medium access control (MAC), most of the ad hoc routing protocols do not consider contention time which occurs in the medium reservation. Large contention times can be more critical than hop counts in determining the end-to-end delay. Most existing routing protocols for mobile ad hoc networks are designed to search for the shortest path with minimum hop counts. However, the shortest routes do not always provide the best performance, especially when there are congested nodes along these routes. In this paper we propose an on demand delay based quality of service (QoS) routing protocol (AODV-D) to ensure that delay does not exceed a maximum value for mobile ad hoc networks. This protocol will take into consideration MAC layer channel contention information and the number of packets in the interface queue in addition to minimum hops.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115149714","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}

引用次数: 11

Secure Position Routing Using Ad hoc Network 使用自组织网络的安全位置路由

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290678

R. Ramesh, S. Kumar

引用次数: 7

A Hybrid CAC Scheme for Integrated Services in CDMA Wireless Access Networks CDMA无线接入网中综合业务的混合CAC方案

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290654

N. Gopalan, C. Mala, R.K. Nayudu, D. Kumar

{"title":"A Hybrid CAC Scheme for Integrated Services in CDMA Wireless Access Networks","authors":"N. Gopalan, C. Mala, R.K. Nayudu, D. Kumar","doi":"10.1109/ISAHUC.2006.4290654","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290654","url":null,"abstract":"Current advances in the area of wireless access networks, and the increasing demand for real time services (e.g. video-on-demand, voice), requires, that the quality of service (QoS) guarantees in wireless networks are met, while ensuring a high level of network utilization. Call admission control (CAC) plays a significant role in providing the desired QoS in code division multiple access (CDMA) integrated wireless access network with heterogeneous services. Several CAC schemes for integrated services in CDMA wireless access network.s are available. Signal to interference ratio (SIR) based call admission and mobility based channel reservation (MBCR) call admission schemes are frequently used CAC schemes. SIR- based CAC always outperforms fixed CAC under hot spot loadings, as it can deal with varying traffic conditions very effectively. This is not the case in FDMA/TDMA cellular systems. But SIR based algorithms do not consider the mobility of users which have a profound effect on QoS. MBCR schemes are flexible to handle the dynamic traffic situations, as these schemes use the traffic information in the current cell and its neighboring cells and hence can adapt to the real-time network conditions. The drawback of this scheme is that it doesn't consider the effect of interference between cells which is a more realistic factor improving the performance of radio links in wireless access networks. To overcome these problems, this paper proposes a hybrid scheme which allocates channels in an efficient manner by taking into account the interference between cells and the mobility of users. Our simulation results show that this hybrid scheme performs better than the SIR and MBCR schemes.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116500498","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}

引用次数: 0

Efficient CPU Scheduling: A Genetic Algorithm based Approach 高效CPU调度:基于遗传算法的方法

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290681

Snehal Kamalapur, Neeta Deshpande

引用次数: 10

Framework Design & Issues Involved in MANET Routing Protocol MANET路由协议框架设计及相关问题

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290679

B. Babu, P. kumar, D. Manjaiah

引用次数: 1

Time-Variant Channel Estimation and Equalization for Wireless Mobile Applications 无线移动应用时变信道估计与均衡

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290667

S. Bansal, R. Bansal, Satnam Singh

引用次数: 0

Effect of Mobility over Performance of the Ad hoc Networks 移动性对Ad hoc网络性能的影响

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290661

V. Geetha, S. Aithal, K. Chandrasekaran

引用次数: 24