2008 IEEE International Networking and Communications Conference最新文献_第3页

A Membership Scheme for Gossip based Reliable Data Dissemination in Ad-hoc WSNs 自组网无线传感器网络中基于八卦的可靠数据传播隶属度方案

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562701

S. Khan, E. Huh, N. Imran, I. Rao

引用次数: 3

A Frequency Domain Approach to Channel Shortening in OFDM Systems OFDM系统中信道缩短的频域方法

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562697

J. Bapat, A. Lakshmi

引用次数: 0

A New Approximate Positioning Approach in Wireless Sensor Networks 一种新的无线传感器网络近似定位方法

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562706

Y. Forghani

引用次数: 7

An Efficient Low Complexity Partial Crosstalk Canceller in xDSL Networks xDSL网络中一种高效的低复杂度部分串扰消除器

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562705

M. Maesoumi, M. Masnadi-Shirazi

{"title":"An Efficient Low Complexity Partial Crosstalk Canceller in xDSL Networks","authors":"M. Maesoumi, M. Masnadi-Shirazi","doi":"10.1109/INCC.2008.4562705","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562705","url":null,"abstract":"Partial crosstalk cancellation algorithm has been proposed to reduce the online complexity of crosstalk canceller in upstream xDSL systems. Also, much lower online complexity can be achieved by joint solution of the multi-user power control and partial crosstalk cancellation problems. However, it must have a very low pre-processing complexity to allow working efficiently in time-varying crosstalk environment. Currently, this joint problem has been formulated as a constrained weighted sum rate maximization problem and solved by employing Lagrange dual decomposition method. However, it suffers from applying per-tone exhaustive search method for its solution because of non-convexity of the problem while it has too high pre-processing computational complexity. In this paper, the joint problem is reformulated as a mixed binary convex problem by successive linear convex relaxation technique which can be solved by the efficient branch and bound method in an iterative fashion. The analytical and simulation results show that the proposed iterative approach provides a solution with extremely low pre-processing computational complexity and quite close to the optimal solution.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"540 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124532648","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

An Energy-efficient MAC-Layer Retransmission Algorithm for Cluster-based Sensor Networks 基于簇的传感器网络的高效mac层重传算法

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562694

Xiaobo Zhang, Heping Wang, A. Khokhar

{"title":"An Energy-efficient MAC-Layer Retransmission Algorithm for Cluster-based Sensor Networks","authors":"Xiaobo Zhang, Heping Wang, A. Khokhar","doi":"10.1109/INCC.2008.4562694","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562694","url":null,"abstract":"In a typical sensor network application scenario, occurrence of an event triggers data collection. In such cases, a mobile sink node moves into the sensing area or a node is activated to serve as a cluster head and collect data from the sensor nodes deployed in the area. In such applications, only the number of nodes in the area is known which makes TDMA-type protocols infeasible. Different data collection algorithms have been proposed for such applications aiming at reducing energy usage, increasing throughput, or reducing delay. However, most of those solutions assume some form of contention-free MAC protocol, making them less practical. Recently proposed synchronized, shared contention window (SSCW) based 802.11 DCF protocol is a contention based solution and has demonstrated superior performance in terms of delay and throughput compared with the standard binary exponential backoff (BEB) based 802.11 DCF and 802.15.4 (ZigBee) protocols. We propose an energy-efficient algorithm based on the contention window concept. We study the energy cost and time delay of our method assuming different sizes of the contention window and determine the optimal value that minimizes the energy cost for a given number of nodes in the cluster. Compared with SSCW protocol, the proposed protocol improves energy efficiency by 36%-400% with throughput still within 82%-75% of SSCW.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130530739","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

Energy Efficient Data Dissemination in Wireless Sensor Networks 无线传感器网络中的高能效数据传输

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562677

Sajid Hussain

引用次数: 0

Combined Equalization and Channel Estimation for MC-IDMA Uplink Transmissions MC-IDMA上行传输的综合均衡和信道估计

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562687

Habib-ur-Rehman, I. Zaka, Syed Ismail Shah, J. Ahmad

引用次数: 3

Wireless Sensor and Sensor-Actuator Networks: Research Trends, Protocols, and Applications 无线传感器和传感器-执行器网络:研究趋势、协议和应用

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562673

M. F. Munir

引用次数: 8

RSR-ARQ Mechanism for Unreliable Data Communication in GPRS GPRS中不可靠数据通信的RSR-ARQ机制

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562702

M. Ali, M. S. Naweed, I.S. Bajwa

引用次数: 1

A Novel Approach to Service Discovery in Mobile Adhoc Network 移动自组织网络中一种新的服务发现方法

2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562692

Noman Islam, Z. Shaikh

{"title":"A Novel Approach to Service Discovery in Mobile Adhoc Network","authors":"Noman Islam, Z. Shaikh","doi":"10.1109/INCC.2008.4562692","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562692","url":null,"abstract":"Mobile adhoc network (MANET) is a network of a number of mobile routers and associated hosts, organized in a random fashion via wireless links. During recent years MANET has gained enormous amount of attention and has been widely used for not only military purposes but for search-and-rescue operations, intelligent transportation system, data collection, virtual classrooms and ubiquitous computing. Service discovery is one of the most important issues in MANET. It is defined as the process of facilitating service providers to advertise their services in a dynamic way and to allow consumers to discover and access those services in an efficient and scalable manner. In this paper, we are proposing a flexible and efficient approach to service discovery for MANET by extending the work of Dante Arias Torres and J. Antonio Garcia-Macias (2004). Most of the service discovery protocols proposed in literature don't provide an appropriate route from consumer to service provider. Hence after services are discovered, a route request needs to be initiated in order to access the service. In this paper, we are proposing a robust and flexible approach to service discovery for MANET that not only discovers a service provider in the vicinity of a node, but at the same time, it also provides a route to access the service. We have extended the approach proposed in Dante Arias Torres and J. Antonio Garcia-Macias for efficiency by adding the push capabilities to service discovery.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380188","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}

引用次数: 22