Named　Data　Networking　(NDN)　has　several　advantages　for　supporting　mobility.　However,　due　to　the　use　of　variable-length　names　in　huge　name　space,　its　Pending　Interest　Table　(PIT)　brings　a　significant　challenge　to　mobile　nodes　in　wireless　net-works　caused　by　the　required　storage　space　and　the　table　lookup　speed.　It　directly　affects　the　packet　forwarding　speed.　Existing　PIT　representations　developed　for　wired　networks　cannot　be　directly　applied　to　MANETs　because　of　the　mobility　constraints.　We　present　in　this　paper　a　Bloom　Filter　based　approach　to　represent　PIT　in　Named　Date　MANET　(NDM)　taking　advantage　of　its　performance　in　fast　table　looking　up　and　space　saving.　Several　technical　issues　associated　with　adopting　Bloom　Filter　for　PIT　representation　in　NDM　will　be　addressed　in　detail.　These　issues　include　false　positive　rate,　hash　function　number,　memory　usage　and　entry　deletion.　We　also　analyze　whether　or　not　the　names　should　be　aggregated.　Simulation　results　show　that　PIT　with　Bloom　Filter　representation　can　indeed　reduce　storage　usage　and　improve　the　lookup　speed　of　PIT　in　NDM.