搜索结果: 76-82 共查到“信息与通信工程 Ad-Hoc”相关记录82条 . 查询时间(0.081 秒)
一种基于双带外信号节省能耗的Ad－Hoc接入协议
功率控制 能量节省 MAC协议
<
2008/5/13
Ad－Hoc在MAC层有两种节约能耗策略。一种是能量节省机制,它允许节点在不活动时候关闭电源进入睡眠状态,从而节省能耗;另一种是功率控制机制,它能通过减小发射功率节约能耗。结合这两种策略来实现能耗节省。节点以最大功率发送RTS/CTS报文,与此同时以最大功率周期性发送带外信号,建立通信以后,以满足需求的最小功率发送DATA/ACK报文。邻居节点通过侦听数据信道和带外信号信道来实现睡眠机制,达到节省...
Lightweight Anonymous Routing for Reliability in Mobile Ad-Hoc Networks
Anonymity on-demand routing pseudonymity privacy security
<
2014/3/11
Mobile ad-hoc networks (MANET) are particularly vulnerable on account of their intrinsic characteristics of open medium, dynamic topology, absence of central authorities, distributed cooperation and c...
AODV-HM: A Hybrid Mesh Ad-hoc On-demand Distance Vector Routing Protocol
Wireless Mesh Networks Routing Hybrid Mesh Networks Channel Diversity
<
2014/3/11
Wireless Mesh Networks (WMNs) have recently gained increasing attention and have emerged as a technology with great potential for a wide range of applications. WMNs can be considered as a superset of ...
多跳Ad hoc网络中支持MIMO的拓扑未知预约时分多址接入协议
MIMO 时分多址接入 拓扑未知 预约
<
2008/6/10
该文提出适合多跳Ad hoc网络的支持MIMO的拓扑未知预约时分多址接入协议。通过预约，每个节点在其分配的无冲突时隙并行发送最大数据流，并以一定概率利用其分配时隙中的冲突时隙和未分配时隙中的空闲时隙而发送一部分数据流。该协议不需知道全网拓扑结构，便于实现和分布式应用。通过理论分析推导出最小通过率及最佳帧长。结果表明该协议具有对网络拓扑的稳定性。
Ad hoc 网络中的多描述视频通信及其分层算法
<
2007/7/28
期刊信息
篇名
Ad hoc 网络中的多描述视频通信及其分层算法
语种
中文
撰写或编译
撰写
作者
张方,王养利,肖嵩
第一作者单位
西安电子科技大学
刊物名称
西安电子科技大学学报
页面
第32卷，第1期，2005年2月， pp.1-6
出版日期
2005年
2月
日
文章标识(ISSN)
相关项目
多描述网格基视频编码
Fast Moving Region Detection Scheme in Ad Hoc Sensor Network
Detection Scheme Ad Hoc Sensor Network
<
2010/12/14
In this paper we present a simple yet effective temporal differencing based moving region detection scheme which can be used in limited resource condition such as in ad-hoc sensor network. Our objecti...
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
Performance evaluation energy efficient topologic control ad hoc wireless networks.
<
2012/11/29
Minimizing total energy to keep an ad hoc wireless network symmetrically connected is an NP-hard problem. Recently, several greedy approximations have been proposed, based on k-restricted decompositio...