摘要：
We have proposed an adaptive gain scheme for resource allocation in wireless Ad Hoc networks based on single neural node and virtual price concept. The degree of congestion on a wireless link can be symbolized an aggregate virtual price along a route, which depends mostly on the wireless node's queue occupancy. This approach adopts an adaptive approach to control the transmission rate at the source, named ASR controller. Our object is to optimize the resource allocation dynamically through the transmission rate adjustment and stabilized the queue size of wireless links. The basic control theory approach for the algorithm is been presented. The performance of simulation indicates that the proposed scheme can achieve the goal of optimal channel capacity sharing among multi-hop flows and sharing bandwidth fairly. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4605830
期刊：
2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15,2007年:1641-1644
通讯作者：
Liu, Ming
作者机构：
[Liu, Ming; Liu, Rui; Sun, Yange; Huang, Xiaoyan] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Liu, Ming] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
ad hoc networks;QoS routing;Ant colony algorithm;congestion avoidance
摘要：
Due to the bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting QoS becomes a multi-constrained QoS routing problem for mobile ad hoc networks. This paper proposes an improved ant colony QoS routing algorithm (IAQR) for ad hoc networks. The IAQR algorithm introduces a routing modeling with four QoS constrained requirements associated with nodes or links, and defines four rules besides congestion avoidance rule. The algorithm can find a route in ad hoc networks that satisfies more QoS requirements of the incoming traffic and at the same time reduces constrained resources consumption as much as possible. Moreover, it can avoid congestion after judging by average queue length quickly. Simulation results show that IAQR algorithm can obviously improve packet delivery ratio and reduce end to end delay.
作者：
Wang Tingting*;Liu Ming（刘明）;Zhang Xingyan;Huang Xiaoyan
期刊：
Advanced Computer Technology, New Education, Proceedings,2007年:749-752
通讯作者：
Wang Tingting
作者机构：
[Liu Ming; Wang Tingting; Huang Xiaoyan; Zhang Xingyan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei Province, Peoples R China.
通讯机构：
[Wang Tingting] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei Province, Peoples R China.
关键词：
hotspot cluster;congestion mitigation;ad hoc networks;routing
摘要：
This paper proposes a congestion mitigation algorithm based on hotspot cluster (CHMA), which provides a novel routing approach to mitigating congestion in ad hoc networks. CHMA defines hotspot cluster to represent highly congested region which is identified according to nodes' MAC delay and buffer occupancy, then finds an efficient path quickly to avoid the congested region and decrease load of congested nodes. A performance analysis, including packet delivery rate in different MAC delay and buffer occupancy, is given. Simulation results show that CHMA algorithm can mitigate congestion and improve ratio of end-to-end packet delivery in ad hoc networks.
摘要：
An important task, of mobile embedded svstem design is to seek, an optimal hardware/software co-design. With the growing complexity of the systems. mobile embedded svstem hardware/software co-design becomes an effective Nvay to improve the design quality. In the discussion of general methods used in mobile embedded system designing. this paper illustrates hardware/software co-design technology and their partitioning. and proposes a design idea based on hardware/software partitioning. the weight of components and their partitioning. which leads to the construction of MEHSC ( Mobile Embedded HW/SW Co-design, MEHSC). Based on the MEHSC Algorithm model. a kind of the mobile "Eelectronics' Schoolbag " is developed.
期刊：
2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING,2006年:1492-1496
通讯作者：
Liu, Ming
作者机构：
[Liu, Ming; Wang, Cheng] Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.;[Liu, Ming; Yang, Junli; Huang, Xiaorong] Ctr China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
通讯机构：
[Liu, Ming] H;Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.
会议名称：
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
会议时间：
2006-06-25
会议地点：
广西桂林
会议论文集名称：
第四届国际通信、电路与系统学术会议
摘要：
Multipath routing allows two network nodes to exchange messages over multiple paths. However, due to the wireless multicast advantage (WMA), there exists serious collision among multiple paths. Thus, data transfer rate of most multipath routing, even if it is node-disjoint, is not so high as its anticipation. This paper proposes a Node-Disjoint multipath routing based on Correlation Factor (NDCF) algorithm for ad hoc networks. To avoid collision maximally, this algorithm defines correlation factor to weigh the collision probability among node-disjoint multipaths when transmitting data simultaneously, then finds the node-disjoint multipath, whose collision probability is minimum. Our preliminary simulation results show that NDCF algorithm can significantly reduce end-to-end delay and improve packet delivery ratio.
期刊：
2006 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-4,2006年:1-4 ISSN：2161-9646
通讯作者：
Liu, Ming
作者机构：
[Liu, Ming; Chen, Peng; Li, Lijun] Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.;[Liu, Ming; Xu, Zhiyan] Ctr China Normal Univ, Dept Comp Sci, Wuhan 430074, Hubei, Peoples R China.
通讯机构：
[Liu, Ming] H;Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.
会议名称：
第二届IEEE无线通讯、网络技术暨移动计算国际会议
会议时间：
2006-09-01
会议地点：
武汉
会议主办单位：
[Liu, Ming;Li, Lijun;Chen, Peng] Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.^[Liu, Ming;Xu, Zhiyan] Ctr China Normal Univ, Dept Comp Sci, Wuhan 430074, Hubei, Peoples R China.
会议论文集名称：
第二届IEEE无线通讯、网络技术暨移动计算国际会议论文集
关键词：
ad hoc networks;measure;interference control topology;path-interference measure
摘要：
Topology control has been well studied as a hotspot in wireless ad hoc networks. However, due to the strictly limited resources, few topology control methods take into account lowering interference of the entire network as the main goal. This paper proposes an interference-minimized control topology algorithm (IMBP) based on path-interference measure for ad hoc networks. Derived from the concept of measure, the IMBP presents a new metric that quantifies the degree of interference of the entire network, and gives an algorithm of computing node interference measure (CNIM), then obtains the interference-minimized network topology while preserving the connectivity of ad hoc networks. Our extensive simulation results show that IMBP algorithm can significantly reduce interference and improve the connectivity of ad hoc networks
期刊：
Proceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications,2006年2:856-860
通讯作者：
Liu, Rong
作者机构：
[Liu, Ming; Zhou, Jianzhong; Liu, Rong] Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.;[Liu, Ming] Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
通讯机构：
[Liu, Rong] H;Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.
关键词：
semi-supervised learning;graph;web page classification;link information
摘要：
Many application domains such as web page classification suffer from not having enough labeled training examples for learning. However, unlabeled training examples are readily available but labeled ones are fairly expensive to obtain. As a result, there has been a great deal of work in resent years on semi-supervised learning. This paper proposes a graph-based semi-supervised learning algorithm that is applied to the web page classification. Our algorithm uses a similarity measure between web pages to construct a K-Nearest Neighbor graph. Labeled and unlabeled web pages are represented as nodes in the weighted graph, with edge weights encoding the similarity between the web pages. In order to use unlabeled data to help classification and get higher accuracy, edge weights of the graph are computed through combining weighting schemes and link information of web pages. The learning problem is then formulated in terms of label propagation in the graph. By using probabilistic matrix methods and belief propagation, the labeled nodes push out labels through unlabeled nodes. Our preliminary experiments on the WebKB dataset show that the algorithm in this paper can effectively exploit unlabeled data in addition to labeled ones to get higher accuracy of web page classification.
作者：
Liu, Ming*（刘明）;Xu, Zhiyan;Yang, Junli;Ye, Juan
期刊：
2006 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-4,2006年:857-861 ISSN：2161-9646
通讯作者：
Liu, Ming
作者机构：
[Liu, Ming; Ye, Juan; Xu, Zhiyan; Yang, Junli] Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
通讯机构：
[Liu, Ming] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
会议名称：
第二届IEEE无线通讯、网络技术暨移动计算国际会议
会议时间：
2006-09-01
会议地点：
武汉
会议主办单位：
[Liu, Ming;Xu, Zhiyan;Yang, Junli;Ye, Juan] Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
会议论文集名称：
第二届IEEE无线通讯、网络技术暨移动计算国际会议论文集
关键词：
ad hoc networks;correlation factor;minimum energy;collision-constrained;multipath
摘要：
Multipath routing can reduce routing update, increase bandwidth and improve data transfer rate of ad hoc Networks. However, there exists serious collision among multiple paths. Energy minimum and collision avoidance are incompatible, and limited battery capacity presents major challenges for collision avoidance. In order to find a tradeoff between them when transmitting data simultaneously, this paper proposes a collision-constrained minimum energy node-disjoint multipath routing algorithm (ECCA) for ad hoc networks. The ECCA defines correlation factor to weigh the collision probability among node-disjoint multipath, then calculates an upper limit for correlation factor according to service requirement, finally finds a minimum energy node-disjoint multipath routing to satisfy the limit. Our preliminary simulation results show that ECCA can significantly reduce the packet loss rate and energy consume, but not prolong routing time.
