2012 18th IEEE International Conference on Networks (ICON)最新文献_第3页

BEE-C: A bio-inspired energy efficient cluster-based algorithm for data continuous dissemination in Wireless Sensor Networks BEE-C:一种生物启发的基于聚类的无线传感器网络数据连续传播算法

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506592

Antoniel da Silva Rego, J. Celestino, André L. M. dos Santos, E. Cerqueira, Ahmed Patel, M. Taghavi

引用次数: 16

Address Auto-configuration in MANET with multiple gateways: Analysis and measurement 多网关的MANET地址自动配置:分析与测量

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506550

Yan Yonghang, Ci Lin-lin, Wang Zhiming, Zhang Lili

引用次数: 1

Remote tracking protocol with predictive localization algorithm 带有预测定位算法的远程跟踪协议

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506568

Alok Pathak, L. Wong, Huaqun Guo, Yongdong Wu

引用次数: 0

Performance study of WDM OPS employing tunable converter sharing under self-similar variable length packet traffic 自相似变长分组流量下采用可调转换器共享的WDM OPS性能研究

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506544

K. Sampath, M. R. Perati, T. Adilakshmi

引用次数: 5

Energy-efficient cooperative MIMO routing in wireless sensor networks 无线传感器网络中的高效协同MIMO路由

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506537

Ping He, Hui Tian, Hong Shen

{"title":"Energy-efficient cooperative MIMO routing in wireless sensor networks","authors":"Ping He, Hui Tian, Hong Shen","doi":"10.1109/ICON.2012.6506537","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506537","url":null,"abstract":"Due to limited batteries of senor node in wireless sensor networks, it is essential to minimize the energy consumption so that the lifetime of WSNs can be prolonged. In this paper, we propose a cooperative multi-input multi-output (CMIMO) scheme by introducing variable cluster size. In general, if the same cluster size is applied in each cluster, the cluster head with lower residual energy runs up more quickly than those with more residual energy. This may result in reclustering in which process new cluster head has to be re-selected. Lots of energy is consumed in this process. In order to avoid energy waste in reclustering, we consider the trade off between residual energy of cluster head and cluster size in cluster construction. We compute the maximized cluster size on the basis of residual energy of cluster head. The cluster with more residual energy has bigger cluster size and the cluster with less residual energy has smaller cluster size. This can balance the energy consumption in each cluster. We analyze the mathematical model for the proposed scheme. It is shown that the proposed scheme is more energy efficient than existing schemes. In our energy model, we present how to determine the cluster size and justify our method by simulations.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027999","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}

引用次数: 6

On improving dynamic stochastic routing algorithms in overlay networks 改进覆盖网络中的动态随机路由算法

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506599

Chengwei Zhang, Xiaojun Hei, Wei Liu, W. Cheng

引用次数: 2

A performance model of pedestrian dead reckoning with activity-based location updates 基于活动的位置更新行人航位推算的性能模型

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506535

Mahbub Hassan

{"title":"A performance model of pedestrian dead reckoning with activity-based location updates","authors":"Mahbub Hassan","doi":"10.1109/ICON.2012.6506535","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506535","url":null,"abstract":"Advanced computing and sensing capabilities of smartphones provide new opportunities for personal indoor positioning. A particular trend is to employ human activity recognition for autonomous calibration of pedestrian dead reckoning systems thereby achieving accurate indoor positioning even in the absence of any positioning infrastructure. The basic idea is that the activity context, such as switching from a walking to a stair climbing activity gives clues about pedestrian's current position. In this paper, we have made a first attempt in developing a performance model for such systems. For an unbiased random walk, we have obtained two interesting results in closed-form expressions. First, we have demonstrated that the distance a pedestrian is expected to travel before the PDR is recalibrated is reciprocal of the density of activity switching points (ASPs) in the indoor environment. The implication of this finding is that the continuous unaided use of PDR can be curbed drastically by identifying more ASPs in a given environmental setting. Second, we have shown that false negatives of the activity detection algorithms do not have a major impact as long as they are within a reasonable range of 0–30%. The system performance however degrades rapidly if false negatives continue to grow beyond 30%.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132420301","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}

引用次数: 17

Performances evaluation of different algorithms for PCIs self configuration in LTE LTE中pci自配置不同算法的性能评价

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506558

Mariem Krichen, D. Barth, O. Marcé

{"title":"Performances evaluation of different algorithms for PCIs self configuration in LTE","authors":"Mariem Krichen, D. Barth, O. Marcé","doi":"10.1109/ICON.2012.6506558","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506558","url":null,"abstract":"Nowadays, network operators are basically facing two problems: the fast number of subscribers growth and the network congestion. To solve these problems, network operators increase the number of cells, make cells smaller and reserve a subpart of frequencies to Femto cells to offload data traffic. As a consequence, networks manual planning demands a lot of efforts and its cost increases. Self-configuring and self-optimizing mechanisms would be vital to operators to reduce manual planning. This article focuses on the application of these mechanisms in LTE and more specifically on the procedure of Automated configuration of Physical Cell Ids (PCIs). This procedure aims at avoiding conflicts in PCIs allocation. In this article, we first evaluate the performances of 3 relabeling algorithms applied on graphs representing real LTE Macro networks: Random Relabeling algorithm (RR), Smallest available Value algorithm (SV), Distance 3 neighbour label algorithm (D3). Then, we evaluate the performances of the best algorithm applied on graphs representing real LTE networks where Femto cells are connected to Macro cells. Here, we answer the following question: is the selected relabeling algorithm still efficient when we extend its application to Femto cells?.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132580959","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}

引用次数: 9

Enhanced Ant Colony algorithm for self-optimized data assured routing in wireless sensor networks 基于改进蚁群算法的无线传感器网络自优化数据保证路由

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506595

K. Saleem, N. Fisal

{"title":"Enhanced Ant Colony algorithm for self-optimized data assured routing in wireless sensor networks","authors":"K. Saleem, N. Fisal","doi":"10.1109/ICON.2012.6506595","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506595","url":null,"abstract":"Wireless sensor network (WSN) deploys tiny wireless sensor nodes to communicate with each other with limited processing speed, power and security measures. A recent WSN routing protocol defined as Secure Real-Time Load Distribution (SRTLD) has been developed to provide realtime transfer, high delivery ratio, and longer sensor node lifetime. SRTLD has been compared with LQER, MMSpeed, RTPC and RPAR. However, SRTLD uses broadcast packets to perform neighbour discovery for every packet transfer every hop, thus consume high energy. A novel Biological inspired self-organized Secure Autonomous Routing Protocol (BIOSARP) to enhance SRTLD with self-optimized and autonomous secure routing mechanism. The BIOSARP routing protocol depends on the optimal forwarding decision obtained by Ant Colony Optimization (ACO). The pheromone value in ACO is computed based on end-to-end delay, remaining battery power, and packet reception rate metrics similar to SRTLD. The proposed BIOSARP has been designed to reduce overhead broadcast packet in order to minimize the delay, packet loss and power consumption in WSN. In this paper we have presented the improved ACO algorithm that has been utilized in BIOSARP to perform self-optimized routing in WSN. BIOSARP has been studied and verified through simulation in network simulator 2 (NS-2). In simulation study BIOSARP normalized overhead is 12.1% less as compare to E&D ANTS and achieves 14% higher delivery ratio with 9% less power consumption when compared to SRTLD. Hence, the results confirm that BIOSARP offers better performance and can be practically implemented in WSN applications as structural and environmental monitoring, battlefield surveillance.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124183226","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}

引用次数: 23

Smart job scheduling with backup system in grid environment 网格环境下带备份系统的智能作业调度

2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506560

H. Al-Najjar, M. Jarrah

引用次数: 3